/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf -i ../../../trunk/examples/svcomp/loops-crafted-1/nested_delay_nd.c -------------------------------------------------------------------------------- This is Ultimate 0.2.1-dev-c225d54 [2021-05-03 00:15:47,462 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-05-03 00:15:47,465 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-05-03 00:15:47,506 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-05-03 00:15:47,507 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-05-03 00:15:47,510 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-05-03 00:15:47,512 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-05-03 00:15:47,518 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-05-03 00:15:47,520 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-05-03 00:15:47,524 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-05-03 00:15:47,525 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-05-03 00:15:47,527 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-05-03 00:15:47,527 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-05-03 00:15:47,529 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-05-03 00:15:47,530 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-05-03 00:15:47,531 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-05-03 00:15:47,534 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-05-03 00:15:47,535 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-05-03 00:15:47,537 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-05-03 00:15:47,543 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-05-03 00:15:47,544 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-05-03 00:15:47,545 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-05-03 00:15:47,546 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-05-03 00:15:47,548 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-05-03 00:15:47,554 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-05-03 00:15:47,555 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-05-03 00:15:47,555 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-05-03 00:15:47,557 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-05-03 00:15:47,557 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-05-03 00:15:47,558 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-05-03 00:15:47,558 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-05-03 00:15:47,558 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-05-03 00:15:47,560 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-05-03 00:15:47,560 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-05-03 00:15:47,561 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-05-03 00:15:47,561 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-05-03 00:15:47,564 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-05-03 00:15:47,564 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-05-03 00:15:47,564 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-05-03 00:15:47,565 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-05-03 00:15:47,566 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-05-03 00:15:47,570 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2021-05-03 00:15:47,598 INFO L113 SettingsManager]: Loading preferences was successful [2021-05-03 00:15:47,598 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-05-03 00:15:47,602 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-05-03 00:15:47,602 INFO L138 SettingsManager]: * sizeof long=4 [2021-05-03 00:15:47,602 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-05-03 00:15:47,602 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-05-03 00:15:47,602 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-05-03 00:15:47,603 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-05-03 00:15:47,603 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-05-03 00:15:47,603 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-05-03 00:15:47,604 INFO L138 SettingsManager]: * sizeof long double=12 [2021-05-03 00:15:47,604 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-05-03 00:15:47,604 INFO L138 SettingsManager]: * Use constant arrays=true [2021-05-03 00:15:47,604 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-05-03 00:15:47,604 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-05-03 00:15:47,605 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-05-03 00:15:47,605 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-05-03 00:15:47,605 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-05-03 00:15:47,605 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-05-03 00:15:47,605 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-05-03 00:15:47,605 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2021-05-03 00:15:47,605 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-05-03 00:15:47,606 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2021-05-03 00:15:47,606 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2021-05-03 00:15:48,082 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-05-03 00:15:48,107 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-05-03 00:15:48,109 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-05-03 00:15:48,110 INFO L271 PluginConnector]: Initializing CDTParser... [2021-05-03 00:15:48,111 INFO L275 PluginConnector]: CDTParser initialized [2021-05-03 00:15:48,112 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops-crafted-1/nested_delay_nd.c [2021-05-03 00:15:48,179 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/30eea788f/c56205a4384a4145b3dc562764b0f755/FLAGe3895cb8c [2021-05-03 00:15:48,681 INFO L306 CDTParser]: Found 1 translation units. [2021-05-03 00:15:48,681 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/nested_delay_nd.c [2021-05-03 00:15:48,696 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/30eea788f/c56205a4384a4145b3dc562764b0f755/FLAGe3895cb8c [2021-05-03 00:15:48,990 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/30eea788f/c56205a4384a4145b3dc562764b0f755 [2021-05-03 00:15:48,992 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-05-03 00:15:48,995 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2021-05-03 00:15:49,000 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-05-03 00:15:49,000 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-05-03 00:15:49,004 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-05-03 00:15:49,005 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.05 12:15:48" (1/1) ... [2021-05-03 00:15:49,006 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4e056d86 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 12:15:49, skipping insertion in model container [2021-05-03 00:15:49,006 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.05 12:15:48" (1/1) ... [2021-05-03 00:15:49,012 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-05-03 00:15:49,027 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-05-03 00:15:49,222 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/nested_delay_nd.c[465,478] [2021-05-03 00:15:49,244 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-05-03 00:15:49,252 INFO L203 MainTranslator]: Completed pre-run [2021-05-03 00:15:49,266 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/nested_delay_nd.c[465,478] [2021-05-03 00:15:49,282 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-05-03 00:15:49,299 INFO L208 MainTranslator]: Completed translation [2021-05-03 00:15:49,300 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 12:15:49 WrapperNode [2021-05-03 00:15:49,300 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-05-03 00:15:49,301 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-05-03 00:15:49,301 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-05-03 00:15:49,302 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-05-03 00:15:49,331 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 12:15:49" (1/1) ... [2021-05-03 00:15:49,331 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 12:15:49" (1/1) ... [2021-05-03 00:15:49,338 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 12:15:49" (1/1) ... [2021-05-03 00:15:49,338 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 12:15:49" (1/1) ... [2021-05-03 00:15:49,351 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 12:15:49" (1/1) ... [2021-05-03 00:15:49,376 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 12:15:49" (1/1) ... [2021-05-03 00:15:49,382 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 12:15:49" (1/1) ... [2021-05-03 00:15:49,388 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-05-03 00:15:49,389 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-05-03 00:15:49,389 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-05-03 00:15:49,389 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-05-03 00:15:49,390 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 12:15:49" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-05-03 00:15:49,476 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2021-05-03 00:15:49,476 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-05-03 00:15:49,476 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2021-05-03 00:15:49,476 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2021-05-03 00:15:49,476 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2021-05-03 00:15:49,476 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2021-05-03 00:15:49,476 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2021-05-03 00:15:49,476 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2021-05-03 00:15:49,477 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2021-05-03 00:15:49,477 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-05-03 00:15:49,477 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2021-05-03 00:15:49,477 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2021-05-03 00:15:49,477 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2021-05-03 00:15:49,477 INFO L130 BoogieDeclarations]: Found specification of procedure main [2021-05-03 00:15:49,477 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2021-05-03 00:15:49,477 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-05-03 00:15:49,477 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-05-03 00:15:49,478 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-05-03 00:15:49,478 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-05-03 00:15:49,478 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-05-03 00:15:49,715 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-05-03 00:15:49,716 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2021-05-03 00:15:49,717 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.05 12:15:49 BoogieIcfgContainer [2021-05-03 00:15:49,717 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-05-03 00:15:49,718 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-05-03 00:15:49,718 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-05-03 00:15:49,720 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-05-03 00:15:49,720 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.05 12:15:48" (1/3) ... [2021-05-03 00:15:49,721 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d684c9a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.05 12:15:49, skipping insertion in model container [2021-05-03 00:15:49,721 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 12:15:49" (2/3) ... [2021-05-03 00:15:49,721 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d684c9a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.05 12:15:49, skipping insertion in model container [2021-05-03 00:15:49,721 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.05 12:15:49" (3/3) ... [2021-05-03 00:15:49,722 INFO L111 eAbstractionObserver]: Analyzing ICFG nested_delay_nd.c [2021-05-03 00:15:49,744 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2021-05-03 00:15:49,747 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2021-05-03 00:15:49,778 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-05-03 00:15:49,811 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-05-03 00:15:49,811 INFO L377 AbstractCegarLoop]: Hoare is true [2021-05-03 00:15:49,811 INFO L378 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2021-05-03 00:15:49,811 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-05-03 00:15:49,811 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-05-03 00:15:49,811 INFO L381 AbstractCegarLoop]: Difference is false [2021-05-03 00:15:49,812 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-05-03 00:15:49,812 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-05-03 00:15:49,845 INFO L276 IsEmpty]: Start isEmpty. Operand has 32 states, 22 states have (on average 1.5454545454545454) internal successors, (34), 24 states have internal predecessors, (34), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2021-05-03 00:15:49,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-05-03 00:15:49,853 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:15:49,853 INFO L523 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:15:49,854 INFO L428 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:15:49,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:15:49,859 INFO L82 PathProgramCache]: Analyzing trace with hash -1039138334, now seen corresponding path program 1 times [2021-05-03 00:15:49,870 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:15:49,871 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [65977591] [2021-05-03 00:15:49,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:15:49,937 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-03 00:15:50,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:15:50,161 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:15:50,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:15:50,191 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:15:50,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:15:50,199 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:15:50,201 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:15:50,201 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [65977591] [2021-05-03 00:15:50,204 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [65977591] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:15:50,204 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:15:50,204 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-05-03 00:15:50,205 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1725850759] [2021-05-03 00:15:50,209 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-05-03 00:15:50,210 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:15:50,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-05-03 00:15:50,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-05-03 00:15:50,230 INFO L87 Difference]: Start difference. First operand has 32 states, 22 states have (on average 1.5454545454545454) internal successors, (34), 24 states have internal predecessors, (34), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 2 states have internal predecessors, (15), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-05-03 00:15:50,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:15:50,365 INFO L93 Difference]: Finished difference Result 50 states and 71 transitions. [2021-05-03 00:15:50,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-05-03 00:15:50,369 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 2 states have internal predecessors, (15), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 21 [2021-05-03 00:15:50,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:15:50,376 INFO L225 Difference]: With dead ends: 50 [2021-05-03 00:15:50,377 INFO L226 Difference]: Without dead ends: 27 [2021-05-03 00:15:50,380 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 58.7ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-05-03 00:15:50,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2021-05-03 00:15:50,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2021-05-03 00:15:50,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 19 states have (on average 1.368421052631579) internal successors, (26), 20 states have internal predecessors, (26), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-05-03 00:15:50,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 33 transitions. [2021-05-03 00:15:50,431 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 33 transitions. Word has length 21 [2021-05-03 00:15:50,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:15:50,432 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 33 transitions. [2021-05-03 00:15:50,432 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 2 states have internal predecessors, (15), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-05-03 00:15:50,432 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 33 transitions. [2021-05-03 00:15:50,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-05-03 00:15:50,433 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:15:50,433 INFO L523 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:15:50,434 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-05-03 00:15:50,434 INFO L428 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:15:50,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:15:50,435 INFO L82 PathProgramCache]: Analyzing trace with hash 677978447, now seen corresponding path program 1 times [2021-05-03 00:15:50,435 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:15:50,435 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1729820973] [2021-05-03 00:15:50,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:15:50,438 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-03 00:15:50,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:15:50,580 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:15:50,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:15:50,618 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:15:50,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:15:50,632 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:15:50,633 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:15:50,633 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1729820973] [2021-05-03 00:15:50,634 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1729820973] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:15:50,634 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:15:50,634 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-05-03 00:15:50,634 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2076372618] [2021-05-03 00:15:50,636 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-05-03 00:15:50,636 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:15:50,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-05-03 00:15:50,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-05-03 00:15:50,639 INFO L87 Difference]: Start difference. First operand 27 states and 33 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:15:50,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:15:50,824 INFO L93 Difference]: Finished difference Result 46 states and 60 transitions. [2021-05-03 00:15:50,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-05-03 00:15:50,825 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 21 [2021-05-03 00:15:50,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:15:50,827 INFO L225 Difference]: With dead ends: 46 [2021-05-03 00:15:50,827 INFO L226 Difference]: Without dead ends: 31 [2021-05-03 00:15:50,829 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 85.2ms TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-05-03 00:15:50,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2021-05-03 00:15:50,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 28. [2021-05-03 00:15:50,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 20 states have (on average 1.35) internal successors, (27), 21 states have internal predecessors, (27), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-05-03 00:15:50,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 34 transitions. [2021-05-03 00:15:50,846 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 34 transitions. Word has length 21 [2021-05-03 00:15:50,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:15:50,846 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 34 transitions. [2021-05-03 00:15:50,846 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:15:50,846 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 34 transitions. [2021-05-03 00:15:50,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-05-03 00:15:50,849 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:15:50,849 INFO L523 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:15:50,849 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-05-03 00:15:50,849 INFO L428 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:15:50,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:15:50,850 INFO L82 PathProgramCache]: Analyzing trace with hash -673447056, now seen corresponding path program 1 times [2021-05-03 00:15:50,851 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:15:50,853 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [685125469] [2021-05-03 00:15:50,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:15:50,900 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_16 v_~SIZE~0_12) (<= v_~last~0_17 v_main_~c~0_16)) InVars {~SIZE~0=v_~SIZE~0_12, main_~c~0=v_main_~c~0_16, ~last~0=v_~last~0_17} OutVars{~SIZE~0=v_~SIZE~0_12, main_~c~0=v_main_~c~0_16, ~last~0=v_~last~0_17} AuxVars[] AssignedVars[] [2021-05-03 00:15:50,919 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:15:50,925 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:15:50,946 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:15:50,967 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:15:50,974 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:15:51,021 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:15:51,047 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:15:51,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:15:51,113 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:15:51,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:15:51,124 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:15:51,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:15:51,129 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:15:51,136 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:15:51,172 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:15:51,173 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [685125469] [2021-05-03 00:15:51,173 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [685125469] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:15:51,173 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:15:51,173 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-05-03 00:15:51,173 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [686903475] [2021-05-03 00:15:51,174 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-05-03 00:15:51,174 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:15:51,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-05-03 00:15:51,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-05-03 00:15:51,175 INFO L87 Difference]: Start difference. First operand 28 states and 34 transitions. Second operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-05-03 00:15:51,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:15:51,402 INFO L93 Difference]: Finished difference Result 59 states and 82 transitions. [2021-05-03 00:15:51,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-05-03 00:15:51,403 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 24 [2021-05-03 00:15:51,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:15:51,406 INFO L225 Difference]: With dead ends: 59 [2021-05-03 00:15:51,406 INFO L226 Difference]: Without dead ends: 43 [2021-05-03 00:15:51,407 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 84.4ms TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2021-05-03 00:15:51,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2021-05-03 00:15:51,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 35. [2021-05-03 00:15:51,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 27 states have (on average 1.3333333333333333) internal successors, (36), 28 states have internal predecessors, (36), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-05-03 00:15:51,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 43 transitions. [2021-05-03 00:15:51,421 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 43 transitions. Word has length 24 [2021-05-03 00:15:51,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:15:51,421 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 43 transitions. [2021-05-03 00:15:51,421 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-05-03 00:15:51,422 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 43 transitions. [2021-05-03 00:15:51,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-05-03 00:15:51,422 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:15:51,422 INFO L523 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:15:51,423 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-05-03 00:15:51,423 INFO L428 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:15:51,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:15:51,424 INFO L82 PathProgramCache]: Analyzing trace with hash 708533296, now seen corresponding path program 1 times [2021-05-03 00:15:51,424 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:15:51,424 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [113773502] [2021-05-03 00:15:51,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:15:51,431 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_20 v_~last~0_18) (< v_main_~c~0_20 v_~SIZE~0_13)) InVars {~SIZE~0=v_~SIZE~0_13, main_~c~0=v_main_~c~0_20, ~last~0=v_~last~0_18} OutVars{~SIZE~0=v_~SIZE~0_13, main_~c~0=v_main_~c~0_20, ~last~0=v_~last~0_18} AuxVars[] AssignedVars[] [2021-05-03 00:15:51,438 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size [2021-05-03 00:15:51,459 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:15:51,465 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:15:51,487 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:15:51,494 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:15:51,518 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size 66 [2021-05-03 00:15:51,536 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:15:51,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:15:51,596 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:15:51,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:15:51,606 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:15:51,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:15:51,611 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:15:51,619 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:15:51,655 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:15:51,656 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [113773502] [2021-05-03 00:15:51,656 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [113773502] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:15:51,656 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:15:51,656 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-05-03 00:15:51,656 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1913329890] [2021-05-03 00:15:51,657 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-05-03 00:15:51,657 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:15:51,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-05-03 00:15:51,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2021-05-03 00:15:51,658 INFO L87 Difference]: Start difference. First operand 35 states and 43 transitions. Second operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-05-03 00:15:51,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:15:51,795 INFO L93 Difference]: Finished difference Result 64 states and 85 transitions. [2021-05-03 00:15:51,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-05-03 00:15:51,796 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 24 [2021-05-03 00:15:51,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:15:51,797 INFO L225 Difference]: With dead ends: 64 [2021-05-03 00:15:51,797 INFO L226 Difference]: Without dead ends: 41 [2021-05-03 00:15:51,798 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 64.0ms TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-05-03 00:15:51,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2021-05-03 00:15:51,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 34. [2021-05-03 00:15:51,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 27 states have internal predecessors, (33), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-05-03 00:15:51,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 40 transitions. [2021-05-03 00:15:51,807 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 40 transitions. Word has length 24 [2021-05-03 00:15:51,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:15:51,808 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 40 transitions. [2021-05-03 00:15:51,808 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-05-03 00:15:51,808 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 40 transitions. [2021-05-03 00:15:51,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-05-03 00:15:51,809 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:15:51,809 INFO L523 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:15:51,809 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-05-03 00:15:51,809 INFO L428 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:15:51,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:15:51,810 INFO L82 PathProgramCache]: Analyzing trace with hash -2061972965, now seen corresponding path program 1 times [2021-05-03 00:15:51,810 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:15:51,811 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1907932768] [2021-05-03 00:15:51,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:15:51,820 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_~last~0_19 v_main_~c~0_24) (< v_main_~c~0_24 v_~SIZE~0_14)) InVars {~SIZE~0=v_~SIZE~0_14, main_~c~0=v_main_~c~0_24, ~last~0=v_~last~0_19} OutVars{~SIZE~0=v_~SIZE~0_14, main_~c~0=v_main_~c~0_24, ~last~0=v_~last~0_19} AuxVars[] AssignedVars[] [2021-05-03 00:15:51,828 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:15:51,832 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:15:51,837 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:15:51,855 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:15:51,859 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:15:51,901 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:15:51,922 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:15:51,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:15:52,039 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:15:52,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:15:52,075 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:15:52,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:15:52,086 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:15:52,093 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:15:52,179 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:15:52,179 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1907932768] [2021-05-03 00:15:52,179 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1907932768] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:15:52,180 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:15:52,180 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-05-03 00:15:52,180 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199697153] [2021-05-03 00:15:52,180 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-05-03 00:15:52,180 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:15:52,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-05-03 00:15:52,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2021-05-03 00:15:52,182 INFO L87 Difference]: Start difference. First operand 34 states and 40 transitions. Second operand has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 8 states have internal predecessors, (19), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:15:52,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:15:52,447 INFO L93 Difference]: Finished difference Result 77 states and 98 transitions. [2021-05-03 00:15:52,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-05-03 00:15:52,448 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 8 states have internal predecessors, (19), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 25 [2021-05-03 00:15:52,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:15:52,450 INFO L225 Difference]: With dead ends: 77 [2021-05-03 00:15:52,450 INFO L226 Difference]: Without dead ends: 55 [2021-05-03 00:15:52,451 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 256.2ms TimeCoverageRelationStatistics Valid=69, Invalid=141, Unknown=0, NotChecked=0, Total=210 [2021-05-03 00:15:52,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2021-05-03 00:15:52,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 50. [2021-05-03 00:15:52,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 41 states have (on average 1.2926829268292683) internal successors, (53), 42 states have internal predecessors, (53), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2021-05-03 00:15:52,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 62 transitions. [2021-05-03 00:15:52,461 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 62 transitions. Word has length 25 [2021-05-03 00:15:52,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:15:52,461 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 62 transitions. [2021-05-03 00:15:52,461 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 8 states have internal predecessors, (19), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:15:52,461 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 62 transitions. [2021-05-03 00:15:52,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-05-03 00:15:52,463 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:15:52,463 INFO L523 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:15:52,463 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-05-03 00:15:52,463 INFO L428 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:15:52,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:15:52,464 INFO L82 PathProgramCache]: Analyzing trace with hash -2060125923, now seen corresponding path program 1 times [2021-05-03 00:15:52,464 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:15:52,464 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1099291877] [2021-05-03 00:15:52,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:15:52,473 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_~last~0_20 v_main_~c~0_28) (< v_main_~c~0_28 v_~SIZE~0_15)) InVars {~SIZE~0=v_~SIZE~0_15, main_~c~0=v_main_~c~0_28, ~last~0=v_~last~0_20} OutVars{~SIZE~0=v_~SIZE~0_15, main_~c~0=v_main_~c~0_28, ~last~0=v_~last~0_20} AuxVars[] AssignedVars[] [2021-05-03 00:15:52,478 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:15:52,480 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:15:52,484 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:15:52,501 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:15:52,505 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:15:52,547 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:15:52,568 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:15:52,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:15:52,644 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:15:52,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:15:52,653 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:15:52,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:15:52,659 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:15:52,743 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:15:52,744 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1099291877] [2021-05-03 00:15:52,744 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1099291877] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:15:52,744 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:15:52,744 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-05-03 00:15:52,744 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [391375749] [2021-05-03 00:15:52,745 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-05-03 00:15:52,745 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:15:52,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-05-03 00:15:52,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2021-05-03 00:15:52,746 INFO L87 Difference]: Start difference. First operand 50 states and 62 transitions. Second operand has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 8 states have internal predecessors, (19), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:15:52,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:15:52,945 INFO L93 Difference]: Finished difference Result 101 states and 129 transitions. [2021-05-03 00:15:52,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-05-03 00:15:52,946 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 8 states have internal predecessors, (19), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 25 [2021-05-03 00:15:52,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:15:52,947 INFO L225 Difference]: With dead ends: 101 [2021-05-03 00:15:52,947 INFO L226 Difference]: Without dead ends: 63 [2021-05-03 00:15:52,948 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 120.6ms TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2021-05-03 00:15:52,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2021-05-03 00:15:52,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 56. [2021-05-03 00:15:52,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 47 states have (on average 1.297872340425532) internal successors, (61), 48 states have internal predecessors, (61), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2021-05-03 00:15:52,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 70 transitions. [2021-05-03 00:15:52,958 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 70 transitions. Word has length 25 [2021-05-03 00:15:52,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:15:52,959 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 70 transitions. [2021-05-03 00:15:52,959 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 8 states have internal predecessors, (19), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:15:52,959 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 70 transitions. [2021-05-03 00:15:52,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-05-03 00:15:52,960 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:15:52,960 INFO L523 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:15:52,960 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-05-03 00:15:52,960 INFO L428 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:15:52,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:15:52,961 INFO L82 PathProgramCache]: Analyzing trace with hash 2067453981, now seen corresponding path program 1 times [2021-05-03 00:15:52,961 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:15:52,961 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1981819709] [2021-05-03 00:15:52,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:15:52,966 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_32 v_~SIZE~0_16) (< v_main_~c~0_32 v_~last~0_21)) InVars {~SIZE~0=v_~SIZE~0_16, main_~c~0=v_main_~c~0_32, ~last~0=v_~last~0_21} OutVars{~SIZE~0=v_~SIZE~0_16, main_~c~0=v_main_~c~0_32, ~last~0=v_~last~0_21} AuxVars[] AssignedVars[] [2021-05-03 00:15:52,971 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size [2021-05-03 00:15:52,973 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:15:52,976 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:15:52,996 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:15:53,002 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:15:53,036 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size 66 [2021-05-03 00:15:53,056 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:15:53,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:15:53,134 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:15:53,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:15:53,144 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:15:53,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:15:53,149 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:15:53,152 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:15:53,194 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:15:53,194 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1981819709] [2021-05-03 00:15:53,194 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1981819709] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:15:53,194 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:15:53,194 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-05-03 00:15:53,194 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361706747] [2021-05-03 00:15:53,194 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-05-03 00:15:53,195 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:15:53,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-05-03 00:15:53,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2021-05-03 00:15:53,195 INFO L87 Difference]: Start difference. First operand 56 states and 70 transitions. Second operand has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 8 states have internal predecessors, (19), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:15:53,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:15:53,383 INFO L93 Difference]: Finished difference Result 105 states and 135 transitions. [2021-05-03 00:15:53,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-05-03 00:15:53,384 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 8 states have internal predecessors, (19), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 25 [2021-05-03 00:15:53,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:15:53,385 INFO L225 Difference]: With dead ends: 105 [2021-05-03 00:15:53,385 INFO L226 Difference]: Without dead ends: 80 [2021-05-03 00:15:53,385 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 108.2ms TimeCoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2021-05-03 00:15:53,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2021-05-03 00:15:53,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 75. [2021-05-03 00:15:53,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 65 states have (on average 1.3076923076923077) internal successors, (85), 66 states have internal predecessors, (85), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:15:53,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 96 transitions. [2021-05-03 00:15:53,395 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 96 transitions. Word has length 25 [2021-05-03 00:15:53,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:15:53,395 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 96 transitions. [2021-05-03 00:15:53,396 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 8 states have internal predecessors, (19), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:15:53,396 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 96 transitions. [2021-05-03 00:15:53,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-05-03 00:15:53,396 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:15:53,396 INFO L523 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:15:53,397 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-05-03 00:15:53,397 INFO L428 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:15:53,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:15:53,397 INFO L82 PathProgramCache]: Analyzing trace with hash 2069301023, now seen corresponding path program 1 times [2021-05-03 00:15:53,397 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:15:53,398 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1643311334] [2021-05-03 00:15:53,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:15:53,402 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_36 v_~SIZE~0_17) (< v_main_~c~0_36 v_~last~0_22)) InVars {~SIZE~0=v_~SIZE~0_17, main_~c~0=v_main_~c~0_36, ~last~0=v_~last~0_22} OutVars{~SIZE~0=v_~SIZE~0_17, main_~c~0=v_main_~c~0_36, ~last~0=v_~last~0_22} AuxVars[] AssignedVars[] [2021-05-03 00:15:53,405 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size [2021-05-03 00:15:53,407 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:15:53,409 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:15:53,429 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:15:53,434 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:15:53,460 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size 66 [2021-05-03 00:15:53,481 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:15:53,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:15:53,640 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:15:53,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:15:53,650 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:15:53,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:15:53,656 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:15:53,812 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:15:53,812 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1643311334] [2021-05-03 00:15:53,812 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1643311334] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:15:53,813 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:15:53,813 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-05-03 00:15:53,813 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2055230993] [2021-05-03 00:15:53,813 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-05-03 00:15:53,813 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:15:53,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-05-03 00:15:53,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2021-05-03 00:15:53,815 INFO L87 Difference]: Start difference. First operand 75 states and 96 transitions. Second operand has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 11 states have internal predecessors, (19), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:15:54,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:15:54,115 INFO L93 Difference]: Finished difference Result 156 states and 205 transitions. [2021-05-03 00:15:54,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-05-03 00:15:54,116 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 11 states have internal predecessors, (19), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 25 [2021-05-03 00:15:54,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:15:54,117 INFO L225 Difference]: With dead ends: 156 [2021-05-03 00:15:54,117 INFO L226 Difference]: Without dead ends: 93 [2021-05-03 00:15:54,118 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 296.2ms TimeCoverageRelationStatistics Valid=69, Invalid=237, Unknown=0, NotChecked=0, Total=306 [2021-05-03 00:15:54,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2021-05-03 00:15:54,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 80. [2021-05-03 00:15:54,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 70 states have (on average 1.3) internal successors, (91), 70 states have internal predecessors, (91), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:15:54,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 102 transitions. [2021-05-03 00:15:54,130 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 102 transitions. Word has length 25 [2021-05-03 00:15:54,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:15:54,130 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 102 transitions. [2021-05-03 00:15:54,130 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 11 states have internal predecessors, (19), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:15:54,130 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 102 transitions. [2021-05-03 00:15:54,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-05-03 00:15:54,131 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:15:54,131 INFO L523 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:15:54,131 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-05-03 00:15:54,132 INFO L428 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:15:54,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:15:54,132 INFO L82 PathProgramCache]: Analyzing trace with hash -1640504642, now seen corresponding path program 2 times [2021-05-03 00:15:54,132 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:15:54,133 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1151988709] [2021-05-03 00:15:54,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:15:54,139 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (+ v_main_~c~0_40 1) v_~SIZE~0_18) (<= v_~last~0_23 v_main_~c~0_40)) InVars {~SIZE~0=v_~SIZE~0_18, main_~c~0=v_main_~c~0_40, ~last~0=v_~last~0_23} OutVars{~SIZE~0=v_~SIZE~0_18, main_~c~0=v_main_~c~0_40, ~last~0=v_~last~0_23} AuxVars[] AssignedVars[] [2021-05-03 00:15:54,143 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size [2021-05-03 00:15:54,145 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:15:54,147 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:15:54,160 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:15:54,163 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:15:54,190 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size 78 [2021-05-03 00:15:54,206 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:15:54,210 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_~last~0_24 v_main_~c~0_42) (< v_main_~c~0_42 v_~SIZE~0_19)) InVars {~SIZE~0=v_~SIZE~0_19, main_~c~0=v_main_~c~0_42, ~last~0=v_~last~0_24} OutVars{~SIZE~0=v_~SIZE~0_19, main_~c~0=v_main_~c~0_42, ~last~0=v_~last~0_24} AuxVars[] AssignedVars[] [2021-05-03 00:15:54,236 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:15:54,255 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:15:54,257 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:15:54,270 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:15:54,274 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:15:54,296 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:15:54,318 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:15:54,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:15:54,389 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:15:54,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:15:54,400 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:15:54,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:15:54,404 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:15:54,504 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:15:54,504 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1151988709] [2021-05-03 00:15:54,505 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1151988709] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:15:54,505 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:15:54,505 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-05-03 00:15:54,505 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263476834] [2021-05-03 00:15:54,505 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-05-03 00:15:54,505 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:15:54,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-05-03 00:15:54,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2021-05-03 00:15:54,506 INFO L87 Difference]: Start difference. First operand 80 states and 102 transitions. Second operand has 10 states, 10 states have (on average 2.2) internal successors, (22), 9 states have internal predecessors, (22), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:15:54,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:15:54,676 INFO L93 Difference]: Finished difference Result 161 states and 207 transitions. [2021-05-03 00:15:54,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-05-03 00:15:54,677 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.2) internal successors, (22), 9 states have internal predecessors, (22), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 28 [2021-05-03 00:15:54,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:15:54,678 INFO L225 Difference]: With dead ends: 161 [2021-05-03 00:15:54,678 INFO L226 Difference]: Without dead ends: 98 [2021-05-03 00:15:54,679 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 14 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 134.9ms TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2021-05-03 00:15:54,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2021-05-03 00:15:54,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 89. [2021-05-03 00:15:54,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 79 states have (on average 1.2658227848101267) internal successors, (100), 79 states have internal predecessors, (100), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:15:54,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 111 transitions. [2021-05-03 00:15:54,690 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 111 transitions. Word has length 28 [2021-05-03 00:15:54,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:15:54,690 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 111 transitions. [2021-05-03 00:15:54,690 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 2.2) internal successors, (22), 9 states have internal predecessors, (22), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:15:54,690 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 111 transitions. [2021-05-03 00:15:54,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-05-03 00:15:54,691 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:15:54,691 INFO L523 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:15:54,691 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-05-03 00:15:54,691 INFO L428 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:15:54,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:15:54,692 INFO L82 PathProgramCache]: Analyzing trace with hash 1643345404, now seen corresponding path program 1 times [2021-05-03 00:15:54,692 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:15:54,692 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [820771658] [2021-05-03 00:15:54,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:15:54,698 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (+ v_main_~c~0_47 1) v_~SIZE~0_20) (< v_main_~c~0_47 v_~last~0_25)) InVars {~SIZE~0=v_~SIZE~0_20, main_~c~0=v_main_~c~0_47, ~last~0=v_~last~0_25} OutVars{~SIZE~0=v_~SIZE~0_20, main_~c~0=v_main_~c~0_47, ~last~0=v_~last~0_25} AuxVars[] AssignedVars[] [2021-05-03 00:15:54,701 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:15:54,718 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:15:54,733 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:15:54,748 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:15:54,752 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:15:54,769 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:15:54,785 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:15:54,788 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_49 v_~SIZE~0_21) (<= v_~last~0_26 v_main_~c~0_49)) InVars {~SIZE~0=v_~SIZE~0_21, main_~c~0=v_main_~c~0_49, ~last~0=v_~last~0_26} OutVars{~SIZE~0=v_~SIZE~0_21, main_~c~0=v_main_~c~0_49, ~last~0=v_~last~0_26} AuxVars[] AssignedVars[] [2021-05-03 00:15:54,791 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:15:54,810 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:15:54,813 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:15:54,825 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:15:54,830 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:15:54,848 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:15:54,868 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_51 v_~last~0_27) (< v_main_~c~0_51 v_~SIZE~0_22)) InVars {~SIZE~0=v_~SIZE~0_22, main_~c~0=v_main_~c~0_51, ~last~0=v_~last~0_27} OutVars{~SIZE~0=v_~SIZE~0_22, main_~c~0=v_main_~c~0_51, ~last~0=v_~last~0_27} AuxVars[] AssignedVars[] [2021-05-03 00:15:54,871 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size [2021-05-03 00:15:54,885 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:15:54,887 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:15:54,903 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:15:54,908 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:15:54,933 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size 66 [2021-05-03 00:15:54,952 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:15:54,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:15:55,050 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:15:55,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:15:55,058 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:15:55,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:15:55,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-03 00:15:55,071 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:15:55,195 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:15:55,195 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [820771658] [2021-05-03 00:15:55,195 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [820771658] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:15:55,195 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:15:55,196 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-05-03 00:15:55,196 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894483214] [2021-05-03 00:15:55,196 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-05-03 00:15:55,196 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:15:55,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-05-03 00:15:55,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2021-05-03 00:15:55,197 INFO L87 Difference]: Start difference. First operand 89 states and 111 transitions. Second operand has 11 states, 11 states have (on average 2.0) internal successors, (22), 10 states have internal predecessors, (22), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:15:55,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:15:55,445 INFO L93 Difference]: Finished difference Result 194 states and 250 transitions. [2021-05-03 00:15:55,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-05-03 00:15:55,446 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.0) internal successors, (22), 10 states have internal predecessors, (22), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 28 [2021-05-03 00:15:55,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:15:55,447 INFO L225 Difference]: With dead ends: 194 [2021-05-03 00:15:55,447 INFO L226 Difference]: Without dead ends: 122 [2021-05-03 00:15:55,451 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 12 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 188.2ms TimeCoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2021-05-03 00:15:55,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2021-05-03 00:15:55,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 93. [2021-05-03 00:15:55,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 83 states have (on average 1.2771084337349397) internal successors, (106), 84 states have internal predecessors, (106), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:15:55,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 117 transitions. [2021-05-03 00:15:55,468 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 117 transitions. Word has length 28 [2021-05-03 00:15:55,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:15:55,468 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 117 transitions. [2021-05-03 00:15:55,468 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 2.0) internal successors, (22), 10 states have internal predecessors, (22), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:15:55,468 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 117 transitions. [2021-05-03 00:15:55,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-05-03 00:15:55,469 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:15:55,469 INFO L523 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:15:55,469 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-05-03 00:15:55,469 INFO L428 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:15:55,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:15:55,470 INFO L82 PathProgramCache]: Analyzing trace with hash 1477805054, now seen corresponding path program 2 times [2021-05-03 00:15:55,470 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:15:55,470 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [925731928] [2021-05-03 00:15:55,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:15:55,474 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (+ v_main_~c~0_57 1) v_~SIZE~0_23) (< v_main_~c~0_57 v_~last~0_28)) InVars {~SIZE~0=v_~SIZE~0_23, main_~c~0=v_main_~c~0_57, ~last~0=v_~last~0_28} OutVars{~SIZE~0=v_~SIZE~0_23, main_~c~0=v_main_~c~0_57, ~last~0=v_~last~0_28} AuxVars[] AssignedVars[] [2021-05-03 00:15:55,476 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:15:55,490 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:15:55,492 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:15:55,506 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:15:55,511 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:15:55,524 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:15:55,546 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:15:55,549 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_59 v_~last~0_29) (< v_main_~c~0_59 v_~SIZE~0_24)) InVars {~SIZE~0=v_~SIZE~0_24, main_~c~0=v_main_~c~0_59, ~last~0=v_~last~0_29} OutVars{~SIZE~0=v_~SIZE~0_24, main_~c~0=v_main_~c~0_59, ~last~0=v_~last~0_29} AuxVars[] AssignedVars[] [2021-05-03 00:15:55,551 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size [2021-05-03 00:15:55,567 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:15:55,570 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:15:55,587 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:15:55,592 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:15:55,608 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size 66 [2021-05-03 00:15:55,628 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:15:55,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:15:55,748 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:15:55,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:15:55,762 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:15:55,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:15:55,779 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:15:56,063 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:15:56,063 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [925731928] [2021-05-03 00:15:56,063 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [925731928] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:15:56,063 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:15:56,064 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-05-03 00:15:56,064 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150335721] [2021-05-03 00:15:56,064 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-05-03 00:15:56,064 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:15:56,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-05-03 00:15:56,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=210, Unknown=0, NotChecked=0, Total=272 [2021-05-03 00:15:56,065 INFO L87 Difference]: Start difference. First operand 93 states and 117 transitions. Second operand has 15 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 13 states have internal predecessors, (22), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:15:56,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:15:56,419 INFO L93 Difference]: Finished difference Result 199 states and 255 transitions. [2021-05-03 00:15:56,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-05-03 00:15:56,419 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 13 states have internal predecessors, (22), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 28 [2021-05-03 00:15:56,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:15:56,421 INFO L225 Difference]: With dead ends: 199 [2021-05-03 00:15:56,421 INFO L226 Difference]: Without dead ends: 118 [2021-05-03 00:15:56,422 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 449.6ms TimeCoverageRelationStatistics Valid=88, Invalid=332, Unknown=0, NotChecked=0, Total=420 [2021-05-03 00:15:56,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2021-05-03 00:15:56,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 101. [2021-05-03 00:15:56,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 91 states have (on average 1.2747252747252746) internal successors, (116), 91 states have internal predecessors, (116), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:15:56,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 127 transitions. [2021-05-03 00:15:56,435 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 127 transitions. Word has length 28 [2021-05-03 00:15:56,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:15:56,435 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 127 transitions. [2021-05-03 00:15:56,435 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 13 states have internal predecessors, (22), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:15:56,435 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 127 transitions. [2021-05-03 00:15:56,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-05-03 00:15:56,436 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:15:56,436 INFO L523 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:15:56,436 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-05-03 00:15:56,436 INFO L428 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:15:56,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:15:56,437 INFO L82 PathProgramCache]: Analyzing trace with hash 942246269, now seen corresponding path program 3 times [2021-05-03 00:15:56,437 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:15:56,437 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [849665752] [2021-05-03 00:15:56,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:15:56,444 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (+ v_main_~c~0_64 1) v_~SIZE~0_25) (<= v_~last~0_30 v_main_~c~0_64)) InVars {~SIZE~0=v_~SIZE~0_25, main_~c~0=v_main_~c~0_64, ~last~0=v_~last~0_30} OutVars{~SIZE~0=v_~SIZE~0_25, main_~c~0=v_main_~c~0_64, ~last~0=v_~last~0_30} AuxVars[] AssignedVars[] [2021-05-03 00:15:56,447 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size [2021-05-03 00:15:56,468 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:15:56,471 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:15:56,484 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:15:56,491 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:15:56,512 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size 78 [2021-05-03 00:15:56,533 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:15:56,536 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_~last~0_31 v_main_~c~0_66) (< v_main_~c~0_66 v_~SIZE~0_26)) InVars {~SIZE~0=v_~SIZE~0_26, main_~c~0=v_main_~c~0_66, ~last~0=v_~last~0_31} OutVars{~SIZE~0=v_~SIZE~0_26, main_~c~0=v_main_~c~0_66, ~last~0=v_~last~0_31} AuxVars[] AssignedVars[] [2021-05-03 00:15:56,538 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:15:56,540 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:15:56,542 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:15:56,557 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:15:56,560 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:15:56,598 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:15:56,620 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:15:56,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:15:56,688 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:15:56,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:15:56,696 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:15:56,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:15:56,699 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:15:56,903 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:15:56,903 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [849665752] [2021-05-03 00:15:56,903 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [849665752] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:15:56,903 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:15:56,903 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-05-03 00:15:56,903 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1021881962] [2021-05-03 00:15:56,904 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-05-03 00:15:56,904 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:15:56,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-05-03 00:15:56,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2021-05-03 00:15:56,905 INFO L87 Difference]: Start difference. First operand 101 states and 127 transitions. Second operand has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 10 states have internal predecessors, (25), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:15:57,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:15:57,160 INFO L93 Difference]: Finished difference Result 212 states and 269 transitions. [2021-05-03 00:15:57,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-05-03 00:15:57,161 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 10 states have internal predecessors, (25), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 31 [2021-05-03 00:15:57,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:15:57,162 INFO L225 Difference]: With dead ends: 212 [2021-05-03 00:15:57,162 INFO L226 Difference]: Without dead ends: 131 [2021-05-03 00:15:57,162 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 12 SyntacticMatches, 5 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 217.9ms TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2021-05-03 00:15:57,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2021-05-03 00:15:57,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 110. [2021-05-03 00:15:57,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 100 states have (on average 1.25) internal successors, (125), 100 states have internal predecessors, (125), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:15:57,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 136 transitions. [2021-05-03 00:15:57,173 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 136 transitions. Word has length 31 [2021-05-03 00:15:57,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:15:57,173 INFO L480 AbstractCegarLoop]: Abstraction has 110 states and 136 transitions. [2021-05-03 00:15:57,173 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 10 states have internal predecessors, (25), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:15:57,173 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 136 transitions. [2021-05-03 00:15:57,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-05-03 00:15:57,174 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:15:57,174 INFO L523 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:15:57,174 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-05-03 00:15:57,174 INFO L428 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:15:57,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:15:57,175 INFO L82 PathProgramCache]: Analyzing trace with hash -646101633, now seen corresponding path program 2 times [2021-05-03 00:15:57,175 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:15:57,175 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1008641762] [2021-05-03 00:15:57,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:15:57,185 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (+ v_main_~c~0_72 1) v_~SIZE~0_27) (<= v_~last~0_32 v_main_~c~0_72)) InVars {~SIZE~0=v_~SIZE~0_27, main_~c~0=v_main_~c~0_72, ~last~0=v_~last~0_32} OutVars{~SIZE~0=v_~SIZE~0_27, main_~c~0=v_main_~c~0_72, ~last~0=v_~last~0_32} AuxVars[] AssignedVars[] [2021-05-03 00:15:57,187 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size [2021-05-03 00:15:57,204 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:15:57,208 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:15:57,220 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:15:57,223 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:15:57,238 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size 78 [2021-05-03 00:15:57,259 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_74 v_~last~0_33) (< (+ v_main_~c~0_74 1) v_~SIZE~0_28)) InVars {~SIZE~0=v_~SIZE~0_28, main_~c~0=v_main_~c~0_74, ~last~0=v_~last~0_33} OutVars{~SIZE~0=v_~SIZE~0_28, main_~c~0=v_main_~c~0_74, ~last~0=v_~last~0_33} AuxVars[] AssignedVars[] [2021-05-03 00:15:57,262 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:15:57,264 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:15:57,266 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:15:57,279 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:15:57,284 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:15:57,311 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:15:57,340 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:15:57,343 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_76 v_~SIZE~0_29) (<= v_~last~0_34 v_main_~c~0_76)) InVars {~SIZE~0=v_~SIZE~0_29, main_~c~0=v_main_~c~0_76, ~last~0=v_~last~0_34} OutVars{~SIZE~0=v_~SIZE~0_29, main_~c~0=v_main_~c~0_76, ~last~0=v_~last~0_34} AuxVars[] AssignedVars[] [2021-05-03 00:15:57,346 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:15:57,347 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:15:57,349 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:15:57,361 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:15:57,364 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:15:57,392 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:15:57,423 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_78 v_~SIZE~0_30) (< v_main_~c~0_78 v_~last~0_35)) InVars {~SIZE~0=v_~SIZE~0_30, main_~c~0=v_main_~c~0_78, ~last~0=v_~last~0_35} OutVars{~SIZE~0=v_~SIZE~0_30, main_~c~0=v_main_~c~0_78, ~last~0=v_~last~0_35} AuxVars[] AssignedVars[] [2021-05-03 00:15:57,425 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size [2021-05-03 00:15:57,426 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:15:57,428 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:15:57,441 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:15:57,448 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:15:57,501 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size 66 [2021-05-03 00:15:57,523 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:15:57,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:15:57,626 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:15:57,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:15:57,635 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:15:57,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:15:57,642 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:15:57,646 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:15:57,814 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:15:57,814 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1008641762] [2021-05-03 00:15:57,814 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1008641762] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:15:57,814 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:15:57,815 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-05-03 00:15:57,815 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [375632557] [2021-05-03 00:15:57,815 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-05-03 00:15:57,815 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:15:57,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-05-03 00:15:57,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2021-05-03 00:15:57,816 INFO L87 Difference]: Start difference. First operand 110 states and 136 transitions. Second operand has 12 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 11 states have internal predecessors, (25), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:15:58,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:15:58,071 INFO L93 Difference]: Finished difference Result 224 states and 277 transitions. [2021-05-03 00:15:58,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-05-03 00:15:58,071 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 11 states have internal predecessors, (25), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 31 [2021-05-03 00:15:58,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:15:58,073 INFO L225 Difference]: With dead ends: 224 [2021-05-03 00:15:58,073 INFO L226 Difference]: Without dead ends: 134 [2021-05-03 00:15:58,074 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 13 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 224.9ms TimeCoverageRelationStatistics Valid=59, Invalid=181, Unknown=0, NotChecked=0, Total=240 [2021-05-03 00:15:58,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2021-05-03 00:15:58,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 110. [2021-05-03 00:15:58,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 100 states have (on average 1.25) internal successors, (125), 100 states have internal predecessors, (125), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:15:58,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 136 transitions. [2021-05-03 00:15:58,089 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 136 transitions. Word has length 31 [2021-05-03 00:15:58,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:15:58,090 INFO L480 AbstractCegarLoop]: Abstraction has 110 states and 136 transitions. [2021-05-03 00:15:58,090 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 11 states have internal predecessors, (25), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:15:58,090 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 136 transitions. [2021-05-03 00:15:58,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-05-03 00:15:58,091 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:15:58,091 INFO L523 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:15:58,091 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2021-05-03 00:15:58,091 INFO L428 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:15:58,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:15:58,092 INFO L82 PathProgramCache]: Analyzing trace with hash -1657218883, now seen corresponding path program 3 times [2021-05-03 00:15:58,092 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:15:58,092 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1178122949] [2021-05-03 00:15:58,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:15:58,099 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_85 v_~last~0_36) (< (+ v_main_~c~0_85 1) v_~SIZE~0_31)) InVars {~SIZE~0=v_~SIZE~0_31, main_~c~0=v_main_~c~0_85, ~last~0=v_~last~0_36} OutVars{~SIZE~0=v_~SIZE~0_31, main_~c~0=v_main_~c~0_85, ~last~0=v_~last~0_36} AuxVars[] AssignedVars[] [2021-05-03 00:15:58,101 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:15:58,103 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:15:58,110 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:15:58,129 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:15:58,135 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:15:58,166 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:15:58,187 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:15:58,191 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_87 v_~SIZE~0_32) (<= v_~last~0_37 v_main_~c~0_87)) InVars {~SIZE~0=v_~SIZE~0_32, main_~c~0=v_main_~c~0_87, ~last~0=v_~last~0_37} OutVars{~SIZE~0=v_~SIZE~0_32, main_~c~0=v_main_~c~0_87, ~last~0=v_~last~0_37} AuxVars[] AssignedVars[] [2021-05-03 00:15:58,194 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:15:58,196 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:15:58,199 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:15:58,212 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:15:58,215 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:15:58,251 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:15:58,272 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_89 v_~SIZE~0_33) (< v_main_~c~0_89 v_~last~0_38)) InVars {~SIZE~0=v_~SIZE~0_33, main_~c~0=v_main_~c~0_89, ~last~0=v_~last~0_38} OutVars{~SIZE~0=v_~SIZE~0_33, main_~c~0=v_main_~c~0_89, ~last~0=v_~last~0_38} AuxVars[] AssignedVars[] [2021-05-03 00:15:58,279 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size [2021-05-03 00:15:58,281 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:15:58,284 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:15:58,307 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:15:58,313 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:15:58,348 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size 66 [2021-05-03 00:15:58,369 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:15:58,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:15:58,439 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:15:58,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:15:58,455 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:15:58,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:15:58,460 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:15:58,464 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:15:58,649 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:15:58,649 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1178122949] [2021-05-03 00:15:58,649 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1178122949] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:15:58,649 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:15:58,649 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-05-03 00:15:58,649 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653161409] [2021-05-03 00:15:58,650 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-05-03 00:15:58,650 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:15:58,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-05-03 00:15:58,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2021-05-03 00:15:58,651 INFO L87 Difference]: Start difference. First operand 110 states and 136 transitions. Second operand has 13 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 12 states have internal predecessors, (25), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:15:58,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:15:58,915 INFO L93 Difference]: Finished difference Result 233 states and 296 transitions. [2021-05-03 00:15:58,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-05-03 00:15:58,916 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 12 states have internal predecessors, (25), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 31 [2021-05-03 00:15:58,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:15:58,917 INFO L225 Difference]: With dead ends: 233 [2021-05-03 00:15:58,917 INFO L226 Difference]: Without dead ends: 143 [2021-05-03 00:15:58,918 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 12 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 218.6ms TimeCoverageRelationStatistics Valid=63, Invalid=177, Unknown=0, NotChecked=0, Total=240 [2021-05-03 00:15:58,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2021-05-03 00:15:58,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 111. [2021-05-03 00:15:58,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 101 states have (on average 1.2574257425742574) internal successors, (127), 102 states have internal predecessors, (127), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:15:58,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 138 transitions. [2021-05-03 00:15:58,937 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 138 transitions. Word has length 31 [2021-05-03 00:15:58,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:15:58,937 INFO L480 AbstractCegarLoop]: Abstraction has 111 states and 138 transitions. [2021-05-03 00:15:58,937 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 13 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 12 states have internal predecessors, (25), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:15:58,937 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 138 transitions. [2021-05-03 00:15:58,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-05-03 00:15:58,942 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:15:58,943 INFO L523 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:15:58,943 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2021-05-03 00:15:58,943 INFO L428 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:15:58,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:15:58,944 INFO L82 PathProgramCache]: Analyzing trace with hash -1822759233, now seen corresponding path program 3 times [2021-05-03 00:15:58,944 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:15:58,944 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1908222050] [2021-05-03 00:15:58,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:15:58,954 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (+ v_main_~c~0_96 1) v_~SIZE~0_34) (< v_main_~c~0_96 v_~last~0_39)) InVars {~SIZE~0=v_~SIZE~0_34, main_~c~0=v_main_~c~0_96, ~last~0=v_~last~0_39} OutVars{~SIZE~0=v_~SIZE~0_34, main_~c~0=v_main_~c~0_96, ~last~0=v_~last~0_39} AuxVars[] AssignedVars[] [2021-05-03 00:15:58,957 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:15:58,974 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:15:58,978 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:15:59,004 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:15:59,010 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:15:59,029 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:15:59,051 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:15:59,053 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_98 v_~last~0_40) (< v_main_~c~0_98 v_~SIZE~0_35)) InVars {~SIZE~0=v_~SIZE~0_35, main_~c~0=v_main_~c~0_98, ~last~0=v_~last~0_40} OutVars{~SIZE~0=v_~SIZE~0_35, main_~c~0=v_main_~c~0_98, ~last~0=v_~last~0_40} AuxVars[] AssignedVars[] [2021-05-03 00:15:59,056 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size [2021-05-03 00:15:59,058 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:15:59,060 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:15:59,078 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:15:59,084 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:15:59,117 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size 66 [2021-05-03 00:15:59,137 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:15:59,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:15:59,263 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:15:59,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:15:59,270 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:15:59,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:15:59,274 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:15:59,537 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:15:59,537 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1908222050] [2021-05-03 00:15:59,537 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1908222050] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:15:59,538 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:15:59,538 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2021-05-03 00:15:59,538 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873886932] [2021-05-03 00:15:59,538 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states [2021-05-03 00:15:59,538 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:15:59,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-05-03 00:15:59,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=269, Unknown=0, NotChecked=0, Total=342 [2021-05-03 00:15:59,539 INFO L87 Difference]: Start difference. First operand 111 states and 138 transitions. Second operand has 17 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 15 states have internal predecessors, (25), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:15:59,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:15:59,952 INFO L93 Difference]: Finished difference Result 242 states and 305 transitions. [2021-05-03 00:15:59,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-05-03 00:15:59,953 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 15 states have internal predecessors, (25), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 31 [2021-05-03 00:15:59,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:15:59,954 INFO L225 Difference]: With dead ends: 242 [2021-05-03 00:15:59,954 INFO L226 Difference]: Without dead ends: 143 [2021-05-03 00:15:59,957 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 470.5ms TimeCoverageRelationStatistics Valid=107, Invalid=445, Unknown=0, NotChecked=0, Total=552 [2021-05-03 00:15:59,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2021-05-03 00:15:59,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 122. [2021-05-03 00:15:59,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 112 states have (on average 1.2589285714285714) internal successors, (141), 112 states have internal predecessors, (141), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:15:59,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 152 transitions. [2021-05-03 00:15:59,976 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 152 transitions. Word has length 31 [2021-05-03 00:15:59,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:15:59,976 INFO L480 AbstractCegarLoop]: Abstraction has 122 states and 152 transitions. [2021-05-03 00:15:59,976 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 17 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 15 states have internal predecessors, (25), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:15:59,976 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 152 transitions. [2021-05-03 00:15:59,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-05-03 00:15:59,977 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:15:59,977 INFO L523 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:15:59,977 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2021-05-03 00:15:59,977 INFO L428 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:15:59,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:15:59,978 INFO L82 PathProgramCache]: Analyzing trace with hash -664471970, now seen corresponding path program 4 times [2021-05-03 00:15:59,978 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:15:59,978 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [286221572] [2021-05-03 00:15:59,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:15:59,986 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_~last~0_41 v_main_~c~0_104) (< (+ v_main_~c~0_104 1) v_~SIZE~0_36)) InVars {~SIZE~0=v_~SIZE~0_36, main_~c~0=v_main_~c~0_104, ~last~0=v_~last~0_41} OutVars{~SIZE~0=v_~SIZE~0_36, main_~c~0=v_main_~c~0_104, ~last~0=v_~last~0_41} AuxVars[] AssignedVars[] [2021-05-03 00:15:59,989 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size [2021-05-03 00:16:00,009 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:00,011 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:00,027 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:16:00,031 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:16:00,052 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size 78 [2021-05-03 00:16:00,072 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:16:00,075 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_106 v_~SIZE~0_37) (<= v_~last~0_42 v_main_~c~0_106)) InVars {~SIZE~0=v_~SIZE~0_37, main_~c~0=v_main_~c~0_106, ~last~0=v_~last~0_42} OutVars{~SIZE~0=v_~SIZE~0_37, main_~c~0=v_main_~c~0_106, ~last~0=v_~last~0_42} AuxVars[] AssignedVars[] [2021-05-03 00:16:00,080 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:16:00,101 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:00,107 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:00,125 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:16:00,128 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:16:00,150 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:16:00,166 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:16:00,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:16:00,227 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:16:00,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:16:00,237 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:16:00,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:16:00,243 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:16:00,440 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:16:00,441 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [286221572] [2021-05-03 00:16:00,441 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [286221572] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:16:00,441 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:16:00,441 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-05-03 00:16:00,441 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567951439] [2021-05-03 00:16:00,442 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-05-03 00:16:00,442 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:16:00,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-05-03 00:16:00,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2021-05-03 00:16:00,443 INFO L87 Difference]: Start difference. First operand 122 states and 152 transitions. Second operand has 12 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 11 states have internal predecessors, (28), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:16:00,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:16:00,672 INFO L93 Difference]: Finished difference Result 251 states and 311 transitions. [2021-05-03 00:16:00,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-05-03 00:16:00,673 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 11 states have internal predecessors, (28), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 34 [2021-05-03 00:16:00,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:16:00,674 INFO L225 Difference]: With dead ends: 251 [2021-05-03 00:16:00,674 INFO L226 Difference]: Without dead ends: 152 [2021-05-03 00:16:00,674 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 12 SyntacticMatches, 7 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 217.1ms TimeCoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2021-05-03 00:16:00,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2021-05-03 00:16:00,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 131. [2021-05-03 00:16:00,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 121 states have (on average 1.2396694214876034) internal successors, (150), 121 states have internal predecessors, (150), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:16:00,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 161 transitions. [2021-05-03 00:16:00,689 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 161 transitions. Word has length 34 [2021-05-03 00:16:00,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:16:00,689 INFO L480 AbstractCegarLoop]: Abstraction has 131 states and 161 transitions. [2021-05-03 00:16:00,689 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 11 states have internal predecessors, (28), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:16:00,689 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 161 transitions. [2021-05-03 00:16:00,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-05-03 00:16:00,691 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:16:00,691 INFO L523 BasicCegarLoop]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:16:00,691 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2021-05-03 00:16:00,691 INFO L428 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:16:00,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:16:00,691 INFO L82 PathProgramCache]: Analyzing trace with hash -1482120420, now seen corresponding path program 4 times [2021-05-03 00:16:00,691 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:16:00,691 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [270032018] [2021-05-03 00:16:00,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:16:00,701 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_~last~0_43 v_main_~c~0_113) (< (+ v_main_~c~0_113 1) v_~SIZE~0_38)) InVars {~SIZE~0=v_~SIZE~0_38, main_~c~0=v_main_~c~0_113, ~last~0=v_~last~0_43} OutVars{~SIZE~0=v_~SIZE~0_38, main_~c~0=v_main_~c~0_113, ~last~0=v_~last~0_43} AuxVars[] AssignedVars[] [2021-05-03 00:16:00,704 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size [2021-05-03 00:16:00,720 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:00,725 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:00,737 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:16:00,739 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:16:00,755 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size 78 [2021-05-03 00:16:00,773 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (+ v_main_~c~0_115 1) v_~SIZE~0_39) (< v_main_~c~0_115 v_~last~0_44)) InVars {~SIZE~0=v_~SIZE~0_39, main_~c~0=v_main_~c~0_115, ~last~0=v_~last~0_44} OutVars{~SIZE~0=v_~SIZE~0_39, main_~c~0=v_main_~c~0_115, ~last~0=v_~last~0_44} AuxVars[] AssignedVars[] [2021-05-03 00:16:00,775 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:16:00,776 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:00,778 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:00,791 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:16:00,796 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:16:00,821 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:16:00,840 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:16:00,843 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_117 v_~SIZE~0_40) (<= v_~last~0_45 v_main_~c~0_117)) InVars {~SIZE~0=v_~SIZE~0_40, main_~c~0=v_main_~c~0_117, ~last~0=v_~last~0_45} OutVars{~SIZE~0=v_~SIZE~0_40, main_~c~0=v_main_~c~0_117, ~last~0=v_~last~0_45} AuxVars[] AssignedVars[] [2021-05-03 00:16:00,848 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:16:00,850 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:00,853 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:00,868 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:16:00,871 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:16:00,910 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:16:00,933 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_119 v_~SIZE~0_41) (< v_main_~c~0_119 v_~last~0_46)) InVars {~SIZE~0=v_~SIZE~0_41, main_~c~0=v_main_~c~0_119, ~last~0=v_~last~0_46} OutVars{~SIZE~0=v_~SIZE~0_41, main_~c~0=v_main_~c~0_119, ~last~0=v_~last~0_46} AuxVars[] AssignedVars[] [2021-05-03 00:16:00,936 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size [2021-05-03 00:16:00,950 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:00,952 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:00,967 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:16:00,972 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:16:00,985 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size 66 [2021-05-03 00:16:01,000 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:16:01,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:16:01,107 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:16:01,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:16:01,117 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:16:01,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:16:01,121 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:16:01,124 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:16:01,321 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:16:01,321 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [270032018] [2021-05-03 00:16:01,321 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [270032018] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:16:01,322 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:16:01,322 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-05-03 00:16:01,322 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1985611029] [2021-05-03 00:16:01,322 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-05-03 00:16:01,322 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:16:01,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-05-03 00:16:01,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2021-05-03 00:16:01,323 INFO L87 Difference]: Start difference. First operand 131 states and 161 transitions. Second operand has 13 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 12 states have internal predecessors, (28), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:16:01,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:16:01,557 INFO L93 Difference]: Finished difference Result 269 states and 329 transitions. [2021-05-03 00:16:01,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-05-03 00:16:01,558 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 12 states have internal predecessors, (28), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 34 [2021-05-03 00:16:01,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:16:01,559 INFO L225 Difference]: With dead ends: 269 [2021-05-03 00:16:01,559 INFO L226 Difference]: Without dead ends: 161 [2021-05-03 00:16:01,560 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 12 SyntacticMatches, 6 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 233.7ms TimeCoverageRelationStatistics Valid=62, Invalid=210, Unknown=0, NotChecked=0, Total=272 [2021-05-03 00:16:01,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2021-05-03 00:16:01,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 131. [2021-05-03 00:16:01,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 121 states have (on average 1.2396694214876034) internal successors, (150), 121 states have internal predecessors, (150), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:16:01,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 161 transitions. [2021-05-03 00:16:01,578 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 161 transitions. Word has length 34 [2021-05-03 00:16:01,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:16:01,578 INFO L480 AbstractCegarLoop]: Abstraction has 131 states and 161 transitions. [2021-05-03 00:16:01,578 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 13 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 12 states have internal predecessors, (28), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:16:01,578 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 161 transitions. [2021-05-03 00:16:01,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-05-03 00:16:01,578 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:16:01,578 INFO L523 BasicCegarLoop]: trace histogram [4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:16:01,579 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2021-05-03 00:16:01,579 INFO L428 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:16:01,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:16:01,579 INFO L82 PathProgramCache]: Analyzing trace with hash 1224498974, now seen corresponding path program 5 times [2021-05-03 00:16:01,579 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:16:01,579 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [454824731] [2021-05-03 00:16:01,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:16:01,587 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_~last~0_47 v_main_~c~0_127) (< (+ v_main_~c~0_127 1) v_~SIZE~0_42)) InVars {~SIZE~0=v_~SIZE~0_42, main_~c~0=v_main_~c~0_127, ~last~0=v_~last~0_47} OutVars{~SIZE~0=v_~SIZE~0_42, main_~c~0=v_main_~c~0_127, ~last~0=v_~last~0_47} AuxVars[] AssignedVars[] [2021-05-03 00:16:01,589 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size [2021-05-03 00:16:01,605 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:01,607 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:01,625 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:16:01,628 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:16:01,643 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size 78 [2021-05-03 00:16:01,660 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_129 v_~last~0_48) (< (+ v_main_~c~0_129 1) v_~SIZE~0_43)) InVars {~SIZE~0=v_~SIZE~0_43, main_~c~0=v_main_~c~0_129, ~last~0=v_~last~0_48} OutVars{~SIZE~0=v_~SIZE~0_43, main_~c~0=v_main_~c~0_129, ~last~0=v_~last~0_48} AuxVars[] AssignedVars[] [2021-05-03 00:16:01,662 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:16:01,680 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:01,686 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:01,700 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:16:01,705 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:16:01,719 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:16:01,738 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:16:01,740 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_131 v_~SIZE~0_44) (<= v_~last~0_49 v_main_~c~0_131)) InVars {~SIZE~0=v_~SIZE~0_44, main_~c~0=v_main_~c~0_131, ~last~0=v_~last~0_49} OutVars{~SIZE~0=v_~SIZE~0_44, main_~c~0=v_main_~c~0_131, ~last~0=v_~last~0_49} AuxVars[] AssignedVars[] [2021-05-03 00:16:01,742 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:16:01,758 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:01,760 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:01,770 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:16:01,772 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:16:01,788 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:16:01,808 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_133 v_~SIZE~0_45) (< v_main_~c~0_133 v_~last~0_50)) InVars {~SIZE~0=v_~SIZE~0_45, main_~c~0=v_main_~c~0_133, ~last~0=v_~last~0_50} OutVars{~SIZE~0=v_~SIZE~0_45, main_~c~0=v_main_~c~0_133, ~last~0=v_~last~0_50} AuxVars[] AssignedVars[] [2021-05-03 00:16:01,810 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size [2021-05-03 00:16:01,827 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:01,828 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:01,841 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:16:01,845 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:16:01,858 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size 66 [2021-05-03 00:16:01,873 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:16:01,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:16:01,949 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:16:01,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:16:01,958 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:16:01,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:16:01,961 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:16:01,963 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:16:02,150 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:16:02,150 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [454824731] [2021-05-03 00:16:02,150 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [454824731] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:16:02,151 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:16:02,151 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-05-03 00:16:02,151 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650539024] [2021-05-03 00:16:02,151 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2021-05-03 00:16:02,151 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:16:02,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-05-03 00:16:02,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=181, Unknown=0, NotChecked=0, Total=240 [2021-05-03 00:16:02,152 INFO L87 Difference]: Start difference. First operand 131 states and 161 transitions. Second operand has 14 states, 14 states have (on average 2.0) internal successors, (28), 13 states have internal predecessors, (28), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:16:02,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:16:02,408 INFO L93 Difference]: Finished difference Result 266 states and 326 transitions. [2021-05-03 00:16:02,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-05-03 00:16:02,409 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.0) internal successors, (28), 13 states have internal predecessors, (28), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 34 [2021-05-03 00:16:02,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:16:02,410 INFO L225 Difference]: With dead ends: 266 [2021-05-03 00:16:02,410 INFO L226 Difference]: Without dead ends: 158 [2021-05-03 00:16:02,410 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 12 SyntacticMatches, 5 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 251.5ms TimeCoverageRelationStatistics Valid=72, Invalid=234, Unknown=0, NotChecked=0, Total=306 [2021-05-03 00:16:02,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2021-05-03 00:16:02,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 131. [2021-05-03 00:16:02,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 121 states have (on average 1.2396694214876034) internal successors, (150), 121 states have internal predecessors, (150), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:16:02,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 161 transitions. [2021-05-03 00:16:02,424 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 161 transitions. Word has length 34 [2021-05-03 00:16:02,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:16:02,424 INFO L480 AbstractCegarLoop]: Abstraction has 131 states and 161 transitions. [2021-05-03 00:16:02,424 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 14 states, 14 states have (on average 2.0) internal successors, (28), 13 states have internal predecessors, (28), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:16:02,425 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 161 transitions. [2021-05-03 00:16:02,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-05-03 00:16:02,425 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:16:02,425 INFO L523 BasicCegarLoop]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:16:02,425 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2021-05-03 00:16:02,425 INFO L428 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:16:02,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:16:02,426 INFO L82 PathProgramCache]: Analyzing trace with hash 213381724, now seen corresponding path program 6 times [2021-05-03 00:16:02,426 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:16:02,426 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [148438424] [2021-05-03 00:16:02,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:16:02,431 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (+ v_main_~c~0_141 1) v_~SIZE~0_46) (< v_main_~c~0_141 v_~last~0_51)) InVars {~SIZE~0=v_~SIZE~0_46, main_~c~0=v_main_~c~0_141, ~last~0=v_~last~0_51} OutVars{~SIZE~0=v_~SIZE~0_46, main_~c~0=v_main_~c~0_141, ~last~0=v_~last~0_51} AuxVars[] AssignedVars[] [2021-05-03 00:16:02,433 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:16:02,445 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:02,447 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:02,462 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:16:02,466 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:16:02,479 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:16:02,495 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:16:02,497 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_~last~0_52 v_main_~c~0_143) (< v_main_~c~0_143 v_~SIZE~0_47)) InVars {~SIZE~0=v_~SIZE~0_47, main_~c~0=v_main_~c~0_143, ~last~0=v_~last~0_52} OutVars{~SIZE~0=v_~SIZE~0_47, main_~c~0=v_main_~c~0_143, ~last~0=v_~last~0_52} AuxVars[] AssignedVars[] [2021-05-03 00:16:02,499 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:16:02,500 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:02,502 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:02,513 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:16:02,515 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:16:02,541 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:16:02,559 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_145 v_~last~0_53) (< v_main_~c~0_145 v_~SIZE~0_48)) InVars {~SIZE~0=v_~SIZE~0_48, main_~c~0=v_main_~c~0_145, ~last~0=v_~last~0_53} OutVars{~SIZE~0=v_~SIZE~0_48, main_~c~0=v_main_~c~0_145, ~last~0=v_~last~0_53} AuxVars[] AssignedVars[] [2021-05-03 00:16:02,560 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size [2021-05-03 00:16:02,572 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:02,574 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:02,587 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:16:02,593 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:16:02,610 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size 66 [2021-05-03 00:16:02,629 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:16:02,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:16:02,738 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:16:02,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:16:02,745 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:16:02,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:16:02,749 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:16:02,752 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:16:02,965 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:16:02,966 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [148438424] [2021-05-03 00:16:02,966 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [148438424] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:16:02,966 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:16:02,966 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-05-03 00:16:02,966 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167185128] [2021-05-03 00:16:02,966 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-05-03 00:16:02,966 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:16:02,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-05-03 00:16:02,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=205, Unknown=0, NotChecked=0, Total=272 [2021-05-03 00:16:02,968 INFO L87 Difference]: Start difference. First operand 131 states and 161 transitions. Second operand has 15 states, 15 states have (on average 1.8666666666666667) internal successors, (28), 14 states have internal predecessors, (28), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:16:03,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:16:03,184 INFO L93 Difference]: Finished difference Result 269 states and 335 transitions. [2021-05-03 00:16:03,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-05-03 00:16:03,184 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.8666666666666667) internal successors, (28), 14 states have internal predecessors, (28), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 34 [2021-05-03 00:16:03,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:16:03,185 INFO L225 Difference]: With dead ends: 269 [2021-05-03 00:16:03,185 INFO L226 Difference]: Without dead ends: 161 [2021-05-03 00:16:03,186 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 12 SyntacticMatches, 4 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 265.0ms TimeCoverageRelationStatistics Valid=82, Invalid=260, Unknown=0, NotChecked=0, Total=342 [2021-05-03 00:16:03,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2021-05-03 00:16:03,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 129. [2021-05-03 00:16:03,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 119 states have (on average 1.2436974789915967) internal successors, (148), 120 states have internal predecessors, (148), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:16:03,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 159 transitions. [2021-05-03 00:16:03,201 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 159 transitions. Word has length 34 [2021-05-03 00:16:03,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:16:03,201 INFO L480 AbstractCegarLoop]: Abstraction has 129 states and 159 transitions. [2021-05-03 00:16:03,201 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 1.8666666666666667) internal successors, (28), 14 states have internal predecessors, (28), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:16:03,201 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 159 transitions. [2021-05-03 00:16:03,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-05-03 00:16:03,202 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:16:03,202 INFO L523 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:16:03,202 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2021-05-03 00:16:03,202 INFO L428 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:16:03,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:16:03,202 INFO L82 PathProgramCache]: Analyzing trace with hash 47841374, now seen corresponding path program 4 times [2021-05-03 00:16:03,203 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:16:03,203 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1265809484] [2021-05-03 00:16:03,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:16:03,208 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_153 v_~last~0_54) (< (+ v_main_~c~0_153 1) v_~SIZE~0_49)) InVars {~SIZE~0=v_~SIZE~0_49, main_~c~0=v_main_~c~0_153, ~last~0=v_~last~0_54} OutVars{~SIZE~0=v_~SIZE~0_49, main_~c~0=v_main_~c~0_153, ~last~0=v_~last~0_54} AuxVars[] AssignedVars[] [2021-05-03 00:16:03,210 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:16:03,222 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:03,224 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:03,236 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:16:03,240 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:16:03,252 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:16:03,267 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:16:03,269 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_155 v_~last~0_55) (< v_main_~c~0_155 v_~SIZE~0_50)) InVars {~SIZE~0=v_~SIZE~0_50, main_~c~0=v_main_~c~0_155, ~last~0=v_~last~0_55} OutVars{~SIZE~0=v_~SIZE~0_50, main_~c~0=v_main_~c~0_155, ~last~0=v_~last~0_55} AuxVars[] AssignedVars[] [2021-05-03 00:16:03,270 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size [2021-05-03 00:16:03,271 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:03,273 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:03,299 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:16:03,303 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:16:03,341 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size 66 [2021-05-03 00:16:03,366 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:16:03,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:16:03,498 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:16:03,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:16:03,509 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:16:03,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:16:03,519 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:16:03,899 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:16:03,900 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1265809484] [2021-05-03 00:16:03,900 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1265809484] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:16:03,900 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:16:03,900 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2021-05-03 00:16:03,900 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676356475] [2021-05-03 00:16:03,900 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-05-03 00:16:03,901 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:16:03,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-05-03 00:16:03,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=336, Unknown=0, NotChecked=0, Total=420 [2021-05-03 00:16:03,902 INFO L87 Difference]: Start difference. First operand 129 states and 159 transitions. Second operand has 19 states, 19 states have (on average 1.4736842105263157) internal successors, (28), 17 states have internal predecessors, (28), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:16:04,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:16:04,399 INFO L93 Difference]: Finished difference Result 285 states and 355 transitions. [2021-05-03 00:16:04,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-05-03 00:16:04,399 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.4736842105263157) internal successors, (28), 17 states have internal predecessors, (28), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 34 [2021-05-03 00:16:04,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:16:04,401 INFO L225 Difference]: With dead ends: 285 [2021-05-03 00:16:04,401 INFO L226 Difference]: Without dead ends: 168 [2021-05-03 00:16:04,402 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 6 SyntacticMatches, 3 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 608.3ms TimeCoverageRelationStatistics Valid=126, Invalid=576, Unknown=0, NotChecked=0, Total=702 [2021-05-03 00:16:04,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2021-05-03 00:16:04,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 143. [2021-05-03 00:16:04,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 133 states have (on average 1.2481203007518797) internal successors, (166), 133 states have internal predecessors, (166), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:16:04,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 177 transitions. [2021-05-03 00:16:04,421 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 177 transitions. Word has length 34 [2021-05-03 00:16:04,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:16:04,421 INFO L480 AbstractCegarLoop]: Abstraction has 143 states and 177 transitions. [2021-05-03 00:16:04,422 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 1.4736842105263157) internal successors, (28), 17 states have internal predecessors, (28), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:16:04,422 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 177 transitions. [2021-05-03 00:16:04,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-05-03 00:16:04,422 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:16:04,422 INFO L523 BasicCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:16:04,422 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2021-05-03 00:16:04,423 INFO L428 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:16:04,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:16:04,423 INFO L82 PathProgramCache]: Analyzing trace with hash 1002983901, now seen corresponding path program 5 times [2021-05-03 00:16:04,423 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:16:04,423 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1936230002] [2021-05-03 00:16:04,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:16:04,429 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_~last~0_56 v_main_~c~0_162) (< (+ v_main_~c~0_162 1) v_~SIZE~0_51)) InVars {~SIZE~0=v_~SIZE~0_51, main_~c~0=v_main_~c~0_162, ~last~0=v_~last~0_56} OutVars{~SIZE~0=v_~SIZE~0_51, main_~c~0=v_main_~c~0_162, ~last~0=v_~last~0_56} AuxVars[] AssignedVars[] [2021-05-03 00:16:04,432 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size [2021-05-03 00:16:04,433 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:04,435 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:04,454 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:16:04,457 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:16:04,489 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size 78 [2021-05-03 00:16:04,509 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:16:04,514 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_164 v_~SIZE~0_52) (<= v_~last~0_57 v_main_~c~0_164)) InVars {~SIZE~0=v_~SIZE~0_52, main_~c~0=v_main_~c~0_164, ~last~0=v_~last~0_57} OutVars{~SIZE~0=v_~SIZE~0_52, main_~c~0=v_main_~c~0_164, ~last~0=v_~last~0_57} AuxVars[] AssignedVars[] [2021-05-03 00:16:04,522 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:16:04,544 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:04,546 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:04,561 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:16:04,564 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:16:04,583 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:16:04,603 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:16:04,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:16:04,695 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:16:04,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:16:04,706 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:16:04,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:16:04,708 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:16:04,952 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:16:04,953 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1936230002] [2021-05-03 00:16:04,953 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1936230002] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:16:04,953 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:16:04,953 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-05-03 00:16:04,953 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834644910] [2021-05-03 00:16:04,954 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-05-03 00:16:04,954 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:16:04,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-05-03 00:16:04,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2021-05-03 00:16:04,957 INFO L87 Difference]: Start difference. First operand 143 states and 177 transitions. Second operand has 13 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 12 states have internal predecessors, (31), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:16:05,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:16:05,232 INFO L93 Difference]: Finished difference Result 299 states and 366 transitions. [2021-05-03 00:16:05,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-05-03 00:16:05,233 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 12 states have internal predecessors, (31), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 37 [2021-05-03 00:16:05,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:16:05,234 INFO L225 Difference]: With dead ends: 299 [2021-05-03 00:16:05,234 INFO L226 Difference]: Without dead ends: 182 [2021-05-03 00:16:05,234 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 13 SyntacticMatches, 9 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 268.5ms TimeCoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2021-05-03 00:16:05,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2021-05-03 00:16:05,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 152. [2021-05-03 00:16:05,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 142 states have (on average 1.232394366197183) internal successors, (175), 142 states have internal predecessors, (175), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:16:05,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 186 transitions. [2021-05-03 00:16:05,251 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 186 transitions. Word has length 37 [2021-05-03 00:16:05,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:16:05,252 INFO L480 AbstractCegarLoop]: Abstraction has 152 states and 186 transitions. [2021-05-03 00:16:05,252 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 13 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 12 states have internal predecessors, (31), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:16:05,252 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 186 transitions. [2021-05-03 00:16:05,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-05-03 00:16:05,252 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:16:05,252 INFO L523 BasicCegarLoop]: trace histogram [5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:16:05,252 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2021-05-03 00:16:05,252 INFO L428 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:16:05,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:16:05,253 INFO L82 PathProgramCache]: Analyzing trace with hash -802454433, now seen corresponding path program 7 times [2021-05-03 00:16:05,253 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:16:05,253 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1625185740] [2021-05-03 00:16:05,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:16:05,259 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (+ v_main_~c~0_172 1) v_~SIZE~0_53) (<= v_~last~0_58 v_main_~c~0_172)) InVars {~SIZE~0=v_~SIZE~0_53, main_~c~0=v_main_~c~0_172, ~last~0=v_~last~0_58} OutVars{~SIZE~0=v_~SIZE~0_53, main_~c~0=v_main_~c~0_172, ~last~0=v_~last~0_58} AuxVars[] AssignedVars[] [2021-05-03 00:16:05,262 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size [2021-05-03 00:16:05,280 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:05,297 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:05,311 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:16:05,314 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:16:05,337 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size 78 [2021-05-03 00:16:05,361 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_174 v_~last~0_59) (< (+ v_main_~c~0_174 1) v_~SIZE~0_54)) InVars {~SIZE~0=v_~SIZE~0_54, main_~c~0=v_main_~c~0_174, ~last~0=v_~last~0_59} OutVars{~SIZE~0=v_~SIZE~0_54, main_~c~0=v_main_~c~0_174, ~last~0=v_~last~0_59} AuxVars[] AssignedVars[] [2021-05-03 00:16:05,366 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:16:05,367 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:05,372 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:05,385 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:16:05,390 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:16:05,416 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:16:05,433 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:16:05,462 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_176 v_~SIZE~0_55) (<= v_~last~0_60 v_main_~c~0_176)) InVars {~SIZE~0=v_~SIZE~0_55, main_~c~0=v_main_~c~0_176, ~last~0=v_~last~0_60} OutVars{~SIZE~0=v_~SIZE~0_55, main_~c~0=v_main_~c~0_176, ~last~0=v_~last~0_60} AuxVars[] AssignedVars[] [2021-05-03 00:16:05,465 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:16:05,485 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:05,488 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:05,502 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:16:05,505 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:16:05,525 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:16:05,549 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_178 v_~last~0_61) (< v_main_~c~0_178 v_~SIZE~0_56)) InVars {~SIZE~0=v_~SIZE~0_56, main_~c~0=v_main_~c~0_178, ~last~0=v_~last~0_61} OutVars{~SIZE~0=v_~SIZE~0_56, main_~c~0=v_main_~c~0_178, ~last~0=v_~last~0_61} AuxVars[] AssignedVars[] [2021-05-03 00:16:05,551 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size [2021-05-03 00:16:05,568 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:05,570 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:05,586 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:16:05,591 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:16:05,608 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size 66 [2021-05-03 00:16:05,631 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:16:05,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:16:05,756 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:16:05,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:16:05,764 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:16:05,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:16:05,768 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:16:05,771 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:16:06,027 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:16:06,028 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1625185740] [2021-05-03 00:16:06,028 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1625185740] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:16:06,028 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:16:06,028 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-05-03 00:16:06,028 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312079855] [2021-05-03 00:16:06,028 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2021-05-03 00:16:06,028 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:16:06,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-05-03 00:16:06,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2021-05-03 00:16:06,029 INFO L87 Difference]: Start difference. First operand 152 states and 186 transitions. Second operand has 14 states, 14 states have (on average 2.2142857142857144) internal successors, (31), 13 states have internal predecessors, (31), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:16:06,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:16:06,317 INFO L93 Difference]: Finished difference Result 317 states and 384 transitions. [2021-05-03 00:16:06,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-05-03 00:16:06,318 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.2142857142857144) internal successors, (31), 13 states have internal predecessors, (31), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 37 [2021-05-03 00:16:06,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:16:06,319 INFO L225 Difference]: With dead ends: 317 [2021-05-03 00:16:06,319 INFO L226 Difference]: Without dead ends: 191 [2021-05-03 00:16:06,320 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 13 SyntacticMatches, 7 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 338.7ms TimeCoverageRelationStatistics Valid=65, Invalid=241, Unknown=0, NotChecked=0, Total=306 [2021-05-03 00:16:06,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2021-05-03 00:16:06,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 152. [2021-05-03 00:16:06,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 142 states have (on average 1.232394366197183) internal successors, (175), 142 states have internal predecessors, (175), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:16:06,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 186 transitions. [2021-05-03 00:16:06,339 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 186 transitions. Word has length 37 [2021-05-03 00:16:06,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:16:06,339 INFO L480 AbstractCegarLoop]: Abstraction has 152 states and 186 transitions. [2021-05-03 00:16:06,339 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 14 states, 14 states have (on average 2.2142857142857144) internal successors, (31), 13 states have internal predecessors, (31), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:16:06,339 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 186 transitions. [2021-05-03 00:16:06,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-05-03 00:16:06,340 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:16:06,340 INFO L523 BasicCegarLoop]: trace histogram [5, 5, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:16:06,340 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66 [2021-05-03 00:16:06,340 INFO L428 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:16:06,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:16:06,340 INFO L82 PathProgramCache]: Analyzing trace with hash -1620102883, now seen corresponding path program 8 times [2021-05-03 00:16:06,341 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:16:06,341 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [130497399] [2021-05-03 00:16:06,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:16:06,348 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_~last~0_62 v_main_~c~0_187) (< (+ v_main_~c~0_187 1) v_~SIZE~0_57)) InVars {~SIZE~0=v_~SIZE~0_57, main_~c~0=v_main_~c~0_187, ~last~0=v_~last~0_62} OutVars{~SIZE~0=v_~SIZE~0_57, main_~c~0=v_main_~c~0_187, ~last~0=v_~last~0_62} AuxVars[] AssignedVars[] [2021-05-03 00:16:06,351 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size [2021-05-03 00:16:06,352 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:06,356 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:06,367 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:16:06,370 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:16:06,397 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size 78 [2021-05-03 00:16:06,414 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (+ v_main_~c~0_189 1) v_~SIZE~0_58) (< v_main_~c~0_189 v_~last~0_63)) InVars {~SIZE~0=v_~SIZE~0_58, main_~c~0=v_main_~c~0_189, ~last~0=v_~last~0_63} OutVars{~SIZE~0=v_~SIZE~0_58, main_~c~0=v_main_~c~0_189, ~last~0=v_~last~0_63} AuxVars[] AssignedVars[] [2021-05-03 00:16:06,416 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:16:06,429 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:06,431 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:06,447 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:16:06,453 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:16:06,466 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:16:06,482 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:16:06,484 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_191 v_~SIZE~0_59) (<= v_~last~0_64 v_main_~c~0_191)) InVars {~SIZE~0=v_~SIZE~0_59, main_~c~0=v_main_~c~0_191, ~last~0=v_~last~0_64} OutVars{~SIZE~0=v_~SIZE~0_59, main_~c~0=v_main_~c~0_191, ~last~0=v_~last~0_64} AuxVars[] AssignedVars[] [2021-05-03 00:16:06,487 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:16:06,488 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:06,490 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:06,499 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:16:06,502 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:16:06,527 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:16:06,544 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_193 v_~SIZE~0_60) (< v_main_~c~0_193 v_~last~0_65)) InVars {~SIZE~0=v_~SIZE~0_60, main_~c~0=v_main_~c~0_193, ~last~0=v_~last~0_65} OutVars{~SIZE~0=v_~SIZE~0_60, main_~c~0=v_main_~c~0_193, ~last~0=v_~last~0_65} AuxVars[] AssignedVars[] [2021-05-03 00:16:06,546 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size [2021-05-03 00:16:06,546 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:06,548 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:06,560 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:16:06,564 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:16:06,586 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size 66 [2021-05-03 00:16:06,601 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:16:06,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:16:06,670 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:16:06,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:16:06,676 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:16:06,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:16:06,679 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:16:06,681 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:16:06,981 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:16:06,981 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [130497399] [2021-05-03 00:16:06,982 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [130497399] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:16:06,982 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:16:06,982 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-05-03 00:16:06,982 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453639161] [2021-05-03 00:16:06,982 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-05-03 00:16:06,982 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:16:06,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-05-03 00:16:06,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=210, Unknown=0, NotChecked=0, Total=272 [2021-05-03 00:16:06,983 INFO L87 Difference]: Start difference. First operand 152 states and 186 transitions. Second operand has 15 states, 15 states have (on average 2.066666666666667) internal successors, (31), 14 states have internal predecessors, (31), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:16:07,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:16:07,330 INFO L93 Difference]: Finished difference Result 311 states and 378 transitions. [2021-05-03 00:16:07,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-05-03 00:16:07,330 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.066666666666667) internal successors, (31), 14 states have internal predecessors, (31), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 37 [2021-05-03 00:16:07,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:16:07,333 INFO L225 Difference]: With dead ends: 311 [2021-05-03 00:16:07,333 INFO L226 Difference]: Without dead ends: 185 [2021-05-03 00:16:07,336 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 12 SyntacticMatches, 7 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 332.1ms TimeCoverageRelationStatistics Valid=75, Invalid=267, Unknown=0, NotChecked=0, Total=342 [2021-05-03 00:16:07,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2021-05-03 00:16:07,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 152. [2021-05-03 00:16:07,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 142 states have (on average 1.232394366197183) internal successors, (175), 142 states have internal predecessors, (175), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:16:07,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 186 transitions. [2021-05-03 00:16:07,364 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 186 transitions. Word has length 37 [2021-05-03 00:16:07,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:16:07,364 INFO L480 AbstractCegarLoop]: Abstraction has 152 states and 186 transitions. [2021-05-03 00:16:07,365 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 2.066666666666667) internal successors, (31), 14 states have internal predecessors, (31), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:16:07,365 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 186 transitions. [2021-05-03 00:16:07,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-05-03 00:16:07,365 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:16:07,365 INFO L523 BasicCegarLoop]: trace histogram [5, 5, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:16:07,365 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable71 [2021-05-03 00:16:07,366 INFO L428 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:16:07,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:16:07,366 INFO L82 PathProgramCache]: Analyzing trace with hash 1086516511, now seen corresponding path program 9 times [2021-05-03 00:16:07,366 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:16:07,366 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1019529595] [2021-05-03 00:16:07,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:16:07,375 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (+ v_main_~c~0_202 1) v_~SIZE~0_61) (<= v_~last~0_66 v_main_~c~0_202)) InVars {~SIZE~0=v_~SIZE~0_61, main_~c~0=v_main_~c~0_202, ~last~0=v_~last~0_66} OutVars{~SIZE~0=v_~SIZE~0_61, main_~c~0=v_main_~c~0_202, ~last~0=v_~last~0_66} AuxVars[] AssignedVars[] [2021-05-03 00:16:07,378 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size [2021-05-03 00:16:07,379 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:07,382 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:07,397 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:16:07,400 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:16:07,433 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size 78 [2021-05-03 00:16:07,456 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_204 v_~last~0_67) (< (+ v_main_~c~0_204 1) v_~SIZE~0_62)) InVars {~SIZE~0=v_~SIZE~0_62, main_~c~0=v_main_~c~0_204, ~last~0=v_~last~0_67} OutVars{~SIZE~0=v_~SIZE~0_62, main_~c~0=v_main_~c~0_204, ~last~0=v_~last~0_67} AuxVars[] AssignedVars[] [2021-05-03 00:16:07,459 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:16:07,460 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:07,464 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:07,480 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:16:07,485 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:16:07,516 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:16:07,535 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:16:07,538 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_206 v_~SIZE~0_63) (<= v_~last~0_68 v_main_~c~0_206)) InVars {~SIZE~0=v_~SIZE~0_63, main_~c~0=v_main_~c~0_206, ~last~0=v_~last~0_68} OutVars{~SIZE~0=v_~SIZE~0_63, main_~c~0=v_main_~c~0_206, ~last~0=v_~last~0_68} AuxVars[] AssignedVars[] [2021-05-03 00:16:07,541 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:16:07,542 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:07,549 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:07,563 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:16:07,566 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:16:07,602 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:16:07,624 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_208 v_~last~0_69) (< v_main_~c~0_208 v_~SIZE~0_64)) InVars {~SIZE~0=v_~SIZE~0_64, main_~c~0=v_main_~c~0_208, ~last~0=v_~last~0_69} OutVars{~SIZE~0=v_~SIZE~0_64, main_~c~0=v_main_~c~0_208, ~last~0=v_~last~0_69} AuxVars[] AssignedVars[] [2021-05-03 00:16:07,626 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size [2021-05-03 00:16:07,627 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:07,629 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:07,645 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:16:07,651 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:16:07,681 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size 66 [2021-05-03 00:16:07,700 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:16:07,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:16:07,774 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:16:07,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:16:07,781 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:16:07,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:16:07,785 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:16:07,789 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:16:08,060 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:16:08,060 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1019529595] [2021-05-03 00:16:08,061 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1019529595] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:16:08,061 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:16:08,061 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2021-05-03 00:16:08,061 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [4038592] [2021-05-03 00:16:08,061 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-05-03 00:16:08,061 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:16:08,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-05-03 00:16:08,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=209, Unknown=0, NotChecked=0, Total=272 [2021-05-03 00:16:08,062 INFO L87 Difference]: Start difference. First operand 152 states and 186 transitions. Second operand has 16 states, 16 states have (on average 1.9375) internal successors, (31), 15 states have internal predecessors, (31), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:16:08,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:16:08,419 INFO L93 Difference]: Finished difference Result 311 states and 382 transitions. [2021-05-03 00:16:08,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-05-03 00:16:08,419 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.9375) internal successors, (31), 15 states have internal predecessors, (31), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 37 [2021-05-03 00:16:08,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:16:08,420 INFO L225 Difference]: With dead ends: 311 [2021-05-03 00:16:08,421 INFO L226 Difference]: Without dead ends: 185 [2021-05-03 00:16:08,424 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 12 SyntacticMatches, 6 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 313.3ms TimeCoverageRelationStatistics Valid=79, Invalid=263, Unknown=0, NotChecked=0, Total=342 [2021-05-03 00:16:08,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2021-05-03 00:16:08,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 152. [2021-05-03 00:16:08,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 142 states have (on average 1.232394366197183) internal successors, (175), 142 states have internal predecessors, (175), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:16:08,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 186 transitions. [2021-05-03 00:16:08,449 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 186 transitions. Word has length 37 [2021-05-03 00:16:08,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:16:08,451 INFO L480 AbstractCegarLoop]: Abstraction has 152 states and 186 transitions. [2021-05-03 00:16:08,451 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 16 states, 16 states have (on average 1.9375) internal successors, (31), 15 states have internal predecessors, (31), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:16:08,451 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 186 transitions. [2021-05-03 00:16:08,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-05-03 00:16:08,451 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:16:08,451 INFO L523 BasicCegarLoop]: trace histogram [5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:16:08,452 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable76 [2021-05-03 00:16:08,452 INFO L428 AbstractCegarLoop]: === Iteration 25 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:16:08,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:16:08,452 INFO L82 PathProgramCache]: Analyzing trace with hash 75399261, now seen corresponding path program 10 times [2021-05-03 00:16:08,452 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:16:08,452 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [685178077] [2021-05-03 00:16:08,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:16:08,458 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (+ v_main_~c~0_217 1) v_~SIZE~0_65) (< v_main_~c~0_217 v_~last~0_70)) InVars {~SIZE~0=v_~SIZE~0_65, main_~c~0=v_main_~c~0_217, ~last~0=v_~last~0_70} OutVars{~SIZE~0=v_~SIZE~0_65, main_~c~0=v_main_~c~0_217, ~last~0=v_~last~0_70} AuxVars[] AssignedVars[] [2021-05-03 00:16:08,460 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:16:08,461 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:08,463 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:08,479 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:16:08,485 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:16:08,515 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:16:08,535 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:16:08,538 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_~last~0_71 v_main_~c~0_219) (< v_main_~c~0_219 v_~SIZE~0_66)) InVars {~SIZE~0=v_~SIZE~0_66, main_~c~0=v_main_~c~0_219, ~last~0=v_~last~0_71} OutVars{~SIZE~0=v_~SIZE~0_66, main_~c~0=v_main_~c~0_219, ~last~0=v_~last~0_71} AuxVars[] AssignedVars[] [2021-05-03 00:16:08,541 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:16:08,542 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:08,544 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:08,557 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:16:08,560 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:16:08,594 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:16:08,615 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_221 v_~last~0_72) (< v_main_~c~0_221 v_~SIZE~0_67)) InVars {~SIZE~0=v_~SIZE~0_67, main_~c~0=v_main_~c~0_221, ~last~0=v_~last~0_72} OutVars{~SIZE~0=v_~SIZE~0_67, main_~c~0=v_main_~c~0_221, ~last~0=v_~last~0_72} AuxVars[] AssignedVars[] [2021-05-03 00:16:08,617 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size [2021-05-03 00:16:08,618 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:08,622 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:08,638 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:16:08,645 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:16:08,675 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size 66 [2021-05-03 00:16:08,694 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:16:08,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:16:08,759 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:16:08,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:16:08,766 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:16:08,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:16:08,770 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:16:08,774 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:16:09,070 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:16:09,070 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [685178077] [2021-05-03 00:16:09,070 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [685178077] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:16:09,070 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:16:09,070 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2021-05-03 00:16:09,071 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [119180961] [2021-05-03 00:16:09,071 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states [2021-05-03 00:16:09,071 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:16:09,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-05-03 00:16:09,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=235, Unknown=0, NotChecked=0, Total=306 [2021-05-03 00:16:09,072 INFO L87 Difference]: Start difference. First operand 152 states and 186 transitions. Second operand has 17 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 16 states have internal predecessors, (31), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:16:09,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:16:09,446 INFO L93 Difference]: Finished difference Result 311 states and 388 transitions. [2021-05-03 00:16:09,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-05-03 00:16:09,447 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 16 states have internal predecessors, (31), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 37 [2021-05-03 00:16:09,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:16:09,448 INFO L225 Difference]: With dead ends: 311 [2021-05-03 00:16:09,448 INFO L226 Difference]: Without dead ends: 185 [2021-05-03 00:16:09,449 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 12 SyntacticMatches, 5 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 333.1ms TimeCoverageRelationStatistics Valid=89, Invalid=291, Unknown=0, NotChecked=0, Total=380 [2021-05-03 00:16:09,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2021-05-03 00:16:09,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 147. [2021-05-03 00:16:09,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 137 states have (on average 1.2335766423357664) internal successors, (169), 138 states have internal predecessors, (169), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:16:09,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 180 transitions. [2021-05-03 00:16:09,488 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 180 transitions. Word has length 37 [2021-05-03 00:16:09,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:16:09,488 INFO L480 AbstractCegarLoop]: Abstraction has 147 states and 180 transitions. [2021-05-03 00:16:09,488 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 17 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 16 states have internal predecessors, (31), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:16:09,488 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 180 transitions. [2021-05-03 00:16:09,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-05-03 00:16:09,489 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:16:09,489 INFO L523 BasicCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:16:09,489 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable80 [2021-05-03 00:16:09,489 INFO L428 AbstractCegarLoop]: === Iteration 26 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:16:09,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:16:09,489 INFO L82 PathProgramCache]: Analyzing trace with hash -90141089, now seen corresponding path program 5 times [2021-05-03 00:16:09,490 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:16:09,490 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2096578870] [2021-05-03 00:16:09,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:16:09,497 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (+ v_main_~c~0_230 1) v_~SIZE~0_68) (< v_main_~c~0_230 v_~last~0_73)) InVars {~SIZE~0=v_~SIZE~0_68, main_~c~0=v_main_~c~0_230, ~last~0=v_~last~0_73} OutVars{~SIZE~0=v_~SIZE~0_68, main_~c~0=v_main_~c~0_230, ~last~0=v_~last~0_73} AuxVars[] AssignedVars[] [2021-05-03 00:16:09,499 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:16:09,510 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:09,512 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:09,525 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:16:09,529 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:16:09,543 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:16:09,559 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:16:09,561 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_232 v_~last~0_74) (< v_main_~c~0_232 v_~SIZE~0_69)) InVars {~SIZE~0=v_~SIZE~0_69, main_~c~0=v_main_~c~0_232, ~last~0=v_~last~0_74} OutVars{~SIZE~0=v_~SIZE~0_69, main_~c~0=v_main_~c~0_232, ~last~0=v_~last~0_74} AuxVars[] AssignedVars[] [2021-05-03 00:16:09,563 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size [2021-05-03 00:16:09,575 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:09,581 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:09,594 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:16:09,599 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:16:09,613 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size 66 [2021-05-03 00:16:09,630 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:16:09,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:16:09,743 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:16:09,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:16:09,755 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:16:09,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:16:09,759 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:16:10,153 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:16:10,154 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2096578870] [2021-05-03 00:16:10,154 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [2096578870] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:16:10,154 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:16:10,154 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2021-05-03 00:16:10,154 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824724940] [2021-05-03 00:16:10,154 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states [2021-05-03 00:16:10,154 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:16:10,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-05-03 00:16:10,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=411, Unknown=0, NotChecked=0, Total=506 [2021-05-03 00:16:10,155 INFO L87 Difference]: Start difference. First operand 147 states and 180 transitions. Second operand has 21 states, 21 states have (on average 1.4761904761904763) internal successors, (31), 19 states have internal predecessors, (31), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:16:10,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:16:10,683 INFO L93 Difference]: Finished difference Result 328 states and 405 transitions. [2021-05-03 00:16:10,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-05-03 00:16:10,684 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 1.4761904761904763) internal successors, (31), 19 states have internal predecessors, (31), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 37 [2021-05-03 00:16:10,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:16:10,685 INFO L225 Difference]: With dead ends: 328 [2021-05-03 00:16:10,685 INFO L226 Difference]: Without dead ends: 193 [2021-05-03 00:16:10,687 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 6 SyntacticMatches, 4 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 202 ImplicationChecksByTransitivity, 652.0ms TimeCoverageRelationStatistics Valid=145, Invalid=725, Unknown=0, NotChecked=0, Total=870 [2021-05-03 00:16:10,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2021-05-03 00:16:10,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 164. [2021-05-03 00:16:10,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 154 states have (on average 1.2402597402597402) internal successors, (191), 154 states have internal predecessors, (191), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:16:10,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 202 transitions. [2021-05-03 00:16:10,730 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 202 transitions. Word has length 37 [2021-05-03 00:16:10,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:16:10,730 INFO L480 AbstractCegarLoop]: Abstraction has 164 states and 202 transitions. [2021-05-03 00:16:10,731 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 21 states, 21 states have (on average 1.4761904761904763) internal successors, (31), 19 states have internal predecessors, (31), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:16:10,731 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 202 transitions. [2021-05-03 00:16:10,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-05-03 00:16:10,732 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:16:10,732 INFO L523 BasicCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:16:10,732 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable83 [2021-05-03 00:16:10,732 INFO L428 AbstractCegarLoop]: === Iteration 27 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:16:10,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:16:10,732 INFO L82 PathProgramCache]: Analyzing trace with hash 589091326, now seen corresponding path program 6 times [2021-05-03 00:16:10,732 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:16:10,732 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [669702655] [2021-05-03 00:16:10,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:16:10,737 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (+ v_main_~c~0_240 1) v_~SIZE~0_70) (<= v_~last~0_75 v_main_~c~0_240)) InVars {~SIZE~0=v_~SIZE~0_70, main_~c~0=v_main_~c~0_240, ~last~0=v_~last~0_75} OutVars{~SIZE~0=v_~SIZE~0_70, main_~c~0=v_main_~c~0_240, ~last~0=v_~last~0_75} AuxVars[] AssignedVars[] [2021-05-03 00:16:10,740 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size [2021-05-03 00:16:10,741 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:10,742 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:10,753 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:16:10,755 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:16:10,780 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size 78 [2021-05-03 00:16:10,795 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:16:10,798 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_~last~0_76 v_main_~c~0_242) (< v_main_~c~0_242 v_~SIZE~0_71)) InVars {~SIZE~0=v_~SIZE~0_71, main_~c~0=v_main_~c~0_242, ~last~0=v_~last~0_76} OutVars{~SIZE~0=v_~SIZE~0_71, main_~c~0=v_main_~c~0_242, ~last~0=v_~last~0_76} AuxVars[] AssignedVars[] [2021-05-03 00:16:10,799 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:16:10,800 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:10,803 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:10,813 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:16:10,816 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:16:10,840 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:16:10,855 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:16:10,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:16:10,919 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:16:10,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:16:10,925 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:16:10,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:16:10,928 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:16:11,186 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:16:11,186 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [669702655] [2021-05-03 00:16:11,186 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [669702655] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:16:11,186 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:16:11,187 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-05-03 00:16:11,187 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602394561] [2021-05-03 00:16:11,187 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2021-05-03 00:16:11,187 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:16:11,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-05-03 00:16:11,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2021-05-03 00:16:11,187 INFO L87 Difference]: Start difference. First operand 164 states and 202 transitions. Second operand has 14 states, 14 states have (on average 2.4285714285714284) internal successors, (34), 13 states have internal predecessors, (34), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:16:11,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:16:11,490 INFO L93 Difference]: Finished difference Result 347 states and 421 transitions. [2021-05-03 00:16:11,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-05-03 00:16:11,491 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.4285714285714284) internal successors, (34), 13 states have internal predecessors, (34), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 40 [2021-05-03 00:16:11,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:16:11,492 INFO L225 Difference]: With dead ends: 347 [2021-05-03 00:16:11,492 INFO L226 Difference]: Without dead ends: 212 [2021-05-03 00:16:11,493 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 14 SyntacticMatches, 10 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 287.2ms TimeCoverageRelationStatistics Valid=52, Invalid=188, Unknown=0, NotChecked=0, Total=240 [2021-05-03 00:16:11,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2021-05-03 00:16:11,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 173. [2021-05-03 00:16:11,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 163 states have (on average 1.2269938650306749) internal successors, (200), 163 states have internal predecessors, (200), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:16:11,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 211 transitions. [2021-05-03 00:16:11,518 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 211 transitions. Word has length 40 [2021-05-03 00:16:11,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:16:11,518 INFO L480 AbstractCegarLoop]: Abstraction has 173 states and 211 transitions. [2021-05-03 00:16:11,518 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 14 states, 14 states have (on average 2.4285714285714284) internal successors, (34), 13 states have internal predecessors, (34), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:16:11,518 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 211 transitions. [2021-05-03 00:16:11,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-05-03 00:16:11,519 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:16:11,519 INFO L523 BasicCegarLoop]: trace histogram [6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:16:11,519 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable86 [2021-05-03 00:16:11,519 INFO L428 AbstractCegarLoop]: === Iteration 28 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:16:11,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:16:11,520 INFO L82 PathProgramCache]: Analyzing trace with hash 651130940, now seen corresponding path program 11 times [2021-05-03 00:16:11,520 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:16:11,520 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [33092499] [2021-05-03 00:16:11,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:16:11,526 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (+ v_main_~c~0_251 1) v_~SIZE~0_72) (<= v_~last~0_77 v_main_~c~0_251)) InVars {~SIZE~0=v_~SIZE~0_72, main_~c~0=v_main_~c~0_251, ~last~0=v_~last~0_77} OutVars{~SIZE~0=v_~SIZE~0_72, main_~c~0=v_main_~c~0_251, ~last~0=v_~last~0_77} AuxVars[] AssignedVars[] [2021-05-03 00:16:11,527 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size [2021-05-03 00:16:11,528 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:11,530 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:11,540 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:16:11,542 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:16:11,573 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size 78 [2021-05-03 00:16:11,590 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_253 v_~last~0_78) (< (+ v_main_~c~0_253 1) v_~SIZE~0_73)) InVars {~SIZE~0=v_~SIZE~0_73, main_~c~0=v_main_~c~0_253, ~last~0=v_~last~0_78} OutVars{~SIZE~0=v_~SIZE~0_73, main_~c~0=v_main_~c~0_253, ~last~0=v_~last~0_78} AuxVars[] AssignedVars[] [2021-05-03 00:16:11,592 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:16:11,593 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:11,594 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:11,606 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:16:11,610 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:16:11,632 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:16:11,647 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:16:11,649 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_255 v_~SIZE~0_74) (<= v_~last~0_79 v_main_~c~0_255)) InVars {~SIZE~0=v_~SIZE~0_74, main_~c~0=v_main_~c~0_255, ~last~0=v_~last~0_79} OutVars{~SIZE~0=v_~SIZE~0_74, main_~c~0=v_main_~c~0_255, ~last~0=v_~last~0_79} AuxVars[] AssignedVars[] [2021-05-03 00:16:11,651 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:16:11,652 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:11,653 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:11,662 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:16:11,665 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:16:11,689 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:16:11,706 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_257 v_~last~0_80) (< v_main_~c~0_257 v_~SIZE~0_75)) InVars {~SIZE~0=v_~SIZE~0_75, main_~c~0=v_main_~c~0_257, ~last~0=v_~last~0_80} OutVars{~SIZE~0=v_~SIZE~0_75, main_~c~0=v_main_~c~0_257, ~last~0=v_~last~0_80} AuxVars[] AssignedVars[] [2021-05-03 00:16:11,708 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size [2021-05-03 00:16:11,709 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:11,710 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:11,722 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:16:11,727 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:16:11,749 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size 66 [2021-05-03 00:16:11,777 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:16:11,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:16:11,842 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:16:11,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:16:11,848 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:16:11,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:16:11,851 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:16:11,854 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:16:12,120 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:16:12,121 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [33092499] [2021-05-03 00:16:12,121 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [33092499] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:16:12,121 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:16:12,121 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-05-03 00:16:12,121 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1320133807] [2021-05-03 00:16:12,122 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-05-03 00:16:12,122 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:16:12,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-05-03 00:16:12,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=215, Unknown=0, NotChecked=0, Total=272 [2021-05-03 00:16:12,137 INFO L87 Difference]: Start difference. First operand 173 states and 211 transitions. Second operand has 15 states, 15 states have (on average 2.2666666666666666) internal successors, (34), 14 states have internal predecessors, (34), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:16:12,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:16:12,453 INFO L93 Difference]: Finished difference Result 365 states and 439 transitions. [2021-05-03 00:16:12,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-05-03 00:16:12,454 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.2666666666666666) internal successors, (34), 14 states have internal predecessors, (34), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 40 [2021-05-03 00:16:12,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:16:12,455 INFO L225 Difference]: With dead ends: 365 [2021-05-03 00:16:12,455 INFO L226 Difference]: Without dead ends: 221 [2021-05-03 00:16:12,456 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 12 SyntacticMatches, 10 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 135 ImplicationChecksByTransitivity, 314.3ms TimeCoverageRelationStatistics Valid=68, Invalid=274, Unknown=0, NotChecked=0, Total=342 [2021-05-03 00:16:12,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2021-05-03 00:16:12,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 173. [2021-05-03 00:16:12,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 163 states have (on average 1.2269938650306749) internal successors, (200), 163 states have internal predecessors, (200), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:16:12,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 211 transitions. [2021-05-03 00:16:12,481 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 211 transitions. Word has length 40 [2021-05-03 00:16:12,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:16:12,481 INFO L480 AbstractCegarLoop]: Abstraction has 173 states and 211 transitions. [2021-05-03 00:16:12,481 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 2.2666666666666666) internal successors, (34), 14 states have internal predecessors, (34), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:16:12,481 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 211 transitions. [2021-05-03 00:16:12,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-05-03 00:16:12,482 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:16:12,482 INFO L523 BasicCegarLoop]: trace histogram [6, 6, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:16:12,482 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable91 [2021-05-03 00:16:12,482 INFO L428 AbstractCegarLoop]: === Iteration 29 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:16:12,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:16:12,482 INFO L82 PathProgramCache]: Analyzing trace with hash -1154307394, now seen corresponding path program 12 times [2021-05-03 00:16:12,482 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:16:12,483 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [517570984] [2021-05-03 00:16:12,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:16:12,488 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_~last~0_81 v_main_~c~0_267) (< (+ v_main_~c~0_267 1) v_~SIZE~0_76)) InVars {~SIZE~0=v_~SIZE~0_76, main_~c~0=v_main_~c~0_267, ~last~0=v_~last~0_81} OutVars{~SIZE~0=v_~SIZE~0_76, main_~c~0=v_main_~c~0_267, ~last~0=v_~last~0_81} AuxVars[] AssignedVars[] [2021-05-03 00:16:12,490 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size [2021-05-03 00:16:12,491 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:12,493 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:12,504 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:16:12,506 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:16:12,541 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size 78 [2021-05-03 00:16:12,557 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_269 v_~last~0_82) (< (+ v_main_~c~0_269 1) v_~SIZE~0_77)) InVars {~SIZE~0=v_~SIZE~0_77, main_~c~0=v_main_~c~0_269, ~last~0=v_~last~0_82} OutVars{~SIZE~0=v_~SIZE~0_77, main_~c~0=v_main_~c~0_269, ~last~0=v_~last~0_82} AuxVars[] AssignedVars[] [2021-05-03 00:16:12,558 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:16:12,572 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:12,575 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:12,586 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:16:12,589 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:16:12,600 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:16:12,616 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:16:12,618 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_~last~0_83 v_main_~c~0_271) (< v_main_~c~0_271 v_~SIZE~0_78)) InVars {~SIZE~0=v_~SIZE~0_78, main_~c~0=v_main_~c~0_271, ~last~0=v_~last~0_83} OutVars{~SIZE~0=v_~SIZE~0_78, main_~c~0=v_main_~c~0_271, ~last~0=v_~last~0_83} AuxVars[] AssignedVars[] [2021-05-03 00:16:12,620 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:16:12,633 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:12,641 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:12,655 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:16:12,657 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:16:12,669 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:16:12,686 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_273 v_~last~0_84) (< v_main_~c~0_273 v_~SIZE~0_79)) InVars {~SIZE~0=v_~SIZE~0_79, main_~c~0=v_main_~c~0_273, ~last~0=v_~last~0_84} OutVars{~SIZE~0=v_~SIZE~0_79, main_~c~0=v_main_~c~0_273, ~last~0=v_~last~0_84} AuxVars[] AssignedVars[] [2021-05-03 00:16:12,690 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size [2021-05-03 00:16:12,691 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:12,692 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:12,703 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:16:12,706 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:16:12,727 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size 66 [2021-05-03 00:16:12,741 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:16:12,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:16:12,811 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:16:12,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:16:12,818 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:16:12,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:16:12,822 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:16:12,825 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:16:13,045 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:16:13,046 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [517570984] [2021-05-03 00:16:13,046 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [517570984] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:16:13,046 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:16:13,046 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2021-05-03 00:16:13,046 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2106580276] [2021-05-03 00:16:13,046 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-05-03 00:16:13,046 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:16:13,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-05-03 00:16:13,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=214, Unknown=0, NotChecked=0, Total=272 [2021-05-03 00:16:13,048 INFO L87 Difference]: Start difference. First operand 173 states and 211 transitions. Second operand has 16 states, 16 states have (on average 2.125) internal successors, (34), 15 states have internal predecessors, (34), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:16:13,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:16:13,373 INFO L93 Difference]: Finished difference Result 365 states and 443 transitions. [2021-05-03 00:16:13,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-05-03 00:16:13,373 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.125) internal successors, (34), 15 states have internal predecessors, (34), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 40 [2021-05-03 00:16:13,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:16:13,374 INFO L225 Difference]: With dead ends: 365 [2021-05-03 00:16:13,374 INFO L226 Difference]: Without dead ends: 221 [2021-05-03 00:16:13,375 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 12 SyntacticMatches, 9 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 137 ImplicationChecksByTransitivity, 259.5ms TimeCoverageRelationStatistics Valid=72, Invalid=270, Unknown=0, NotChecked=0, Total=342 [2021-05-03 00:16:13,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2021-05-03 00:16:13,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 173. [2021-05-03 00:16:13,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 163 states have (on average 1.2269938650306749) internal successors, (200), 163 states have internal predecessors, (200), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:16:13,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 211 transitions. [2021-05-03 00:16:13,407 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 211 transitions. Word has length 40 [2021-05-03 00:16:13,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:16:13,407 INFO L480 AbstractCegarLoop]: Abstraction has 173 states and 211 transitions. [2021-05-03 00:16:13,407 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 16 states, 16 states have (on average 2.125) internal successors, (34), 15 states have internal predecessors, (34), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:16:13,407 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 211 transitions. [2021-05-03 00:16:13,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-05-03 00:16:13,408 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:16:13,408 INFO L523 BasicCegarLoop]: trace histogram [6, 6, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:16:13,408 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable96 [2021-05-03 00:16:13,408 INFO L428 AbstractCegarLoop]: === Iteration 30 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:16:13,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:16:13,409 INFO L82 PathProgramCache]: Analyzing trace with hash -1971955844, now seen corresponding path program 13 times [2021-05-03 00:16:13,409 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:16:13,409 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1503459430] [2021-05-03 00:16:13,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:16:13,416 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (+ v_main_~c~0_283 1) v_~SIZE~0_80) (<= v_~last~0_85 v_main_~c~0_283)) InVars {~SIZE~0=v_~SIZE~0_80, main_~c~0=v_main_~c~0_283, ~last~0=v_~last~0_85} OutVars{~SIZE~0=v_~SIZE~0_80, main_~c~0=v_main_~c~0_283, ~last~0=v_~last~0_85} AuxVars[] AssignedVars[] [2021-05-03 00:16:13,418 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size [2021-05-03 00:16:13,419 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:13,420 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:13,429 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:16:13,431 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:16:13,456 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size 78 [2021-05-03 00:16:13,474 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_285 v_~last~0_86) (< (+ v_main_~c~0_285 1) v_~SIZE~0_81)) InVars {~SIZE~0=v_~SIZE~0_81, main_~c~0=v_main_~c~0_285, ~last~0=v_~last~0_86} OutVars{~SIZE~0=v_~SIZE~0_81, main_~c~0=v_main_~c~0_285, ~last~0=v_~last~0_86} AuxVars[] AssignedVars[] [2021-05-03 00:16:13,476 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:16:13,487 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:13,489 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:13,500 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:16:13,504 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:16:13,516 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:16:13,532 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:16:13,534 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_~last~0_87 v_main_~c~0_287) (< v_main_~c~0_287 v_~SIZE~0_82)) InVars {~SIZE~0=v_~SIZE~0_82, main_~c~0=v_main_~c~0_287, ~last~0=v_~last~0_87} OutVars{~SIZE~0=v_~SIZE~0_82, main_~c~0=v_main_~c~0_287, ~last~0=v_~last~0_87} AuxVars[] AssignedVars[] [2021-05-03 00:16:13,535 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:16:13,550 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:13,551 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:13,561 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:16:13,563 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:16:13,576 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:16:13,595 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_289 v_~last~0_88) (< v_main_~c~0_289 v_~SIZE~0_83)) InVars {~SIZE~0=v_~SIZE~0_83, main_~c~0=v_main_~c~0_289, ~last~0=v_~last~0_88} OutVars{~SIZE~0=v_~SIZE~0_83, main_~c~0=v_main_~c~0_289, ~last~0=v_~last~0_88} AuxVars[] AssignedVars[] [2021-05-03 00:16:13,597 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size [2021-05-03 00:16:13,610 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:13,611 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:13,624 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:16:13,628 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:16:13,642 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size 66 [2021-05-03 00:16:13,659 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:16:13,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:16:13,722 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:16:13,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:16:13,729 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:16:13,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:16:13,731 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:16:13,734 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:16:14,047 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:16:14,048 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1503459430] [2021-05-03 00:16:14,049 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1503459430] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:16:14,049 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:16:14,049 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2021-05-03 00:16:14,049 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [606630854] [2021-05-03 00:16:14,049 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states [2021-05-03 00:16:14,049 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:16:14,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-05-03 00:16:14,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=240, Unknown=0, NotChecked=0, Total=306 [2021-05-03 00:16:14,050 INFO L87 Difference]: Start difference. First operand 173 states and 211 transitions. Second operand has 17 states, 17 states have (on average 2.0) internal successors, (34), 16 states have internal predecessors, (34), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:16:14,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:16:14,425 INFO L93 Difference]: Finished difference Result 356 states and 434 transitions. [2021-05-03 00:16:14,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-05-03 00:16:14,425 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.0) internal successors, (34), 16 states have internal predecessors, (34), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 40 [2021-05-03 00:16:14,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:16:14,426 INFO L225 Difference]: With dead ends: 356 [2021-05-03 00:16:14,426 INFO L226 Difference]: Without dead ends: 212 [2021-05-03 00:16:14,427 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 12 SyntacticMatches, 8 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 151 ImplicationChecksByTransitivity, 346.0ms TimeCoverageRelationStatistics Valid=82, Invalid=298, Unknown=0, NotChecked=0, Total=380 [2021-05-03 00:16:14,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2021-05-03 00:16:14,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 173. [2021-05-03 00:16:14,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 163 states have (on average 1.2269938650306749) internal successors, (200), 163 states have internal predecessors, (200), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:16:14,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 211 transitions. [2021-05-03 00:16:14,453 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 211 transitions. Word has length 40 [2021-05-03 00:16:14,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:16:14,454 INFO L480 AbstractCegarLoop]: Abstraction has 173 states and 211 transitions. [2021-05-03 00:16:14,454 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 17 states, 17 states have (on average 2.0) internal successors, (34), 16 states have internal predecessors, (34), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:16:14,454 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 211 transitions. [2021-05-03 00:16:14,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-05-03 00:16:14,454 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:16:14,454 INFO L523 BasicCegarLoop]: trace histogram [6, 6, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:16:14,454 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable101 [2021-05-03 00:16:14,454 INFO L428 AbstractCegarLoop]: === Iteration 31 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:16:14,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:16:14,455 INFO L82 PathProgramCache]: Analyzing trace with hash 734663550, now seen corresponding path program 14 times [2021-05-03 00:16:14,455 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:16:14,455 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1297886895] [2021-05-03 00:16:14,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:16:14,461 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (+ v_main_~c~0_299 1) v_~SIZE~0_84) (<= v_~last~0_89 v_main_~c~0_299)) InVars {~SIZE~0=v_~SIZE~0_84, main_~c~0=v_main_~c~0_299, ~last~0=v_~last~0_89} OutVars{~SIZE~0=v_~SIZE~0_84, main_~c~0=v_main_~c~0_299, ~last~0=v_~last~0_89} AuxVars[] AssignedVars[] [2021-05-03 00:16:14,462 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size [2021-05-03 00:16:14,477 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:14,479 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:14,488 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:16:14,490 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:16:14,505 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size 78 [2021-05-03 00:16:14,521 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (+ v_main_~c~0_301 1) v_~SIZE~0_85) (< v_main_~c~0_301 v_~last~0_90)) InVars {~SIZE~0=v_~SIZE~0_85, main_~c~0=v_main_~c~0_301, ~last~0=v_~last~0_90} OutVars{~SIZE~0=v_~SIZE~0_85, main_~c~0=v_main_~c~0_301, ~last~0=v_~last~0_90} AuxVars[] AssignedVars[] [2021-05-03 00:16:14,523 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:16:14,524 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:14,525 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:14,536 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:16:14,540 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:16:14,560 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:16:14,575 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:16:14,577 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_~last~0_91 v_main_~c~0_303) (< v_main_~c~0_303 v_~SIZE~0_86)) InVars {~SIZE~0=v_~SIZE~0_86, main_~c~0=v_main_~c~0_303, ~last~0=v_~last~0_91} OutVars{~SIZE~0=v_~SIZE~0_86, main_~c~0=v_main_~c~0_303, ~last~0=v_~last~0_91} AuxVars[] AssignedVars[] [2021-05-03 00:16:14,579 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:16:14,591 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:14,593 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:14,601 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:16:14,603 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:16:14,615 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:16:14,631 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_305 v_~SIZE~0_87) (< v_main_~c~0_305 v_~last~0_92)) InVars {~SIZE~0=v_~SIZE~0_87, main_~c~0=v_main_~c~0_305, ~last~0=v_~last~0_92} OutVars{~SIZE~0=v_~SIZE~0_87, main_~c~0=v_main_~c~0_305, ~last~0=v_~last~0_92} AuxVars[] AssignedVars[] [2021-05-03 00:16:14,633 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size [2021-05-03 00:16:14,634 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:14,635 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:14,645 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:16:14,649 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:16:14,669 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size 66 [2021-05-03 00:16:14,683 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:16:14,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:16:14,739 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:16:14,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:16:14,744 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:16:14,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:16:14,745 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:16:14,748 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:16:15,063 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:16:15,064 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1297886895] [2021-05-03 00:16:15,064 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1297886895] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:16:15,064 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:16:15,064 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2021-05-03 00:16:15,064 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2042022339] [2021-05-03 00:16:15,064 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-05-03 00:16:15,064 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:16:15,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-05-03 00:16:15,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=299, Unknown=0, NotChecked=0, Total=380 [2021-05-03 00:16:15,065 INFO L87 Difference]: Start difference. First operand 173 states and 211 transitions. Second operand has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 17 states have internal predecessors, (34), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:16:15,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:16:15,358 INFO L93 Difference]: Finished difference Result 350 states and 424 transitions. [2021-05-03 00:16:15,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-05-03 00:16:15,358 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 17 states have internal predecessors, (34), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 40 [2021-05-03 00:16:15,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:16:15,359 INFO L225 Difference]: With dead ends: 350 [2021-05-03 00:16:15,359 INFO L226 Difference]: Without dead ends: 206 [2021-05-03 00:16:15,360 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 12 SyntacticMatches, 7 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 174 ImplicationChecksByTransitivity, 362.7ms TimeCoverageRelationStatistics Valid=98, Invalid=364, Unknown=0, NotChecked=0, Total=462 [2021-05-03 00:16:15,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2021-05-03 00:16:15,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 173. [2021-05-03 00:16:15,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 163 states have (on average 1.2269938650306749) internal successors, (200), 163 states have internal predecessors, (200), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:16:15,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 211 transitions. [2021-05-03 00:16:15,393 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 211 transitions. Word has length 40 [2021-05-03 00:16:15,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:16:15,393 INFO L480 AbstractCegarLoop]: Abstraction has 173 states and 211 transitions. [2021-05-03 00:16:15,393 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 17 states have internal predecessors, (34), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:16:15,393 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 211 transitions. [2021-05-03 00:16:15,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-05-03 00:16:15,394 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:16:15,394 INFO L523 BasicCegarLoop]: trace histogram [6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:16:15,394 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable106 [2021-05-03 00:16:15,395 INFO L428 AbstractCegarLoop]: === Iteration 32 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:16:15,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:16:15,395 INFO L82 PathProgramCache]: Analyzing trace with hash -276453700, now seen corresponding path program 15 times [2021-05-03 00:16:15,395 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:16:15,395 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1214407520] [2021-05-03 00:16:15,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:16:15,400 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_315 v_~last~0_93) (< (+ v_main_~c~0_315 1) v_~SIZE~0_88)) InVars {~SIZE~0=v_~SIZE~0_88, main_~c~0=v_main_~c~0_315, ~last~0=v_~last~0_93} OutVars{~SIZE~0=v_~SIZE~0_88, main_~c~0=v_main_~c~0_315, ~last~0=v_~last~0_93} AuxVars[] AssignedVars[] [2021-05-03 00:16:15,403 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:16:15,415 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:15,417 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:15,434 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:16:15,438 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:16:15,453 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:16:15,470 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:16:15,473 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_~last~0_94 v_main_~c~0_317) (< v_main_~c~0_317 v_~SIZE~0_89)) InVars {~SIZE~0=v_~SIZE~0_89, main_~c~0=v_main_~c~0_317, ~last~0=v_~last~0_94} OutVars{~SIZE~0=v_~SIZE~0_89, main_~c~0=v_main_~c~0_317, ~last~0=v_~last~0_94} AuxVars[] AssignedVars[] [2021-05-03 00:16:15,474 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:16:15,475 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:15,478 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:15,488 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:16:15,491 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:16:15,517 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:16:15,536 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_319 v_~SIZE~0_90) (< v_main_~c~0_319 v_~last~0_95)) InVars {~SIZE~0=v_~SIZE~0_90, main_~c~0=v_main_~c~0_319, ~last~0=v_~last~0_95} OutVars{~SIZE~0=v_~SIZE~0_90, main_~c~0=v_main_~c~0_319, ~last~0=v_~last~0_95} AuxVars[] AssignedVars[] [2021-05-03 00:16:15,538 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size [2021-05-03 00:16:15,552 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:15,554 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:15,567 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:16:15,571 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:16:15,600 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size 66 [2021-05-03 00:16:15,619 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:16:15,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:16:15,692 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:16:15,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:16:15,698 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:16:15,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:16:15,701 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:16:15,704 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:16:15,996 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:16:15,996 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1214407520] [2021-05-03 00:16:15,996 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1214407520] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:16:15,996 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:16:15,996 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2021-05-03 00:16:15,997 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731809462] [2021-05-03 00:16:15,997 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-05-03 00:16:15,997 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:16:15,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-05-03 00:16:15,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=331, Unknown=0, NotChecked=0, Total=420 [2021-05-03 00:16:15,998 INFO L87 Difference]: Start difference. First operand 173 states and 211 transitions. Second operand has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 18 states have internal predecessors, (34), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:16:16,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:16:16,282 INFO L93 Difference]: Finished difference Result 353 states and 433 transitions. [2021-05-03 00:16:16,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-05-03 00:16:16,283 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 18 states have internal predecessors, (34), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 40 [2021-05-03 00:16:16,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:16:16,284 INFO L225 Difference]: With dead ends: 353 [2021-05-03 00:16:16,284 INFO L226 Difference]: Without dead ends: 209 [2021-05-03 00:16:16,284 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 12 SyntacticMatches, 6 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 169 ImplicationChecksByTransitivity, 330.2ms TimeCoverageRelationStatistics Valid=108, Invalid=398, Unknown=0, NotChecked=0, Total=506 [2021-05-03 00:16:16,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2021-05-03 00:16:16,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 165. [2021-05-03 00:16:16,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 155 states have (on average 1.2258064516129032) internal successors, (190), 156 states have internal predecessors, (190), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:16:16,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 201 transitions. [2021-05-03 00:16:16,311 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 201 transitions. Word has length 40 [2021-05-03 00:16:16,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:16:16,311 INFO L480 AbstractCegarLoop]: Abstraction has 165 states and 201 transitions. [2021-05-03 00:16:16,311 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 18 states have internal predecessors, (34), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:16:16,311 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 201 transitions. [2021-05-03 00:16:16,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-05-03 00:16:16,311 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:16:16,311 INFO L523 BasicCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:16:16,312 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable110 [2021-05-03 00:16:16,312 INFO L428 AbstractCegarLoop]: === Iteration 33 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:16:16,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:16:16,312 INFO L82 PathProgramCache]: Analyzing trace with hash -441994050, now seen corresponding path program 6 times [2021-05-03 00:16:16,312 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:16:16,312 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [519304509] [2021-05-03 00:16:16,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:16:16,316 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_329 v_~last~0_96) (< (+ v_main_~c~0_329 1) v_~SIZE~0_91)) InVars {~SIZE~0=v_~SIZE~0_91, main_~c~0=v_main_~c~0_329, ~last~0=v_~last~0_96} OutVars{~SIZE~0=v_~SIZE~0_91, main_~c~0=v_main_~c~0_329, ~last~0=v_~last~0_96} AuxVars[] AssignedVars[] [2021-05-03 00:16:16,317 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:16:16,317 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:16,319 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:16,329 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:16:16,332 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:16:16,352 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:16:16,367 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:16:16,369 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_331 v_~last~0_97) (< v_main_~c~0_331 v_~SIZE~0_92)) InVars {~SIZE~0=v_~SIZE~0_92, main_~c~0=v_main_~c~0_331, ~last~0=v_~last~0_97} OutVars{~SIZE~0=v_~SIZE~0_92, main_~c~0=v_main_~c~0_331, ~last~0=v_~last~0_97} AuxVars[] AssignedVars[] [2021-05-03 00:16:16,370 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size [2021-05-03 00:16:16,371 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:16,372 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:16,382 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:16:16,386 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:16:16,405 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size 66 [2021-05-03 00:16:16,419 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:16:16,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:16:16,506 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:16:16,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:16:16,510 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:16:16,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:16:16,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-03 00:16:16,962 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:16:16,962 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [519304509] [2021-05-03 00:16:16,962 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [519304509] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:16:16,963 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:16:16,963 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2021-05-03 00:16:16,963 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1829449961] [2021-05-03 00:16:16,963 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states [2021-05-03 00:16:16,963 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:16:16,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-05-03 00:16:16,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=494, Unknown=0, NotChecked=0, Total=600 [2021-05-03 00:16:16,964 INFO L87 Difference]: Start difference. First operand 165 states and 201 transitions. Second operand has 23 states, 23 states have (on average 1.4782608695652173) internal successors, (34), 21 states have internal predecessors, (34), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:16:17,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:16:17,543 INFO L93 Difference]: Finished difference Result 371 states and 455 transitions. [2021-05-03 00:16:17,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2021-05-03 00:16:17,543 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 1.4782608695652173) internal successors, (34), 21 states have internal predecessors, (34), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 40 [2021-05-03 00:16:17,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:16:17,544 INFO L225 Difference]: With dead ends: 371 [2021-05-03 00:16:17,544 INFO L226 Difference]: Without dead ends: 218 [2021-05-03 00:16:17,545 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 6 SyntacticMatches, 5 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 254 ImplicationChecksByTransitivity, 721.5ms TimeCoverageRelationStatistics Valid=164, Invalid=892, Unknown=0, NotChecked=0, Total=1056 [2021-05-03 00:16:17,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2021-05-03 00:16:17,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 185. [2021-05-03 00:16:17,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 175 states have (on average 1.2342857142857142) internal successors, (216), 175 states have internal predecessors, (216), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:16:17,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 227 transitions. [2021-05-03 00:16:17,574 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 227 transitions. Word has length 40 [2021-05-03 00:16:17,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:16:17,574 INFO L480 AbstractCegarLoop]: Abstraction has 185 states and 227 transitions. [2021-05-03 00:16:17,574 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 23 states, 23 states have (on average 1.4782608695652173) internal successors, (34), 21 states have internal predecessors, (34), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:16:17,574 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 227 transitions. [2021-05-03 00:16:17,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2021-05-03 00:16:17,575 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:16:17,575 INFO L523 BasicCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:16:17,575 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable113 [2021-05-03 00:16:17,575 INFO L428 AbstractCegarLoop]: === Iteration 34 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:16:17,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:16:17,575 INFO L82 PathProgramCache]: Analyzing trace with hash 1166496317, now seen corresponding path program 7 times [2021-05-03 00:16:17,575 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:16:17,576 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [29237296] [2021-05-03 00:16:17,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:16:17,580 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (+ v_main_~c~0_340 1) v_~SIZE~0_93) (<= v_~last~0_98 v_main_~c~0_340)) InVars {~SIZE~0=v_~SIZE~0_93, main_~c~0=v_main_~c~0_340, ~last~0=v_~last~0_98} OutVars{~SIZE~0=v_~SIZE~0_93, main_~c~0=v_main_~c~0_340, ~last~0=v_~last~0_98} AuxVars[] AssignedVars[] [2021-05-03 00:16:17,583 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size [2021-05-03 00:16:17,596 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:17,597 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:17,605 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:16:17,607 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:16:17,623 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size 78 [2021-05-03 00:16:17,640 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:16:17,642 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_~last~0_99 v_main_~c~0_342) (< v_main_~c~0_342 v_~SIZE~0_94)) InVars {~SIZE~0=v_~SIZE~0_94, main_~c~0=v_main_~c~0_342, ~last~0=v_~last~0_99} OutVars{~SIZE~0=v_~SIZE~0_94, main_~c~0=v_main_~c~0_342, ~last~0=v_~last~0_99} AuxVars[] AssignedVars[] [2021-05-03 00:16:17,643 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:16:17,657 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:17,659 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:17,667 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:16:17,669 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:16:17,681 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:16:17,696 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:16:17,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:16:17,744 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:16:17,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:16:17,750 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:16:17,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:16:17,752 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:16:18,044 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:16:18,044 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [29237296] [2021-05-03 00:16:18,044 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [29237296] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:16:18,045 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:16:18,045 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-05-03 00:16:18,045 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774653998] [2021-05-03 00:16:18,045 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-05-03 00:16:18,045 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:16:18,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-05-03 00:16:18,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=188, Unknown=0, NotChecked=0, Total=240 [2021-05-03 00:16:18,046 INFO L87 Difference]: Start difference. First operand 185 states and 227 transitions. Second operand has 15 states, 15 states have (on average 2.466666666666667) internal successors, (37), 14 states have internal predecessors, (37), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:16:18,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:16:18,440 INFO L93 Difference]: Finished difference Result 395 states and 476 transitions. [2021-05-03 00:16:18,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-05-03 00:16:18,440 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.466666666666667) internal successors, (37), 14 states have internal predecessors, (37), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 43 [2021-05-03 00:16:18,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:16:18,442 INFO L225 Difference]: With dead ends: 395 [2021-05-03 00:16:18,442 INFO L226 Difference]: Without dead ends: 242 [2021-05-03 00:16:18,443 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 13 SyntacticMatches, 12 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 310.6ms TimeCoverageRelationStatistics Valid=56, Invalid=216, Unknown=0, NotChecked=0, Total=272 [2021-05-03 00:16:18,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2021-05-03 00:16:18,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 194. [2021-05-03 00:16:18,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 184 states have (on average 1.2228260869565217) internal successors, (225), 184 states have internal predecessors, (225), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:16:18,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 236 transitions. [2021-05-03 00:16:18,475 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 236 transitions. Word has length 43 [2021-05-03 00:16:18,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:16:18,475 INFO L480 AbstractCegarLoop]: Abstraction has 194 states and 236 transitions. [2021-05-03 00:16:18,475 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 2.466666666666667) internal successors, (37), 14 states have internal predecessors, (37), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:16:18,475 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 236 transitions. [2021-05-03 00:16:18,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2021-05-03 00:16:18,476 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:16:18,476 INFO L523 BasicCegarLoop]: trace histogram [7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:16:18,476 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable116 [2021-05-03 00:16:18,476 INFO L428 AbstractCegarLoop]: === Iteration 35 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:16:18,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:16:18,476 INFO L82 PathProgramCache]: Analyzing trace with hash -1742267585, now seen corresponding path program 16 times [2021-05-03 00:16:18,476 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:16:18,476 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [422491546] [2021-05-03 00:16:18,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:16:18,482 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_~last~0_100 v_main_~c~0_352) (< (+ v_main_~c~0_352 1) v_~SIZE~0_95)) InVars {~SIZE~0=v_~SIZE~0_95, main_~c~0=v_main_~c~0_352, ~last~0=v_~last~0_100} OutVars{~SIZE~0=v_~SIZE~0_95, main_~c~0=v_main_~c~0_352, ~last~0=v_~last~0_100} AuxVars[] AssignedVars[] [2021-05-03 00:16:18,484 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size [2021-05-03 00:16:18,484 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:18,486 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:18,496 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:16:18,499 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:16:18,526 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size 78 [2021-05-03 00:16:18,543 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (+ v_main_~c~0_354 1) v_~SIZE~0_96) (< v_main_~c~0_354 v_~last~0_101)) InVars {~SIZE~0=v_~SIZE~0_96, main_~c~0=v_main_~c~0_354, ~last~0=v_~last~0_101} OutVars{~SIZE~0=v_~SIZE~0_96, main_~c~0=v_main_~c~0_354, ~last~0=v_~last~0_101} AuxVars[] AssignedVars[] [2021-05-03 00:16:18,544 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:16:18,545 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:18,546 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:18,557 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:16:18,560 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:16:18,580 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:16:18,596 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:16:18,600 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_~last~0_102 v_main_~c~0_356) (< v_main_~c~0_356 v_~SIZE~0_97)) InVars {~SIZE~0=v_~SIZE~0_97, main_~c~0=v_main_~c~0_356, ~last~0=v_~last~0_102} OutVars{~SIZE~0=v_~SIZE~0_97, main_~c~0=v_main_~c~0_356, ~last~0=v_~last~0_102} AuxVars[] AssignedVars[] [2021-05-03 00:16:18,607 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:16:18,608 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:18,609 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:18,621 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:16:18,624 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:16:18,652 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:16:18,672 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_358 v_~last~0_103) (< v_main_~c~0_358 v_~SIZE~0_98)) InVars {~SIZE~0=v_~SIZE~0_98, main_~c~0=v_main_~c~0_358, ~last~0=v_~last~0_103} OutVars{~SIZE~0=v_~SIZE~0_98, main_~c~0=v_main_~c~0_358, ~last~0=v_~last~0_103} AuxVars[] AssignedVars[] [2021-05-03 00:16:18,674 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size [2021-05-03 00:16:18,674 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:18,676 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:18,687 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:16:18,690 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:16:18,710 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size 66 [2021-05-03 00:16:18,725 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:16:18,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:16:18,771 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:16:18,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:16:18,776 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:16:18,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:16:18,777 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:16:18,780 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:16:19,087 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:16:19,087 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [422491546] [2021-05-03 00:16:19,087 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [422491546] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:16:19,087 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:16:19,087 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2021-05-03 00:16:19,087 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509469544] [2021-05-03 00:16:19,088 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-05-03 00:16:19,088 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:16:19,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-05-03 00:16:19,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=219, Unknown=0, NotChecked=0, Total=272 [2021-05-03 00:16:19,088 INFO L87 Difference]: Start difference. First operand 194 states and 236 transitions. Second operand has 16 states, 16 states have (on average 2.3125) internal successors, (37), 15 states have internal predecessors, (37), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:16:19,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:16:19,533 INFO L93 Difference]: Finished difference Result 422 states and 507 transitions. [2021-05-03 00:16:19,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-05-03 00:16:19,533 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.3125) internal successors, (37), 15 states have internal predecessors, (37), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 43 [2021-05-03 00:16:19,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:16:19,535 INFO L225 Difference]: With dead ends: 422 [2021-05-03 00:16:19,535 INFO L226 Difference]: Without dead ends: 260 [2021-05-03 00:16:19,535 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 12 SyntacticMatches, 12 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 342.5ms TimeCoverageRelationStatistics Valid=65, Invalid=277, Unknown=0, NotChecked=0, Total=342 [2021-05-03 00:16:19,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2021-05-03 00:16:19,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 194. [2021-05-03 00:16:19,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 184 states have (on average 1.2228260869565217) internal successors, (225), 184 states have internal predecessors, (225), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:16:19,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 236 transitions. [2021-05-03 00:16:19,585 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 236 transitions. Word has length 43 [2021-05-03 00:16:19,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:16:19,585 INFO L480 AbstractCegarLoop]: Abstraction has 194 states and 236 transitions. [2021-05-03 00:16:19,585 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 16 states, 16 states have (on average 2.3125) internal successors, (37), 15 states have internal predecessors, (37), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:16:19,585 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 236 transitions. [2021-05-03 00:16:19,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2021-05-03 00:16:19,586 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:16:19,586 INFO L523 BasicCegarLoop]: trace histogram [7, 7, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:16:19,586 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable121 [2021-05-03 00:16:19,586 INFO L428 AbstractCegarLoop]: === Iteration 36 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:16:19,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:16:19,587 INFO L82 PathProgramCache]: Analyzing trace with hash -1680227971, now seen corresponding path program 17 times [2021-05-03 00:16:19,587 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:16:19,587 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [643298321] [2021-05-03 00:16:19,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:16:19,594 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_~last~0_104 v_main_~c~0_369) (< (+ v_main_~c~0_369 1) v_~SIZE~0_99)) InVars {~SIZE~0=v_~SIZE~0_99, main_~c~0=v_main_~c~0_369, ~last~0=v_~last~0_104} OutVars{~SIZE~0=v_~SIZE~0_99, main_~c~0=v_main_~c~0_369, ~last~0=v_~last~0_104} AuxVars[] AssignedVars[] [2021-05-03 00:16:19,596 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size [2021-05-03 00:16:19,612 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:19,614 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:19,624 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:16:19,627 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:16:19,642 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size 78 [2021-05-03 00:16:19,663 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (+ v_main_~c~0_371 1) v_~SIZE~0_100) (< v_main_~c~0_371 v_~last~0_105)) InVars {~SIZE~0=v_~SIZE~0_100, main_~c~0=v_main_~c~0_371, ~last~0=v_~last~0_105} OutVars{~SIZE~0=v_~SIZE~0_100, main_~c~0=v_main_~c~0_371, ~last~0=v_~last~0_105} AuxVars[] AssignedVars[] [2021-05-03 00:16:19,665 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:16:19,666 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:19,667 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:19,680 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:16:19,684 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:16:19,708 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:16:19,727 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:16:19,729 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_~last~0_106 v_main_~c~0_373) (< v_main_~c~0_373 v_~SIZE~0_101)) InVars {~SIZE~0=v_~SIZE~0_101, main_~c~0=v_main_~c~0_373, ~last~0=v_~last~0_106} OutVars{~SIZE~0=v_~SIZE~0_101, main_~c~0=v_main_~c~0_373, ~last~0=v_~last~0_106} AuxVars[] AssignedVars[] [2021-05-03 00:16:19,731 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:16:19,747 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:19,749 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:19,758 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:16:19,761 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:16:19,775 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:16:19,793 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_375 v_~SIZE~0_102) (< v_main_~c~0_375 v_~last~0_107)) InVars {~SIZE~0=v_~SIZE~0_102, main_~c~0=v_main_~c~0_375, ~last~0=v_~last~0_107} OutVars{~SIZE~0=v_~SIZE~0_102, main_~c~0=v_main_~c~0_375, ~last~0=v_~last~0_107} AuxVars[] AssignedVars[] [2021-05-03 00:16:19,794 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size [2021-05-03 00:16:19,804 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:19,805 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:19,815 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:16:19,818 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:16:19,828 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size 66 [2021-05-03 00:16:19,843 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:16:19,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:16:19,888 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:16:19,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:16:19,891 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:16:19,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:16:19,892 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:16:19,895 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:16:20,222 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:16:20,222 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [643298321] [2021-05-03 00:16:20,222 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [643298321] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:16:20,222 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:16:20,222 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2021-05-03 00:16:20,222 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1018238830] [2021-05-03 00:16:20,223 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states [2021-05-03 00:16:20,223 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:16:20,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-05-03 00:16:20,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=245, Unknown=0, NotChecked=0, Total=306 [2021-05-03 00:16:20,223 INFO L87 Difference]: Start difference. First operand 194 states and 236 transitions. Second operand has 17 states, 17 states have (on average 2.176470588235294) internal successors, (37), 16 states have internal predecessors, (37), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:16:20,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:16:20,635 INFO L93 Difference]: Finished difference Result 413 states and 498 transitions. [2021-05-03 00:16:20,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-05-03 00:16:20,635 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.176470588235294) internal successors, (37), 16 states have internal predecessors, (37), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 43 [2021-05-03 00:16:20,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:16:20,636 INFO L225 Difference]: With dead ends: 413 [2021-05-03 00:16:20,636 INFO L226 Difference]: Without dead ends: 251 [2021-05-03 00:16:20,637 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 12 SyntacticMatches, 11 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 161 ImplicationChecksByTransitivity, 361.0ms TimeCoverageRelationStatistics Valid=75, Invalid=305, Unknown=0, NotChecked=0, Total=380 [2021-05-03 00:16:20,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2021-05-03 00:16:20,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 194. [2021-05-03 00:16:20,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 184 states have (on average 1.2228260869565217) internal successors, (225), 184 states have internal predecessors, (225), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:16:20,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 236 transitions. [2021-05-03 00:16:20,681 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 236 transitions. Word has length 43 [2021-05-03 00:16:20,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:16:20,681 INFO L480 AbstractCegarLoop]: Abstraction has 194 states and 236 transitions. [2021-05-03 00:16:20,681 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 17 states, 17 states have (on average 2.176470588235294) internal successors, (37), 16 states have internal predecessors, (37), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:16:20,682 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 236 transitions. [2021-05-03 00:16:20,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2021-05-03 00:16:20,682 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:16:20,682 INFO L523 BasicCegarLoop]: trace histogram [7, 7, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:16:20,682 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable126 [2021-05-03 00:16:20,682 INFO L428 AbstractCegarLoop]: === Iteration 37 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:16:20,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:16:20,683 INFO L82 PathProgramCache]: Analyzing trace with hash 809300991, now seen corresponding path program 18 times [2021-05-03 00:16:20,683 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:16:20,683 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1981819776] [2021-05-03 00:16:20,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:16:20,688 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (+ v_main_~c~0_386 1) v_~SIZE~0_103) (<= v_~last~0_108 v_main_~c~0_386)) InVars {~SIZE~0=v_~SIZE~0_103, main_~c~0=v_main_~c~0_386, ~last~0=v_~last~0_108} OutVars{~SIZE~0=v_~SIZE~0_103, main_~c~0=v_main_~c~0_386, ~last~0=v_~last~0_108} AuxVars[] AssignedVars[] [2021-05-03 00:16:20,690 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size [2021-05-03 00:16:20,704 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:20,706 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:20,714 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:16:20,716 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:16:20,729 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size 78 [2021-05-03 00:16:20,746 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_388 v_~last~0_109) (< (+ v_main_~c~0_388 1) v_~SIZE~0_104)) InVars {~SIZE~0=v_~SIZE~0_104, main_~c~0=v_main_~c~0_388, ~last~0=v_~last~0_109} OutVars{~SIZE~0=v_~SIZE~0_104, main_~c~0=v_main_~c~0_388, ~last~0=v_~last~0_109} AuxVars[] AssignedVars[] [2021-05-03 00:16:20,748 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:16:20,759 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:20,760 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:20,771 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:16:20,774 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:16:20,786 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:16:20,803 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:16:20,805 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_390 v_~SIZE~0_105) (<= v_~last~0_110 v_main_~c~0_390)) InVars {~SIZE~0=v_~SIZE~0_105, main_~c~0=v_main_~c~0_390, ~last~0=v_~last~0_110} OutVars{~SIZE~0=v_~SIZE~0_105, main_~c~0=v_main_~c~0_390, ~last~0=v_~last~0_110} AuxVars[] AssignedVars[] [2021-05-03 00:16:20,806 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:16:20,820 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:20,821 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:20,830 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:16:20,832 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:16:20,845 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:16:20,862 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_392 v_~last~0_111) (< v_main_~c~0_392 v_~SIZE~0_106)) InVars {~SIZE~0=v_~SIZE~0_106, main_~c~0=v_main_~c~0_392, ~last~0=v_~last~0_111} OutVars{~SIZE~0=v_~SIZE~0_106, main_~c~0=v_main_~c~0_392, ~last~0=v_~last~0_111} AuxVars[] AssignedVars[] [2021-05-03 00:16:20,863 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size [2021-05-03 00:16:20,864 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:20,865 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:20,876 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:16:20,880 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:16:20,901 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size 66 [2021-05-03 00:16:20,918 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:16:20,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:16:21,032 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:16:21,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:16:21,038 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:16:21,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:16:21,040 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:16:21,042 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:16:21,471 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:16:21,471 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1981819776] [2021-05-03 00:16:21,471 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1981819776] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:16:21,471 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:16:21,471 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2021-05-03 00:16:21,471 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [203524998] [2021-05-03 00:16:21,472 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states [2021-05-03 00:16:21,472 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:16:21,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2021-05-03 00:16:21,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=440, Unknown=0, NotChecked=0, Total=552 [2021-05-03 00:16:21,472 INFO L87 Difference]: Start difference. First operand 194 states and 236 transitions. Second operand has 22 states, 22 states have (on average 1.6818181818181819) internal successors, (37), 20 states have internal predecessors, (37), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:16:21,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:16:21,886 INFO L93 Difference]: Finished difference Result 399 states and 482 transitions. [2021-05-03 00:16:21,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-05-03 00:16:21,886 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 1.6818181818181819) internal successors, (37), 20 states have internal predecessors, (37), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 43 [2021-05-03 00:16:21,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:16:21,887 INFO L225 Difference]: With dead ends: 399 [2021-05-03 00:16:21,887 INFO L226 Difference]: Without dead ends: 237 [2021-05-03 00:16:21,888 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 6 SyntacticMatches, 10 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 261 ImplicationChecksByTransitivity, 579.0ms TimeCoverageRelationStatistics Valid=146, Invalid=610, Unknown=0, NotChecked=0, Total=756 [2021-05-03 00:16:21,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2021-05-03 00:16:21,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 194. [2021-05-03 00:16:21,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 184 states have (on average 1.2228260869565217) internal successors, (225), 184 states have internal predecessors, (225), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:16:21,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 236 transitions. [2021-05-03 00:16:21,928 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 236 transitions. Word has length 43 [2021-05-03 00:16:21,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:16:21,929 INFO L480 AbstractCegarLoop]: Abstraction has 194 states and 236 transitions. [2021-05-03 00:16:21,929 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 22 states, 22 states have (on average 1.6818181818181819) internal successors, (37), 20 states have internal predecessors, (37), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:16:21,929 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 236 transitions. [2021-05-03 00:16:21,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2021-05-03 00:16:21,929 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:16:21,929 INFO L523 BasicCegarLoop]: trace histogram [7, 7, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:16:21,930 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable131 [2021-05-03 00:16:21,930 INFO L428 AbstractCegarLoop]: === Iteration 38 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:16:21,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:16:21,930 INFO L82 PathProgramCache]: Analyzing trace with hash -8347459, now seen corresponding path program 19 times [2021-05-03 00:16:21,930 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:16:21,930 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1836963437] [2021-05-03 00:16:21,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:16:21,936 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (+ v_main_~c~0_403 1) v_~SIZE~0_107) (<= v_~last~0_112 v_main_~c~0_403)) InVars {~SIZE~0=v_~SIZE~0_107, main_~c~0=v_main_~c~0_403, ~last~0=v_~last~0_112} OutVars{~SIZE~0=v_~SIZE~0_107, main_~c~0=v_main_~c~0_403, ~last~0=v_~last~0_112} AuxVars[] AssignedVars[] [2021-05-03 00:16:21,937 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size [2021-05-03 00:16:21,938 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:21,959 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:21,968 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:16:21,970 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:16:21,992 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size 78 [2021-05-03 00:16:22,009 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (+ v_main_~c~0_405 1) v_~SIZE~0_108) (< v_main_~c~0_405 v_~last~0_113)) InVars {~SIZE~0=v_~SIZE~0_108, main_~c~0=v_main_~c~0_405, ~last~0=v_~last~0_113} OutVars{~SIZE~0=v_~SIZE~0_108, main_~c~0=v_main_~c~0_405, ~last~0=v_~last~0_113} AuxVars[] AssignedVars[] [2021-05-03 00:16:22,010 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:16:22,011 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:22,012 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:22,024 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:16:22,028 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:16:22,050 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:16:22,067 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:16:22,069 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_407 v_~SIZE~0_109) (<= v_~last~0_114 v_main_~c~0_407)) InVars {~SIZE~0=v_~SIZE~0_109, main_~c~0=v_main_~c~0_407, ~last~0=v_~last~0_114} OutVars{~SIZE~0=v_~SIZE~0_109, main_~c~0=v_main_~c~0_407, ~last~0=v_~last~0_114} AuxVars[] AssignedVars[] [2021-05-03 00:16:22,071 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:16:22,072 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:22,073 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:22,082 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:16:22,084 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:16:22,106 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:16:22,122 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_409 v_~last~0_115) (< v_main_~c~0_409 v_~SIZE~0_110)) InVars {~SIZE~0=v_~SIZE~0_110, main_~c~0=v_main_~c~0_409, ~last~0=v_~last~0_115} OutVars{~SIZE~0=v_~SIZE~0_110, main_~c~0=v_main_~c~0_409, ~last~0=v_~last~0_115} AuxVars[] AssignedVars[] [2021-05-03 00:16:22,123 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size [2021-05-03 00:16:22,124 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:22,125 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:22,135 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:16:22,139 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:16:22,161 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size 66 [2021-05-03 00:16:22,177 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:16:22,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:16:22,299 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:16:22,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:16:22,303 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:16:22,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:16:22,304 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:16:22,306 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:16:22,778 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:16:22,779 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1836963437] [2021-05-03 00:16:22,779 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1836963437] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:16:22,779 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:16:22,779 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2021-05-03 00:16:22,779 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2104923076] [2021-05-03 00:16:22,779 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states [2021-05-03 00:16:22,779 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:16:22,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-05-03 00:16:22,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=479, Unknown=0, NotChecked=0, Total=600 [2021-05-03 00:16:22,780 INFO L87 Difference]: Start difference. First operand 194 states and 236 transitions. Second operand has 23 states, 23 states have (on average 1.608695652173913) internal successors, (37), 21 states have internal predecessors, (37), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:16:23,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:16:23,299 INFO L93 Difference]: Finished difference Result 397 states and 480 transitions. [2021-05-03 00:16:23,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-05-03 00:16:23,299 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 1.608695652173913) internal successors, (37), 21 states have internal predecessors, (37), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 43 [2021-05-03 00:16:23,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:16:23,300 INFO L225 Difference]: With dead ends: 397 [2021-05-03 00:16:23,300 INFO L226 Difference]: Without dead ends: 235 [2021-05-03 00:16:23,301 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 6 SyntacticMatches, 9 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 272 ImplicationChecksByTransitivity, 633.5ms TimeCoverageRelationStatistics Valid=159, Invalid=653, Unknown=0, NotChecked=0, Total=812 [2021-05-03 00:16:23,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2021-05-03 00:16:23,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 194. [2021-05-03 00:16:23,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 184 states have (on average 1.2228260869565217) internal successors, (225), 184 states have internal predecessors, (225), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:16:23,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 236 transitions. [2021-05-03 00:16:23,347 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 236 transitions. Word has length 43 [2021-05-03 00:16:23,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:16:23,347 INFO L480 AbstractCegarLoop]: Abstraction has 194 states and 236 transitions. [2021-05-03 00:16:23,347 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 23 states, 23 states have (on average 1.608695652173913) internal successors, (37), 21 states have internal predecessors, (37), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:16:23,347 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 236 transitions. [2021-05-03 00:16:23,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2021-05-03 00:16:23,347 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:16:23,348 INFO L523 BasicCegarLoop]: trace histogram [7, 7, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:16:23,348 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable136 [2021-05-03 00:16:23,348 INFO L428 AbstractCegarLoop]: === Iteration 39 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:16:23,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:16:23,348 INFO L82 PathProgramCache]: Analyzing trace with hash -1596695361, now seen corresponding path program 20 times [2021-05-03 00:16:23,348 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:16:23,348 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [99934122] [2021-05-03 00:16:23,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:16:23,355 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_~last~0_116 v_main_~c~0_420) (< (+ v_main_~c~0_420 1) v_~SIZE~0_111)) InVars {~SIZE~0=v_~SIZE~0_111, main_~c~0=v_main_~c~0_420, ~last~0=v_~last~0_116} OutVars{~SIZE~0=v_~SIZE~0_111, main_~c~0=v_main_~c~0_420, ~last~0=v_~last~0_116} AuxVars[] AssignedVars[] [2021-05-03 00:16:23,356 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size [2021-05-03 00:16:23,357 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:23,359 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:23,368 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:16:23,370 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:16:23,391 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size 78 [2021-05-03 00:16:23,408 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_422 v_~last~0_117) (< (+ v_main_~c~0_422 1) v_~SIZE~0_112)) InVars {~SIZE~0=v_~SIZE~0_112, main_~c~0=v_main_~c~0_422, ~last~0=v_~last~0_117} OutVars{~SIZE~0=v_~SIZE~0_112, main_~c~0=v_main_~c~0_422, ~last~0=v_~last~0_117} AuxVars[] AssignedVars[] [2021-05-03 00:16:23,410 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:16:23,420 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:23,422 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:23,432 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:16:23,449 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:16:23,461 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:16:23,476 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:16:23,478 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_424 v_~SIZE~0_113) (<= v_~last~0_118 v_main_~c~0_424)) InVars {~SIZE~0=v_~SIZE~0_113, main_~c~0=v_main_~c~0_424, ~last~0=v_~last~0_118} OutVars{~SIZE~0=v_~SIZE~0_113, main_~c~0=v_main_~c~0_424, ~last~0=v_~last~0_118} AuxVars[] AssignedVars[] [2021-05-03 00:16:23,480 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:16:23,480 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:23,482 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:23,489 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:16:23,491 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:16:23,512 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:16:23,527 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_426 v_~SIZE~0_114) (< v_main_~c~0_426 v_~last~0_119)) InVars {~SIZE~0=v_~SIZE~0_114, main_~c~0=v_main_~c~0_426, ~last~0=v_~last~0_119} OutVars{~SIZE~0=v_~SIZE~0_114, main_~c~0=v_main_~c~0_426, ~last~0=v_~last~0_119} AuxVars[] AssignedVars[] [2021-05-03 00:16:23,529 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size [2021-05-03 00:16:23,539 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:23,540 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:23,550 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:16:23,554 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:16:23,564 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size 66 [2021-05-03 00:16:23,580 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:16:23,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:16:23,636 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:16:23,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:16:23,640 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:16:23,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:16:23,641 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:16:23,643 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:16:24,003 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:16:24,003 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [99934122] [2021-05-03 00:16:24,003 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [99934122] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:16:24,003 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:16:24,004 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2021-05-03 00:16:24,004 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863190329] [2021-05-03 00:16:24,004 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states [2021-05-03 00:16:24,004 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:16:24,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-05-03 00:16:24,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=370, Unknown=0, NotChecked=0, Total=462 [2021-05-03 00:16:24,004 INFO L87 Difference]: Start difference. First operand 194 states and 236 transitions. Second operand has 20 states, 20 states have (on average 1.85) internal successors, (37), 19 states have internal predecessors, (37), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:16:24,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:16:24,378 INFO L93 Difference]: Finished difference Result 394 states and 475 transitions. [2021-05-03 00:16:24,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-05-03 00:16:24,379 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.85) internal successors, (37), 19 states have internal predecessors, (37), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 43 [2021-05-03 00:16:24,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:16:24,380 INFO L225 Difference]: With dead ends: 394 [2021-05-03 00:16:24,380 INFO L226 Difference]: Without dead ends: 232 [2021-05-03 00:16:24,381 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 12 SyntacticMatches, 8 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 214 ImplicationChecksByTransitivity, 398.2ms TimeCoverageRelationStatistics Valid=111, Invalid=441, Unknown=0, NotChecked=0, Total=552 [2021-05-03 00:16:24,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2021-05-03 00:16:24,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 194. [2021-05-03 00:16:24,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 184 states have (on average 1.2228260869565217) internal successors, (225), 184 states have internal predecessors, (225), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:16:24,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 236 transitions. [2021-05-03 00:16:24,416 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 236 transitions. Word has length 43 [2021-05-03 00:16:24,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:16:24,416 INFO L480 AbstractCegarLoop]: Abstraction has 194 states and 236 transitions. [2021-05-03 00:16:24,416 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 20 states, 20 states have (on average 1.85) internal successors, (37), 19 states have internal predecessors, (37), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:16:24,416 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 236 transitions. [2021-05-03 00:16:24,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2021-05-03 00:16:24,417 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:16:24,417 INFO L523 BasicCegarLoop]: trace histogram [7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:16:24,417 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable141 [2021-05-03 00:16:24,417 INFO L428 AbstractCegarLoop]: === Iteration 40 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:16:24,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:16:24,417 INFO L82 PathProgramCache]: Analyzing trace with hash 1687154685, now seen corresponding path program 21 times [2021-05-03 00:16:24,417 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:16:24,417 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [98398500] [2021-05-03 00:16:24,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:16:24,422 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (+ v_main_~c~0_437 1) v_~SIZE~0_115) (< v_main_~c~0_437 v_~last~0_120)) InVars {~SIZE~0=v_~SIZE~0_115, main_~c~0=v_main_~c~0_437, ~last~0=v_~last~0_120} OutVars{~SIZE~0=v_~SIZE~0_115, main_~c~0=v_main_~c~0_437, ~last~0=v_~last~0_120} AuxVars[] AssignedVars[] [2021-05-03 00:16:24,423 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:16:24,424 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:24,425 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:24,436 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:16:24,440 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:16:24,459 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:16:24,475 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:16:24,477 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_439 v_~SIZE~0_116) (<= v_~last~0_121 v_main_~c~0_439)) InVars {~SIZE~0=v_~SIZE~0_116, main_~c~0=v_main_~c~0_439, ~last~0=v_~last~0_121} OutVars{~SIZE~0=v_~SIZE~0_116, main_~c~0=v_main_~c~0_439, ~last~0=v_~last~0_121} AuxVars[] AssignedVars[] [2021-05-03 00:16:24,478 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:16:24,491 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:24,492 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:24,501 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:16:24,503 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:16:24,515 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:16:24,531 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_441 v_~last~0_122) (< v_main_~c~0_441 v_~SIZE~0_117)) InVars {~SIZE~0=v_~SIZE~0_117, main_~c~0=v_main_~c~0_441, ~last~0=v_~last~0_122} OutVars{~SIZE~0=v_~SIZE~0_117, main_~c~0=v_main_~c~0_441, ~last~0=v_~last~0_122} AuxVars[] AssignedVars[] [2021-05-03 00:16:24,532 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size [2021-05-03 00:16:24,542 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:24,544 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:24,554 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:16:24,558 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:16:24,569 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size 66 [2021-05-03 00:16:24,584 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:16:24,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:16:24,631 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:16:24,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:16:24,636 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:16:24,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:16:24,637 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:16:24,640 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:16:25,032 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:16:25,032 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [98398500] [2021-05-03 00:16:25,032 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [98398500] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:16:25,032 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:16:25,032 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2021-05-03 00:16:25,032 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912777500] [2021-05-03 00:16:25,033 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states [2021-05-03 00:16:25,033 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:16:25,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-05-03 00:16:25,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=369, Unknown=0, NotChecked=0, Total=462 [2021-05-03 00:16:25,033 INFO L87 Difference]: Start difference. First operand 194 states and 236 transitions. Second operand has 21 states, 21 states have (on average 1.7619047619047619) internal successors, (37), 20 states have internal predecessors, (37), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:16:25,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:16:25,401 INFO L93 Difference]: Finished difference Result 389 states and 480 transitions. [2021-05-03 00:16:25,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-05-03 00:16:25,401 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 1.7619047619047619) internal successors, (37), 20 states have internal predecessors, (37), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 43 [2021-05-03 00:16:25,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:16:25,402 INFO L225 Difference]: With dead ends: 389 [2021-05-03 00:16:25,402 INFO L226 Difference]: Without dead ends: 227 [2021-05-03 00:16:25,403 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 12 SyntacticMatches, 7 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 187 ImplicationChecksByTransitivity, 421.5ms TimeCoverageRelationStatistics Valid=115, Invalid=437, Unknown=0, NotChecked=0, Total=552 [2021-05-03 00:16:25,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2021-05-03 00:16:25,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 198. [2021-05-03 00:16:25,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 188 states have (on average 1.2287234042553192) internal successors, (231), 188 states have internal predecessors, (231), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:16:25,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 242 transitions. [2021-05-03 00:16:25,439 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 242 transitions. Word has length 43 [2021-05-03 00:16:25,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:16:25,439 INFO L480 AbstractCegarLoop]: Abstraction has 198 states and 242 transitions. [2021-05-03 00:16:25,439 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 21 states, 21 states have (on average 1.7619047619047619) internal successors, (37), 20 states have internal predecessors, (37), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:16:25,439 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 242 transitions. [2021-05-03 00:16:25,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2021-05-03 00:16:25,439 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:16:25,440 INFO L523 BasicCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:16:25,440 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable145 [2021-05-03 00:16:25,440 INFO L428 AbstractCegarLoop]: === Iteration 41 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:16:25,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:16:25,440 INFO L82 PathProgramCache]: Analyzing trace with hash 1521614335, now seen corresponding path program 7 times [2021-05-03 00:16:25,440 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:16:25,440 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1877959117] [2021-05-03 00:16:25,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:16:25,444 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (+ v_main_~c~0_452 1) v_~SIZE~0_118) (< v_main_~c~0_452 v_~last~0_123)) InVars {~SIZE~0=v_~SIZE~0_118, main_~c~0=v_main_~c~0_452, ~last~0=v_~last~0_123} OutVars{~SIZE~0=v_~SIZE~0_118, main_~c~0=v_main_~c~0_452, ~last~0=v_~last~0_123} AuxVars[] AssignedVars[] [2021-05-03 00:16:25,445 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:16:25,455 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:25,457 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:25,466 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:16:25,470 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:16:25,481 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:16:25,495 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:16:25,497 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_454 v_~last~0_124) (< v_main_~c~0_454 v_~SIZE~0_119)) InVars {~SIZE~0=v_~SIZE~0_119, main_~c~0=v_main_~c~0_454, ~last~0=v_~last~0_124} OutVars{~SIZE~0=v_~SIZE~0_119, main_~c~0=v_main_~c~0_454, ~last~0=v_~last~0_124} AuxVars[] AssignedVars[] [2021-05-03 00:16:25,498 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size [2021-05-03 00:16:25,499 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:25,500 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:25,510 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:16:25,514 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:16:25,533 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size 66 [2021-05-03 00:16:25,549 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:16:25,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:16:25,629 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:16:25,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:16:25,633 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:16:25,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:16:25,635 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:16:26,175 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:16:26,176 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1877959117] [2021-05-03 00:16:26,176 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1877959117] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:16:26,176 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:16:26,176 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2021-05-03 00:16:26,176 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1225513148] [2021-05-03 00:16:26,176 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states [2021-05-03 00:16:26,176 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:16:26,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-05-03 00:16:26,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=585, Unknown=0, NotChecked=0, Total=702 [2021-05-03 00:16:26,177 INFO L87 Difference]: Start difference. First operand 198 states and 242 transitions. Second operand has 25 states, 25 states have (on average 1.48) internal successors, (37), 23 states have internal predecessors, (37), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:16:26,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:16:26,925 INFO L93 Difference]: Finished difference Result 414 states and 505 transitions. [2021-05-03 00:16:26,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2021-05-03 00:16:26,926 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 1.48) internal successors, (37), 23 states have internal predecessors, (37), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 43 [2021-05-03 00:16:26,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:16:26,927 INFO L225 Difference]: With dead ends: 414 [2021-05-03 00:16:26,927 INFO L226 Difference]: Without dead ends: 243 [2021-05-03 00:16:26,928 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 6 SyntacticMatches, 6 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 312 ImplicationChecksByTransitivity, 872.3ms TimeCoverageRelationStatistics Valid=183, Invalid=1077, Unknown=0, NotChecked=0, Total=1260 [2021-05-03 00:16:26,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2021-05-03 00:16:26,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 206. [2021-05-03 00:16:26,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 196 states have (on average 1.2295918367346939) internal successors, (241), 196 states have internal predecessors, (241), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:16:26,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 252 transitions. [2021-05-03 00:16:26,965 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 252 transitions. Word has length 43 [2021-05-03 00:16:26,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:16:26,966 INFO L480 AbstractCegarLoop]: Abstraction has 206 states and 252 transitions. [2021-05-03 00:16:26,966 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 25 states, 25 states have (on average 1.48) internal successors, (37), 23 states have internal predecessors, (37), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:16:26,966 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 252 transitions. [2021-05-03 00:16:26,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2021-05-03 00:16:26,966 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:16:26,966 INFO L523 BasicCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:16:26,966 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable148 [2021-05-03 00:16:26,966 INFO L428 AbstractCegarLoop]: === Iteration 42 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:16:26,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:16:26,967 INFO L82 PathProgramCache]: Analyzing trace with hash 1294562718, now seen corresponding path program 8 times [2021-05-03 00:16:26,967 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:16:26,967 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1108609967] [2021-05-03 00:16:26,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:16:26,971 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (+ v_main_~c~0_464 1) v_~SIZE~0_120) (<= v_~last~0_125 v_main_~c~0_464)) InVars {~SIZE~0=v_~SIZE~0_120, main_~c~0=v_main_~c~0_464, ~last~0=v_~last~0_125} OutVars{~SIZE~0=v_~SIZE~0_120, main_~c~0=v_main_~c~0_464, ~last~0=v_~last~0_125} AuxVars[] AssignedVars[] [2021-05-03 00:16:26,973 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size [2021-05-03 00:16:26,988 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:26,989 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:26,997 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:16:26,999 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:16:27,011 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size 78 [2021-05-03 00:16:27,026 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:16:27,028 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_466 v_~SIZE~0_121) (<= v_~last~0_126 v_main_~c~0_466)) InVars {~SIZE~0=v_~SIZE~0_121, main_~c~0=v_main_~c~0_466, ~last~0=v_~last~0_126} OutVars{~SIZE~0=v_~SIZE~0_121, main_~c~0=v_main_~c~0_466, ~last~0=v_~last~0_126} AuxVars[] AssignedVars[] [2021-05-03 00:16:27,029 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:16:27,030 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:27,031 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:27,039 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:16:27,041 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:16:27,064 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:16:27,080 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:16:27,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:16:27,127 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:16:27,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:16:27,131 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:16:27,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:16:27,132 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:16:27,494 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:16:27,494 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1108609967] [2021-05-03 00:16:27,494 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1108609967] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:16:27,494 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:16:27,494 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2021-05-03 00:16:27,495 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1219319863] [2021-05-03 00:16:27,495 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-05-03 00:16:27,495 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:16:27,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-05-03 00:16:27,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=216, Unknown=0, NotChecked=0, Total=272 [2021-05-03 00:16:27,496 INFO L87 Difference]: Start difference. First operand 206 states and 252 transitions. Second operand has 16 states, 16 states have (on average 2.5) internal successors, (40), 15 states have internal predecessors, (40), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:16:27,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:16:27,975 INFO L93 Difference]: Finished difference Result 452 states and 544 transitions. [2021-05-03 00:16:27,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-05-03 00:16:27,976 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.5) internal successors, (40), 15 states have internal predecessors, (40), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 46 [2021-05-03 00:16:27,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:16:27,977 INFO L225 Difference]: With dead ends: 452 [2021-05-03 00:16:27,977 INFO L226 Difference]: Without dead ends: 281 [2021-05-03 00:16:27,977 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 12 SyntacticMatches, 15 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 385.0ms TimeCoverageRelationStatistics Valid=66, Invalid=276, Unknown=0, NotChecked=0, Total=342 [2021-05-03 00:16:27,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2021-05-03 00:16:28,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 215. [2021-05-03 00:16:28,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 205 states have (on average 1.2195121951219512) internal successors, (250), 205 states have internal predecessors, (250), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:16:28,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 261 transitions. [2021-05-03 00:16:28,021 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 261 transitions. Word has length 46 [2021-05-03 00:16:28,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:16:28,021 INFO L480 AbstractCegarLoop]: Abstraction has 215 states and 261 transitions. [2021-05-03 00:16:28,021 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 16 states, 16 states have (on average 2.5) internal successors, (40), 15 states have internal predecessors, (40), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:16:28,022 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 261 transitions. [2021-05-03 00:16:28,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2021-05-03 00:16:28,022 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:16:28,022 INFO L523 BasicCegarLoop]: trace histogram [8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:16:28,022 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable151 [2021-05-03 00:16:28,022 INFO L428 AbstractCegarLoop]: === Iteration 43 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:16:28,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:16:28,022 INFO L82 PathProgramCache]: Analyzing trace with hash 1569322332, now seen corresponding path program 22 times [2021-05-03 00:16:28,022 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:16:28,023 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1583636983] [2021-05-03 00:16:28,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:16:28,029 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (+ v_main_~c~0_477 1) v_~SIZE~0_122) (<= v_~last~0_127 v_main_~c~0_477)) InVars {~SIZE~0=v_~SIZE~0_122, main_~c~0=v_main_~c~0_477, ~last~0=v_~last~0_127} OutVars{~SIZE~0=v_~SIZE~0_122, main_~c~0=v_main_~c~0_477, ~last~0=v_~last~0_127} AuxVars[] AssignedVars[] [2021-05-03 00:16:28,030 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size [2021-05-03 00:16:28,044 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:28,046 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:28,054 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:16:28,056 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:16:28,071 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size 78 [2021-05-03 00:16:28,089 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (+ v_main_~c~0_479 1) v_~SIZE~0_123) (< v_main_~c~0_479 v_~last~0_128)) InVars {~SIZE~0=v_~SIZE~0_123, main_~c~0=v_main_~c~0_479, ~last~0=v_~last~0_128} OutVars{~SIZE~0=v_~SIZE~0_123, main_~c~0=v_main_~c~0_479, ~last~0=v_~last~0_128} AuxVars[] AssignedVars[] [2021-05-03 00:16:28,090 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:16:28,100 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:28,101 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:28,111 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:16:28,114 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:16:28,125 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:16:28,140 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:16:28,142 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_~last~0_129 v_main_~c~0_481) (< v_main_~c~0_481 v_~SIZE~0_124)) InVars {~SIZE~0=v_~SIZE~0_124, main_~c~0=v_main_~c~0_481, ~last~0=v_~last~0_129} OutVars{~SIZE~0=v_~SIZE~0_124, main_~c~0=v_main_~c~0_481, ~last~0=v_~last~0_129} AuxVars[] AssignedVars[] [2021-05-03 00:16:28,144 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:16:28,156 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:28,158 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:28,165 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:16:28,167 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:16:28,179 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:16:28,194 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_483 v_~SIZE~0_125) (< v_main_~c~0_483 v_~last~0_130)) InVars {~SIZE~0=v_~SIZE~0_125, main_~c~0=v_main_~c~0_483, ~last~0=v_~last~0_130} OutVars{~SIZE~0=v_~SIZE~0_125, main_~c~0=v_main_~c~0_483, ~last~0=v_~last~0_130} AuxVars[] AssignedVars[] [2021-05-03 00:16:28,196 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size [2021-05-03 00:16:28,196 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:28,197 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:28,207 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:16:28,211 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:16:28,230 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size 66 [2021-05-03 00:16:28,246 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:16:28,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:16:28,301 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:16:28,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:16:28,325 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:16:28,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:16:28,328 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:16:28,332 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:16:28,747 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:16:28,747 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1583636983] [2021-05-03 00:16:28,747 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1583636983] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:16:28,747 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:16:28,747 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2021-05-03 00:16:28,747 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [740331478] [2021-05-03 00:16:28,747 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states [2021-05-03 00:16:28,748 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:16:28,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-05-03 00:16:28,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=279, Unknown=0, NotChecked=0, Total=342 [2021-05-03 00:16:28,748 INFO L87 Difference]: Start difference. First operand 215 states and 261 transitions. Second operand has 17 states, 17 states have (on average 2.3529411764705883) internal successors, (40), 16 states have internal predecessors, (40), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:16:29,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:16:29,199 INFO L93 Difference]: Finished difference Result 461 states and 549 transitions. [2021-05-03 00:16:29,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-05-03 00:16:29,199 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.3529411764705883) internal successors, (40), 16 states have internal predecessors, (40), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 46 [2021-05-03 00:16:29,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:16:29,200 INFO L225 Difference]: With dead ends: 461 [2021-05-03 00:16:29,200 INFO L226 Difference]: Without dead ends: 281 [2021-05-03 00:16:29,201 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 12 SyntacticMatches, 14 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 177 ImplicationChecksByTransitivity, 422.7ms TimeCoverageRelationStatistics Valid=74, Invalid=346, Unknown=0, NotChecked=0, Total=420 [2021-05-03 00:16:29,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2021-05-03 00:16:29,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 215. [2021-05-03 00:16:29,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 205 states have (on average 1.2195121951219512) internal successors, (250), 205 states have internal predecessors, (250), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:16:29,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 261 transitions. [2021-05-03 00:16:29,277 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 261 transitions. Word has length 46 [2021-05-03 00:16:29,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:16:29,277 INFO L480 AbstractCegarLoop]: Abstraction has 215 states and 261 transitions. [2021-05-03 00:16:29,277 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 17 states, 17 states have (on average 2.3529411764705883) internal successors, (40), 16 states have internal predecessors, (40), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:16:29,277 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 261 transitions. [2021-05-03 00:16:29,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2021-05-03 00:16:29,277 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:16:29,278 INFO L523 BasicCegarLoop]: trace histogram [8, 8, 6, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:16:29,278 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable156 [2021-05-03 00:16:29,278 INFO L428 AbstractCegarLoop]: === Iteration 44 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:16:29,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:16:29,278 INFO L82 PathProgramCache]: Analyzing trace with hash -1339441570, now seen corresponding path program 23 times [2021-05-03 00:16:29,278 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:16:29,278 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [186362326] [2021-05-03 00:16:29,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:16:29,284 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (+ v_main_~c~0_495 1) v_~SIZE~0_126) (<= v_~last~0_131 v_main_~c~0_495)) InVars {~SIZE~0=v_~SIZE~0_126, main_~c~0=v_main_~c~0_495, ~last~0=v_~last~0_131} OutVars{~SIZE~0=v_~SIZE~0_126, main_~c~0=v_main_~c~0_495, ~last~0=v_~last~0_131} AuxVars[] AssignedVars[] [2021-05-03 00:16:29,286 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size [2021-05-03 00:16:29,287 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:29,288 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:29,297 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:16:29,300 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:16:29,325 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size 78 [2021-05-03 00:16:29,342 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (+ v_main_~c~0_497 1) v_~SIZE~0_127) (< v_main_~c~0_497 v_~last~0_132)) InVars {~SIZE~0=v_~SIZE~0_127, main_~c~0=v_main_~c~0_497, ~last~0=v_~last~0_132} OutVars{~SIZE~0=v_~SIZE~0_127, main_~c~0=v_main_~c~0_497, ~last~0=v_~last~0_132} AuxVars[] AssignedVars[] [2021-05-03 00:16:29,343 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:16:29,354 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:29,355 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:29,365 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:16:29,368 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:16:29,380 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:16:29,395 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:16:29,397 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_~last~0_133 v_main_~c~0_499) (< v_main_~c~0_499 v_~SIZE~0_128)) InVars {~SIZE~0=v_~SIZE~0_128, main_~c~0=v_main_~c~0_499, ~last~0=v_~last~0_133} OutVars{~SIZE~0=v_~SIZE~0_128, main_~c~0=v_main_~c~0_499, ~last~0=v_~last~0_133} AuxVars[] AssignedVars[] [2021-05-03 00:16:29,398 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:16:29,399 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:29,400 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:29,408 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:16:29,410 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:16:29,435 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:16:29,452 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_501 v_~last~0_134) (< v_main_~c~0_501 v_~SIZE~0_129)) InVars {~SIZE~0=v_~SIZE~0_129, main_~c~0=v_main_~c~0_501, ~last~0=v_~last~0_134} OutVars{~SIZE~0=v_~SIZE~0_129, main_~c~0=v_main_~c~0_501, ~last~0=v_~last~0_134} AuxVars[] AssignedVars[] [2021-05-03 00:16:29,456 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size [2021-05-03 00:16:29,457 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:29,458 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:29,469 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:16:29,472 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:16:29,492 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size 66 [2021-05-03 00:16:29,508 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:16:29,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:16:29,557 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:16:29,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:16:29,561 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:16:29,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:16:29,563 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:16:29,565 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:16:29,953 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:16:29,953 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [186362326] [2021-05-03 00:16:29,953 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [186362326] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:16:29,953 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:16:29,953 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2021-05-03 00:16:29,953 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270230805] [2021-05-03 00:16:29,954 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-05-03 00:16:29,954 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:16:29,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-05-03 00:16:29,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=278, Unknown=0, NotChecked=0, Total=342 [2021-05-03 00:16:29,954 INFO L87 Difference]: Start difference. First operand 215 states and 261 transitions. Second operand has 18 states, 18 states have (on average 2.2222222222222223) internal successors, (40), 17 states have internal predecessors, (40), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:16:30,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:16:30,398 INFO L93 Difference]: Finished difference Result 461 states and 553 transitions. [2021-05-03 00:16:30,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-05-03 00:16:30,399 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.2222222222222223) internal successors, (40), 17 states have internal predecessors, (40), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 46 [2021-05-03 00:16:30,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:16:30,400 INFO L225 Difference]: With dead ends: 461 [2021-05-03 00:16:30,400 INFO L226 Difference]: Without dead ends: 281 [2021-05-03 00:16:30,401 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 12 SyntacticMatches, 13 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 185 ImplicationChecksByTransitivity, 419.4ms TimeCoverageRelationStatistics Valid=78, Invalid=342, Unknown=0, NotChecked=0, Total=420 [2021-05-03 00:16:30,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2021-05-03 00:16:30,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 215. [2021-05-03 00:16:30,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 205 states have (on average 1.2195121951219512) internal successors, (250), 205 states have internal predecessors, (250), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:16:30,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 261 transitions. [2021-05-03 00:16:30,450 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 261 transitions. Word has length 46 [2021-05-03 00:16:30,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:16:30,450 INFO L480 AbstractCegarLoop]: Abstraction has 215 states and 261 transitions. [2021-05-03 00:16:30,450 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 2.2222222222222223) internal successors, (40), 17 states have internal predecessors, (40), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:16:30,450 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 261 transitions. [2021-05-03 00:16:30,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2021-05-03 00:16:30,450 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:16:30,450 INFO L523 BasicCegarLoop]: trace histogram [8, 8, 5, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:16:30,451 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable161 [2021-05-03 00:16:30,451 INFO L428 AbstractCegarLoop]: === Iteration 45 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:16:30,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:16:30,451 INFO L82 PathProgramCache]: Analyzing trace with hash -1277401956, now seen corresponding path program 24 times [2021-05-03 00:16:30,451 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:16:30,451 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [826354478] [2021-05-03 00:16:30,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:16:30,457 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_~last~0_135 v_main_~c~0_513) (< (+ v_main_~c~0_513 1) v_~SIZE~0_130)) InVars {~SIZE~0=v_~SIZE~0_130, main_~c~0=v_main_~c~0_513, ~last~0=v_~last~0_135} OutVars{~SIZE~0=v_~SIZE~0_130, main_~c~0=v_main_~c~0_513, ~last~0=v_~last~0_135} AuxVars[] AssignedVars[] [2021-05-03 00:16:30,458 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size [2021-05-03 00:16:30,471 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:30,473 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:30,480 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:16:30,482 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:16:30,494 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size 78 [2021-05-03 00:16:30,510 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (+ v_main_~c~0_515 1) v_~SIZE~0_131) (< v_main_~c~0_515 v_~last~0_136)) InVars {~SIZE~0=v_~SIZE~0_131, main_~c~0=v_main_~c~0_515, ~last~0=v_~last~0_136} OutVars{~SIZE~0=v_~SIZE~0_131, main_~c~0=v_main_~c~0_515, ~last~0=v_~last~0_136} AuxVars[] AssignedVars[] [2021-05-03 00:16:30,511 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:16:30,521 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:30,523 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:30,532 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:16:30,536 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:16:30,547 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:16:30,562 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:16:30,564 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_517 v_~SIZE~0_132) (<= v_~last~0_137 v_main_~c~0_517)) InVars {~SIZE~0=v_~SIZE~0_132, main_~c~0=v_main_~c~0_517, ~last~0=v_~last~0_137} OutVars{~SIZE~0=v_~SIZE~0_132, main_~c~0=v_main_~c~0_517, ~last~0=v_~last~0_137} AuxVars[] AssignedVars[] [2021-05-03 00:16:30,565 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:16:30,597 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:30,599 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:30,608 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:16:30,610 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:16:30,623 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:16:30,641 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_519 v_~last~0_138) (< v_main_~c~0_519 v_~SIZE~0_133)) InVars {~SIZE~0=v_~SIZE~0_133, main_~c~0=v_main_~c~0_519, ~last~0=v_~last~0_138} OutVars{~SIZE~0=v_~SIZE~0_133, main_~c~0=v_main_~c~0_519, ~last~0=v_~last~0_138} AuxVars[] AssignedVars[] [2021-05-03 00:16:30,643 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size [2021-05-03 00:16:30,644 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:30,645 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:30,656 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:16:30,660 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:16:30,681 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size 66 [2021-05-03 00:16:30,698 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:16:30,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:16:30,757 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:16:30,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:16:30,761 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:16:30,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:16:30,762 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:16:30,766 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:16:31,165 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:16:31,165 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [826354478] [2021-05-03 00:16:31,165 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [826354478] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:16:31,165 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:16:31,166 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2021-05-03 00:16:31,166 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282364390] [2021-05-03 00:16:31,166 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-05-03 00:16:31,166 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:16:31,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-05-03 00:16:31,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=341, Unknown=0, NotChecked=0, Total=420 [2021-05-03 00:16:31,167 INFO L87 Difference]: Start difference. First operand 215 states and 261 transitions. Second operand has 19 states, 19 states have (on average 2.1052631578947367) internal successors, (40), 18 states have internal predecessors, (40), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:16:31,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:16:31,598 INFO L93 Difference]: Finished difference Result 460 states and 551 transitions. [2021-05-03 00:16:31,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-05-03 00:16:31,599 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.1052631578947367) internal successors, (40), 18 states have internal predecessors, (40), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 46 [2021-05-03 00:16:31,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:16:31,600 INFO L225 Difference]: With dead ends: 460 [2021-05-03 00:16:31,600 INFO L226 Difference]: Without dead ends: 280 [2021-05-03 00:16:31,601 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 12 SyntacticMatches, 12 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 236 ImplicationChecksByTransitivity, 440.8ms TimeCoverageRelationStatistics Valid=94, Invalid=412, Unknown=0, NotChecked=0, Total=506 [2021-05-03 00:16:31,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2021-05-03 00:16:31,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 215. [2021-05-03 00:16:31,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 205 states have (on average 1.2195121951219512) internal successors, (250), 205 states have internal predecessors, (250), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:16:31,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 261 transitions. [2021-05-03 00:16:31,651 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 261 transitions. Word has length 46 [2021-05-03 00:16:31,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:16:31,651 INFO L480 AbstractCegarLoop]: Abstraction has 215 states and 261 transitions. [2021-05-03 00:16:31,651 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 2.1052631578947367) internal successors, (40), 18 states have internal predecessors, (40), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:16:31,651 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 261 transitions. [2021-05-03 00:16:31,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2021-05-03 00:16:31,652 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:16:31,652 INFO L523 BasicCegarLoop]: trace histogram [8, 8, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:16:31,652 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable166 [2021-05-03 00:16:31,652 INFO L428 AbstractCegarLoop]: === Iteration 46 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:16:31,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:16:31,652 INFO L82 PathProgramCache]: Analyzing trace with hash 1212127006, now seen corresponding path program 25 times [2021-05-03 00:16:31,652 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:16:31,652 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1711991203] [2021-05-03 00:16:31,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:16:31,658 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_~last~0_139 v_main_~c~0_531) (< (+ v_main_~c~0_531 1) v_~SIZE~0_134)) InVars {~SIZE~0=v_~SIZE~0_134, main_~c~0=v_main_~c~0_531, ~last~0=v_~last~0_139} OutVars{~SIZE~0=v_~SIZE~0_134, main_~c~0=v_main_~c~0_531, ~last~0=v_~last~0_139} AuxVars[] AssignedVars[] [2021-05-03 00:16:31,659 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size [2021-05-03 00:16:31,660 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:31,661 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:31,668 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:16:31,670 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:16:31,696 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size 78 [2021-05-03 00:16:31,715 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_533 v_~last~0_140) (< (+ v_main_~c~0_533 1) v_~SIZE~0_135)) InVars {~SIZE~0=v_~SIZE~0_135, main_~c~0=v_main_~c~0_533, ~last~0=v_~last~0_140} OutVars{~SIZE~0=v_~SIZE~0_135, main_~c~0=v_main_~c~0_533, ~last~0=v_~last~0_140} AuxVars[] AssignedVars[] [2021-05-03 00:16:31,716 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:16:31,717 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:31,718 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:31,729 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:16:31,732 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:16:31,751 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:16:31,766 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:16:31,768 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_535 v_~SIZE~0_136) (<= v_~last~0_141 v_main_~c~0_535)) InVars {~SIZE~0=v_~SIZE~0_136, main_~c~0=v_main_~c~0_535, ~last~0=v_~last~0_141} OutVars{~SIZE~0=v_~SIZE~0_136, main_~c~0=v_main_~c~0_535, ~last~0=v_~last~0_141} AuxVars[] AssignedVars[] [2021-05-03 00:16:31,770 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:16:31,783 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:31,784 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:31,792 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:16:31,794 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:16:31,807 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:16:31,824 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_537 v_~SIZE~0_137) (< v_main_~c~0_537 v_~last~0_142)) InVars {~SIZE~0=v_~SIZE~0_137, main_~c~0=v_main_~c~0_537, ~last~0=v_~last~0_142} OutVars{~SIZE~0=v_~SIZE~0_137, main_~c~0=v_main_~c~0_537, ~last~0=v_~last~0_142} AuxVars[] AssignedVars[] [2021-05-03 00:16:31,825 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size [2021-05-03 00:16:31,835 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:31,837 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:31,847 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:16:31,851 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:16:31,862 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size 66 [2021-05-03 00:16:31,880 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:16:31,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:16:31,940 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:16:31,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:16:31,944 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:16:31,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:16:31,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-03 00:16:31,947 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:16:32,416 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:16:32,417 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1711991203] [2021-05-03 00:16:32,417 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1711991203] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:16:32,417 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:16:32,417 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2021-05-03 00:16:32,417 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [332916122] [2021-05-03 00:16:32,417 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states [2021-05-03 00:16:32,417 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:16:32,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-05-03 00:16:32,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=375, Unknown=0, NotChecked=0, Total=462 [2021-05-03 00:16:32,418 INFO L87 Difference]: Start difference. First operand 215 states and 261 transitions. Second operand has 20 states, 20 states have (on average 2.0) internal successors, (40), 19 states have internal predecessors, (40), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:16:32,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:16:32,834 INFO L93 Difference]: Finished difference Result 451 states and 542 transitions. [2021-05-03 00:16:32,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-05-03 00:16:32,835 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.0) internal successors, (40), 19 states have internal predecessors, (40), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 46 [2021-05-03 00:16:32,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:16:32,855 INFO L225 Difference]: With dead ends: 451 [2021-05-03 00:16:32,856 INFO L226 Difference]: Without dead ends: 271 [2021-05-03 00:16:32,856 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 12 SyntacticMatches, 11 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 252 ImplicationChecksByTransitivity, 509.4ms TimeCoverageRelationStatistics Valid=104, Invalid=448, Unknown=0, NotChecked=0, Total=552 [2021-05-03 00:16:32,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2021-05-03 00:16:32,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 215. [2021-05-03 00:16:32,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 205 states have (on average 1.2195121951219512) internal successors, (250), 205 states have internal predecessors, (250), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:16:32,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 261 transitions. [2021-05-03 00:16:32,913 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 261 transitions. Word has length 46 [2021-05-03 00:16:32,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:16:32,913 INFO L480 AbstractCegarLoop]: Abstraction has 215 states and 261 transitions. [2021-05-03 00:16:32,913 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 20 states, 20 states have (on average 2.0) internal successors, (40), 19 states have internal predecessors, (40), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:16:32,914 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 261 transitions. [2021-05-03 00:16:32,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2021-05-03 00:16:32,914 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:16:32,914 INFO L523 BasicCegarLoop]: trace histogram [8, 8, 5, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:16:32,914 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable171 [2021-05-03 00:16:32,914 INFO L428 AbstractCegarLoop]: === Iteration 47 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:16:32,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:16:32,914 INFO L82 PathProgramCache]: Analyzing trace with hash 394478556, now seen corresponding path program 26 times [2021-05-03 00:16:32,914 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:16:32,915 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [692449830] [2021-05-03 00:16:32,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:16:32,921 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_~last~0_143 v_main_~c~0_549) (< (+ v_main_~c~0_549 1) v_~SIZE~0_138)) InVars {~SIZE~0=v_~SIZE~0_138, main_~c~0=v_main_~c~0_549, ~last~0=v_~last~0_143} OutVars{~SIZE~0=v_~SIZE~0_138, main_~c~0=v_main_~c~0_549, ~last~0=v_~last~0_143} AuxVars[] AssignedVars[] [2021-05-03 00:16:32,922 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size [2021-05-03 00:16:32,923 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:32,925 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:32,937 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:16:32,939 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:16:32,963 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size 78 [2021-05-03 00:16:32,987 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (+ v_main_~c~0_551 1) v_~SIZE~0_139) (< v_main_~c~0_551 v_~last~0_144)) InVars {~SIZE~0=v_~SIZE~0_139, main_~c~0=v_main_~c~0_551, ~last~0=v_~last~0_144} OutVars{~SIZE~0=v_~SIZE~0_139, main_~c~0=v_main_~c~0_551, ~last~0=v_~last~0_144} AuxVars[] AssignedVars[] [2021-05-03 00:16:32,994 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:16:33,008 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:33,013 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:33,029 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:16:33,033 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:16:33,049 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:16:33,068 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:16:33,071 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_553 v_~SIZE~0_140) (<= v_~last~0_145 v_main_~c~0_553)) InVars {~SIZE~0=v_~SIZE~0_140, main_~c~0=v_main_~c~0_553, ~last~0=v_~last~0_145} OutVars{~SIZE~0=v_~SIZE~0_140, main_~c~0=v_main_~c~0_553, ~last~0=v_~last~0_145} AuxVars[] AssignedVars[] [2021-05-03 00:16:33,073 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:16:33,074 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:33,076 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:33,089 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:16:33,092 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:16:33,115 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:16:33,132 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_555 v_~last~0_146) (< v_main_~c~0_555 v_~SIZE~0_141)) InVars {~SIZE~0=v_~SIZE~0_141, main_~c~0=v_main_~c~0_555, ~last~0=v_~last~0_146} OutVars{~SIZE~0=v_~SIZE~0_141, main_~c~0=v_main_~c~0_555, ~last~0=v_~last~0_146} AuxVars[] AssignedVars[] [2021-05-03 00:16:33,134 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size [2021-05-03 00:16:33,145 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:33,147 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:33,157 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:16:33,161 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:16:33,173 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size 66 [2021-05-03 00:16:33,189 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:16:33,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:16:33,305 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:16:33,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:16:33,310 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:16:33,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:16:33,312 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:16:33,314 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:16:33,710 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:16:33,710 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [692449830] [2021-05-03 00:16:33,710 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [692449830] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:16:33,710 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:16:33,710 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2021-05-03 00:16:33,710 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [810999038] [2021-05-03 00:16:33,711 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states [2021-05-03 00:16:33,711 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:16:33,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-05-03 00:16:33,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=411, Unknown=0, NotChecked=0, Total=506 [2021-05-03 00:16:33,712 INFO L87 Difference]: Start difference. First operand 215 states and 261 transitions. Second operand has 21 states, 21 states have (on average 1.9047619047619047) internal successors, (40), 20 states have internal predecessors, (40), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:16:34,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:16:34,199 INFO L93 Difference]: Finished difference Result 437 states and 525 transitions. [2021-05-03 00:16:34,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-05-03 00:16:34,200 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 1.9047619047619047) internal successors, (40), 20 states have internal predecessors, (40), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 46 [2021-05-03 00:16:34,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:16:34,201 INFO L225 Difference]: With dead ends: 437 [2021-05-03 00:16:34,201 INFO L226 Difference]: Without dead ends: 257 [2021-05-03 00:16:34,201 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 12 SyntacticMatches, 10 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 259 ImplicationChecksByTransitivity, 446.6ms TimeCoverageRelationStatistics Valid=114, Invalid=486, Unknown=0, NotChecked=0, Total=600 [2021-05-03 00:16:34,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2021-05-03 00:16:34,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 215. [2021-05-03 00:16:34,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 205 states have (on average 1.2195121951219512) internal successors, (250), 205 states have internal predecessors, (250), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:16:34,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 261 transitions. [2021-05-03 00:16:34,252 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 261 transitions. Word has length 46 [2021-05-03 00:16:34,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:16:34,252 INFO L480 AbstractCegarLoop]: Abstraction has 215 states and 261 transitions. [2021-05-03 00:16:34,252 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 21 states, 21 states have (on average 1.9047619047619047) internal successors, (40), 20 states have internal predecessors, (40), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:16:34,253 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 261 transitions. [2021-05-03 00:16:34,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2021-05-03 00:16:34,253 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:16:34,253 INFO L523 BasicCegarLoop]: trace histogram [8, 8, 6, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:16:34,253 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable176 [2021-05-03 00:16:34,253 INFO L428 AbstractCegarLoop]: === Iteration 48 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:16:34,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:16:34,253 INFO L82 PathProgramCache]: Analyzing trace with hash -1193869346, now seen corresponding path program 27 times [2021-05-03 00:16:34,254 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:16:34,254 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1189338703] [2021-05-03 00:16:34,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:16:34,259 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (+ v_main_~c~0_567 1) v_~SIZE~0_142) (<= v_~last~0_147 v_main_~c~0_567)) InVars {~SIZE~0=v_~SIZE~0_142, main_~c~0=v_main_~c~0_567, ~last~0=v_~last~0_147} OutVars{~SIZE~0=v_~SIZE~0_142, main_~c~0=v_main_~c~0_567, ~last~0=v_~last~0_147} AuxVars[] AssignedVars[] [2021-05-03 00:16:34,260 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size [2021-05-03 00:16:34,273 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:34,275 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:34,283 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:16:34,285 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:16:34,297 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size 78 [2021-05-03 00:16:34,317 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (+ v_main_~c~0_569 1) v_~SIZE~0_143) (< v_main_~c~0_569 v_~last~0_148)) InVars {~SIZE~0=v_~SIZE~0_143, main_~c~0=v_main_~c~0_569, ~last~0=v_~last~0_148} OutVars{~SIZE~0=v_~SIZE~0_143, main_~c~0=v_main_~c~0_569, ~last~0=v_~last~0_148} AuxVars[] AssignedVars[] [2021-05-03 00:16:34,318 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:16:34,319 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:34,320 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:34,330 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:16:34,334 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:16:34,355 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:16:34,371 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:16:34,373 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_~last~0_149 v_main_~c~0_571) (< v_main_~c~0_571 v_~SIZE~0_144)) InVars {~SIZE~0=v_~SIZE~0_144, main_~c~0=v_main_~c~0_571, ~last~0=v_~last~0_149} OutVars{~SIZE~0=v_~SIZE~0_144, main_~c~0=v_main_~c~0_571, ~last~0=v_~last~0_149} AuxVars[] AssignedVars[] [2021-05-03 00:16:34,374 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:16:34,387 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:34,389 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:34,397 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:16:34,399 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:16:34,411 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:16:34,428 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_573 v_~last~0_150) (< v_main_~c~0_573 v_~SIZE~0_145)) InVars {~SIZE~0=v_~SIZE~0_145, main_~c~0=v_main_~c~0_573, ~last~0=v_~last~0_150} OutVars{~SIZE~0=v_~SIZE~0_145, main_~c~0=v_main_~c~0_573, ~last~0=v_~last~0_150} AuxVars[] AssignedVars[] [2021-05-03 00:16:34,430 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size [2021-05-03 00:16:34,442 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:34,444 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:34,454 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:16:34,458 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:16:34,469 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size 66 [2021-05-03 00:16:34,484 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:16:34,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:16:34,535 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:16:34,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:16:34,539 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:16:34,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:16:34,540 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:16:34,543 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:16:34,980 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:16:34,980 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1189338703] [2021-05-03 00:16:34,980 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1189338703] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:16:34,980 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:16:34,981 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2021-05-03 00:16:34,981 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [942446481] [2021-05-03 00:16:34,981 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states [2021-05-03 00:16:34,981 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:16:34,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2021-05-03 00:16:34,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=410, Unknown=0, NotChecked=0, Total=506 [2021-05-03 00:16:34,982 INFO L87 Difference]: Start difference. First operand 215 states and 261 transitions. Second operand has 22 states, 22 states have (on average 1.8181818181818181) internal successors, (40), 21 states have internal predecessors, (40), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:16:35,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:16:35,382 INFO L93 Difference]: Finished difference Result 428 states and 520 transitions. [2021-05-03 00:16:35,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-05-03 00:16:35,382 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 1.8181818181818181) internal successors, (40), 21 states have internal predecessors, (40), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 46 [2021-05-03 00:16:35,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:16:35,383 INFO L225 Difference]: With dead ends: 428 [2021-05-03 00:16:35,383 INFO L226 Difference]: Without dead ends: 248 [2021-05-03 00:16:35,384 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 12 SyntacticMatches, 9 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 235 ImplicationChecksByTransitivity, 468.8ms TimeCoverageRelationStatistics Valid=118, Invalid=482, Unknown=0, NotChecked=0, Total=600 [2021-05-03 00:16:35,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2021-05-03 00:16:35,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 215. [2021-05-03 00:16:35,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 205 states have (on average 1.2195121951219512) internal successors, (250), 205 states have internal predecessors, (250), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:16:35,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 261 transitions. [2021-05-03 00:16:35,446 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 261 transitions. Word has length 46 [2021-05-03 00:16:35,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:16:35,446 INFO L480 AbstractCegarLoop]: Abstraction has 215 states and 261 transitions. [2021-05-03 00:16:35,446 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 22 states, 22 states have (on average 1.8181818181818181) internal successors, (40), 21 states have internal predecessors, (40), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:16:35,446 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 261 transitions. [2021-05-03 00:16:35,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2021-05-03 00:16:35,447 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:16:35,447 INFO L523 BasicCegarLoop]: trace histogram [8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:16:35,447 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable181 [2021-05-03 00:16:35,447 INFO L428 AbstractCegarLoop]: === Iteration 49 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:16:35,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:16:35,447 INFO L82 PathProgramCache]: Analyzing trace with hash 2089980700, now seen corresponding path program 28 times [2021-05-03 00:16:35,447 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:16:35,447 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [407104212] [2021-05-03 00:16:35,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:16:35,452 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_585 v_~last~0_151) (< (+ v_main_~c~0_585 1) v_~SIZE~0_146)) InVars {~SIZE~0=v_~SIZE~0_146, main_~c~0=v_main_~c~0_585, ~last~0=v_~last~0_151} OutVars{~SIZE~0=v_~SIZE~0_146, main_~c~0=v_main_~c~0_585, ~last~0=v_~last~0_151} AuxVars[] AssignedVars[] [2021-05-03 00:16:35,454 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:16:35,464 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:35,465 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:35,476 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:16:35,480 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:16:35,491 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:16:35,506 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:16:35,508 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_~last~0_152 v_main_~c~0_587) (< v_main_~c~0_587 v_~SIZE~0_147)) InVars {~SIZE~0=v_~SIZE~0_147, main_~c~0=v_main_~c~0_587, ~last~0=v_~last~0_152} OutVars{~SIZE~0=v_~SIZE~0_147, main_~c~0=v_main_~c~0_587, ~last~0=v_~last~0_152} AuxVars[] AssignedVars[] [2021-05-03 00:16:35,509 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:16:35,510 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:35,511 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:35,519 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:16:35,521 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:16:35,544 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:16:35,561 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_589 v_~last~0_153) (< v_main_~c~0_589 v_~SIZE~0_148)) InVars {~SIZE~0=v_~SIZE~0_148, main_~c~0=v_main_~c~0_589, ~last~0=v_~last~0_153} OutVars{~SIZE~0=v_~SIZE~0_148, main_~c~0=v_main_~c~0_589, ~last~0=v_~last~0_153} AuxVars[] AssignedVars[] [2021-05-03 00:16:35,563 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size [2021-05-03 00:16:35,574 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:35,575 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:35,586 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:16:35,589 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:16:35,603 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size 66 [2021-05-03 00:16:35,621 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:16:35,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:16:35,683 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:16:35,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:16:35,686 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:16:35,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:16:35,688 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:16:35,705 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:16:36,120 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:16:36,120 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [407104212] [2021-05-03 00:16:36,120 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [407104212] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:16:36,120 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:16:36,120 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2021-05-03 00:16:36,120 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [493588814] [2021-05-03 00:16:36,121 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states [2021-05-03 00:16:36,121 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:16:36,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-05-03 00:16:36,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=489, Unknown=0, NotChecked=0, Total=600 [2021-05-03 00:16:36,121 INFO L87 Difference]: Start difference. First operand 215 states and 261 transitions. Second operand has 23 states, 23 states have (on average 1.7391304347826086) internal successors, (40), 22 states have internal predecessors, (40), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:16:36,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:16:36,658 INFO L93 Difference]: Finished difference Result 437 states and 531 transitions. [2021-05-03 00:16:36,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-05-03 00:16:36,659 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 1.7391304347826086) internal successors, (40), 22 states have internal predecessors, (40), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 46 [2021-05-03 00:16:36,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:16:36,660 INFO L225 Difference]: With dead ends: 437 [2021-05-03 00:16:36,660 INFO L226 Difference]: Without dead ends: 257 [2021-05-03 00:16:36,661 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 12 SyntacticMatches, 8 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 246 ImplicationChecksByTransitivity, 459.7ms TimeCoverageRelationStatistics Valid=134, Invalid=568, Unknown=0, NotChecked=0, Total=702 [2021-05-03 00:16:36,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2021-05-03 00:16:36,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 201. [2021-05-03 00:16:36,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 191 states have (on average 1.2146596858638743) internal successors, (232), 192 states have internal predecessors, (232), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:16:36,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 243 transitions. [2021-05-03 00:16:36,719 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 243 transitions. Word has length 46 [2021-05-03 00:16:36,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:16:36,720 INFO L480 AbstractCegarLoop]: Abstraction has 201 states and 243 transitions. [2021-05-03 00:16:36,720 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 23 states, 23 states have (on average 1.7391304347826086) internal successors, (40), 22 states have internal predecessors, (40), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:16:36,720 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 243 transitions. [2021-05-03 00:16:36,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2021-05-03 00:16:36,720 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:16:36,720 INFO L523 BasicCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:16:36,720 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable185 [2021-05-03 00:16:36,720 INFO L428 AbstractCegarLoop]: === Iteration 50 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:16:36,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:16:36,721 INFO L82 PathProgramCache]: Analyzing trace with hash 1924440350, now seen corresponding path program 8 times [2021-05-03 00:16:36,721 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:16:36,721 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [172298026] [2021-05-03 00:16:36,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:16:36,724 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_601 v_~last~0_154) (< (+ v_main_~c~0_601 1) v_~SIZE~0_149)) InVars {~SIZE~0=v_~SIZE~0_149, main_~c~0=v_main_~c~0_601, ~last~0=v_~last~0_154} OutVars{~SIZE~0=v_~SIZE~0_149, main_~c~0=v_main_~c~0_601, ~last~0=v_~last~0_154} AuxVars[] AssignedVars[] [2021-05-03 00:16:36,726 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:16:36,736 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:36,737 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:36,746 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:16:36,750 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:16:36,762 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:16:36,779 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:16:36,780 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_603 v_~SIZE~0_150) (< v_main_~c~0_603 v_~last~0_155)) InVars {~SIZE~0=v_~SIZE~0_150, main_~c~0=v_main_~c~0_603, ~last~0=v_~last~0_155} OutVars{~SIZE~0=v_~SIZE~0_150, main_~c~0=v_main_~c~0_603, ~last~0=v_~last~0_155} AuxVars[] AssignedVars[] [2021-05-03 00:16:36,782 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size [2021-05-03 00:16:36,783 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:36,784 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:36,795 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:16:36,799 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:16:36,819 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size 66 [2021-05-03 00:16:36,837 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:16:36,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:16:36,936 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:16:36,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:16:36,941 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:16:36,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:16:36,943 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:16:37,593 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:16:37,594 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [172298026] [2021-05-03 00:16:37,594 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [172298026] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:16:37,594 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:16:37,594 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2021-05-03 00:16:37,594 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665608914] [2021-05-03 00:16:37,594 INFO L460 AbstractCegarLoop]: Interpolant automaton has 27 states [2021-05-03 00:16:37,594 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:16:37,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2021-05-03 00:16:37,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=684, Unknown=0, NotChecked=0, Total=812 [2021-05-03 00:16:37,595 INFO L87 Difference]: Start difference. First operand 201 states and 243 transitions. Second operand has 27 states, 27 states have (on average 1.4814814814814814) internal successors, (40), 25 states have internal predecessors, (40), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:16:38,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:16:38,400 INFO L93 Difference]: Finished difference Result 457 states and 555 transitions. [2021-05-03 00:16:38,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2021-05-03 00:16:38,400 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 1.4814814814814814) internal successors, (40), 25 states have internal predecessors, (40), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 46 [2021-05-03 00:16:38,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:16:38,403 INFO L225 Difference]: With dead ends: 457 [2021-05-03 00:16:38,403 INFO L226 Difference]: Without dead ends: 268 [2021-05-03 00:16:38,404 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 6 SyntacticMatches, 7 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 376 ImplicationChecksByTransitivity, 993.7ms TimeCoverageRelationStatistics Valid=202, Invalid=1280, Unknown=0, NotChecked=0, Total=1482 [2021-05-03 00:16:38,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2021-05-03 00:16:38,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 227. [2021-05-03 00:16:38,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 227 states, 217 states have (on average 1.2258064516129032) internal successors, (266), 217 states have internal predecessors, (266), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:16:38,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 277 transitions. [2021-05-03 00:16:38,460 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 277 transitions. Word has length 46 [2021-05-03 00:16:38,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:16:38,460 INFO L480 AbstractCegarLoop]: Abstraction has 227 states and 277 transitions. [2021-05-03 00:16:38,460 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 27 states, 27 states have (on average 1.4814814814814814) internal successors, (40), 25 states have internal predecessors, (40), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:16:38,460 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 277 transitions. [2021-05-03 00:16:38,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2021-05-03 00:16:38,460 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:16:38,460 INFO L523 BasicCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:16:38,461 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable188 [2021-05-03 00:16:38,461 INFO L428 AbstractCegarLoop]: === Iteration 51 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:16:38,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:16:38,461 INFO L82 PathProgramCache]: Analyzing trace with hash -1705211235, now seen corresponding path program 9 times [2021-05-03 00:16:38,461 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:16:38,461 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1404435213] [2021-05-03 00:16:38,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:16:38,465 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (+ v_main_~c~0_614 1) v_~SIZE~0_151) (<= v_~last~0_156 v_main_~c~0_614)) InVars {~SIZE~0=v_~SIZE~0_151, main_~c~0=v_main_~c~0_614, ~last~0=v_~last~0_156} OutVars{~SIZE~0=v_~SIZE~0_151, main_~c~0=v_main_~c~0_614, ~last~0=v_~last~0_156} AuxVars[] AssignedVars[] [2021-05-03 00:16:38,466 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size [2021-05-03 00:16:38,467 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:38,468 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:38,476 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:16:38,477 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:16:38,503 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size 78 [2021-05-03 00:16:38,519 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:16:38,521 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_616 v_~SIZE~0_152) (<= v_~last~0_157 v_main_~c~0_616)) InVars {~SIZE~0=v_~SIZE~0_152, main_~c~0=v_main_~c~0_616, ~last~0=v_~last~0_157} OutVars{~SIZE~0=v_~SIZE~0_152, main_~c~0=v_main_~c~0_616, ~last~0=v_~last~0_157} AuxVars[] AssignedVars[] [2021-05-03 00:16:38,522 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:16:38,523 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:38,524 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:38,533 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:16:38,535 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:16:38,556 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:16:38,575 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:16:38,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:16:38,655 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:16:38,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:16:38,660 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:16:38,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:16:38,662 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:16:39,099 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:16:39,100 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1404435213] [2021-05-03 00:16:39,100 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1404435213] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:16:39,100 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:16:39,100 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2021-05-03 00:16:39,100 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1091220516] [2021-05-03 00:16:39,100 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states [2021-05-03 00:16:39,100 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:16:39,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-05-03 00:16:39,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=246, Unknown=0, NotChecked=0, Total=306 [2021-05-03 00:16:39,101 INFO L87 Difference]: Start difference. First operand 227 states and 277 transitions. Second operand has 17 states, 17 states have (on average 2.5294117647058822) internal successors, (43), 16 states have internal predecessors, (43), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:16:39,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:16:39,589 INFO L93 Difference]: Finished difference Result 491 states and 586 transitions. [2021-05-03 00:16:39,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-05-03 00:16:39,590 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.5294117647058822) internal successors, (43), 16 states have internal predecessors, (43), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 49 [2021-05-03 00:16:39,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:16:39,590 INFO L225 Difference]: With dead ends: 491 [2021-05-03 00:16:39,591 INFO L226 Difference]: Without dead ends: 302 [2021-05-03 00:16:39,591 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 14 SyntacticMatches, 16 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 452.7ms TimeCoverageRelationStatistics Valid=64, Invalid=278, Unknown=0, NotChecked=0, Total=342 [2021-05-03 00:16:39,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2021-05-03 00:16:39,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 236. [2021-05-03 00:16:39,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 236 states, 226 states have (on average 1.2168141592920354) internal successors, (275), 226 states have internal predecessors, (275), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:16:39,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 286 transitions. [2021-05-03 00:16:39,655 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 286 transitions. Word has length 49 [2021-05-03 00:16:39,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:16:39,655 INFO L480 AbstractCegarLoop]: Abstraction has 236 states and 286 transitions. [2021-05-03 00:16:39,655 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 17 states, 17 states have (on average 2.5294117647058822) internal successors, (43), 16 states have internal predecessors, (43), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:16:39,655 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 286 transitions. [2021-05-03 00:16:39,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2021-05-03 00:16:39,656 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:16:39,656 INFO L523 BasicCegarLoop]: trace histogram [9, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:16:39,656 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable191 [2021-05-03 00:16:39,656 INFO L428 AbstractCegarLoop]: === Iteration 52 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:16:39,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:16:39,656 INFO L82 PathProgramCache]: Analyzing trace with hash 1745750559, now seen corresponding path program 29 times [2021-05-03 00:16:39,656 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:16:39,656 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1719216892] [2021-05-03 00:16:39,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:16:39,662 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_~last~0_158 v_main_~c~0_628) (< (+ v_main_~c~0_628 1) v_~SIZE~0_153)) InVars {~SIZE~0=v_~SIZE~0_153, main_~c~0=v_main_~c~0_628, ~last~0=v_~last~0_158} OutVars{~SIZE~0=v_~SIZE~0_153, main_~c~0=v_main_~c~0_628, ~last~0=v_~last~0_158} AuxVars[] AssignedVars[] [2021-05-03 00:16:39,664 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size [2021-05-03 00:16:39,678 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:39,680 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:39,689 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:16:39,691 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:16:39,705 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size 78 [2021-05-03 00:16:39,724 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (+ v_main_~c~0_630 1) v_~SIZE~0_154) (< v_main_~c~0_630 v_~last~0_159)) InVars {~SIZE~0=v_~SIZE~0_154, main_~c~0=v_main_~c~0_630, ~last~0=v_~last~0_159} OutVars{~SIZE~0=v_~SIZE~0_154, main_~c~0=v_main_~c~0_630, ~last~0=v_~last~0_159} AuxVars[] AssignedVars[] [2021-05-03 00:16:39,726 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:16:39,736 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:39,738 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:39,749 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:16:39,754 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:16:39,766 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:16:39,783 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:16:39,784 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_~last~0_160 v_main_~c~0_632) (< v_main_~c~0_632 v_~SIZE~0_155)) InVars {~SIZE~0=v_~SIZE~0_155, main_~c~0=v_main_~c~0_632, ~last~0=v_~last~0_160} OutVars{~SIZE~0=v_~SIZE~0_155, main_~c~0=v_main_~c~0_632, ~last~0=v_~last~0_160} AuxVars[] AssignedVars[] [2021-05-03 00:16:39,786 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:16:39,786 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:39,787 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:39,796 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:16:39,798 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:16:39,820 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:16:39,837 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_634 v_~last~0_161) (< v_main_~c~0_634 v_~SIZE~0_156)) InVars {~SIZE~0=v_~SIZE~0_156, main_~c~0=v_main_~c~0_634, ~last~0=v_~last~0_161} OutVars{~SIZE~0=v_~SIZE~0_156, main_~c~0=v_main_~c~0_634, ~last~0=v_~last~0_161} AuxVars[] AssignedVars[] [2021-05-03 00:16:39,838 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size [2021-05-03 00:16:39,847 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:39,849 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:39,859 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:16:39,863 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:16:39,875 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size 66 [2021-05-03 00:16:39,892 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:16:39,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:16:39,993 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:16:39,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:16:39,997 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:16:39,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:16:40,004 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:16:40,006 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:16:40,590 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:16:40,591 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1719216892] [2021-05-03 00:16:40,591 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1719216892] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:16:40,591 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:16:40,591 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2021-05-03 00:16:40,591 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675599148] [2021-05-03 00:16:40,591 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-05-03 00:16:40,591 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:16:40,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-05-03 00:16:40,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=314, Unknown=0, NotChecked=0, Total=380 [2021-05-03 00:16:40,592 INFO L87 Difference]: Start difference. First operand 236 states and 286 transitions. Second operand has 18 states, 18 states have (on average 2.388888888888889) internal successors, (43), 17 states have internal predecessors, (43), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:16:41,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:16:41,195 INFO L93 Difference]: Finished difference Result 509 states and 604 transitions. [2021-05-03 00:16:41,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-05-03 00:16:41,196 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.388888888888889) internal successors, (43), 17 states have internal predecessors, (43), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 49 [2021-05-03 00:16:41,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:16:41,197 INFO L225 Difference]: With dead ends: 509 [2021-05-03 00:16:41,197 INFO L226 Difference]: Without dead ends: 311 [2021-05-03 00:16:41,198 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 12 SyntacticMatches, 16 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 198 ImplicationChecksByTransitivity, 659.0ms TimeCoverageRelationStatistics Valid=77, Invalid=385, Unknown=0, NotChecked=0, Total=462 [2021-05-03 00:16:41,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2021-05-03 00:16:41,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 236. [2021-05-03 00:16:41,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 236 states, 226 states have (on average 1.2168141592920354) internal successors, (275), 226 states have internal predecessors, (275), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:16:41,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 286 transitions. [2021-05-03 00:16:41,280 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 286 transitions. Word has length 49 [2021-05-03 00:16:41,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:16:41,280 INFO L480 AbstractCegarLoop]: Abstraction has 236 states and 286 transitions. [2021-05-03 00:16:41,280 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 2.388888888888889) internal successors, (43), 17 states have internal predecessors, (43), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:16:41,280 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 286 transitions. [2021-05-03 00:16:41,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2021-05-03 00:16:41,281 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:16:41,281 INFO L523 BasicCegarLoop]: trace histogram [9, 9, 7, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:16:41,281 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable196 [2021-05-03 00:16:41,281 INFO L428 AbstractCegarLoop]: === Iteration 53 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:16:41,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:16:41,281 INFO L82 PathProgramCache]: Analyzing trace with hash 2020510173, now seen corresponding path program 30 times [2021-05-03 00:16:41,281 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:16:41,282 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [269161733] [2021-05-03 00:16:41,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:16:41,303 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_~last~0_162 v_main_~c~0_647) (< (+ v_main_~c~0_647 1) v_~SIZE~0_157)) InVars {~SIZE~0=v_~SIZE~0_157, main_~c~0=v_main_~c~0_647, ~last~0=v_~last~0_162} OutVars{~SIZE~0=v_~SIZE~0_157, main_~c~0=v_main_~c~0_647, ~last~0=v_~last~0_162} AuxVars[] AssignedVars[] [2021-05-03 00:16:41,305 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size [2021-05-03 00:16:41,322 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:41,323 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:41,334 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:16:41,336 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:16:41,355 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size 78 [2021-05-03 00:16:41,376 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_649 v_~last~0_163) (< (+ v_main_~c~0_649 1) v_~SIZE~0_158)) InVars {~SIZE~0=v_~SIZE~0_158, main_~c~0=v_main_~c~0_649, ~last~0=v_~last~0_163} OutVars{~SIZE~0=v_~SIZE~0_158, main_~c~0=v_main_~c~0_649, ~last~0=v_~last~0_163} AuxVars[] AssignedVars[] [2021-05-03 00:16:41,378 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:16:41,390 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:41,392 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:41,417 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:16:41,422 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:16:41,435 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:16:41,457 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:16:41,460 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_651 v_~SIZE~0_159) (<= v_~last~0_164 v_main_~c~0_651)) InVars {~SIZE~0=v_~SIZE~0_159, main_~c~0=v_main_~c~0_651, ~last~0=v_~last~0_164} OutVars{~SIZE~0=v_~SIZE~0_159, main_~c~0=v_main_~c~0_651, ~last~0=v_~last~0_164} AuxVars[] AssignedVars[] [2021-05-03 00:16:41,462 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:16:41,478 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:41,484 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:41,493 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:16:41,495 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:16:41,508 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:16:41,524 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_653 v_~SIZE~0_160) (< v_main_~c~0_653 v_~last~0_165)) InVars {~SIZE~0=v_~SIZE~0_160, main_~c~0=v_main_~c~0_653, ~last~0=v_~last~0_165} OutVars{~SIZE~0=v_~SIZE~0_160, main_~c~0=v_main_~c~0_653, ~last~0=v_~last~0_165} AuxVars[] AssignedVars[] [2021-05-03 00:16:41,525 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size [2021-05-03 00:16:41,537 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:41,539 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:41,551 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:16:41,555 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:16:41,568 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size 66 [2021-05-03 00:16:41,586 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:16:41,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:16:41,659 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:16:41,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:16:41,664 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:16:41,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:16:41,667 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:16:41,669 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:16:42,123 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:16:42,123 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [269161733] [2021-05-03 00:16:42,123 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [269161733] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:16:42,123 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:16:42,124 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2021-05-03 00:16:42,124 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516135568] [2021-05-03 00:16:42,124 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-05-03 00:16:42,124 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:16:42,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-05-03 00:16:42,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=313, Unknown=0, NotChecked=0, Total=380 [2021-05-03 00:16:42,124 INFO L87 Difference]: Start difference. First operand 236 states and 286 transitions. Second operand has 19 states, 19 states have (on average 2.263157894736842) internal successors, (43), 18 states have internal predecessors, (43), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:16:42,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:16:42,719 INFO L93 Difference]: Finished difference Result 509 states and 608 transitions. [2021-05-03 00:16:42,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-05-03 00:16:42,719 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.263157894736842) internal successors, (43), 18 states have internal predecessors, (43), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 49 [2021-05-03 00:16:42,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:16:42,720 INFO L225 Difference]: With dead ends: 509 [2021-05-03 00:16:42,720 INFO L226 Difference]: Without dead ends: 311 [2021-05-03 00:16:42,721 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 12 SyntacticMatches, 15 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 209 ImplicationChecksByTransitivity, 464.8ms TimeCoverageRelationStatistics Valid=81, Invalid=381, Unknown=0, NotChecked=0, Total=462 [2021-05-03 00:16:42,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2021-05-03 00:16:42,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 236. [2021-05-03 00:16:42,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 236 states, 226 states have (on average 1.2168141592920354) internal successors, (275), 226 states have internal predecessors, (275), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:16:42,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 286 transitions. [2021-05-03 00:16:42,817 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 286 transitions. Word has length 49 [2021-05-03 00:16:42,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:16:42,817 INFO L480 AbstractCegarLoop]: Abstraction has 236 states and 286 transitions. [2021-05-03 00:16:42,817 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 2.263157894736842) internal successors, (43), 18 states have internal predecessors, (43), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:16:42,817 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 286 transitions. [2021-05-03 00:16:42,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2021-05-03 00:16:42,818 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:16:42,818 INFO L523 BasicCegarLoop]: trace histogram [9, 9, 6, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:16:42,818 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable201 [2021-05-03 00:16:42,818 INFO L428 AbstractCegarLoop]: === Iteration 54 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:16:42,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:16:42,818 INFO L82 PathProgramCache]: Analyzing trace with hash -888253729, now seen corresponding path program 31 times [2021-05-03 00:16:42,818 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:16:42,818 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2101717179] [2021-05-03 00:16:42,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:16:42,824 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (+ v_main_~c~0_666 1) v_~SIZE~0_161) (<= v_~last~0_166 v_main_~c~0_666)) InVars {~SIZE~0=v_~SIZE~0_161, main_~c~0=v_main_~c~0_666, ~last~0=v_~last~0_166} OutVars{~SIZE~0=v_~SIZE~0_161, main_~c~0=v_main_~c~0_666, ~last~0=v_~last~0_166} AuxVars[] AssignedVars[] [2021-05-03 00:16:42,826 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size [2021-05-03 00:16:42,826 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:42,828 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:42,838 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:16:42,840 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:16:42,865 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size 78 [2021-05-03 00:16:42,882 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (+ v_main_~c~0_668 1) v_~SIZE~0_162) (< v_main_~c~0_668 v_~last~0_167)) InVars {~SIZE~0=v_~SIZE~0_162, main_~c~0=v_main_~c~0_668, ~last~0=v_~last~0_167} OutVars{~SIZE~0=v_~SIZE~0_162, main_~c~0=v_main_~c~0_668, ~last~0=v_~last~0_167} AuxVars[] AssignedVars[] [2021-05-03 00:16:42,884 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:16:42,896 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:42,897 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:42,909 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:16:42,913 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:16:42,926 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:16:42,942 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:16:42,944 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_~last~0_168 v_main_~c~0_670) (< v_main_~c~0_670 v_~SIZE~0_163)) InVars {~SIZE~0=v_~SIZE~0_163, main_~c~0=v_main_~c~0_670, ~last~0=v_~last~0_168} OutVars{~SIZE~0=v_~SIZE~0_163, main_~c~0=v_main_~c~0_670, ~last~0=v_~last~0_168} AuxVars[] AssignedVars[] [2021-05-03 00:16:42,946 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:16:42,961 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:42,963 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:42,971 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:16:42,974 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:16:42,987 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:16:43,006 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_672 v_~SIZE~0_164) (< v_main_~c~0_672 v_~last~0_169)) InVars {~SIZE~0=v_~SIZE~0_164, main_~c~0=v_main_~c~0_672, ~last~0=v_~last~0_169} OutVars{~SIZE~0=v_~SIZE~0_164, main_~c~0=v_main_~c~0_672, ~last~0=v_~last~0_169} AuxVars[] AssignedVars[] [2021-05-03 00:16:43,008 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size [2021-05-03 00:16:43,009 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:43,010 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:43,022 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:16:43,026 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:16:43,048 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size 66 [2021-05-03 00:16:43,064 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:16:43,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:16:43,115 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:16:43,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:16:43,119 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:16:43,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:16:43,121 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:16:43,124 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:16:43,566 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:16:43,566 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2101717179] [2021-05-03 00:16:43,566 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [2101717179] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:16:43,566 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:16:43,566 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2021-05-03 00:16:43,566 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [693994182] [2021-05-03 00:16:43,566 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states [2021-05-03 00:16:43,566 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:16:43,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-05-03 00:16:43,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=345, Unknown=0, NotChecked=0, Total=420 [2021-05-03 00:16:43,567 INFO L87 Difference]: Start difference. First operand 236 states and 286 transitions. Second operand has 20 states, 20 states have (on average 2.15) internal successors, (43), 19 states have internal predecessors, (43), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:16:44,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:16:44,167 INFO L93 Difference]: Finished difference Result 500 states and 599 transitions. [2021-05-03 00:16:44,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-05-03 00:16:44,168 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.15) internal successors, (43), 19 states have internal predecessors, (43), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 49 [2021-05-03 00:16:44,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:16:44,169 INFO L225 Difference]: With dead ends: 500 [2021-05-03 00:16:44,169 INFO L226 Difference]: Without dead ends: 302 [2021-05-03 00:16:44,170 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 12 SyntacticMatches, 14 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 241 ImplicationChecksByTransitivity, 468.8ms TimeCoverageRelationStatistics Valid=91, Invalid=415, Unknown=0, NotChecked=0, Total=506 [2021-05-03 00:16:44,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2021-05-03 00:16:44,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 236. [2021-05-03 00:16:44,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 236 states, 226 states have (on average 1.2168141592920354) internal successors, (275), 226 states have internal predecessors, (275), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:16:44,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 286 transitions. [2021-05-03 00:16:44,253 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 286 transitions. Word has length 49 [2021-05-03 00:16:44,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:16:44,254 INFO L480 AbstractCegarLoop]: Abstraction has 236 states and 286 transitions. [2021-05-03 00:16:44,254 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 20 states, 20 states have (on average 2.15) internal successors, (43), 19 states have internal predecessors, (43), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:16:44,254 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 286 transitions. [2021-05-03 00:16:44,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2021-05-03 00:16:44,254 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:16:44,254 INFO L523 BasicCegarLoop]: trace histogram [9, 9, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:16:44,254 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable206 [2021-05-03 00:16:44,254 INFO L428 AbstractCegarLoop]: === Iteration 55 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:16:44,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:16:44,255 INFO L82 PathProgramCache]: Analyzing trace with hash -826214115, now seen corresponding path program 32 times [2021-05-03 00:16:44,255 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:16:44,255 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [111233121] [2021-05-03 00:16:44,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:16:44,261 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_~last~0_170 v_main_~c~0_685) (< (+ v_main_~c~0_685 1) v_~SIZE~0_165)) InVars {~SIZE~0=v_~SIZE~0_165, main_~c~0=v_main_~c~0_685, ~last~0=v_~last~0_170} OutVars{~SIZE~0=v_~SIZE~0_165, main_~c~0=v_main_~c~0_685, ~last~0=v_~last~0_170} AuxVars[] AssignedVars[] [2021-05-03 00:16:44,263 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size [2021-05-03 00:16:44,264 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:44,265 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:44,274 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:16:44,277 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:16:44,304 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size 78 [2021-05-03 00:16:44,321 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (+ v_main_~c~0_687 1) v_~SIZE~0_166) (< v_main_~c~0_687 v_~last~0_171)) InVars {~SIZE~0=v_~SIZE~0_166, main_~c~0=v_main_~c~0_687, ~last~0=v_~last~0_171} OutVars{~SIZE~0=v_~SIZE~0_166, main_~c~0=v_main_~c~0_687, ~last~0=v_~last~0_171} AuxVars[] AssignedVars[] [2021-05-03 00:16:44,323 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:16:44,323 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:44,325 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:44,338 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:16:44,357 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:16:44,380 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:16:44,397 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:16:44,400 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_~last~0_172 v_main_~c~0_689) (< v_main_~c~0_689 v_~SIZE~0_167)) InVars {~SIZE~0=v_~SIZE~0_167, main_~c~0=v_main_~c~0_689, ~last~0=v_~last~0_172} OutVars{~SIZE~0=v_~SIZE~0_167, main_~c~0=v_main_~c~0_689, ~last~0=v_~last~0_172} AuxVars[] AssignedVars[] [2021-05-03 00:16:44,401 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:16:44,402 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:44,404 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:44,414 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:16:44,417 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:16:44,444 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:16:44,462 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_691 v_~SIZE~0_168) (< v_main_~c~0_691 v_~last~0_173)) InVars {~SIZE~0=v_~SIZE~0_168, main_~c~0=v_main_~c~0_691, ~last~0=v_~last~0_173} OutVars{~SIZE~0=v_~SIZE~0_168, main_~c~0=v_main_~c~0_691, ~last~0=v_~last~0_173} AuxVars[] AssignedVars[] [2021-05-03 00:16:44,464 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size [2021-05-03 00:16:44,465 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:44,466 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:44,480 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:16:44,484 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:16:44,510 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size 66 [2021-05-03 00:16:44,527 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:16:44,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:16:44,578 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:16:44,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:16:44,583 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:16:44,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:16:44,585 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:16:44,588 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:16:45,022 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:16:45,022 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [111233121] [2021-05-03 00:16:45,022 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [111233121] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:16:45,022 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:16:45,022 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2021-05-03 00:16:45,022 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [190889551] [2021-05-03 00:16:45,022 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states [2021-05-03 00:16:45,022 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:16:45,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-05-03 00:16:45,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=379, Unknown=0, NotChecked=0, Total=462 [2021-05-03 00:16:45,023 INFO L87 Difference]: Start difference. First operand 236 states and 286 transitions. Second operand has 21 states, 21 states have (on average 2.0476190476190474) internal successors, (43), 20 states have internal predecessors, (43), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:16:45,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:16:45,672 INFO L93 Difference]: Finished difference Result 491 states and 590 transitions. [2021-05-03 00:16:45,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-05-03 00:16:45,672 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.0476190476190474) internal successors, (43), 20 states have internal predecessors, (43), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 49 [2021-05-03 00:16:45,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:16:45,674 INFO L225 Difference]: With dead ends: 491 [2021-05-03 00:16:45,675 INFO L226 Difference]: Without dead ends: 293 [2021-05-03 00:16:45,675 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 13 SyntacticMatches, 12 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 252 ImplicationChecksByTransitivity, 460.6ms TimeCoverageRelationStatistics Valid=101, Invalid=451, Unknown=0, NotChecked=0, Total=552 [2021-05-03 00:16:45,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2021-05-03 00:16:45,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 236. [2021-05-03 00:16:45,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 236 states, 226 states have (on average 1.2168141592920354) internal successors, (275), 226 states have internal predecessors, (275), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:16:45,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 286 transitions. [2021-05-03 00:16:45,756 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 286 transitions. Word has length 49 [2021-05-03 00:16:45,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:16:45,756 INFO L480 AbstractCegarLoop]: Abstraction has 236 states and 286 transitions. [2021-05-03 00:16:45,756 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 21 states, 21 states have (on average 2.0476190476190474) internal successors, (43), 20 states have internal predecessors, (43), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:16:45,756 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 286 transitions. [2021-05-03 00:16:45,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2021-05-03 00:16:45,756 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:16:45,756 INFO L523 BasicCegarLoop]: trace histogram [9, 9, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:16:45,757 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable211 [2021-05-03 00:16:45,757 INFO L428 AbstractCegarLoop]: === Iteration 56 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:16:45,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:16:45,757 INFO L82 PathProgramCache]: Analyzing trace with hash 1663314847, now seen corresponding path program 33 times [2021-05-03 00:16:45,757 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:16:45,757 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1425803480] [2021-05-03 00:16:45,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:16:45,763 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_~last~0_174 v_main_~c~0_704) (< (+ v_main_~c~0_704 1) v_~SIZE~0_169)) InVars {~SIZE~0=v_~SIZE~0_169, main_~c~0=v_main_~c~0_704, ~last~0=v_~last~0_174} OutVars{~SIZE~0=v_~SIZE~0_169, main_~c~0=v_main_~c~0_704, ~last~0=v_~last~0_174} AuxVars[] AssignedVars[] [2021-05-03 00:16:45,765 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size [2021-05-03 00:16:45,781 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:45,783 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:45,792 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:16:45,795 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:16:45,809 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size 78 [2021-05-03 00:16:45,827 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_706 v_~last~0_175) (< (+ v_main_~c~0_706 1) v_~SIZE~0_170)) InVars {~SIZE~0=v_~SIZE~0_170, main_~c~0=v_main_~c~0_706, ~last~0=v_~last~0_175} OutVars{~SIZE~0=v_~SIZE~0_170, main_~c~0=v_main_~c~0_706, ~last~0=v_~last~0_175} AuxVars[] AssignedVars[] [2021-05-03 00:16:45,828 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:16:45,829 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:45,831 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:45,843 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:16:45,848 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:16:45,870 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:16:45,888 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:16:45,890 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_708 v_~SIZE~0_171) (<= v_~last~0_176 v_main_~c~0_708)) InVars {~SIZE~0=v_~SIZE~0_171, main_~c~0=v_main_~c~0_708, ~last~0=v_~last~0_176} OutVars{~SIZE~0=v_~SIZE~0_171, main_~c~0=v_main_~c~0_708, ~last~0=v_~last~0_176} AuxVars[] AssignedVars[] [2021-05-03 00:16:45,892 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:16:45,907 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:45,909 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:45,919 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:16:45,922 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:16:45,936 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:16:45,955 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_710 v_~SIZE~0_172) (< v_main_~c~0_710 v_~last~0_177)) InVars {~SIZE~0=v_~SIZE~0_172, main_~c~0=v_main_~c~0_710, ~last~0=v_~last~0_177} OutVars{~SIZE~0=v_~SIZE~0_172, main_~c~0=v_main_~c~0_710, ~last~0=v_~last~0_177} AuxVars[] AssignedVars[] [2021-05-03 00:16:45,956 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size [2021-05-03 00:16:45,957 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:45,958 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:45,971 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:16:45,975 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:16:45,997 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size 66 [2021-05-03 00:16:46,014 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:16:46,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:16:46,086 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:16:46,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:16:46,090 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:16:46,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:16:46,093 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:16:46,095 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:16:46,659 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:16:46,659 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1425803480] [2021-05-03 00:16:46,659 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1425803480] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:16:46,659 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:16:46,659 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2021-05-03 00:16:46,659 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289927290] [2021-05-03 00:16:46,660 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states [2021-05-03 00:16:46,660 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:16:46,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2021-05-03 00:16:46,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=415, Unknown=0, NotChecked=0, Total=506 [2021-05-03 00:16:46,660 INFO L87 Difference]: Start difference. First operand 236 states and 286 transitions. Second operand has 22 states, 22 states have (on average 1.9545454545454546) internal successors, (43), 21 states have internal predecessors, (43), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:16:47,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:16:47,183 INFO L93 Difference]: Finished difference Result 482 states and 581 transitions. [2021-05-03 00:16:47,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-05-03 00:16:47,183 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 1.9545454545454546) internal successors, (43), 21 states have internal predecessors, (43), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 49 [2021-05-03 00:16:47,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:16:47,184 INFO L225 Difference]: With dead ends: 482 [2021-05-03 00:16:47,185 INFO L226 Difference]: Without dead ends: 284 [2021-05-03 00:16:47,185 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 12 SyntacticMatches, 12 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 278 ImplicationChecksByTransitivity, 609.4ms TimeCoverageRelationStatistics Valid=111, Invalid=489, Unknown=0, NotChecked=0, Total=600 [2021-05-03 00:16:47,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2021-05-03 00:16:47,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 236. [2021-05-03 00:16:47,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 236 states, 226 states have (on average 1.2168141592920354) internal successors, (275), 226 states have internal predecessors, (275), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:16:47,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 286 transitions. [2021-05-03 00:16:47,272 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 286 transitions. Word has length 49 [2021-05-03 00:16:47,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:16:47,272 INFO L480 AbstractCegarLoop]: Abstraction has 236 states and 286 transitions. [2021-05-03 00:16:47,272 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 22 states, 22 states have (on average 1.9545454545454546) internal successors, (43), 21 states have internal predecessors, (43), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:16:47,272 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 286 transitions. [2021-05-03 00:16:47,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2021-05-03 00:16:47,273 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:16:47,273 INFO L523 BasicCegarLoop]: trace histogram [9, 9, 6, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:16:47,273 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable216 [2021-05-03 00:16:47,273 INFO L428 AbstractCegarLoop]: === Iteration 57 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:16:47,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:16:47,273 INFO L82 PathProgramCache]: Analyzing trace with hash 845666397, now seen corresponding path program 34 times [2021-05-03 00:16:47,273 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:16:47,273 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [834193634] [2021-05-03 00:16:47,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:16:47,279 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (+ v_main_~c~0_723 1) v_~SIZE~0_173) (<= v_~last~0_178 v_main_~c~0_723)) InVars {~SIZE~0=v_~SIZE~0_173, main_~c~0=v_main_~c~0_723, ~last~0=v_~last~0_178} OutVars{~SIZE~0=v_~SIZE~0_173, main_~c~0=v_main_~c~0_723, ~last~0=v_~last~0_178} AuxVars[] AssignedVars[] [2021-05-03 00:16:47,281 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size [2021-05-03 00:16:47,282 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:47,283 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:47,293 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:16:47,295 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:16:47,320 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size 78 [2021-05-03 00:16:47,337 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (+ v_main_~c~0_725 1) v_~SIZE~0_174) (< v_main_~c~0_725 v_~last~0_179)) InVars {~SIZE~0=v_~SIZE~0_174, main_~c~0=v_main_~c~0_725, ~last~0=v_~last~0_179} OutVars{~SIZE~0=v_~SIZE~0_174, main_~c~0=v_main_~c~0_725, ~last~0=v_~last~0_179} AuxVars[] AssignedVars[] [2021-05-03 00:16:47,338 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:16:47,350 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:47,352 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:47,364 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:16:47,368 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:16:47,380 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:16:47,396 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:16:47,398 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_727 v_~SIZE~0_175) (<= v_~last~0_180 v_main_~c~0_727)) InVars {~SIZE~0=v_~SIZE~0_175, main_~c~0=v_main_~c~0_727, ~last~0=v_~last~0_180} OutVars{~SIZE~0=v_~SIZE~0_175, main_~c~0=v_main_~c~0_727, ~last~0=v_~last~0_180} AuxVars[] AssignedVars[] [2021-05-03 00:16:47,399 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:16:47,401 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:47,402 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:47,412 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:16:47,415 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:16:47,439 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:16:47,456 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_729 v_~SIZE~0_176) (< v_main_~c~0_729 v_~last~0_181)) InVars {~SIZE~0=v_~SIZE~0_176, main_~c~0=v_main_~c~0_729, ~last~0=v_~last~0_181} OutVars{~SIZE~0=v_~SIZE~0_176, main_~c~0=v_main_~c~0_729, ~last~0=v_~last~0_181} AuxVars[] AssignedVars[] [2021-05-03 00:16:47,458 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size [2021-05-03 00:16:47,458 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:47,460 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:47,472 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:16:47,476 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:16:47,499 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size 66 [2021-05-03 00:16:47,515 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:16:47,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:16:47,580 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:16:47,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:16:47,585 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:16:47,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:16:47,587 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:16:47,590 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:16:48,055 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:16:48,055 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [834193634] [2021-05-03 00:16:48,055 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [834193634] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:16:48,055 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:16:48,055 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2021-05-03 00:16:48,056 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1866176728] [2021-05-03 00:16:48,056 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states [2021-05-03 00:16:48,056 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:16:48,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-05-03 00:16:48,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=494, Unknown=0, NotChecked=0, Total=600 [2021-05-03 00:16:48,056 INFO L87 Difference]: Start difference. First operand 236 states and 286 transitions. Second operand has 23 states, 23 states have (on average 1.8695652173913044) internal successors, (43), 22 states have internal predecessors, (43), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:16:48,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:16:48,641 INFO L93 Difference]: Finished difference Result 479 states and 574 transitions. [2021-05-03 00:16:48,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-05-03 00:16:48,642 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 1.8695652173913044) internal successors, (43), 22 states have internal predecessors, (43), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 49 [2021-05-03 00:16:48,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:16:48,643 INFO L225 Difference]: With dead ends: 479 [2021-05-03 00:16:48,643 INFO L226 Difference]: Without dead ends: 281 [2021-05-03 00:16:48,644 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 13 SyntacticMatches, 10 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 291 ImplicationChecksByTransitivity, 510.1ms TimeCoverageRelationStatistics Valid=127, Invalid=575, Unknown=0, NotChecked=0, Total=702 [2021-05-03 00:16:48,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2021-05-03 00:16:48,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 236. [2021-05-03 00:16:48,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 236 states, 226 states have (on average 1.2168141592920354) internal successors, (275), 226 states have internal predecessors, (275), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:16:48,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 286 transitions. [2021-05-03 00:16:48,756 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 286 transitions. Word has length 49 [2021-05-03 00:16:48,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:16:48,757 INFO L480 AbstractCegarLoop]: Abstraction has 236 states and 286 transitions. [2021-05-03 00:16:48,757 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 23 states, 23 states have (on average 1.8695652173913044) internal successors, (43), 22 states have internal predecessors, (43), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:16:48,757 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 286 transitions. [2021-05-03 00:16:48,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2021-05-03 00:16:48,757 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:16:48,757 INFO L523 BasicCegarLoop]: trace histogram [9, 9, 7, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:16:48,758 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable221 [2021-05-03 00:16:48,758 INFO L428 AbstractCegarLoop]: === Iteration 58 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:16:48,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:16:48,758 INFO L82 PathProgramCache]: Analyzing trace with hash -742681505, now seen corresponding path program 35 times [2021-05-03 00:16:48,758 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:16:48,758 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1925910963] [2021-05-03 00:16:48,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:16:48,766 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (+ v_main_~c~0_742 1) v_~SIZE~0_177) (<= v_~last~0_182 v_main_~c~0_742)) InVars {~SIZE~0=v_~SIZE~0_177, main_~c~0=v_main_~c~0_742, ~last~0=v_~last~0_182} OutVars{~SIZE~0=v_~SIZE~0_177, main_~c~0=v_main_~c~0_742, ~last~0=v_~last~0_182} AuxVars[] AssignedVars[] [2021-05-03 00:16:48,768 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size [2021-05-03 00:16:48,769 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:48,771 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:48,783 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:16:48,786 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:16:48,816 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size 78 [2021-05-03 00:16:48,835 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_744 v_~last~0_183) (< (+ v_main_~c~0_744 1) v_~SIZE~0_178)) InVars {~SIZE~0=v_~SIZE~0_178, main_~c~0=v_main_~c~0_744, ~last~0=v_~last~0_183} OutVars{~SIZE~0=v_~SIZE~0_178, main_~c~0=v_main_~c~0_744, ~last~0=v_~last~0_183} AuxVars[] AssignedVars[] [2021-05-03 00:16:48,836 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:16:48,837 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:48,838 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:48,850 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:16:48,854 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:16:48,875 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:16:48,893 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:16:48,897 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_746 v_~SIZE~0_179) (<= v_~last~0_184 v_main_~c~0_746)) InVars {~SIZE~0=v_~SIZE~0_179, main_~c~0=v_main_~c~0_746, ~last~0=v_~last~0_184} OutVars{~SIZE~0=v_~SIZE~0_179, main_~c~0=v_main_~c~0_746, ~last~0=v_~last~0_184} AuxVars[] AssignedVars[] [2021-05-03 00:16:48,899 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:16:48,914 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:48,915 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:48,925 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:16:48,927 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:16:48,941 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:16:48,961 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_748 v_~last~0_185) (< v_main_~c~0_748 v_~SIZE~0_180)) InVars {~SIZE~0=v_~SIZE~0_180, main_~c~0=v_main_~c~0_748, ~last~0=v_~last~0_185} OutVars{~SIZE~0=v_~SIZE~0_180, main_~c~0=v_main_~c~0_748, ~last~0=v_~last~0_185} AuxVars[] AssignedVars[] [2021-05-03 00:16:48,962 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size [2021-05-03 00:16:48,963 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:48,964 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:48,976 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:16:48,980 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:16:49,001 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size 66 [2021-05-03 00:16:49,018 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:16:49,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:16:49,099 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:16:49,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:16:49,105 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:16:49,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:16:49,108 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:16:49,111 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:16:49,657 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:16:49,658 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1925910963] [2021-05-03 00:16:49,658 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1925910963] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:16:49,658 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:16:49,658 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2021-05-03 00:16:49,658 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169067949] [2021-05-03 00:16:49,658 INFO L460 AbstractCegarLoop]: Interpolant automaton has 24 states [2021-05-03 00:16:49,658 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:16:49,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2021-05-03 00:16:49,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=493, Unknown=0, NotChecked=0, Total=600 [2021-05-03 00:16:49,659 INFO L87 Difference]: Start difference. First operand 236 states and 286 transitions. Second operand has 24 states, 24 states have (on average 1.7916666666666667) internal successors, (43), 23 states have internal predecessors, (43), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:16:50,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:16:50,164 INFO L93 Difference]: Finished difference Result 467 states and 566 transitions. [2021-05-03 00:16:50,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-05-03 00:16:50,164 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 1.7916666666666667) internal successors, (43), 23 states have internal predecessors, (43), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 49 [2021-05-03 00:16:50,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:16:50,165 INFO L225 Difference]: With dead ends: 467 [2021-05-03 00:16:50,165 INFO L226 Difference]: Without dead ends: 269 [2021-05-03 00:16:50,166 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 12 SyntacticMatches, 10 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 279 ImplicationChecksByTransitivity, 578.5ms TimeCoverageRelationStatistics Valid=131, Invalid=571, Unknown=0, NotChecked=0, Total=702 [2021-05-03 00:16:50,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2021-05-03 00:16:50,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 236. [2021-05-03 00:16:50,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 236 states, 226 states have (on average 1.2168141592920354) internal successors, (275), 226 states have internal predecessors, (275), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:16:50,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 286 transitions. [2021-05-03 00:16:50,246 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 286 transitions. Word has length 49 [2021-05-03 00:16:50,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:16:50,246 INFO L480 AbstractCegarLoop]: Abstraction has 236 states and 286 transitions. [2021-05-03 00:16:50,246 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 24 states, 24 states have (on average 1.7916666666666667) internal successors, (43), 23 states have internal predecessors, (43), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:16:50,246 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 286 transitions. [2021-05-03 00:16:50,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2021-05-03 00:16:50,247 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:16:50,247 INFO L523 BasicCegarLoop]: trace histogram [9, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:16:50,247 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable226 [2021-05-03 00:16:50,247 INFO L428 AbstractCegarLoop]: === Iteration 59 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:16:50,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:16:50,247 INFO L82 PathProgramCache]: Analyzing trace with hash -1753798755, now seen corresponding path program 36 times [2021-05-03 00:16:50,247 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:16:50,247 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [845638349] [2021-05-03 00:16:50,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:16:50,252 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_761 v_~last~0_186) (< (+ v_main_~c~0_761 1) v_~SIZE~0_181)) InVars {~SIZE~0=v_~SIZE~0_181, main_~c~0=v_main_~c~0_761, ~last~0=v_~last~0_186} OutVars{~SIZE~0=v_~SIZE~0_181, main_~c~0=v_main_~c~0_761, ~last~0=v_~last~0_186} AuxVars[] AssignedVars[] [2021-05-03 00:16:50,254 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:16:50,254 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:50,256 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:50,268 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:16:50,272 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:16:50,296 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:16:50,313 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:16:50,315 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_763 v_~SIZE~0_182) (<= v_~last~0_187 v_main_~c~0_763)) InVars {~SIZE~0=v_~SIZE~0_182, main_~c~0=v_main_~c~0_763, ~last~0=v_~last~0_187} OutVars{~SIZE~0=v_~SIZE~0_182, main_~c~0=v_main_~c~0_763, ~last~0=v_~last~0_187} AuxVars[] AssignedVars[] [2021-05-03 00:16:50,317 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:16:50,333 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:50,334 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:50,343 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:16:50,346 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:16:50,361 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:16:50,378 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_765 v_~SIZE~0_183) (< v_main_~c~0_765 v_~last~0_188)) InVars {~SIZE~0=v_~SIZE~0_183, main_~c~0=v_main_~c~0_765, ~last~0=v_~last~0_188} OutVars{~SIZE~0=v_~SIZE~0_183, main_~c~0=v_main_~c~0_765, ~last~0=v_~last~0_188} AuxVars[] AssignedVars[] [2021-05-03 00:16:50,380 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size [2021-05-03 00:16:50,391 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:50,393 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:50,410 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:16:50,415 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:16:50,430 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size 66 [2021-05-03 00:16:50,447 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:16:50,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:16:50,497 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:16:50,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:16:50,501 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:16:50,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:16:50,504 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:16:50,506 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:16:51,004 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:16:51,004 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [845638349] [2021-05-03 00:16:51,004 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [845638349] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:16:51,004 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:16:51,005 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2021-05-03 00:16:51,005 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811513115] [2021-05-03 00:16:51,005 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states [2021-05-03 00:16:51,005 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:16:51,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-05-03 00:16:51,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=535, Unknown=0, NotChecked=0, Total=650 [2021-05-03 00:16:51,005 INFO L87 Difference]: Start difference. First operand 236 states and 286 transitions. Second operand has 25 states, 25 states have (on average 1.72) internal successors, (43), 24 states have internal predecessors, (43), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:16:51,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:16:51,500 INFO L93 Difference]: Finished difference Result 467 states and 572 transitions. [2021-05-03 00:16:51,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2021-05-03 00:16:51,500 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 1.72) internal successors, (43), 24 states have internal predecessors, (43), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 49 [2021-05-03 00:16:51,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:16:51,501 INFO L225 Difference]: With dead ends: 467 [2021-05-03 00:16:51,501 INFO L226 Difference]: Without dead ends: 269 [2021-05-03 00:16:51,501 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 12 SyntacticMatches, 9 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 266 ImplicationChecksByTransitivity, 524.1ms TimeCoverageRelationStatistics Valid=141, Invalid=615, Unknown=0, NotChecked=0, Total=756 [2021-05-03 00:16:51,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2021-05-03 00:16:51,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 219. [2021-05-03 00:16:51,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 209 states have (on average 1.2105263157894737) internal successors, (253), 210 states have internal predecessors, (253), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:16:51,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 264 transitions. [2021-05-03 00:16:51,571 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 264 transitions. Word has length 49 [2021-05-03 00:16:51,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:16:51,571 INFO L480 AbstractCegarLoop]: Abstraction has 219 states and 264 transitions. [2021-05-03 00:16:51,571 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 25 states, 25 states have (on average 1.72) internal successors, (43), 24 states have internal predecessors, (43), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:16:51,572 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 264 transitions. [2021-05-03 00:16:51,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2021-05-03 00:16:51,572 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:16:51,572 INFO L523 BasicCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:16:51,572 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable230 [2021-05-03 00:16:51,572 INFO L428 AbstractCegarLoop]: === Iteration 60 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:16:51,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:16:51,572 INFO L82 PathProgramCache]: Analyzing trace with hash -1919339105, now seen corresponding path program 9 times [2021-05-03 00:16:51,572 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:16:51,572 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1799602505] [2021-05-03 00:16:51,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:16:51,581 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_778 v_~last~0_189) (< (+ v_main_~c~0_778 1) v_~SIZE~0_184)) InVars {~SIZE~0=v_~SIZE~0_184, main_~c~0=v_main_~c~0_778, ~last~0=v_~last~0_189} OutVars{~SIZE~0=v_~SIZE~0_184, main_~c~0=v_main_~c~0_778, ~last~0=v_~last~0_189} AuxVars[] AssignedVars[] [2021-05-03 00:16:51,582 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:16:51,592 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:51,594 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:51,604 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:16:51,607 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:16:51,618 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:16:51,632 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:16:51,633 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_780 v_~SIZE~0_185) (< v_main_~c~0_780 v_~last~0_190)) InVars {~SIZE~0=v_~SIZE~0_185, main_~c~0=v_main_~c~0_780, ~last~0=v_~last~0_190} OutVars{~SIZE~0=v_~SIZE~0_185, main_~c~0=v_main_~c~0_780, ~last~0=v_~last~0_190} AuxVars[] AssignedVars[] [2021-05-03 00:16:51,634 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size [2021-05-03 00:16:51,645 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:51,646 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:51,656 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:16:51,660 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:16:51,671 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size 66 [2021-05-03 00:16:51,689 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:16:51,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:16:51,836 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:16:51,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:16:51,841 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:16:51,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:16:51,843 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:16:52,579 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:16:52,580 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1799602505] [2021-05-03 00:16:52,580 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1799602505] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:16:52,580 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:16:52,580 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2021-05-03 00:16:52,580 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263517966] [2021-05-03 00:16:52,580 INFO L460 AbstractCegarLoop]: Interpolant automaton has 29 states [2021-05-03 00:16:52,580 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:16:52,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2021-05-03 00:16:52,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=791, Unknown=0, NotChecked=0, Total=930 [2021-05-03 00:16:52,581 INFO L87 Difference]: Start difference. First operand 219 states and 264 transitions. Second operand has 29 states, 29 states have (on average 1.4827586206896552) internal successors, (43), 27 states have internal predecessors, (43), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:16:53,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:16:53,663 INFO L93 Difference]: Finished difference Result 500 states and 605 transitions. [2021-05-03 00:16:53,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2021-05-03 00:16:53,664 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 1.4827586206896552) internal successors, (43), 27 states have internal predecessors, (43), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 49 [2021-05-03 00:16:53,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:16:53,665 INFO L225 Difference]: With dead ends: 500 [2021-05-03 00:16:53,666 INFO L226 Difference]: Without dead ends: 293 [2021-05-03 00:16:53,666 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 6 SyntacticMatches, 8 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 446 ImplicationChecksByTransitivity, 1146.0ms TimeCoverageRelationStatistics Valid=221, Invalid=1501, Unknown=0, NotChecked=0, Total=1722 [2021-05-03 00:16:53,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2021-05-03 00:16:53,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 248. [2021-05-03 00:16:53,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 248 states, 238 states have (on average 1.2226890756302522) internal successors, (291), 238 states have internal predecessors, (291), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:16:53,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 302 transitions. [2021-05-03 00:16:53,776 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 302 transitions. Word has length 49 [2021-05-03 00:16:53,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:16:53,777 INFO L480 AbstractCegarLoop]: Abstraction has 248 states and 302 transitions. [2021-05-03 00:16:53,777 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 29 states, 29 states have (on average 1.4827586206896552) internal successors, (43), 27 states have internal predecessors, (43), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:16:53,777 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 302 transitions. [2021-05-03 00:16:53,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2021-05-03 00:16:53,777 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:16:53,777 INFO L523 BasicCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:16:53,777 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable233 [2021-05-03 00:16:53,777 INFO L428 AbstractCegarLoop]: === Iteration 61 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:16:53,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:16:53,778 INFO L82 PathProgramCache]: Analyzing trace with hash 1708450110, now seen corresponding path program 10 times [2021-05-03 00:16:53,778 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:16:53,778 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [775184902] [2021-05-03 00:16:53,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:16:53,783 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (+ v_main_~c~0_792 1) v_~SIZE~0_186) (<= v_~last~0_191 v_main_~c~0_792)) InVars {~SIZE~0=v_~SIZE~0_186, main_~c~0=v_main_~c~0_792, ~last~0=v_~last~0_191} OutVars{~SIZE~0=v_~SIZE~0_186, main_~c~0=v_main_~c~0_792, ~last~0=v_~last~0_191} AuxVars[] AssignedVars[] [2021-05-03 00:16:53,784 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size [2021-05-03 00:16:53,800 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:53,802 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:53,811 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:16:53,814 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:16:53,829 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size 78 [2021-05-03 00:16:53,846 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:16:53,848 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_~last~0_192 v_main_~c~0_794) (< v_main_~c~0_794 v_~SIZE~0_187)) InVars {~SIZE~0=v_~SIZE~0_187, main_~c~0=v_main_~c~0_794, ~last~0=v_~last~0_192} OutVars{~SIZE~0=v_~SIZE~0_187, main_~c~0=v_main_~c~0_794, ~last~0=v_~last~0_192} AuxVars[] AssignedVars[] [2021-05-03 00:16:53,850 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:16:53,866 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:53,868 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:53,877 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:16:53,879 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:16:53,894 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:16:53,910 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:16:53,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:16:53,959 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:16:53,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:16:53,964 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:16:53,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:16:53,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-03 00:16:54,430 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:16:54,430 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [775184902] [2021-05-03 00:16:54,431 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [775184902] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:16:54,431 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:16:54,431 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2021-05-03 00:16:54,431 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [178320946] [2021-05-03 00:16:54,431 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-05-03 00:16:54,431 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:16:54,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-05-03 00:16:54,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=278, Unknown=0, NotChecked=0, Total=342 [2021-05-03 00:16:54,432 INFO L87 Difference]: Start difference. First operand 248 states and 302 transitions. Second operand has 18 states, 18 states have (on average 2.5555555555555554) internal successors, (46), 17 states have internal predecessors, (46), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:16:55,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:16:55,143 INFO L93 Difference]: Finished difference Result 548 states and 654 transitions. [2021-05-03 00:16:55,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-05-03 00:16:55,144 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.5555555555555554) internal successors, (46), 17 states have internal predecessors, (46), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 52 [2021-05-03 00:16:55,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:16:55,146 INFO L225 Difference]: With dead ends: 548 [2021-05-03 00:16:55,146 INFO L226 Difference]: Without dead ends: 341 [2021-05-03 00:16:55,146 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 13 SyntacticMatches, 18 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 145 ImplicationChecksByTransitivity, 474.7ms TimeCoverageRelationStatistics Valid=74, Invalid=346, Unknown=0, NotChecked=0, Total=420 [2021-05-03 00:16:55,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2021-05-03 00:16:55,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 257. [2021-05-03 00:16:55,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 257 states, 247 states have (on average 1.214574898785425) internal successors, (300), 247 states have internal predecessors, (300), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:16:55,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 311 transitions. [2021-05-03 00:16:55,247 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 311 transitions. Word has length 52 [2021-05-03 00:16:55,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:16:55,247 INFO L480 AbstractCegarLoop]: Abstraction has 257 states and 311 transitions. [2021-05-03 00:16:55,247 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 2.5555555555555554) internal successors, (46), 17 states have internal predecessors, (46), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:16:55,247 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 311 transitions. [2021-05-03 00:16:55,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2021-05-03 00:16:55,247 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:16:55,248 INFO L523 BasicCegarLoop]: trace histogram [10, 10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:16:55,248 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable236 [2021-05-03 00:16:55,248 INFO L428 AbstractCegarLoop]: === Iteration 62 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:16:55,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:16:55,248 INFO L82 PathProgramCache]: Analyzing trace with hash 679090812, now seen corresponding path program 37 times [2021-05-03 00:16:55,248 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:16:55,248 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [413926743] [2021-05-03 00:16:55,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:16:55,254 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (+ v_main_~c~0_807 1) v_~SIZE~0_188) (<= v_~last~0_193 v_main_~c~0_807)) InVars {~SIZE~0=v_~SIZE~0_188, main_~c~0=v_main_~c~0_807, ~last~0=v_~last~0_193} OutVars{~SIZE~0=v_~SIZE~0_188, main_~c~0=v_main_~c~0_807, ~last~0=v_~last~0_193} AuxVars[] AssignedVars[] [2021-05-03 00:16:55,256 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size [2021-05-03 00:16:55,257 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:55,259 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:55,269 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:16:55,272 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:16:55,297 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size 78 [2021-05-03 00:16:55,315 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (+ v_main_~c~0_809 1) v_~SIZE~0_189) (< v_main_~c~0_809 v_~last~0_194)) InVars {~SIZE~0=v_~SIZE~0_189, main_~c~0=v_main_~c~0_809, ~last~0=v_~last~0_194} OutVars{~SIZE~0=v_~SIZE~0_189, main_~c~0=v_main_~c~0_809, ~last~0=v_~last~0_194} AuxVars[] AssignedVars[] [2021-05-03 00:16:55,317 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:16:55,329 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:55,330 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:55,343 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:16:55,347 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:16:55,360 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:16:55,378 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:16:55,381 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_811 v_~SIZE~0_190) (<= v_~last~0_195 v_main_~c~0_811)) InVars {~SIZE~0=v_~SIZE~0_190, main_~c~0=v_main_~c~0_811, ~last~0=v_~last~0_195} OutVars{~SIZE~0=v_~SIZE~0_190, main_~c~0=v_main_~c~0_811, ~last~0=v_~last~0_195} AuxVars[] AssignedVars[] [2021-05-03 00:16:55,382 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:16:55,383 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:55,384 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:55,394 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:16:55,397 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:16:55,421 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:16:55,439 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_813 v_~last~0_196) (< v_main_~c~0_813 v_~SIZE~0_191)) InVars {~SIZE~0=v_~SIZE~0_191, main_~c~0=v_main_~c~0_813, ~last~0=v_~last~0_196} OutVars{~SIZE~0=v_~SIZE~0_191, main_~c~0=v_main_~c~0_813, ~last~0=v_~last~0_196} AuxVars[] AssignedVars[] [2021-05-03 00:16:55,440 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size [2021-05-03 00:16:55,453 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:55,454 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:55,467 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:16:55,471 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:16:55,484 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size 66 [2021-05-03 00:16:55,500 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:16:55,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:16:55,550 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:16:55,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:16:55,555 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:16:55,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:16:55,557 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:16:55,560 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:16:56,028 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:16:56,029 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [413926743] [2021-05-03 00:16:56,029 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [413926743] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:16:56,029 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:16:56,029 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2021-05-03 00:16:56,029 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655908576] [2021-05-03 00:16:56,029 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-05-03 00:16:56,029 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:16:56,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-05-03 00:16:56,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=318, Unknown=0, NotChecked=0, Total=380 [2021-05-03 00:16:56,030 INFO L87 Difference]: Start difference. First operand 257 states and 311 transitions. Second operand has 19 states, 19 states have (on average 2.4210526315789473) internal successors, (46), 18 states have internal predecessors, (46), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:16:56,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:16:56,767 INFO L93 Difference]: Finished difference Result 566 states and 672 transitions. [2021-05-03 00:16:56,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-05-03 00:16:56,767 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.4210526315789473) internal successors, (46), 18 states have internal predecessors, (46), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 52 [2021-05-03 00:16:56,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:16:56,769 INFO L225 Difference]: With dead ends: 566 [2021-05-03 00:16:56,769 INFO L226 Difference]: Without dead ends: 350 [2021-05-03 00:16:56,769 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 12 SyntacticMatches, 18 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 186 ImplicationChecksByTransitivity, 498.3ms TimeCoverageRelationStatistics Valid=74, Invalid=388, Unknown=0, NotChecked=0, Total=462 [2021-05-03 00:16:56,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2021-05-03 00:16:56,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 257. [2021-05-03 00:16:56,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 257 states, 247 states have (on average 1.214574898785425) internal successors, (300), 247 states have internal predecessors, (300), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:16:56,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 311 transitions. [2021-05-03 00:16:56,885 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 311 transitions. Word has length 52 [2021-05-03 00:16:56,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:16:56,885 INFO L480 AbstractCegarLoop]: Abstraction has 257 states and 311 transitions. [2021-05-03 00:16:56,886 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 2.4210526315789473) internal successors, (46), 18 states have internal predecessors, (46), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:16:56,886 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 311 transitions. [2021-05-03 00:16:56,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2021-05-03 00:16:56,886 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:16:56,886 INFO L523 BasicCegarLoop]: trace histogram [10, 10, 8, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:16:56,886 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable241 [2021-05-03 00:16:56,886 INFO L428 AbstractCegarLoop]: === Iteration 63 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:16:56,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:16:56,887 INFO L82 PathProgramCache]: Analyzing trace with hash -164914690, now seen corresponding path program 38 times [2021-05-03 00:16:56,887 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:16:56,887 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1836963220] [2021-05-03 00:16:56,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:16:56,893 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (+ v_main_~c~0_827 1) v_~SIZE~0_192) (<= v_~last~0_197 v_main_~c~0_827)) InVars {~SIZE~0=v_~SIZE~0_192, main_~c~0=v_main_~c~0_827, ~last~0=v_~last~0_197} OutVars{~SIZE~0=v_~SIZE~0_192, main_~c~0=v_main_~c~0_827, ~last~0=v_~last~0_197} AuxVars[] AssignedVars[] [2021-05-03 00:16:56,894 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size [2021-05-03 00:16:56,895 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:56,897 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:56,907 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:16:56,910 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:16:56,938 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size 78 [2021-05-03 00:16:56,956 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (+ v_main_~c~0_829 1) v_~SIZE~0_193) (< v_main_~c~0_829 v_~last~0_198)) InVars {~SIZE~0=v_~SIZE~0_193, main_~c~0=v_main_~c~0_829, ~last~0=v_~last~0_198} OutVars{~SIZE~0=v_~SIZE~0_193, main_~c~0=v_main_~c~0_829, ~last~0=v_~last~0_198} AuxVars[] AssignedVars[] [2021-05-03 00:16:56,958 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:16:56,970 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:56,972 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:56,985 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:16:56,990 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:16:57,003 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:16:57,020 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:16:57,023 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_~last~0_199 v_main_~c~0_831) (< v_main_~c~0_831 v_~SIZE~0_194)) InVars {~SIZE~0=v_~SIZE~0_194, main_~c~0=v_main_~c~0_831, ~last~0=v_~last~0_199} OutVars{~SIZE~0=v_~SIZE~0_194, main_~c~0=v_main_~c~0_831, ~last~0=v_~last~0_199} AuxVars[] AssignedVars[] [2021-05-03 00:16:57,024 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:16:57,041 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:57,042 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:57,054 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:16:57,057 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:16:57,075 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:16:57,095 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_833 v_~SIZE~0_195) (< v_main_~c~0_833 v_~last~0_200)) InVars {~SIZE~0=v_~SIZE~0_195, main_~c~0=v_main_~c~0_833, ~last~0=v_~last~0_200} OutVars{~SIZE~0=v_~SIZE~0_195, main_~c~0=v_main_~c~0_833, ~last~0=v_~last~0_200} AuxVars[] AssignedVars[] [2021-05-03 00:16:57,097 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size [2021-05-03 00:16:57,110 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:57,112 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:57,125 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:16:57,130 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:16:57,145 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size 66 [2021-05-03 00:16:57,165 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:16:57,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:16:57,229 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:16:57,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:16:57,234 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:16:57,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:16:57,236 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:16:57,239 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:16:57,743 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:16:57,744 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1836963220] [2021-05-03 00:16:57,744 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1836963220] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:16:57,744 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:16:57,744 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2021-05-03 00:16:57,744 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1303040685] [2021-05-03 00:16:57,744 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states [2021-05-03 00:16:57,744 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:16:57,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-05-03 00:16:57,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=385, Unknown=0, NotChecked=0, Total=462 [2021-05-03 00:16:57,745 INFO L87 Difference]: Start difference. First operand 257 states and 311 transitions. Second operand has 20 states, 20 states have (on average 2.3) internal successors, (46), 19 states have internal predecessors, (46), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:16:58,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:16:58,378 INFO L93 Difference]: Finished difference Result 551 states and 653 transitions. [2021-05-03 00:16:58,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-05-03 00:16:58,379 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.3) internal successors, (46), 19 states have internal predecessors, (46), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 52 [2021-05-03 00:16:58,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:16:58,380 INFO L225 Difference]: With dead ends: 551 [2021-05-03 00:16:58,380 INFO L226 Difference]: Without dead ends: 335 [2021-05-03 00:16:58,381 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 12 SyntacticMatches, 17 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 265 ImplicationChecksByTransitivity, 542.4ms TimeCoverageRelationStatistics Valid=90, Invalid=462, Unknown=0, NotChecked=0, Total=552 [2021-05-03 00:16:58,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2021-05-03 00:16:58,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 257. [2021-05-03 00:16:58,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 257 states, 247 states have (on average 1.214574898785425) internal successors, (300), 247 states have internal predecessors, (300), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:16:58,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 311 transitions. [2021-05-03 00:16:58,515 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 311 transitions. Word has length 52 [2021-05-03 00:16:58,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:16:58,515 INFO L480 AbstractCegarLoop]: Abstraction has 257 states and 311 transitions. [2021-05-03 00:16:58,515 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 20 states, 20 states have (on average 2.3) internal successors, (46), 19 states have internal predecessors, (46), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:16:58,515 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 311 transitions. [2021-05-03 00:16:58,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2021-05-03 00:16:58,515 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:16:58,516 INFO L523 BasicCegarLoop]: trace histogram [10, 10, 7, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:16:58,516 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable246 [2021-05-03 00:16:58,516 INFO L428 AbstractCegarLoop]: === Iteration 64 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:16:58,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:16:58,516 INFO L82 PathProgramCache]: Analyzing trace with hash 109844924, now seen corresponding path program 39 times [2021-05-03 00:16:58,516 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:16:58,516 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [823250176] [2021-05-03 00:16:58,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:16:58,522 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_~last~0_201 v_main_~c~0_847) (< (+ v_main_~c~0_847 1) v_~SIZE~0_196)) InVars {~SIZE~0=v_~SIZE~0_196, main_~c~0=v_main_~c~0_847, ~last~0=v_~last~0_201} OutVars{~SIZE~0=v_~SIZE~0_196, main_~c~0=v_main_~c~0_847, ~last~0=v_~last~0_201} AuxVars[] AssignedVars[] [2021-05-03 00:16:58,524 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size [2021-05-03 00:16:58,538 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:58,539 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:58,547 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:16:58,549 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:16:58,568 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size 78 [2021-05-03 00:16:58,585 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (+ v_main_~c~0_849 1) v_~SIZE~0_197) (< v_main_~c~0_849 v_~last~0_202)) InVars {~SIZE~0=v_~SIZE~0_197, main_~c~0=v_main_~c~0_849, ~last~0=v_~last~0_202} OutVars{~SIZE~0=v_~SIZE~0_197, main_~c~0=v_main_~c~0_849, ~last~0=v_~last~0_202} AuxVars[] AssignedVars[] [2021-05-03 00:16:58,586 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:16:58,597 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:58,598 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:58,611 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:16:58,615 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:16:58,627 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:16:58,645 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:16:58,647 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_851 v_~SIZE~0_198) (<= v_~last~0_203 v_main_~c~0_851)) InVars {~SIZE~0=v_~SIZE~0_198, main_~c~0=v_main_~c~0_851, ~last~0=v_~last~0_203} OutVars{~SIZE~0=v_~SIZE~0_198, main_~c~0=v_main_~c~0_851, ~last~0=v_~last~0_203} AuxVars[] AssignedVars[] [2021-05-03 00:16:58,673 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:16:58,674 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:58,676 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:58,685 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:16:58,687 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:16:58,711 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:16:58,728 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_853 v_~SIZE~0_199) (< v_main_~c~0_853 v_~last~0_204)) InVars {~SIZE~0=v_~SIZE~0_199, main_~c~0=v_main_~c~0_853, ~last~0=v_~last~0_204} OutVars{~SIZE~0=v_~SIZE~0_199, main_~c~0=v_main_~c~0_853, ~last~0=v_~last~0_204} AuxVars[] AssignedVars[] [2021-05-03 00:16:58,729 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size [2021-05-03 00:16:58,730 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:58,731 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:58,742 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:16:58,746 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:16:58,767 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size 66 [2021-05-03 00:16:58,782 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:16:58,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:16:58,853 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:16:58,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:16:58,871 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:16:58,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:16:58,872 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:16:58,874 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:16:59,346 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:16:59,346 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [823250176] [2021-05-03 00:16:59,346 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [823250176] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:16:59,346 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:16:59,347 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2021-05-03 00:16:59,347 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1374742173] [2021-05-03 00:16:59,347 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states [2021-05-03 00:16:59,347 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:16:59,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-05-03 00:16:59,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=384, Unknown=0, NotChecked=0, Total=462 [2021-05-03 00:16:59,347 INFO L87 Difference]: Start difference. First operand 257 states and 311 transitions. Second operand has 21 states, 21 states have (on average 2.1904761904761907) internal successors, (46), 20 states have internal predecessors, (46), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:16:59,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:16:59,984 INFO L93 Difference]: Finished difference Result 548 states and 654 transitions. [2021-05-03 00:16:59,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-05-03 00:16:59,984 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.1904761904761907) internal successors, (46), 20 states have internal predecessors, (46), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 52 [2021-05-03 00:16:59,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:16:59,985 INFO L225 Difference]: With dead ends: 548 [2021-05-03 00:16:59,985 INFO L226 Difference]: Without dead ends: 332 [2021-05-03 00:16:59,986 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 12 SyntacticMatches, 16 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 271 ImplicationChecksByTransitivity, 499.8ms TimeCoverageRelationStatistics Valid=94, Invalid=458, Unknown=0, NotChecked=0, Total=552 [2021-05-03 00:16:59,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2021-05-03 00:17:00,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 257. [2021-05-03 00:17:00,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 257 states, 247 states have (on average 1.214574898785425) internal successors, (300), 247 states have internal predecessors, (300), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:17:00,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 311 transitions. [2021-05-03 00:17:00,082 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 311 transitions. Word has length 52 [2021-05-03 00:17:00,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:17:00,082 INFO L480 AbstractCegarLoop]: Abstraction has 257 states and 311 transitions. [2021-05-03 00:17:00,082 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 21 states, 21 states have (on average 2.1904761904761907) internal successors, (46), 20 states have internal predecessors, (46), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:17:00,082 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 311 transitions. [2021-05-03 00:17:00,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2021-05-03 00:17:00,083 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:17:00,083 INFO L523 BasicCegarLoop]: trace histogram [10, 10, 6, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:17:00,083 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable251 [2021-05-03 00:17:00,083 INFO L428 AbstractCegarLoop]: === Iteration 65 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:17:00,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:17:00,083 INFO L82 PathProgramCache]: Analyzing trace with hash 1496048318, now seen corresponding path program 40 times [2021-05-03 00:17:00,083 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:17:00,084 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1831240728] [2021-05-03 00:17:00,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:17:00,089 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (+ v_main_~c~0_867 1) v_~SIZE~0_200) (<= v_~last~0_205 v_main_~c~0_867)) InVars {~SIZE~0=v_~SIZE~0_200, main_~c~0=v_main_~c~0_867, ~last~0=v_~last~0_205} OutVars{~SIZE~0=v_~SIZE~0_200, main_~c~0=v_main_~c~0_867, ~last~0=v_~last~0_205} AuxVars[] AssignedVars[] [2021-05-03 00:17:00,090 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size [2021-05-03 00:17:00,103 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:00,104 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:00,112 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:17:00,114 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:17:00,126 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size 78 [2021-05-03 00:17:00,143 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (+ v_main_~c~0_869 1) v_~SIZE~0_201) (< v_main_~c~0_869 v_~last~0_206)) InVars {~SIZE~0=v_~SIZE~0_201, main_~c~0=v_main_~c~0_869, ~last~0=v_~last~0_206} OutVars{~SIZE~0=v_~SIZE~0_201, main_~c~0=v_main_~c~0_869, ~last~0=v_~last~0_206} AuxVars[] AssignedVars[] [2021-05-03 00:17:00,144 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:17:00,145 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:00,146 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:00,156 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:17:00,160 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:17:00,180 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:17:00,198 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:17:00,200 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_871 v_~SIZE~0_202) (<= v_~last~0_207 v_main_~c~0_871)) InVars {~SIZE~0=v_~SIZE~0_202, main_~c~0=v_main_~c~0_871, ~last~0=v_~last~0_207} OutVars{~SIZE~0=v_~SIZE~0_202, main_~c~0=v_main_~c~0_871, ~last~0=v_~last~0_207} AuxVars[] AssignedVars[] [2021-05-03 00:17:00,201 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:17:00,215 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:00,216 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:00,224 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:17:00,227 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:17:00,240 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:17:00,260 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_873 v_~last~0_208) (< v_main_~c~0_873 v_~SIZE~0_203)) InVars {~SIZE~0=v_~SIZE~0_203, main_~c~0=v_main_~c~0_873, ~last~0=v_~last~0_208} OutVars{~SIZE~0=v_~SIZE~0_203, main_~c~0=v_main_~c~0_873, ~last~0=v_~last~0_208} AuxVars[] AssignedVars[] [2021-05-03 00:17:00,261 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size [2021-05-03 00:17:00,272 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:00,273 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:00,285 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:17:00,289 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:17:00,302 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size 66 [2021-05-03 00:17:00,320 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:17:00,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:17:00,384 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:17:00,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:17:00,387 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:17:00,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:17:00,388 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:17:00,390 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:17:00,850 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:17:00,850 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1831240728] [2021-05-03 00:17:00,850 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1831240728] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:17:00,850 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:17:00,850 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2021-05-03 00:17:00,850 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [885986771] [2021-05-03 00:17:00,850 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states [2021-05-03 00:17:00,851 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:17:00,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2021-05-03 00:17:00,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=459, Unknown=0, NotChecked=0, Total=552 [2021-05-03 00:17:00,851 INFO L87 Difference]: Start difference. First operand 257 states and 311 transitions. Second operand has 22 states, 22 states have (on average 2.090909090909091) internal successors, (46), 21 states have internal predecessors, (46), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:17:01,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:17:01,422 INFO L93 Difference]: Finished difference Result 539 states and 641 transitions. [2021-05-03 00:17:01,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-05-03 00:17:01,423 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 2.090909090909091) internal successors, (46), 21 states have internal predecessors, (46), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 52 [2021-05-03 00:17:01,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:17:01,424 INFO L225 Difference]: With dead ends: 539 [2021-05-03 00:17:01,424 INFO L226 Difference]: Without dead ends: 323 [2021-05-03 00:17:01,425 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 12 SyntacticMatches, 15 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 330 ImplicationChecksByTransitivity, 508.8ms TimeCoverageRelationStatistics Valid=110, Invalid=540, Unknown=0, NotChecked=0, Total=650 [2021-05-03 00:17:01,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2021-05-03 00:17:01,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 257. [2021-05-03 00:17:01,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 257 states, 247 states have (on average 1.214574898785425) internal successors, (300), 247 states have internal predecessors, (300), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:17:01,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 311 transitions. [2021-05-03 00:17:01,526 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 311 transitions. Word has length 52 [2021-05-03 00:17:01,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:17:01,526 INFO L480 AbstractCegarLoop]: Abstraction has 257 states and 311 transitions. [2021-05-03 00:17:01,526 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 22 states, 22 states have (on average 2.090909090909091) internal successors, (46), 21 states have internal predecessors, (46), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:17:01,526 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 311 transitions. [2021-05-03 00:17:01,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2021-05-03 00:17:01,527 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:17:01,527 INFO L523 BasicCegarLoop]: trace histogram [10, 10, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:17:01,527 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable256 [2021-05-03 00:17:01,527 INFO L428 AbstractCegarLoop]: === Iteration 66 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:17:01,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:17:01,527 INFO L82 PathProgramCache]: Analyzing trace with hash 1558087932, now seen corresponding path program 41 times [2021-05-03 00:17:01,527 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:17:01,527 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [146391672] [2021-05-03 00:17:01,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:17:01,532 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_~last~0_209 v_main_~c~0_887) (< (+ v_main_~c~0_887 1) v_~SIZE~0_204)) InVars {~SIZE~0=v_~SIZE~0_204, main_~c~0=v_main_~c~0_887, ~last~0=v_~last~0_209} OutVars{~SIZE~0=v_~SIZE~0_204, main_~c~0=v_main_~c~0_887, ~last~0=v_~last~0_209} AuxVars[] AssignedVars[] [2021-05-03 00:17:01,534 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size [2021-05-03 00:17:01,534 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:01,536 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:01,544 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:17:01,546 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:17:01,570 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size 78 [2021-05-03 00:17:01,588 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_889 v_~last~0_210) (< (+ v_main_~c~0_889 1) v_~SIZE~0_205)) InVars {~SIZE~0=v_~SIZE~0_205, main_~c~0=v_main_~c~0_889, ~last~0=v_~last~0_210} OutVars{~SIZE~0=v_~SIZE~0_205, main_~c~0=v_main_~c~0_889, ~last~0=v_~last~0_210} AuxVars[] AssignedVars[] [2021-05-03 00:17:01,589 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:17:01,599 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:01,600 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:01,611 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:17:01,615 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:17:01,627 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:17:01,645 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:17:01,646 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_~last~0_211 v_main_~c~0_891) (< v_main_~c~0_891 v_~SIZE~0_206)) InVars {~SIZE~0=v_~SIZE~0_206, main_~c~0=v_main_~c~0_891, ~last~0=v_~last~0_211} OutVars{~SIZE~0=v_~SIZE~0_206, main_~c~0=v_main_~c~0_891, ~last~0=v_~last~0_211} AuxVars[] AssignedVars[] [2021-05-03 00:17:01,648 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:17:01,662 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:01,663 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:01,671 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:17:01,673 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:17:01,688 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:17:01,707 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_893 v_~SIZE~0_207) (< v_main_~c~0_893 v_~last~0_212)) InVars {~SIZE~0=v_~SIZE~0_207, main_~c~0=v_main_~c~0_893, ~last~0=v_~last~0_212} OutVars{~SIZE~0=v_~SIZE~0_207, main_~c~0=v_main_~c~0_893, ~last~0=v_~last~0_212} AuxVars[] AssignedVars[] [2021-05-03 00:17:01,708 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size [2021-05-03 00:17:01,719 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:01,720 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:01,732 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:17:01,736 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:17:01,749 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size 66 [2021-05-03 00:17:01,767 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:17:01,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:17:01,831 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:17:01,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:17:01,834 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:17:01,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:17:01,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-03 00:17:01,837 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:17:02,314 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:17:02,314 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [146391672] [2021-05-03 00:17:02,314 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [146391672] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:17:02,314 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:17:02,314 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2021-05-03 00:17:02,315 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668922876] [2021-05-03 00:17:02,315 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states [2021-05-03 00:17:02,315 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:17:02,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-05-03 00:17:02,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=499, Unknown=0, NotChecked=0, Total=600 [2021-05-03 00:17:02,315 INFO L87 Difference]: Start difference. First operand 257 states and 311 transitions. Second operand has 23 states, 23 states have (on average 2.0) internal successors, (46), 22 states have internal predecessors, (46), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:17:02,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:17:02,880 INFO L93 Difference]: Finished difference Result 533 states and 635 transitions. [2021-05-03 00:17:02,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-05-03 00:17:02,881 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.0) internal successors, (46), 22 states have internal predecessors, (46), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 52 [2021-05-03 00:17:02,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:17:02,882 INFO L225 Difference]: With dead ends: 533 [2021-05-03 00:17:02,882 INFO L226 Difference]: Without dead ends: 317 [2021-05-03 00:17:02,882 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 13 SyntacticMatches, 13 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 334 ImplicationChecksByTransitivity, 545.0ms TimeCoverageRelationStatistics Valid=120, Invalid=582, Unknown=0, NotChecked=0, Total=702 [2021-05-03 00:17:02,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2021-05-03 00:17:02,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 257. [2021-05-03 00:17:02,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 257 states, 247 states have (on average 1.214574898785425) internal successors, (300), 247 states have internal predecessors, (300), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:17:02,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 311 transitions. [2021-05-03 00:17:02,986 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 311 transitions. Word has length 52 [2021-05-03 00:17:02,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:17:02,987 INFO L480 AbstractCegarLoop]: Abstraction has 257 states and 311 transitions. [2021-05-03 00:17:02,987 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 23 states, 23 states have (on average 2.0) internal successors, (46), 22 states have internal predecessors, (46), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:17:02,987 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 311 transitions. [2021-05-03 00:17:02,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2021-05-03 00:17:02,987 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:17:02,987 INFO L523 BasicCegarLoop]: trace histogram [10, 10, 6, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:17:02,987 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable261 [2021-05-03 00:17:02,987 INFO L428 AbstractCegarLoop]: === Iteration 67 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:17:02,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:17:02,988 INFO L82 PathProgramCache]: Analyzing trace with hash -247350402, now seen corresponding path program 42 times [2021-05-03 00:17:02,988 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:17:02,988 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [552673218] [2021-05-03 00:17:02,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:17:02,993 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_~last~0_213 v_main_~c~0_907) (< (+ v_main_~c~0_907 1) v_~SIZE~0_208)) InVars {~SIZE~0=v_~SIZE~0_208, main_~c~0=v_main_~c~0_907, ~last~0=v_~last~0_213} OutVars{~SIZE~0=v_~SIZE~0_208, main_~c~0=v_main_~c~0_907, ~last~0=v_~last~0_213} AuxVars[] AssignedVars[] [2021-05-03 00:17:02,995 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size [2021-05-03 00:17:02,996 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:02,997 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:03,005 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:17:03,007 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:17:03,029 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size 78 [2021-05-03 00:17:03,047 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_909 v_~last~0_214) (< (+ v_main_~c~0_909 1) v_~SIZE~0_209)) InVars {~SIZE~0=v_~SIZE~0_209, main_~c~0=v_main_~c~0_909, ~last~0=v_~last~0_214} OutVars{~SIZE~0=v_~SIZE~0_209, main_~c~0=v_main_~c~0_909, ~last~0=v_~last~0_214} AuxVars[] AssignedVars[] [2021-05-03 00:17:03,048 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:17:03,058 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:03,059 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:03,070 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:17:03,074 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:17:03,086 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:17:03,103 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:17:03,105 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_911 v_~SIZE~0_210) (<= v_~last~0_215 v_main_~c~0_911)) InVars {~SIZE~0=v_~SIZE~0_210, main_~c~0=v_main_~c~0_911, ~last~0=v_~last~0_215} OutVars{~SIZE~0=v_~SIZE~0_210, main_~c~0=v_main_~c~0_911, ~last~0=v_~last~0_215} AuxVars[] AssignedVars[] [2021-05-03 00:17:03,106 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:17:03,107 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:03,108 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:03,116 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:17:03,118 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:17:03,143 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:17:03,162 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_913 v_~last~0_216) (< v_main_~c~0_913 v_~SIZE~0_211)) InVars {~SIZE~0=v_~SIZE~0_211, main_~c~0=v_main_~c~0_913, ~last~0=v_~last~0_216} OutVars{~SIZE~0=v_~SIZE~0_211, main_~c~0=v_main_~c~0_913, ~last~0=v_~last~0_216} AuxVars[] AssignedVars[] [2021-05-03 00:17:03,164 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size [2021-05-03 00:17:03,164 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:03,165 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:03,176 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:17:03,180 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:17:03,203 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size 66 [2021-05-03 00:17:03,221 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:17:03,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:17:03,282 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:17:03,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:17:03,286 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:17:03,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:17:03,287 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:17:03,289 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:17:03,900 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:17:03,900 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [552673218] [2021-05-03 00:17:03,900 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [552673218] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:17:03,900 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:17:03,900 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2021-05-03 00:17:03,901 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1867218040] [2021-05-03 00:17:03,901 INFO L460 AbstractCegarLoop]: Interpolant automaton has 24 states [2021-05-03 00:17:03,901 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:17:03,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2021-05-03 00:17:03,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=541, Unknown=0, NotChecked=0, Total=650 [2021-05-03 00:17:03,901 INFO L87 Difference]: Start difference. First operand 257 states and 311 transitions. Second operand has 24 states, 24 states have (on average 1.9166666666666667) internal successors, (46), 23 states have internal predecessors, (46), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:17:04,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:17:04,483 INFO L93 Difference]: Finished difference Result 527 states and 629 transitions. [2021-05-03 00:17:04,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-05-03 00:17:04,483 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 1.9166666666666667) internal successors, (46), 23 states have internal predecessors, (46), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 52 [2021-05-03 00:17:04,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:17:04,485 INFO L225 Difference]: With dead ends: 527 [2021-05-03 00:17:04,485 INFO L226 Difference]: Without dead ends: 311 [2021-05-03 00:17:04,485 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 14 SyntacticMatches, 11 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 325 ImplicationChecksByTransitivity, 631.6ms TimeCoverageRelationStatistics Valid=130, Invalid=626, Unknown=0, NotChecked=0, Total=756 [2021-05-03 00:17:04,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2021-05-03 00:17:04,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 257. [2021-05-03 00:17:04,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 257 states, 247 states have (on average 1.214574898785425) internal successors, (300), 247 states have internal predecessors, (300), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:17:04,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 311 transitions. [2021-05-03 00:17:04,596 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 311 transitions. Word has length 52 [2021-05-03 00:17:04,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:17:04,596 INFO L480 AbstractCegarLoop]: Abstraction has 257 states and 311 transitions. [2021-05-03 00:17:04,596 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 24 states, 24 states have (on average 1.9166666666666667) internal successors, (46), 23 states have internal predecessors, (46), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:17:04,596 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 311 transitions. [2021-05-03 00:17:04,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2021-05-03 00:17:04,597 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:17:04,597 INFO L523 BasicCegarLoop]: trace histogram [10, 10, 7, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:17:04,597 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable266 [2021-05-03 00:17:04,597 INFO L428 AbstractCegarLoop]: === Iteration 68 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:17:04,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:17:04,597 INFO L82 PathProgramCache]: Analyzing trace with hash -1064998852, now seen corresponding path program 43 times [2021-05-03 00:17:04,597 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:17:04,597 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1386753401] [2021-05-03 00:17:04,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:17:04,606 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_~last~0_217 v_main_~c~0_927) (< (+ v_main_~c~0_927 1) v_~SIZE~0_212)) InVars {~SIZE~0=v_~SIZE~0_212, main_~c~0=v_main_~c~0_927, ~last~0=v_~last~0_217} OutVars{~SIZE~0=v_~SIZE~0_212, main_~c~0=v_main_~c~0_927, ~last~0=v_~last~0_217} AuxVars[] AssignedVars[] [2021-05-03 00:17:04,607 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size [2021-05-03 00:17:04,608 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:04,609 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:04,618 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:17:04,620 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:17:04,650 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size 78 [2021-05-03 00:17:04,690 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_929 v_~last~0_218) (< (+ v_main_~c~0_929 1) v_~SIZE~0_213)) InVars {~SIZE~0=v_~SIZE~0_213, main_~c~0=v_main_~c~0_929, ~last~0=v_~last~0_218} OutVars{~SIZE~0=v_~SIZE~0_213, main_~c~0=v_main_~c~0_929, ~last~0=v_~last~0_218} AuxVars[] AssignedVars[] [2021-05-03 00:17:04,691 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:17:04,703 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:04,704 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:04,715 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:17:04,719 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:17:04,732 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:17:04,749 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:17:04,751 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_~last~0_219 v_main_~c~0_931) (< v_main_~c~0_931 v_~SIZE~0_214)) InVars {~SIZE~0=v_~SIZE~0_214, main_~c~0=v_main_~c~0_931, ~last~0=v_~last~0_219} OutVars{~SIZE~0=v_~SIZE~0_214, main_~c~0=v_main_~c~0_931, ~last~0=v_~last~0_219} AuxVars[] AssignedVars[] [2021-05-03 00:17:04,752 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:17:04,753 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:04,754 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:04,763 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:17:04,765 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:17:04,788 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:17:04,805 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_933 v_~last~0_220) (< v_main_~c~0_933 v_~SIZE~0_215)) InVars {~SIZE~0=v_~SIZE~0_215, main_~c~0=v_main_~c~0_933, ~last~0=v_~last~0_220} OutVars{~SIZE~0=v_~SIZE~0_215, main_~c~0=v_main_~c~0_933, ~last~0=v_~last~0_220} AuxVars[] AssignedVars[] [2021-05-03 00:17:04,806 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size [2021-05-03 00:17:04,807 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:04,808 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:04,819 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:17:04,823 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:17:04,844 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size 66 [2021-05-03 00:17:04,859 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:17:04,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:17:04,910 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:17:04,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:17:04,914 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:17:04,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:17:04,915 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:17:04,917 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:17:05,417 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:17:05,417 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1386753401] [2021-05-03 00:17:05,417 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1386753401] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:17:05,417 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:17:05,417 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2021-05-03 00:17:05,417 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1265079072] [2021-05-03 00:17:05,418 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states [2021-05-03 00:17:05,418 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:17:05,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-05-03 00:17:05,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=540, Unknown=0, NotChecked=0, Total=650 [2021-05-03 00:17:05,418 INFO L87 Difference]: Start difference. First operand 257 states and 311 transitions. Second operand has 25 states, 25 states have (on average 1.84) internal successors, (46), 24 states have internal predecessors, (46), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:17:05,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:17:05,979 INFO L93 Difference]: Finished difference Result 512 states and 618 transitions. [2021-05-03 00:17:05,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2021-05-03 00:17:05,980 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 1.84) internal successors, (46), 24 states have internal predecessors, (46), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 52 [2021-05-03 00:17:05,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:17:05,981 INFO L225 Difference]: With dead ends: 512 [2021-05-03 00:17:05,981 INFO L226 Difference]: Without dead ends: 296 [2021-05-03 00:17:05,981 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 12 SyntacticMatches, 12 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 333 ImplicationChecksByTransitivity, 530.7ms TimeCoverageRelationStatistics Valid=134, Invalid=622, Unknown=0, NotChecked=0, Total=756 [2021-05-03 00:17:05,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2021-05-03 00:17:06,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 257. [2021-05-03 00:17:06,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 257 states, 247 states have (on average 1.214574898785425) internal successors, (300), 247 states have internal predecessors, (300), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:17:06,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 311 transitions. [2021-05-03 00:17:06,100 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 311 transitions. Word has length 52 [2021-05-03 00:17:06,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:17:06,100 INFO L480 AbstractCegarLoop]: Abstraction has 257 states and 311 transitions. [2021-05-03 00:17:06,100 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 25 states, 25 states have (on average 1.84) internal successors, (46), 24 states have internal predecessors, (46), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:17:06,100 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 311 transitions. [2021-05-03 00:17:06,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2021-05-03 00:17:06,101 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:17:06,101 INFO L523 BasicCegarLoop]: trace histogram [10, 10, 8, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:17:06,101 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable271 [2021-05-03 00:17:06,101 INFO L428 AbstractCegarLoop]: === Iteration 69 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:17:06,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:17:06,101 INFO L82 PathProgramCache]: Analyzing trace with hash 1641620542, now seen corresponding path program 44 times [2021-05-03 00:17:06,101 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:17:06,101 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1675286318] [2021-05-03 00:17:06,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:17:06,107 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_~last~0_221 v_main_~c~0_947) (< (+ v_main_~c~0_947 1) v_~SIZE~0_216)) InVars {~SIZE~0=v_~SIZE~0_216, main_~c~0=v_main_~c~0_947, ~last~0=v_~last~0_221} OutVars{~SIZE~0=v_~SIZE~0_216, main_~c~0=v_main_~c~0_947, ~last~0=v_~last~0_221} AuxVars[] AssignedVars[] [2021-05-03 00:17:06,109 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size [2021-05-03 00:17:06,109 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:06,111 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:06,122 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:17:06,125 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:17:06,154 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size 78 [2021-05-03 00:17:06,172 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_949 v_~last~0_222) (< (+ v_main_~c~0_949 1) v_~SIZE~0_217)) InVars {~SIZE~0=v_~SIZE~0_217, main_~c~0=v_main_~c~0_949, ~last~0=v_~last~0_222} OutVars{~SIZE~0=v_~SIZE~0_217, main_~c~0=v_main_~c~0_949, ~last~0=v_~last~0_222} AuxVars[] AssignedVars[] [2021-05-03 00:17:06,173 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:17:06,174 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:06,175 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:06,186 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:17:06,189 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:17:06,210 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:17:06,227 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:17:06,229 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_951 v_~SIZE~0_218) (<= v_~last~0_223 v_main_~c~0_951)) InVars {~SIZE~0=v_~SIZE~0_218, main_~c~0=v_main_~c~0_951, ~last~0=v_~last~0_223} OutVars{~SIZE~0=v_~SIZE~0_218, main_~c~0=v_main_~c~0_951, ~last~0=v_~last~0_223} AuxVars[] AssignedVars[] [2021-05-03 00:17:06,231 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:17:06,246 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:06,247 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:06,256 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:17:06,259 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:17:06,275 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:17:06,297 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_953 v_~last~0_224) (< v_main_~c~0_953 v_~SIZE~0_219)) InVars {~SIZE~0=v_~SIZE~0_219, main_~c~0=v_main_~c~0_953, ~last~0=v_~last~0_224} OutVars{~SIZE~0=v_~SIZE~0_219, main_~c~0=v_main_~c~0_953, ~last~0=v_~last~0_224} AuxVars[] AssignedVars[] [2021-05-03 00:17:06,299 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size [2021-05-03 00:17:06,300 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:06,301 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:06,314 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:17:06,319 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:17:06,343 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size 66 [2021-05-03 00:17:06,364 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:17:06,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:17:06,440 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:17:06,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:17:06,444 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:17:06,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:17:06,446 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:17:06,448 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:17:07,104 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:17:07,104 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1675286318] [2021-05-03 00:17:07,104 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1675286318] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:17:07,104 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:17:07,104 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2021-05-03 00:17:07,104 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016394917] [2021-05-03 00:17:07,105 INFO L460 AbstractCegarLoop]: Interpolant automaton has 26 states [2021-05-03 00:17:07,105 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:17:07,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2021-05-03 00:17:07,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=631, Unknown=0, NotChecked=0, Total=756 [2021-05-03 00:17:07,105 INFO L87 Difference]: Start difference. First operand 257 states and 311 transitions. Second operand has 26 states, 26 states have (on average 1.7692307692307692) internal successors, (46), 25 states have internal predecessors, (46), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:17:07,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:17:07,853 INFO L93 Difference]: Finished difference Result 518 states and 620 transitions. [2021-05-03 00:17:07,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2021-05-03 00:17:07,854 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 1.7692307692307692) internal successors, (46), 25 states have internal predecessors, (46), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 52 [2021-05-03 00:17:07,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:17:07,855 INFO L225 Difference]: With dead ends: 518 [2021-05-03 00:17:07,855 INFO L226 Difference]: Without dead ends: 302 [2021-05-03 00:17:07,856 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 12 SyntacticMatches, 11 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 352 ImplicationChecksByTransitivity, 707.4ms TimeCoverageRelationStatistics Valid=150, Invalid=720, Unknown=0, NotChecked=0, Total=870 [2021-05-03 00:17:07,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2021-05-03 00:17:07,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 257. [2021-05-03 00:17:07,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 257 states, 247 states have (on average 1.214574898785425) internal successors, (300), 247 states have internal predecessors, (300), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:17:07,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 311 transitions. [2021-05-03 00:17:07,971 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 311 transitions. Word has length 52 [2021-05-03 00:17:07,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:17:07,972 INFO L480 AbstractCegarLoop]: Abstraction has 257 states and 311 transitions. [2021-05-03 00:17:07,972 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 26 states, 26 states have (on average 1.7692307692307692) internal successors, (46), 25 states have internal predecessors, (46), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:17:07,972 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 311 transitions. [2021-05-03 00:17:07,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2021-05-03 00:17:07,972 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:17:07,972 INFO L523 BasicCegarLoop]: trace histogram [10, 10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:17:07,973 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable276 [2021-05-03 00:17:07,973 INFO L428 AbstractCegarLoop]: === Iteration 70 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:17:07,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:17:07,973 INFO L82 PathProgramCache]: Analyzing trace with hash 630503292, now seen corresponding path program 45 times [2021-05-03 00:17:07,973 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:17:07,973 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [719411135] [2021-05-03 00:17:07,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:17:07,979 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (+ v_main_~c~0_967 1) v_~SIZE~0_220) (< v_main_~c~0_967 v_~last~0_225)) InVars {~SIZE~0=v_~SIZE~0_220, main_~c~0=v_main_~c~0_967, ~last~0=v_~last~0_225} OutVars{~SIZE~0=v_~SIZE~0_220, main_~c~0=v_main_~c~0_967, ~last~0=v_~last~0_225} AuxVars[] AssignedVars[] [2021-05-03 00:17:07,981 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:17:07,982 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:07,983 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:07,996 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:17:08,001 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:17:08,023 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:17:08,040 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:17:08,042 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_~last~0_226 v_main_~c~0_969) (< v_main_~c~0_969 v_~SIZE~0_221)) InVars {~SIZE~0=v_~SIZE~0_221, main_~c~0=v_main_~c~0_969, ~last~0=v_~last~0_226} OutVars{~SIZE~0=v_~SIZE~0_221, main_~c~0=v_main_~c~0_969, ~last~0=v_~last~0_226} AuxVars[] AssignedVars[] [2021-05-03 00:17:08,043 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:17:08,044 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:08,045 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:08,053 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:17:08,055 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:17:08,081 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:17:08,100 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_971 v_~SIZE~0_222) (< v_main_~c~0_971 v_~last~0_227)) InVars {~SIZE~0=v_~SIZE~0_222, main_~c~0=v_main_~c~0_971, ~last~0=v_~last~0_227} OutVars{~SIZE~0=v_~SIZE~0_222, main_~c~0=v_main_~c~0_971, ~last~0=v_~last~0_227} AuxVars[] AssignedVars[] [2021-05-03 00:17:08,101 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size [2021-05-03 00:17:08,102 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:08,103 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:08,114 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:17:08,118 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:17:08,140 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size 66 [2021-05-03 00:17:08,159 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:17:08,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:17:08,206 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:17:08,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:17:08,210 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:17:08,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:17:08,211 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:17:08,214 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:17:08,819 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:17:08,819 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [719411135] [2021-05-03 00:17:08,819 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [719411135] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:17:08,819 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:17:08,819 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2021-05-03 00:17:08,819 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105432837] [2021-05-03 00:17:08,819 INFO L460 AbstractCegarLoop]: Interpolant automaton has 27 states [2021-05-03 00:17:08,819 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:17:08,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2021-05-03 00:17:08,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=630, Unknown=0, NotChecked=0, Total=756 [2021-05-03 00:17:08,820 INFO L87 Difference]: Start difference. First operand 257 states and 311 transitions. Second operand has 27 states, 27 states have (on average 1.7037037037037037) internal successors, (46), 26 states have internal predecessors, (46), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:17:09,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:17:09,327 INFO L93 Difference]: Finished difference Result 506 states and 618 transitions. [2021-05-03 00:17:09,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2021-05-03 00:17:09,328 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 1.7037037037037037) internal successors, (46), 26 states have internal predecessors, (46), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 52 [2021-05-03 00:17:09,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:17:09,329 INFO L225 Difference]: With dead ends: 506 [2021-05-03 00:17:09,329 INFO L226 Difference]: Without dead ends: 290 [2021-05-03 00:17:09,330 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 12 SyntacticMatches, 10 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 310 ImplicationChecksByTransitivity, 622.5ms TimeCoverageRelationStatistics Valid=154, Invalid=716, Unknown=0, NotChecked=0, Total=870 [2021-05-03 00:17:09,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2021-05-03 00:17:09,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 237. [2021-05-03 00:17:09,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 237 states, 227 states have (on average 1.2070484581497798) internal successors, (274), 228 states have internal predecessors, (274), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:17:09,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 285 transitions. [2021-05-03 00:17:09,430 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 285 transitions. Word has length 52 [2021-05-03 00:17:09,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:17:09,430 INFO L480 AbstractCegarLoop]: Abstraction has 237 states and 285 transitions. [2021-05-03 00:17:09,430 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 27 states, 27 states have (on average 1.7037037037037037) internal successors, (46), 26 states have internal predecessors, (46), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:17:09,430 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 285 transitions. [2021-05-03 00:17:09,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2021-05-03 00:17:09,430 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:17:09,430 INFO L523 BasicCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:17:09,430 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable280 [2021-05-03 00:17:09,431 INFO L428 AbstractCegarLoop]: === Iteration 71 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:17:09,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:17:09,431 INFO L82 PathProgramCache]: Analyzing trace with hash 464962942, now seen corresponding path program 10 times [2021-05-03 00:17:09,431 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:17:09,431 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [118813652] [2021-05-03 00:17:09,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:17:09,434 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_985 v_~last~0_228) (< (+ v_main_~c~0_985 1) v_~SIZE~0_223)) InVars {~SIZE~0=v_~SIZE~0_223, main_~c~0=v_main_~c~0_985, ~last~0=v_~last~0_228} OutVars{~SIZE~0=v_~SIZE~0_223, main_~c~0=v_main_~c~0_985, ~last~0=v_~last~0_228} AuxVars[] AssignedVars[] [2021-05-03 00:17:09,436 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:17:09,436 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:09,437 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:09,447 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:17:09,451 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:17:09,471 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:17:09,488 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:17:09,489 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_987 v_~last~0_229) (< v_main_~c~0_987 v_~SIZE~0_224)) InVars {~SIZE~0=v_~SIZE~0_224, main_~c~0=v_main_~c~0_987, ~last~0=v_~last~0_229} OutVars{~SIZE~0=v_~SIZE~0_224, main_~c~0=v_main_~c~0_987, ~last~0=v_~last~0_229} AuxVars[] AssignedVars[] [2021-05-03 00:17:09,490 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size [2021-05-03 00:17:09,491 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:09,492 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:09,503 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:17:09,507 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:17:09,528 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size 66 [2021-05-03 00:17:09,545 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:17:09,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:17:09,632 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:17:09,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:17:09,636 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:17:09,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:17:09,637 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:17:10,386 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:17:10,387 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [118813652] [2021-05-03 00:17:10,387 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [118813652] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:17:10,387 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:17:10,387 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [31] imperfect sequences [] total 31 [2021-05-03 00:17:10,387 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [547537718] [2021-05-03 00:17:10,387 INFO L460 AbstractCegarLoop]: Interpolant automaton has 31 states [2021-05-03 00:17:10,387 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:17:10,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2021-05-03 00:17:10,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=906, Unknown=0, NotChecked=0, Total=1056 [2021-05-03 00:17:10,388 INFO L87 Difference]: Start difference. First operand 237 states and 285 transitions. Second operand has 31 states, 31 states have (on average 1.4838709677419355) internal successors, (46), 29 states have internal predecessors, (46), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:17:11,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:17:11,631 INFO L93 Difference]: Finished difference Result 543 states and 655 transitions. [2021-05-03 00:17:11,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2021-05-03 00:17:11,632 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 1.4838709677419355) internal successors, (46), 29 states have internal predecessors, (46), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 52 [2021-05-03 00:17:11,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:17:11,633 INFO L225 Difference]: With dead ends: 543 [2021-05-03 00:17:11,633 INFO L226 Difference]: Without dead ends: 318 [2021-05-03 00:17:11,633 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 6 SyntacticMatches, 9 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 522 ImplicationChecksByTransitivity, 1175.4ms TimeCoverageRelationStatistics Valid=240, Invalid=1740, Unknown=0, NotChecked=0, Total=1980 [2021-05-03 00:17:11,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2021-05-03 00:17:11,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 269. [2021-05-03 00:17:11,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 269 states, 259 states have (on average 1.22007722007722) internal successors, (316), 259 states have internal predecessors, (316), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:17:11,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 327 transitions. [2021-05-03 00:17:11,751 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 327 transitions. Word has length 52 [2021-05-03 00:17:11,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:17:11,751 INFO L480 AbstractCegarLoop]: Abstraction has 269 states and 327 transitions. [2021-05-03 00:17:11,751 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 31 states, 31 states have (on average 1.4838709677419355) internal successors, (46), 29 states have internal predecessors, (46), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:17:11,751 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 327 transitions. [2021-05-03 00:17:11,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2021-05-03 00:17:11,752 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:17:11,752 INFO L523 BasicCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:17:11,752 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable283 [2021-05-03 00:17:11,752 INFO L428 AbstractCegarLoop]: === Iteration 72 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:17:11,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:17:11,752 INFO L82 PathProgramCache]: Analyzing trace with hash 1857944317, now seen corresponding path program 11 times [2021-05-03 00:17:11,752 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:17:11,752 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1341547252] [2021-05-03 00:17:11,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:17:11,757 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_~last~0_230 v_main_~c~0_1000) (< (+ v_main_~c~0_1000 1) v_~SIZE~0_225)) InVars {~SIZE~0=v_~SIZE~0_225, main_~c~0=v_main_~c~0_1000, ~last~0=v_~last~0_230} OutVars{~SIZE~0=v_~SIZE~0_225, main_~c~0=v_main_~c~0_1000, ~last~0=v_~last~0_230} AuxVars[] AssignedVars[] [2021-05-03 00:17:11,758 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size [2021-05-03 00:17:11,771 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:11,772 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:11,779 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:17:11,781 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:17:11,793 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size 78 [2021-05-03 00:17:11,808 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:17:11,809 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_~last~0_231 v_main_~c~0_1002) (< v_main_~c~0_1002 v_~SIZE~0_226)) InVars {~SIZE~0=v_~SIZE~0_226, main_~c~0=v_main_~c~0_1002, ~last~0=v_~last~0_231} OutVars{~SIZE~0=v_~SIZE~0_226, main_~c~0=v_main_~c~0_1002, ~last~0=v_~last~0_231} AuxVars[] AssignedVars[] [2021-05-03 00:17:11,811 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:17:11,811 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:11,812 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:11,821 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:17:11,823 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:17:11,844 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:17:11,860 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:17:11,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:17:11,903 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:17:11,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:17:11,907 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:17:11,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:17:11,908 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:17:12,407 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:17:12,408 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1341547252] [2021-05-03 00:17:12,408 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1341547252] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:17:12,408 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:17:12,408 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2021-05-03 00:17:12,408 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624001293] [2021-05-03 00:17:12,408 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-05-03 00:17:12,408 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:17:12,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-05-03 00:17:12,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=312, Unknown=0, NotChecked=0, Total=380 [2021-05-03 00:17:12,409 INFO L87 Difference]: Start difference. First operand 269 states and 327 transitions. Second operand has 19 states, 19 states have (on average 2.5789473684210527) internal successors, (49), 18 states have internal predecessors, (49), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:17:13,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:17:13,057 INFO L93 Difference]: Finished difference Result 587 states and 696 transitions. [2021-05-03 00:17:13,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-05-03 00:17:13,058 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.5789473684210527) internal successors, (49), 18 states have internal predecessors, (49), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 55 [2021-05-03 00:17:13,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:17:13,059 INFO L225 Difference]: With dead ends: 587 [2021-05-03 00:17:13,059 INFO L226 Difference]: Without dead ends: 362 [2021-05-03 00:17:13,060 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 14 SyntacticMatches, 20 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 515.9ms TimeCoverageRelationStatistics Valid=72, Invalid=348, Unknown=0, NotChecked=0, Total=420 [2021-05-03 00:17:13,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2021-05-03 00:17:13,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 278. [2021-05-03 00:17:13,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 278 states, 268 states have (on average 1.212686567164179) internal successors, (325), 268 states have internal predecessors, (325), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:17:13,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 336 transitions. [2021-05-03 00:17:13,184 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 336 transitions. Word has length 55 [2021-05-03 00:17:13,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:17:13,184 INFO L480 AbstractCegarLoop]: Abstraction has 278 states and 336 transitions. [2021-05-03 00:17:13,184 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 2.5789473684210527) internal successors, (49), 18 states have internal predecessors, (49), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:17:13,184 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 336 transitions. [2021-05-03 00:17:13,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2021-05-03 00:17:13,185 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:17:13,185 INFO L523 BasicCegarLoop]: trace histogram [11, 11, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:17:13,185 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable286 [2021-05-03 00:17:13,185 INFO L428 AbstractCegarLoop]: === Iteration 73 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:17:13,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:17:13,185 INFO L82 PathProgramCache]: Analyzing trace with hash -2013376257, now seen corresponding path program 46 times [2021-05-03 00:17:13,185 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:17:13,186 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [835281116] [2021-05-03 00:17:13,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:17:13,191 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_~last~0_232 v_main_~c~0_1016) (< (+ v_main_~c~0_1016 1) v_~SIZE~0_227)) InVars {~SIZE~0=v_~SIZE~0_227, main_~c~0=v_main_~c~0_1016, ~last~0=v_~last~0_232} OutVars{~SIZE~0=v_~SIZE~0_227, main_~c~0=v_main_~c~0_1016, ~last~0=v_~last~0_232} AuxVars[] AssignedVars[] [2021-05-03 00:17:13,193 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size [2021-05-03 00:17:13,205 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:13,207 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:13,216 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:17:13,218 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:17:13,229 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size 78 [2021-05-03 00:17:13,242 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (+ v_main_~c~0_1018 1) v_~SIZE~0_228) (< v_main_~c~0_1018 v_~last~0_233)) InVars {~SIZE~0=v_~SIZE~0_228, main_~c~0=v_main_~c~0_1018, ~last~0=v_~last~0_233} OutVars{~SIZE~0=v_~SIZE~0_228, main_~c~0=v_main_~c~0_1018, ~last~0=v_~last~0_233} AuxVars[] AssignedVars[] [2021-05-03 00:17:13,243 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:17:13,244 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:13,245 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:13,255 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:17:13,259 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:17:13,276 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:17:13,288 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:17:13,290 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_1020 v_~SIZE~0_229) (<= v_~last~0_234 v_main_~c~0_1020)) InVars {~SIZE~0=v_~SIZE~0_229, main_~c~0=v_main_~c~0_1020, ~last~0=v_~last~0_234} OutVars{~SIZE~0=v_~SIZE~0_229, main_~c~0=v_main_~c~0_1020, ~last~0=v_~last~0_234} AuxVars[] AssignedVars[] [2021-05-03 00:17:13,291 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:17:13,304 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:13,305 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:13,312 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:17:13,314 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:17:13,324 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:17:13,338 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_1022 v_~last~0_235) (< v_main_~c~0_1022 v_~SIZE~0_230)) InVars {~SIZE~0=v_~SIZE~0_230, main_~c~0=v_main_~c~0_1022, ~last~0=v_~last~0_235} OutVars{~SIZE~0=v_~SIZE~0_230, main_~c~0=v_main_~c~0_1022, ~last~0=v_~last~0_235} AuxVars[] AssignedVars[] [2021-05-03 00:17:13,339 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size [2021-05-03 00:17:13,350 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:13,352 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:13,361 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:17:13,364 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:17:13,374 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size 66 [2021-05-03 00:17:13,389 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:17:13,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:17:13,458 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:17:13,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:17:13,462 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:17:13,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:17:13,466 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:17:13,468 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:17:13,893 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:17:13,893 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [835281116] [2021-05-03 00:17:13,893 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [835281116] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:17:13,894 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:17:13,894 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2021-05-03 00:17:13,894 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1636327685] [2021-05-03 00:17:13,894 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states [2021-05-03 00:17:13,894 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:17:13,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-05-03 00:17:13,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=355, Unknown=0, NotChecked=0, Total=420 [2021-05-03 00:17:13,894 INFO L87 Difference]: Start difference. First operand 278 states and 336 transitions. Second operand has 20 states, 20 states have (on average 2.45) internal successors, (49), 19 states have internal predecessors, (49), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:17:14,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:17:14,701 INFO L93 Difference]: Finished difference Result 614 states and 727 transitions. [2021-05-03 00:17:14,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-05-03 00:17:14,702 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.45) internal successors, (49), 19 states have internal predecessors, (49), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 55 [2021-05-03 00:17:14,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:17:14,703 INFO L225 Difference]: With dead ends: 614 [2021-05-03 00:17:14,703 INFO L226 Difference]: Without dead ends: 380 [2021-05-03 00:17:14,704 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 13 SyntacticMatches, 19 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 198 ImplicationChecksByTransitivity, 450.8ms TimeCoverageRelationStatistics Valid=77, Invalid=429, Unknown=0, NotChecked=0, Total=506 [2021-05-03 00:17:14,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2021-05-03 00:17:14,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 278. [2021-05-03 00:17:14,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 278 states, 268 states have (on average 1.212686567164179) internal successors, (325), 268 states have internal predecessors, (325), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:17:14,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 336 transitions. [2021-05-03 00:17:14,837 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 336 transitions. Word has length 55 [2021-05-03 00:17:14,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:17:14,837 INFO L480 AbstractCegarLoop]: Abstraction has 278 states and 336 transitions. [2021-05-03 00:17:14,837 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 20 states, 20 states have (on average 2.45) internal successors, (49), 19 states have internal predecessors, (49), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:17:14,837 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 336 transitions. [2021-05-03 00:17:14,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2021-05-03 00:17:14,837 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:17:14,837 INFO L523 BasicCegarLoop]: trace histogram [11, 11, 9, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:17:14,837 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable291 [2021-05-03 00:17:14,838 INFO L428 AbstractCegarLoop]: === Iteration 74 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:17:14,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:17:14,838 INFO L82 PathProgramCache]: Analyzing trace with hash 1252231741, now seen corresponding path program 47 times [2021-05-03 00:17:14,838 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:17:14,838 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [119586303] [2021-05-03 00:17:14,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:17:14,866 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (+ v_main_~c~0_1037 1) v_~SIZE~0_231) (<= v_~last~0_236 v_main_~c~0_1037)) InVars {~SIZE~0=v_~SIZE~0_231, main_~c~0=v_main_~c~0_1037, ~last~0=v_~last~0_236} OutVars{~SIZE~0=v_~SIZE~0_231, main_~c~0=v_main_~c~0_1037, ~last~0=v_~last~0_236} AuxVars[] AssignedVars[] [2021-05-03 00:17:14,868 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size [2021-05-03 00:17:14,869 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:14,870 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:14,880 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:17:14,882 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:17:14,917 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size 78 [2021-05-03 00:17:14,936 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_1039 v_~last~0_237) (< (+ v_main_~c~0_1039 1) v_~SIZE~0_232)) InVars {~SIZE~0=v_~SIZE~0_232, main_~c~0=v_main_~c~0_1039, ~last~0=v_~last~0_237} OutVars{~SIZE~0=v_~SIZE~0_232, main_~c~0=v_main_~c~0_1039, ~last~0=v_~last~0_237} AuxVars[] AssignedVars[] [2021-05-03 00:17:14,938 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:17:14,938 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:14,939 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:14,951 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:17:14,955 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:17:14,978 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:17:14,997 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:17:14,999 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_1041 v_~SIZE~0_233) (<= v_~last~0_238 v_main_~c~0_1041)) InVars {~SIZE~0=v_~SIZE~0_233, main_~c~0=v_main_~c~0_1041, ~last~0=v_~last~0_238} OutVars{~SIZE~0=v_~SIZE~0_233, main_~c~0=v_main_~c~0_1041, ~last~0=v_~last~0_238} AuxVars[] AssignedVars[] [2021-05-03 00:17:15,000 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:17:15,001 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:15,002 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:15,012 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:17:15,014 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:17:15,040 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:17:15,060 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_1043 v_~last~0_239) (< v_main_~c~0_1043 v_~SIZE~0_234)) InVars {~SIZE~0=v_~SIZE~0_234, main_~c~0=v_main_~c~0_1043, ~last~0=v_~last~0_239} OutVars{~SIZE~0=v_~SIZE~0_234, main_~c~0=v_main_~c~0_1043, ~last~0=v_~last~0_239} AuxVars[] AssignedVars[] [2021-05-03 00:17:15,062 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size [2021-05-03 00:17:15,073 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:15,074 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:15,086 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:17:15,090 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:17:15,103 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size 66 [2021-05-03 00:17:15,123 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:17:15,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:17:15,183 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:17:15,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:17:15,187 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:17:15,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:17:15,188 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:17:15,189 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:17:15,726 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:17:15,726 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [119586303] [2021-05-03 00:17:15,726 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [119586303] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:17:15,726 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:17:15,727 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2021-05-03 00:17:15,727 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1640155042] [2021-05-03 00:17:15,727 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states [2021-05-03 00:17:15,727 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:17:15,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-05-03 00:17:15,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=426, Unknown=0, NotChecked=0, Total=506 [2021-05-03 00:17:15,727 INFO L87 Difference]: Start difference. First operand 278 states and 336 transitions. Second operand has 21 states, 21 states have (on average 2.3333333333333335) internal successors, (49), 20 states have internal predecessors, (49), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:17:16,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:17:16,414 INFO L93 Difference]: Finished difference Result 599 states and 708 transitions. [2021-05-03 00:17:16,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-05-03 00:17:16,414 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.3333333333333335) internal successors, (49), 20 states have internal predecessors, (49), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 55 [2021-05-03 00:17:16,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:17:16,416 INFO L225 Difference]: With dead ends: 599 [2021-05-03 00:17:16,416 INFO L226 Difference]: Without dead ends: 365 [2021-05-03 00:17:16,416 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 12 SyntacticMatches, 19 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 292 ImplicationChecksByTransitivity, 577.5ms TimeCoverageRelationStatistics Valid=93, Invalid=507, Unknown=0, NotChecked=0, Total=600 [2021-05-03 00:17:16,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2021-05-03 00:17:16,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 278. [2021-05-03 00:17:16,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 278 states, 268 states have (on average 1.212686567164179) internal successors, (325), 268 states have internal predecessors, (325), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:17:16,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 336 transitions. [2021-05-03 00:17:16,568 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 336 transitions. Word has length 55 [2021-05-03 00:17:16,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:17:16,568 INFO L480 AbstractCegarLoop]: Abstraction has 278 states and 336 transitions. [2021-05-03 00:17:16,568 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 21 states, 21 states have (on average 2.3333333333333335) internal successors, (49), 20 states have internal predecessors, (49), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:17:16,568 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 336 transitions. [2021-05-03 00:17:16,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2021-05-03 00:17:16,569 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:17:16,569 INFO L523 BasicCegarLoop]: trace histogram [11, 11, 8, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:17:16,569 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable296 [2021-05-03 00:17:16,569 INFO L428 AbstractCegarLoop]: === Iteration 75 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:17:16,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:17:16,569 INFO L82 PathProgramCache]: Analyzing trace with hash 408226239, now seen corresponding path program 48 times [2021-05-03 00:17:16,569 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:17:16,569 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [164682739] [2021-05-03 00:17:16,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:17:16,575 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (+ v_main_~c~0_1058 1) v_~SIZE~0_235) (<= v_~last~0_240 v_main_~c~0_1058)) InVars {~SIZE~0=v_~SIZE~0_235, main_~c~0=v_main_~c~0_1058, ~last~0=v_~last~0_240} OutVars{~SIZE~0=v_~SIZE~0_235, main_~c~0=v_main_~c~0_1058, ~last~0=v_~last~0_240} AuxVars[] AssignedVars[] [2021-05-03 00:17:16,577 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size [2021-05-03 00:17:16,577 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:16,578 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:16,587 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:17:16,590 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:17:16,612 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size 78 [2021-05-03 00:17:16,629 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (+ v_main_~c~0_1060 1) v_~SIZE~0_236) (< v_main_~c~0_1060 v_~last~0_241)) InVars {~SIZE~0=v_~SIZE~0_236, main_~c~0=v_main_~c~0_1060, ~last~0=v_~last~0_241} OutVars{~SIZE~0=v_~SIZE~0_236, main_~c~0=v_main_~c~0_1060, ~last~0=v_~last~0_241} AuxVars[] AssignedVars[] [2021-05-03 00:17:16,630 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:17:16,631 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:16,632 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:16,642 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:17:16,646 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:17:16,667 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:17:16,683 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:17:16,685 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_1062 v_~SIZE~0_237) (<= v_~last~0_242 v_main_~c~0_1062)) InVars {~SIZE~0=v_~SIZE~0_237, main_~c~0=v_main_~c~0_1062, ~last~0=v_~last~0_242} OutVars{~SIZE~0=v_~SIZE~0_237, main_~c~0=v_main_~c~0_1062, ~last~0=v_~last~0_242} AuxVars[] AssignedVars[] [2021-05-03 00:17:16,686 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:17:16,687 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:16,688 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:16,697 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:17:16,700 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:17:16,725 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:17:16,745 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_1064 v_~last~0_243) (< v_main_~c~0_1064 v_~SIZE~0_238)) InVars {~SIZE~0=v_~SIZE~0_238, main_~c~0=v_main_~c~0_1064, ~last~0=v_~last~0_243} OutVars{~SIZE~0=v_~SIZE~0_238, main_~c~0=v_main_~c~0_1064, ~last~0=v_~last~0_243} AuxVars[] AssignedVars[] [2021-05-03 00:17:16,746 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size [2021-05-03 00:17:16,747 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:16,748 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:16,760 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:17:16,764 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:17:16,787 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size 66 [2021-05-03 00:17:16,805 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:17:16,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:17:16,898 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:17:16,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:17:16,902 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:17:16,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:17:16,903 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:17:16,905 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:17:17,489 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:17:17,489 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [164682739] [2021-05-03 00:17:17,489 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [164682739] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:17:17,489 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:17:17,489 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2021-05-03 00:17:17,489 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2016369133] [2021-05-03 00:17:17,490 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states [2021-05-03 00:17:17,490 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:17:17,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2021-05-03 00:17:17,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=464, Unknown=0, NotChecked=0, Total=552 [2021-05-03 00:17:17,491 INFO L87 Difference]: Start difference. First operand 278 states and 336 transitions. Second operand has 22 states, 22 states have (on average 2.227272727272727) internal successors, (49), 21 states have internal predecessors, (49), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:17:18,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:17:18,208 INFO L93 Difference]: Finished difference Result 593 states and 702 transitions. [2021-05-03 00:17:18,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-05-03 00:17:18,209 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 2.227272727272727) internal successors, (49), 21 states have internal predecessors, (49), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 55 [2021-05-03 00:17:18,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:17:18,210 INFO L225 Difference]: With dead ends: 593 [2021-05-03 00:17:18,210 INFO L226 Difference]: Without dead ends: 359 [2021-05-03 00:17:18,211 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 12 SyntacticMatches, 18 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 335 ImplicationChecksByTransitivity, 629.4ms TimeCoverageRelationStatistics Valid=103, Invalid=547, Unknown=0, NotChecked=0, Total=650 [2021-05-03 00:17:18,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2021-05-03 00:17:18,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 278. [2021-05-03 00:17:18,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 278 states, 268 states have (on average 1.212686567164179) internal successors, (325), 268 states have internal predecessors, (325), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:17:18,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 336 transitions. [2021-05-03 00:17:18,361 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 336 transitions. Word has length 55 [2021-05-03 00:17:18,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:17:18,361 INFO L480 AbstractCegarLoop]: Abstraction has 278 states and 336 transitions. [2021-05-03 00:17:18,361 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 22 states, 22 states have (on average 2.227272727272727) internal successors, (49), 21 states have internal predecessors, (49), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:17:18,361 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 336 transitions. [2021-05-03 00:17:18,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2021-05-03 00:17:18,362 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:17:18,362 INFO L523 BasicCegarLoop]: trace histogram [11, 11, 7, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:17:18,362 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable301 [2021-05-03 00:17:18,362 INFO L428 AbstractCegarLoop]: === Iteration 76 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:17:18,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:17:18,362 INFO L82 PathProgramCache]: Analyzing trace with hash 682985853, now seen corresponding path program 49 times [2021-05-03 00:17:18,362 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:17:18,362 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [93348766] [2021-05-03 00:17:18,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:17:18,368 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_~last~0_244 v_main_~c~0_1079) (< (+ v_main_~c~0_1079 1) v_~SIZE~0_239)) InVars {~SIZE~0=v_~SIZE~0_239, main_~c~0=v_main_~c~0_1079, ~last~0=v_~last~0_244} OutVars{~SIZE~0=v_~SIZE~0_239, main_~c~0=v_main_~c~0_1079, ~last~0=v_~last~0_244} AuxVars[] AssignedVars[] [2021-05-03 00:17:18,370 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size [2021-05-03 00:17:18,383 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:18,385 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:18,394 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:17:18,397 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:17:18,411 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size 78 [2021-05-03 00:17:18,429 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (+ v_main_~c~0_1081 1) v_~SIZE~0_240) (< v_main_~c~0_1081 v_~last~0_245)) InVars {~SIZE~0=v_~SIZE~0_240, main_~c~0=v_main_~c~0_1081, ~last~0=v_~last~0_245} OutVars{~SIZE~0=v_~SIZE~0_240, main_~c~0=v_main_~c~0_1081, ~last~0=v_~last~0_245} AuxVars[] AssignedVars[] [2021-05-03 00:17:18,431 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:17:18,445 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:18,447 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:18,458 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:17:18,463 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:17:18,499 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:17:18,518 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:17:18,520 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_1083 v_~SIZE~0_241) (<= v_~last~0_246 v_main_~c~0_1083)) InVars {~SIZE~0=v_~SIZE~0_241, main_~c~0=v_main_~c~0_1083, ~last~0=v_~last~0_246} OutVars{~SIZE~0=v_~SIZE~0_241, main_~c~0=v_main_~c~0_1083, ~last~0=v_~last~0_246} AuxVars[] AssignedVars[] [2021-05-03 00:17:18,522 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:17:18,522 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:18,523 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:18,532 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:17:18,534 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:17:18,559 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:17:18,580 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_1085 v_~SIZE~0_242) (< v_main_~c~0_1085 v_~last~0_247)) InVars {~SIZE~0=v_~SIZE~0_242, main_~c~0=v_main_~c~0_1085, ~last~0=v_~last~0_247} OutVars{~SIZE~0=v_~SIZE~0_242, main_~c~0=v_main_~c~0_1085, ~last~0=v_~last~0_247} AuxVars[] AssignedVars[] [2021-05-03 00:17:18,581 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size [2021-05-03 00:17:18,582 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:18,583 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:18,594 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:17:18,599 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:17:18,621 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size 66 [2021-05-03 00:17:18,641 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:17:18,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:17:18,700 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:17:18,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:17:18,704 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:17:18,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:17:18,705 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:17:18,707 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:17:19,220 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:17:19,220 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [93348766] [2021-05-03 00:17:19,220 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [93348766] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:17:19,220 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:17:19,220 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2021-05-03 00:17:19,220 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [264997243] [2021-05-03 00:17:19,221 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states [2021-05-03 00:17:19,221 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:17:19,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-05-03 00:17:19,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=504, Unknown=0, NotChecked=0, Total=600 [2021-05-03 00:17:19,221 INFO L87 Difference]: Start difference. First operand 278 states and 336 transitions. Second operand has 23 states, 23 states have (on average 2.130434782608696) internal successors, (49), 22 states have internal predecessors, (49), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:17:20,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:17:20,004 INFO L93 Difference]: Finished difference Result 587 states and 696 transitions. [2021-05-03 00:17:20,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-05-03 00:17:20,004 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.130434782608696) internal successors, (49), 22 states have internal predecessors, (49), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 55 [2021-05-03 00:17:20,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:17:20,006 INFO L225 Difference]: With dead ends: 587 [2021-05-03 00:17:20,006 INFO L226 Difference]: Without dead ends: 353 [2021-05-03 00:17:20,007 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 13 SyntacticMatches, 16 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 356 ImplicationChecksByTransitivity, 556.2ms TimeCoverageRelationStatistics Valid=113, Invalid=589, Unknown=0, NotChecked=0, Total=702 [2021-05-03 00:17:20,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2021-05-03 00:17:20,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 278. [2021-05-03 00:17:20,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 278 states, 268 states have (on average 1.212686567164179) internal successors, (325), 268 states have internal predecessors, (325), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:17:20,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 336 transitions. [2021-05-03 00:17:20,167 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 336 transitions. Word has length 55 [2021-05-03 00:17:20,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:17:20,167 INFO L480 AbstractCegarLoop]: Abstraction has 278 states and 336 transitions. [2021-05-03 00:17:20,167 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 23 states, 23 states have (on average 2.130434782608696) internal successors, (49), 22 states have internal predecessors, (49), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:17:20,167 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 336 transitions. [2021-05-03 00:17:20,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2021-05-03 00:17:20,167 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:17:20,167 INFO L523 BasicCegarLoop]: trace histogram [11, 11, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:17:20,167 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable306 [2021-05-03 00:17:20,167 INFO L428 AbstractCegarLoop]: === Iteration 77 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:17:20,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:17:20,168 INFO L82 PathProgramCache]: Analyzing trace with hash 2069189247, now seen corresponding path program 50 times [2021-05-03 00:17:20,168 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:17:20,168 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1649099847] [2021-05-03 00:17:20,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:17:20,173 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_~last~0_248 v_main_~c~0_1100) (< (+ v_main_~c~0_1100 1) v_~SIZE~0_243)) InVars {~SIZE~0=v_~SIZE~0_243, main_~c~0=v_main_~c~0_1100, ~last~0=v_~last~0_248} OutVars{~SIZE~0=v_~SIZE~0_243, main_~c~0=v_main_~c~0_1100, ~last~0=v_~last~0_248} AuxVars[] AssignedVars[] [2021-05-03 00:17:20,175 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size [2021-05-03 00:17:20,187 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:20,188 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:20,196 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:17:20,198 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:17:20,210 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size 78 [2021-05-03 00:17:20,227 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_1102 v_~last~0_249) (< (+ v_main_~c~0_1102 1) v_~SIZE~0_244)) InVars {~SIZE~0=v_~SIZE~0_244, main_~c~0=v_main_~c~0_1102, ~last~0=v_~last~0_249} OutVars{~SIZE~0=v_~SIZE~0_244, main_~c~0=v_main_~c~0_1102, ~last~0=v_~last~0_249} AuxVars[] AssignedVars[] [2021-05-03 00:17:20,228 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:17:20,239 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:20,240 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:20,251 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:17:20,255 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:17:20,268 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:17:20,287 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:17:20,289 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_1104 v_~SIZE~0_245) (<= v_~last~0_250 v_main_~c~0_1104)) InVars {~SIZE~0=v_~SIZE~0_245, main_~c~0=v_main_~c~0_1104, ~last~0=v_~last~0_250} OutVars{~SIZE~0=v_~SIZE~0_245, main_~c~0=v_main_~c~0_1104, ~last~0=v_~last~0_250} AuxVars[] AssignedVars[] [2021-05-03 00:17:20,290 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:17:20,305 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:20,306 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:20,318 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:17:20,320 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:17:20,335 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:17:20,355 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_1106 v_~SIZE~0_246) (< v_main_~c~0_1106 v_~last~0_251)) InVars {~SIZE~0=v_~SIZE~0_246, main_~c~0=v_main_~c~0_1106, ~last~0=v_~last~0_251} OutVars{~SIZE~0=v_~SIZE~0_246, main_~c~0=v_main_~c~0_1106, ~last~0=v_~last~0_251} AuxVars[] AssignedVars[] [2021-05-03 00:17:20,357 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size [2021-05-03 00:17:20,368 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:20,370 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:20,383 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:17:20,387 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:17:20,400 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size 66 [2021-05-03 00:17:20,420 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:17:20,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:17:20,481 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:17:20,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:17:20,484 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:17:20,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:17:20,486 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:17:20,487 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:17:21,018 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:17:21,018 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1649099847] [2021-05-03 00:17:21,018 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1649099847] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:17:21,018 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:17:21,018 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2021-05-03 00:17:21,018 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1889366867] [2021-05-03 00:17:21,019 INFO L460 AbstractCegarLoop]: Interpolant automaton has 24 states [2021-05-03 00:17:21,019 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:17:21,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2021-05-03 00:17:21,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=546, Unknown=0, NotChecked=0, Total=650 [2021-05-03 00:17:21,019 INFO L87 Difference]: Start difference. First operand 278 states and 336 transitions. Second operand has 24 states, 24 states have (on average 2.0416666666666665) internal successors, (49), 23 states have internal predecessors, (49), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:17:21,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:17:21,702 INFO L93 Difference]: Finished difference Result 581 states and 690 transitions. [2021-05-03 00:17:21,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-05-03 00:17:21,702 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 2.0416666666666665) internal successors, (49), 23 states have internal predecessors, (49), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 55 [2021-05-03 00:17:21,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:17:21,703 INFO L225 Difference]: With dead ends: 581 [2021-05-03 00:17:21,703 INFO L226 Difference]: Without dead ends: 347 [2021-05-03 00:17:21,704 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 12 SyntacticMatches, 16 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 394 ImplicationChecksByTransitivity, 576.8ms TimeCoverageRelationStatistics Valid=123, Invalid=633, Unknown=0, NotChecked=0, Total=756 [2021-05-03 00:17:21,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2021-05-03 00:17:21,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 278. [2021-05-03 00:17:21,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 278 states, 268 states have (on average 1.212686567164179) internal successors, (325), 268 states have internal predecessors, (325), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:17:21,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 336 transitions. [2021-05-03 00:17:21,877 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 336 transitions. Word has length 55 [2021-05-03 00:17:21,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:17:21,878 INFO L480 AbstractCegarLoop]: Abstraction has 278 states and 336 transitions. [2021-05-03 00:17:21,878 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 24 states, 24 states have (on average 2.0416666666666665) internal successors, (49), 23 states have internal predecessors, (49), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:17:21,878 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 336 transitions. [2021-05-03 00:17:21,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2021-05-03 00:17:21,878 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:17:21,878 INFO L523 BasicCegarLoop]: trace histogram [11, 11, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:17:21,878 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable311 [2021-05-03 00:17:21,878 INFO L428 AbstractCegarLoop]: === Iteration 78 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:17:21,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:17:21,879 INFO L82 PathProgramCache]: Analyzing trace with hash 2131228861, now seen corresponding path program 51 times [2021-05-03 00:17:21,879 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:17:21,879 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1326793383] [2021-05-03 00:17:21,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:17:21,884 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_~last~0_252 v_main_~c~0_1121) (< (+ v_main_~c~0_1121 1) v_~SIZE~0_247)) InVars {~SIZE~0=v_~SIZE~0_247, main_~c~0=v_main_~c~0_1121, ~last~0=v_~last~0_252} OutVars{~SIZE~0=v_~SIZE~0_247, main_~c~0=v_main_~c~0_1121, ~last~0=v_~last~0_252} AuxVars[] AssignedVars[] [2021-05-03 00:17:21,886 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size [2021-05-03 00:17:21,901 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:21,902 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:21,911 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:17:21,913 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:17:21,926 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size 78 [2021-05-03 00:17:21,942 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_1123 v_~last~0_253) (< (+ v_main_~c~0_1123 1) v_~SIZE~0_248)) InVars {~SIZE~0=v_~SIZE~0_248, main_~c~0=v_main_~c~0_1123, ~last~0=v_~last~0_253} OutVars{~SIZE~0=v_~SIZE~0_248, main_~c~0=v_main_~c~0_1123, ~last~0=v_~last~0_253} AuxVars[] AssignedVars[] [2021-05-03 00:17:21,944 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:17:21,955 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:21,956 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:21,966 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:17:21,970 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:17:21,986 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:17:22,007 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:17:22,009 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_1125 v_~SIZE~0_249) (<= v_~last~0_254 v_main_~c~0_1125)) InVars {~SIZE~0=v_~SIZE~0_249, main_~c~0=v_main_~c~0_1125, ~last~0=v_~last~0_254} OutVars{~SIZE~0=v_~SIZE~0_249, main_~c~0=v_main_~c~0_1125, ~last~0=v_~last~0_254} AuxVars[] AssignedVars[] [2021-05-03 00:17:22,011 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:17:22,012 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:22,014 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:22,025 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:17:22,028 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:17:22,056 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:17:22,077 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_1127 v_~last~0_255) (< v_main_~c~0_1127 v_~SIZE~0_250)) InVars {~SIZE~0=v_~SIZE~0_250, main_~c~0=v_main_~c~0_1127, ~last~0=v_~last~0_255} OutVars{~SIZE~0=v_~SIZE~0_250, main_~c~0=v_main_~c~0_1127, ~last~0=v_~last~0_255} AuxVars[] AssignedVars[] [2021-05-03 00:17:22,079 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size [2021-05-03 00:17:22,080 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:22,081 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:22,095 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:17:22,100 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:17:22,120 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size 66 [2021-05-03 00:17:22,137 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:17:22,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:17:22,184 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:17:22,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:17:22,189 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:17:22,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:17:22,190 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:17:22,192 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:17:22,798 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:17:22,799 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1326793383] [2021-05-03 00:17:22,799 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1326793383] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:17:22,799 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:17:22,799 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2021-05-03 00:17:22,799 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117477880] [2021-05-03 00:17:22,799 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states [2021-05-03 00:17:22,799 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:17:22,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-05-03 00:17:22,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=545, Unknown=0, NotChecked=0, Total=650 [2021-05-03 00:17:22,800 INFO L87 Difference]: Start difference. First operand 278 states and 336 transitions. Second operand has 25 states, 25 states have (on average 1.96) internal successors, (49), 24 states have internal predecessors, (49), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:17:23,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:17:23,626 INFO L93 Difference]: Finished difference Result 569 states and 682 transitions. [2021-05-03 00:17:23,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2021-05-03 00:17:23,626 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 1.96) internal successors, (49), 24 states have internal predecessors, (49), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 55 [2021-05-03 00:17:23,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:17:23,627 INFO L225 Difference]: With dead ends: 569 [2021-05-03 00:17:23,627 INFO L226 Difference]: Without dead ends: 335 [2021-05-03 00:17:23,629 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 12 SyntacticMatches, 15 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 379 ImplicationChecksByTransitivity, 632.4ms TimeCoverageRelationStatistics Valid=127, Invalid=629, Unknown=0, NotChecked=0, Total=756 [2021-05-03 00:17:23,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2021-05-03 00:17:23,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 278. [2021-05-03 00:17:23,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 278 states, 268 states have (on average 1.212686567164179) internal successors, (325), 268 states have internal predecessors, (325), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:17:23,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 336 transitions. [2021-05-03 00:17:23,813 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 336 transitions. Word has length 55 [2021-05-03 00:17:23,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:17:23,813 INFO L480 AbstractCegarLoop]: Abstraction has 278 states and 336 transitions. [2021-05-03 00:17:23,813 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 25 states, 25 states have (on average 1.96) internal successors, (49), 24 states have internal predecessors, (49), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:17:23,813 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 336 transitions. [2021-05-03 00:17:23,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2021-05-03 00:17:23,814 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:17:23,814 INFO L523 BasicCegarLoop]: trace histogram [11, 11, 7, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:17:23,814 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable316 [2021-05-03 00:17:23,814 INFO L428 AbstractCegarLoop]: === Iteration 79 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:17:23,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:17:23,814 INFO L82 PathProgramCache]: Analyzing trace with hash 325790527, now seen corresponding path program 52 times [2021-05-03 00:17:23,814 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:17:23,814 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [145730293] [2021-05-03 00:17:23,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:17:23,820 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (+ v_main_~c~0_1142 1) v_~SIZE~0_251) (<= v_~last~0_256 v_main_~c~0_1142)) InVars {~SIZE~0=v_~SIZE~0_251, main_~c~0=v_main_~c~0_1142, ~last~0=v_~last~0_256} OutVars{~SIZE~0=v_~SIZE~0_251, main_~c~0=v_main_~c~0_1142, ~last~0=v_~last~0_256} AuxVars[] AssignedVars[] [2021-05-03 00:17:23,821 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size [2021-05-03 00:17:23,835 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:23,836 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:23,844 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:17:23,846 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:17:23,858 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size 78 [2021-05-03 00:17:23,876 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (+ v_main_~c~0_1144 1) v_~SIZE~0_252) (< v_main_~c~0_1144 v_~last~0_257)) InVars {~SIZE~0=v_~SIZE~0_252, main_~c~0=v_main_~c~0_1144, ~last~0=v_~last~0_257} OutVars{~SIZE~0=v_~SIZE~0_252, main_~c~0=v_main_~c~0_1144, ~last~0=v_~last~0_257} AuxVars[] AssignedVars[] [2021-05-03 00:17:23,877 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:17:23,878 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:23,879 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:23,909 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:17:23,913 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:17:23,935 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:17:23,951 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:17:23,953 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_~last~0_258 v_main_~c~0_1146) (< v_main_~c~0_1146 v_~SIZE~0_253)) InVars {~SIZE~0=v_~SIZE~0_253, main_~c~0=v_main_~c~0_1146, ~last~0=v_~last~0_258} OutVars{~SIZE~0=v_~SIZE~0_253, main_~c~0=v_main_~c~0_1146, ~last~0=v_~last~0_258} AuxVars[] AssignedVars[] [2021-05-03 00:17:23,956 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:17:23,957 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:23,958 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:23,969 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:17:23,971 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:17:23,996 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:17:24,016 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_1148 v_~last~0_259) (< v_main_~c~0_1148 v_~SIZE~0_254)) InVars {~SIZE~0=v_~SIZE~0_254, main_~c~0=v_main_~c~0_1148, ~last~0=v_~last~0_259} OutVars{~SIZE~0=v_~SIZE~0_254, main_~c~0=v_main_~c~0_1148, ~last~0=v_~last~0_259} AuxVars[] AssignedVars[] [2021-05-03 00:17:24,017 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size [2021-05-03 00:17:24,028 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:24,029 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:24,040 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:17:24,044 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:17:24,056 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size 66 [2021-05-03 00:17:24,073 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:17:24,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:17:24,144 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:17:24,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:17:24,149 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:17:24,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:17:24,151 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:17:24,154 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:17:24,672 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:17:24,672 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [145730293] [2021-05-03 00:17:24,672 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [145730293] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:17:24,672 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:17:24,672 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2021-05-03 00:17:24,672 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117363740] [2021-05-03 00:17:24,673 INFO L460 AbstractCegarLoop]: Interpolant automaton has 26 states [2021-05-03 00:17:24,673 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:17:24,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2021-05-03 00:17:24,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=589, Unknown=0, NotChecked=0, Total=702 [2021-05-03 00:17:24,673 INFO L87 Difference]: Start difference. First operand 278 states and 336 transitions. Second operand has 26 states, 26 states have (on average 1.8846153846153846) internal successors, (49), 25 states have internal predecessors, (49), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:17:25,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:17:25,325 INFO L93 Difference]: Finished difference Result 560 states and 673 transitions. [2021-05-03 00:17:25,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2021-05-03 00:17:25,326 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 1.8846153846153846) internal successors, (49), 25 states have internal predecessors, (49), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 55 [2021-05-03 00:17:25,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:17:25,327 INFO L225 Difference]: With dead ends: 560 [2021-05-03 00:17:25,327 INFO L226 Difference]: Without dead ends: 326 [2021-05-03 00:17:25,327 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 12 SyntacticMatches, 14 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 387 ImplicationChecksByTransitivity, 548.4ms TimeCoverageRelationStatistics Valid=137, Invalid=675, Unknown=0, NotChecked=0, Total=812 [2021-05-03 00:17:25,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2021-05-03 00:17:25,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 278. [2021-05-03 00:17:25,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 278 states, 268 states have (on average 1.212686567164179) internal successors, (325), 268 states have internal predecessors, (325), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:17:25,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 336 transitions. [2021-05-03 00:17:25,601 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 336 transitions. Word has length 55 [2021-05-03 00:17:25,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:17:25,601 INFO L480 AbstractCegarLoop]: Abstraction has 278 states and 336 transitions. [2021-05-03 00:17:25,601 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 26 states, 26 states have (on average 1.8846153846153846) internal successors, (49), 25 states have internal predecessors, (49), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:17:25,601 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 336 transitions. [2021-05-03 00:17:25,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2021-05-03 00:17:25,611 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:17:25,611 INFO L523 BasicCegarLoop]: trace histogram [11, 11, 8, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:17:25,611 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable321 [2021-05-03 00:17:25,611 INFO L428 AbstractCegarLoop]: === Iteration 80 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:17:25,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:17:25,611 INFO L82 PathProgramCache]: Analyzing trace with hash -491857923, now seen corresponding path program 53 times [2021-05-03 00:17:25,612 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:17:25,612 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [308518363] [2021-05-03 00:17:25,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:17:25,620 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_~last~0_260 v_main_~c~0_1163) (< (+ v_main_~c~0_1163 1) v_~SIZE~0_255)) InVars {~SIZE~0=v_~SIZE~0_255, main_~c~0=v_main_~c~0_1163, ~last~0=v_~last~0_260} OutVars{~SIZE~0=v_~SIZE~0_255, main_~c~0=v_main_~c~0_1163, ~last~0=v_~last~0_260} AuxVars[] AssignedVars[] [2021-05-03 00:17:25,623 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size [2021-05-03 00:17:25,624 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:25,626 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:25,638 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:17:25,641 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:17:25,680 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size 78 [2021-05-03 00:17:25,706 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_1165 v_~last~0_261) (< (+ v_main_~c~0_1165 1) v_~SIZE~0_256)) InVars {~SIZE~0=v_~SIZE~0_256, main_~c~0=v_main_~c~0_1165, ~last~0=v_~last~0_261} OutVars{~SIZE~0=v_~SIZE~0_256, main_~c~0=v_main_~c~0_1165, ~last~0=v_~last~0_261} AuxVars[] AssignedVars[] [2021-05-03 00:17:25,708 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:17:25,725 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:25,727 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:25,746 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:17:25,752 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:17:25,771 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:17:25,798 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:17:25,801 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_1167 v_~SIZE~0_257) (<= v_~last~0_262 v_main_~c~0_1167)) InVars {~SIZE~0=v_~SIZE~0_257, main_~c~0=v_main_~c~0_1167, ~last~0=v_~last~0_262} OutVars{~SIZE~0=v_~SIZE~0_257, main_~c~0=v_main_~c~0_1167, ~last~0=v_~last~0_262} AuxVars[] AssignedVars[] [2021-05-03 00:17:25,804 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:17:25,828 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:25,830 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:25,845 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:17:25,849 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:17:25,871 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:17:25,899 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_1169 v_~last~0_263) (< v_main_~c~0_1169 v_~SIZE~0_258)) InVars {~SIZE~0=v_~SIZE~0_258, main_~c~0=v_main_~c~0_1169, ~last~0=v_~last~0_263} OutVars{~SIZE~0=v_~SIZE~0_258, main_~c~0=v_main_~c~0_1169, ~last~0=v_~last~0_263} AuxVars[] AssignedVars[] [2021-05-03 00:17:25,901 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size [2021-05-03 00:17:25,920 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:25,922 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:25,940 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:17:25,947 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:17:25,969 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size 66 [2021-05-03 00:17:25,993 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:17:25,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:17:26,060 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:17:26,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:17:26,066 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:17:26,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:17:26,069 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:17:26,073 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:17:26,717 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:17:26,717 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [308518363] [2021-05-03 00:17:26,717 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [308518363] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:17:26,717 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:17:26,717 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2021-05-03 00:17:26,717 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1071748275] [2021-05-03 00:17:26,717 INFO L460 AbstractCegarLoop]: Interpolant automaton has 27 states [2021-05-03 00:17:26,717 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:17:26,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2021-05-03 00:17:26,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=635, Unknown=0, NotChecked=0, Total=756 [2021-05-03 00:17:26,718 INFO L87 Difference]: Start difference. First operand 278 states and 336 transitions. Second operand has 27 states, 27 states have (on average 1.8148148148148149) internal successors, (49), 26 states have internal predecessors, (49), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:17:27,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:17:27,480 INFO L93 Difference]: Finished difference Result 551 states and 664 transitions. [2021-05-03 00:17:27,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2021-05-03 00:17:27,481 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 1.8148148148148149) internal successors, (49), 26 states have internal predecessors, (49), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 55 [2021-05-03 00:17:27,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:17:27,482 INFO L225 Difference]: With dead ends: 551 [2021-05-03 00:17:27,482 INFO L226 Difference]: Without dead ends: 317 [2021-05-03 00:17:27,483 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 12 SyntacticMatches, 13 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 386 ImplicationChecksByTransitivity, 670.0ms TimeCoverageRelationStatistics Valid=147, Invalid=723, Unknown=0, NotChecked=0, Total=870 [2021-05-03 00:17:27,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2021-05-03 00:17:27,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 278. [2021-05-03 00:17:27,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 278 states, 268 states have (on average 1.212686567164179) internal successors, (325), 268 states have internal predecessors, (325), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:17:27,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 336 transitions. [2021-05-03 00:17:27,636 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 336 transitions. Word has length 55 [2021-05-03 00:17:27,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:17:27,636 INFO L480 AbstractCegarLoop]: Abstraction has 278 states and 336 transitions. [2021-05-03 00:17:27,637 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 27 states, 27 states have (on average 1.8148148148148149) internal successors, (49), 26 states have internal predecessors, (49), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:17:27,637 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 336 transitions. [2021-05-03 00:17:27,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2021-05-03 00:17:27,637 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:17:27,637 INFO L523 BasicCegarLoop]: trace histogram [11, 11, 9, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:17:27,637 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable326 [2021-05-03 00:17:27,637 INFO L428 AbstractCegarLoop]: === Iteration 81 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:17:27,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:17:27,638 INFO L82 PathProgramCache]: Analyzing trace with hash -2080205825, now seen corresponding path program 54 times [2021-05-03 00:17:27,638 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:17:27,638 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1696176686] [2021-05-03 00:17:27,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:17:27,647 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (+ v_main_~c~0_1184 1) v_~SIZE~0_259) (<= v_~last~0_264 v_main_~c~0_1184)) InVars {~SIZE~0=v_~SIZE~0_259, main_~c~0=v_main_~c~0_1184, ~last~0=v_~last~0_264} OutVars{~SIZE~0=v_~SIZE~0_259, main_~c~0=v_main_~c~0_1184, ~last~0=v_~last~0_264} AuxVars[] AssignedVars[] [2021-05-03 00:17:27,649 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size [2021-05-03 00:17:27,650 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:27,651 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:27,659 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:17:27,661 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:17:27,683 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size 78 [2021-05-03 00:17:27,700 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (+ v_main_~c~0_1186 1) v_~SIZE~0_260) (< v_main_~c~0_1186 v_~last~0_265)) InVars {~SIZE~0=v_~SIZE~0_260, main_~c~0=v_main_~c~0_1186, ~last~0=v_~last~0_265} OutVars{~SIZE~0=v_~SIZE~0_260, main_~c~0=v_main_~c~0_1186, ~last~0=v_~last~0_265} AuxVars[] AssignedVars[] [2021-05-03 00:17:27,702 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:17:27,702 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:27,703 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:27,732 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:17:27,753 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:17:27,774 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:17:27,792 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:17:27,794 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_1188 v_~SIZE~0_261) (<= v_~last~0_266 v_main_~c~0_1188)) InVars {~SIZE~0=v_~SIZE~0_261, main_~c~0=v_main_~c~0_1188, ~last~0=v_~last~0_266} OutVars{~SIZE~0=v_~SIZE~0_261, main_~c~0=v_main_~c~0_1188, ~last~0=v_~last~0_266} AuxVars[] AssignedVars[] [2021-05-03 00:17:27,795 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:17:27,796 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:27,797 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:27,805 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:17:27,807 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:17:27,832 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:17:27,852 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_1190 v_~last~0_267) (< v_main_~c~0_1190 v_~SIZE~0_262)) InVars {~SIZE~0=v_~SIZE~0_262, main_~c~0=v_main_~c~0_1190, ~last~0=v_~last~0_267} OutVars{~SIZE~0=v_~SIZE~0_262, main_~c~0=v_main_~c~0_1190, ~last~0=v_~last~0_267} AuxVars[] AssignedVars[] [2021-05-03 00:17:27,853 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size [2021-05-03 00:17:27,854 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:27,855 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:27,867 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:17:27,871 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:17:27,896 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size 66 [2021-05-03 00:17:27,921 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:17:27,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:17:27,976 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:17:27,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:17:27,980 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:17:27,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:17:27,981 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:17:27,983 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:17:28,591 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:17:28,592 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1696176686] [2021-05-03 00:17:28,592 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1696176686] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:17:28,592 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:17:28,592 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2021-05-03 00:17:28,592 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961449476] [2021-05-03 00:17:28,592 INFO L460 AbstractCegarLoop]: Interpolant automaton has 28 states [2021-05-03 00:17:28,592 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:17:28,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2021-05-03 00:17:28,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=683, Unknown=0, NotChecked=0, Total=812 [2021-05-03 00:17:28,593 INFO L87 Difference]: Start difference. First operand 278 states and 336 transitions. Second operand has 28 states, 28 states have (on average 1.75) internal successors, (49), 27 states have internal predecessors, (49), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:17:29,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:17:29,638 INFO L93 Difference]: Finished difference Result 545 states and 658 transitions. [2021-05-03 00:17:29,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2021-05-03 00:17:29,638 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 1.75) internal successors, (49), 27 states have internal predecessors, (49), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 55 [2021-05-03 00:17:29,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:17:29,639 INFO L225 Difference]: With dead ends: 545 [2021-05-03 00:17:29,639 INFO L226 Difference]: Without dead ends: 311 [2021-05-03 00:17:29,640 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 12 SyntacticMatches, 12 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 376 ImplicationChecksByTransitivity, 639.4ms TimeCoverageRelationStatistics Valid=157, Invalid=773, Unknown=0, NotChecked=0, Total=930 [2021-05-03 00:17:29,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2021-05-03 00:17:29,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 278. [2021-05-03 00:17:29,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 278 states, 268 states have (on average 1.212686567164179) internal successors, (325), 268 states have internal predecessors, (325), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:17:29,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 336 transitions. [2021-05-03 00:17:29,781 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 336 transitions. Word has length 55 [2021-05-03 00:17:29,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:17:29,781 INFO L480 AbstractCegarLoop]: Abstraction has 278 states and 336 transitions. [2021-05-03 00:17:29,781 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 28 states, 28 states have (on average 1.75) internal successors, (49), 27 states have internal predecessors, (49), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:17:29,782 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 336 transitions. [2021-05-03 00:17:29,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2021-05-03 00:17:29,782 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:17:29,782 INFO L523 BasicCegarLoop]: trace histogram [11, 11, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:17:29,782 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable331 [2021-05-03 00:17:29,782 INFO L428 AbstractCegarLoop]: === Iteration 82 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:17:29,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:17:29,782 INFO L82 PathProgramCache]: Analyzing trace with hash 1203644221, now seen corresponding path program 55 times [2021-05-03 00:17:29,782 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:17:29,783 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2038778385] [2021-05-03 00:17:29,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:17:29,787 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_1205 v_~last~0_268) (< (+ v_main_~c~0_1205 1) v_~SIZE~0_263)) InVars {~SIZE~0=v_~SIZE~0_263, main_~c~0=v_main_~c~0_1205, ~last~0=v_~last~0_268} OutVars{~SIZE~0=v_~SIZE~0_263, main_~c~0=v_main_~c~0_1205, ~last~0=v_~last~0_268} AuxVars[] AssignedVars[] [2021-05-03 00:17:29,788 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:17:29,789 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:29,790 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:29,800 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:17:29,804 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:17:29,825 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:17:29,844 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:17:29,846 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_~last~0_269 v_main_~c~0_1207) (< v_main_~c~0_1207 v_~SIZE~0_264)) InVars {~SIZE~0=v_~SIZE~0_264, main_~c~0=v_main_~c~0_1207, ~last~0=v_~last~0_269} OutVars{~SIZE~0=v_~SIZE~0_264, main_~c~0=v_main_~c~0_1207, ~last~0=v_~last~0_269} AuxVars[] AssignedVars[] [2021-05-03 00:17:29,847 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:17:29,848 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:29,849 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:29,857 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:17:29,860 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:17:29,884 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:17:29,903 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_1209 v_~last~0_270) (< v_main_~c~0_1209 v_~SIZE~0_265)) InVars {~SIZE~0=v_~SIZE~0_265, main_~c~0=v_main_~c~0_1209, ~last~0=v_~last~0_270} OutVars{~SIZE~0=v_~SIZE~0_265, main_~c~0=v_main_~c~0_1209, ~last~0=v_~last~0_270} AuxVars[] AssignedVars[] [2021-05-03 00:17:29,904 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size [2021-05-03 00:17:29,915 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:29,916 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:29,927 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:17:29,931 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:17:29,944 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size 66 [2021-05-03 00:17:29,964 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:17:29,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:17:30,097 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:17:30,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:17:30,100 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:17:30,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:17:30,102 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:17:30,104 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:17:30,904 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:17:30,904 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2038778385] [2021-05-03 00:17:30,905 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [2038778385] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:17:30,905 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:17:30,905 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [33] imperfect sequences [] total 33 [2021-05-03 00:17:30,905 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [78876023] [2021-05-03 00:17:30,905 INFO L460 AbstractCegarLoop]: Interpolant automaton has 33 states [2021-05-03 00:17:30,905 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:17:30,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2021-05-03 00:17:30,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=178, Invalid=1012, Unknown=0, NotChecked=0, Total=1190 [2021-05-03 00:17:30,906 INFO L87 Difference]: Start difference. First operand 278 states and 336 transitions. Second operand has 33 states, 33 states have (on average 1.4848484848484849) internal successors, (49), 31 states have internal predecessors, (49), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:17:31,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:17:31,850 INFO L93 Difference]: Finished difference Result 567 states and 679 transitions. [2021-05-03 00:17:31,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2021-05-03 00:17:31,850 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 1.4848484848484849) internal successors, (49), 31 states have internal predecessors, (49), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 55 [2021-05-03 00:17:31,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:17:31,851 INFO L225 Difference]: With dead ends: 567 [2021-05-03 00:17:31,851 INFO L226 Difference]: Without dead ends: 333 [2021-05-03 00:17:31,852 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 6 SyntacticMatches, 11 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 465 ImplicationChecksByTransitivity, 980.7ms TimeCoverageRelationStatistics Valid=240, Invalid=1242, Unknown=0, NotChecked=0, Total=1482 [2021-05-03 00:17:31,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2021-05-03 00:17:31,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 279. [2021-05-03 00:17:31,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 279 states, 269 states have (on average 1.2156133828996283) internal successors, (327), 269 states have internal predecessors, (327), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:17:31,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 338 transitions. [2021-05-03 00:17:31,988 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 338 transitions. Word has length 55 [2021-05-03 00:17:31,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:17:31,989 INFO L480 AbstractCegarLoop]: Abstraction has 279 states and 338 transitions. [2021-05-03 00:17:31,989 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 33 states, 33 states have (on average 1.4848484848484849) internal successors, (49), 31 states have internal predecessors, (49), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:17:31,989 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 338 transitions. [2021-05-03 00:17:31,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2021-05-03 00:17:31,989 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:17:31,989 INFO L523 BasicCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:17:31,989 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable335 [2021-05-03 00:17:31,989 INFO L428 AbstractCegarLoop]: === Iteration 83 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:17:31,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:17:31,990 INFO L82 PathProgramCache]: Analyzing trace with hash 1038103871, now seen corresponding path program 11 times [2021-05-03 00:17:31,990 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:17:31,990 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2065617766] [2021-05-03 00:17:31,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:17:31,993 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (+ v_main_~c~0_1224 1) v_~SIZE~0_266) (< v_main_~c~0_1224 v_~last~0_271)) InVars {~SIZE~0=v_~SIZE~0_266, main_~c~0=v_main_~c~0_1224, ~last~0=v_~last~0_271} OutVars{~SIZE~0=v_~SIZE~0_266, main_~c~0=v_main_~c~0_1224, ~last~0=v_~last~0_271} AuxVars[] AssignedVars[] [2021-05-03 00:17:31,995 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:17:32,005 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:32,006 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:32,016 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:17:32,019 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:17:32,031 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:17:32,047 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:17:32,048 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_1226 v_~SIZE~0_267) (< v_main_~c~0_1226 v_~last~0_272)) InVars {~SIZE~0=v_~SIZE~0_267, main_~c~0=v_main_~c~0_1226, ~last~0=v_~last~0_272} OutVars{~SIZE~0=v_~SIZE~0_267, main_~c~0=v_main_~c~0_1226, ~last~0=v_~last~0_272} AuxVars[] AssignedVars[] [2021-05-03 00:17:32,050 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size [2021-05-03 00:17:32,060 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:32,061 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:32,072 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:17:32,076 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:17:32,089 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size 66 [2021-05-03 00:17:32,107 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:17:32,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:17:32,193 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:17:32,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:17:32,197 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:17:32,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:17:32,198 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:17:33,059 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:17:33,059 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2065617766] [2021-05-03 00:17:33,059 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [2065617766] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:17:33,059 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:17:33,059 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [33] imperfect sequences [] total 33 [2021-05-03 00:17:33,060 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1376002269] [2021-05-03 00:17:33,060 INFO L460 AbstractCegarLoop]: Interpolant automaton has 33 states [2021-05-03 00:17:33,060 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:17:33,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2021-05-03 00:17:33,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=1029, Unknown=0, NotChecked=0, Total=1190 [2021-05-03 00:17:33,060 INFO L87 Difference]: Start difference. First operand 279 states and 338 transitions. Second operand has 33 states, 33 states have (on average 1.4848484848484849) internal successors, (49), 31 states have internal predecessors, (49), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:17:34,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:17:34,341 INFO L93 Difference]: Finished difference Result 568 states and 681 transitions. [2021-05-03 00:17:34,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2021-05-03 00:17:34,342 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 1.4848484848484849) internal successors, (49), 31 states have internal predecessors, (49), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 55 [2021-05-03 00:17:34,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:17:34,343 INFO L225 Difference]: With dead ends: 568 [2021-05-03 00:17:34,343 INFO L226 Difference]: Without dead ends: 334 [2021-05-03 00:17:34,344 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 6 SyntacticMatches, 10 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 604 ImplicationChecksByTransitivity, 1320.6ms TimeCoverageRelationStatistics Valid=259, Invalid=1997, Unknown=0, NotChecked=0, Total=2256 [2021-05-03 00:17:34,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2021-05-03 00:17:34,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 281. [2021-05-03 00:17:34,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 281 states, 271 states have (on average 1.2140221402214022) internal successors, (329), 271 states have internal predecessors, (329), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:17:34,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 340 transitions. [2021-05-03 00:17:34,534 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 340 transitions. Word has length 55 [2021-05-03 00:17:34,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:17:34,534 INFO L480 AbstractCegarLoop]: Abstraction has 281 states and 340 transitions. [2021-05-03 00:17:34,534 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 33 states, 33 states have (on average 1.4848484848484849) internal successors, (49), 31 states have internal predecessors, (49), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:17:34,534 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 340 transitions. [2021-05-03 00:17:34,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2021-05-03 00:17:34,534 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:17:34,535 INFO L523 BasicCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:17:34,535 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable338 [2021-05-03 00:17:34,535 INFO L428 AbstractCegarLoop]: === Iteration 84 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:17:34,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:17:34,535 INFO L82 PathProgramCache]: Analyzing trace with hash 1558779102, now seen corresponding path program 12 times [2021-05-03 00:17:34,535 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:17:34,535 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1555610563] [2021-05-03 00:17:34,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:17:34,540 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (+ v_main_~c~0_1240 1) v_~SIZE~0_268) (<= v_~last~0_273 v_main_~c~0_1240)) InVars {~SIZE~0=v_~SIZE~0_268, main_~c~0=v_main_~c~0_1240, ~last~0=v_~last~0_273} OutVars{~SIZE~0=v_~SIZE~0_268, main_~c~0=v_main_~c~0_1240, ~last~0=v_~last~0_273} AuxVars[] AssignedVars[] [2021-05-03 00:17:34,542 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size [2021-05-03 00:17:34,557 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:34,558 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:34,567 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:17:34,569 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:17:34,582 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size 78 [2021-05-03 00:17:34,600 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:17:34,602 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_1242 v_~SIZE~0_269) (<= v_~last~0_274 v_main_~c~0_1242)) InVars {~SIZE~0=v_~SIZE~0_269, main_~c~0=v_main_~c~0_1242, ~last~0=v_~last~0_274} OutVars{~SIZE~0=v_~SIZE~0_269, main_~c~0=v_main_~c~0_1242, ~last~0=v_~last~0_274} AuxVars[] AssignedVars[] [2021-05-03 00:17:34,603 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:17:34,603 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:34,605 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:34,613 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:17:34,616 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:17:34,640 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:17:34,658 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:17:34,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:17:34,702 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:17:34,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:17:34,706 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:17:34,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:17:34,707 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:17:35,274 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:17:35,274 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1555610563] [2021-05-03 00:17:35,274 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1555610563] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:17:35,274 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:17:35,275 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2021-05-03 00:17:35,275 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [538866782] [2021-05-03 00:17:35,275 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states [2021-05-03 00:17:35,275 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:17:35,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-05-03 00:17:35,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=348, Unknown=0, NotChecked=0, Total=420 [2021-05-03 00:17:35,275 INFO L87 Difference]: Start difference. First operand 281 states and 340 transitions. Second operand has 20 states, 20 states have (on average 2.6) internal successors, (52), 19 states have internal predecessors, (52), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:17:36,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:17:36,136 INFO L93 Difference]: Finished difference Result 617 states and 727 transitions. [2021-05-03 00:17:36,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-05-03 00:17:36,137 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.6) internal successors, (52), 19 states have internal predecessors, (52), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 58 [2021-05-03 00:17:36,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:17:36,138 INFO L225 Difference]: With dead ends: 617 [2021-05-03 00:17:36,138 INFO L226 Difference]: Without dead ends: 383 [2021-05-03 00:17:36,139 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 12 SyntacticMatches, 23 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 580.2ms TimeCoverageRelationStatistics Valid=76, Invalid=386, Unknown=0, NotChecked=0, Total=462 [2021-05-03 00:17:36,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383 states. [2021-05-03 00:17:36,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383 to 290. [2021-05-03 00:17:36,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 290 states, 280 states have (on average 1.207142857142857) internal successors, (338), 280 states have internal predecessors, (338), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:17:36,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 349 transitions. [2021-05-03 00:17:36,343 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 349 transitions. Word has length 58 [2021-05-03 00:17:36,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:17:36,343 INFO L480 AbstractCegarLoop]: Abstraction has 290 states and 349 transitions. [2021-05-03 00:17:36,343 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 20 states, 20 states have (on average 2.6) internal successors, (52), 19 states have internal predecessors, (52), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:17:36,343 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 349 transitions. [2021-05-03 00:17:36,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2021-05-03 00:17:36,343 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:17:36,343 INFO L523 BasicCegarLoop]: trace histogram [12, 12, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:17:36,343 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable341 [2021-05-03 00:17:36,344 INFO L428 AbstractCegarLoop]: === Iteration 85 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:17:36,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:17:36,344 INFO L82 PathProgramCache]: Analyzing trace with hash -490608740, now seen corresponding path program 56 times [2021-05-03 00:17:36,344 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:17:36,344 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [804042838] [2021-05-03 00:17:36,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:17:36,350 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (+ v_main_~c~0_1257 1) v_~SIZE~0_270) (<= v_~last~0_275 v_main_~c~0_1257)) InVars {~SIZE~0=v_~SIZE~0_270, main_~c~0=v_main_~c~0_1257, ~last~0=v_~last~0_275} OutVars{~SIZE~0=v_~SIZE~0_270, main_~c~0=v_main_~c~0_1257, ~last~0=v_~last~0_275} AuxVars[] AssignedVars[] [2021-05-03 00:17:36,351 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size [2021-05-03 00:17:36,352 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:36,353 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:36,361 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:17:36,363 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:17:36,387 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size 78 [2021-05-03 00:17:36,405 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_1259 v_~last~0_276) (< (+ v_main_~c~0_1259 1) v_~SIZE~0_271)) InVars {~SIZE~0=v_~SIZE~0_271, main_~c~0=v_main_~c~0_1259, ~last~0=v_~last~0_276} OutVars{~SIZE~0=v_~SIZE~0_271, main_~c~0=v_main_~c~0_1259, ~last~0=v_~last~0_276} AuxVars[] AssignedVars[] [2021-05-03 00:17:36,407 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:17:36,418 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:36,419 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:36,430 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:17:36,435 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:17:36,448 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:17:36,472 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:17:36,474 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_~last~0_277 v_main_~c~0_1261) (< v_main_~c~0_1261 v_~SIZE~0_272)) InVars {~SIZE~0=v_~SIZE~0_272, main_~c~0=v_main_~c~0_1261, ~last~0=v_~last~0_277} OutVars{~SIZE~0=v_~SIZE~0_272, main_~c~0=v_main_~c~0_1261, ~last~0=v_~last~0_277} AuxVars[] AssignedVars[] [2021-05-03 00:17:36,476 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:17:36,477 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:36,478 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:36,490 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:17:36,493 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:17:36,523 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:17:36,543 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_1263 v_~SIZE~0_273) (< v_main_~c~0_1263 v_~last~0_278)) InVars {~SIZE~0=v_~SIZE~0_273, main_~c~0=v_main_~c~0_1263, ~last~0=v_~last~0_278} OutVars{~SIZE~0=v_~SIZE~0_273, main_~c~0=v_main_~c~0_1263, ~last~0=v_~last~0_278} AuxVars[] AssignedVars[] [2021-05-03 00:17:36,544 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size [2021-05-03 00:17:36,545 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:36,546 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:36,557 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:17:36,561 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:17:36,584 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size 66 [2021-05-03 00:17:36,604 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:17:36,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:17:36,671 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:17:36,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:17:36,674 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:17:36,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:17:36,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-03 00:17:36,678 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:17:37,353 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:17:37,354 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [804042838] [2021-05-03 00:17:37,354 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [804042838] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:17:37,354 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:17:37,354 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2021-05-03 00:17:37,354 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285294588] [2021-05-03 00:17:37,354 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states [2021-05-03 00:17:37,354 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:17:37,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-05-03 00:17:37,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=431, Unknown=0, NotChecked=0, Total=506 [2021-05-03 00:17:37,355 INFO L87 Difference]: Start difference. First operand 290 states and 349 transitions. Second operand has 21 states, 21 states have (on average 2.4761904761904763) internal successors, (52), 20 states have internal predecessors, (52), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:17:38,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:17:38,275 INFO L93 Difference]: Finished difference Result 635 states and 745 transitions. [2021-05-03 00:17:38,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-05-03 00:17:38,276 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.4761904761904763) internal successors, (52), 20 states have internal predecessors, (52), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 58 [2021-05-03 00:17:38,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:17:38,277 INFO L225 Difference]: With dead ends: 635 [2021-05-03 00:17:38,277 INFO L226 Difference]: Without dead ends: 392 [2021-05-03 00:17:38,278 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 12 SyntacticMatches, 22 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 261 ImplicationChecksByTransitivity, 710.1ms TimeCoverageRelationStatistics Valid=86, Invalid=514, Unknown=0, NotChecked=0, Total=600 [2021-05-03 00:17:38,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2021-05-03 00:17:38,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 290. [2021-05-03 00:17:38,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 290 states, 280 states have (on average 1.207142857142857) internal successors, (338), 280 states have internal predecessors, (338), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:17:38,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 349 transitions. [2021-05-03 00:17:38,460 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 349 transitions. Word has length 58 [2021-05-03 00:17:38,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:17:38,460 INFO L480 AbstractCegarLoop]: Abstraction has 290 states and 349 transitions. [2021-05-03 00:17:38,460 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 21 states, 21 states have (on average 2.4761904761904763) internal successors, (52), 20 states have internal predecessors, (52), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:17:38,461 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 349 transitions. [2021-05-03 00:17:38,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2021-05-03 00:17:38,461 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:17:38,461 INFO L523 BasicCegarLoop]: trace histogram [12, 12, 10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:17:38,461 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable346 [2021-05-03 00:17:38,461 INFO L428 AbstractCegarLoop]: === Iteration 86 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:17:38,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:17:38,462 INFO L82 PathProgramCache]: Analyzing trace with hash -66962018, now seen corresponding path program 57 times [2021-05-03 00:17:38,462 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:17:38,462 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1455962586] [2021-05-03 00:17:38,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:17:38,467 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_~last~0_279 v_main_~c~0_1279) (< (+ v_main_~c~0_1279 1) v_~SIZE~0_274)) InVars {~SIZE~0=v_~SIZE~0_274, main_~c~0=v_main_~c~0_1279, ~last~0=v_~last~0_279} OutVars{~SIZE~0=v_~SIZE~0_274, main_~c~0=v_main_~c~0_1279, ~last~0=v_~last~0_279} AuxVars[] AssignedVars[] [2021-05-03 00:17:38,469 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size [2021-05-03 00:17:38,470 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:38,471 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:38,479 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:17:38,481 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:17:38,504 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size 78 [2021-05-03 00:17:38,522 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (+ v_main_~c~0_1281 1) v_~SIZE~0_275) (< v_main_~c~0_1281 v_~last~0_280)) InVars {~SIZE~0=v_~SIZE~0_275, main_~c~0=v_main_~c~0_1281, ~last~0=v_~last~0_280} OutVars{~SIZE~0=v_~SIZE~0_275, main_~c~0=v_main_~c~0_1281, ~last~0=v_~last~0_280} AuxVars[] AssignedVars[] [2021-05-03 00:17:38,523 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:17:38,534 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:38,536 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:38,546 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:17:38,550 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:17:38,563 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:17:38,582 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:17:38,584 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_~last~0_281 v_main_~c~0_1283) (< v_main_~c~0_1283 v_~SIZE~0_276)) InVars {~SIZE~0=v_~SIZE~0_276, main_~c~0=v_main_~c~0_1283, ~last~0=v_~last~0_281} OutVars{~SIZE~0=v_~SIZE~0_276, main_~c~0=v_main_~c~0_1283, ~last~0=v_~last~0_281} AuxVars[] AssignedVars[] [2021-05-03 00:17:38,585 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:17:38,600 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:38,601 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:38,610 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:17:38,612 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:17:38,626 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:17:38,646 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_1285 v_~SIZE~0_277) (< v_main_~c~0_1285 v_~last~0_282)) InVars {~SIZE~0=v_~SIZE~0_277, main_~c~0=v_main_~c~0_1285, ~last~0=v_~last~0_282} OutVars{~SIZE~0=v_~SIZE~0_277, main_~c~0=v_main_~c~0_1285, ~last~0=v_~last~0_282} AuxVars[] AssignedVars[] [2021-05-03 00:17:38,648 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size [2021-05-03 00:17:38,662 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:38,663 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:38,676 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:17:38,681 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:17:38,694 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size 66 [2021-05-03 00:17:38,716 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:17:38,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:17:38,766 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:17:38,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:17:38,770 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:17:38,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:17:38,771 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:17:38,773 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:17:39,355 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:17:39,355 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1455962586] [2021-05-03 00:17:39,355 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1455962586] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:17:39,355 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:17:39,355 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2021-05-03 00:17:39,355 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1786694048] [2021-05-03 00:17:39,356 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states [2021-05-03 00:17:39,356 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:17:39,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2021-05-03 00:17:39,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=430, Unknown=0, NotChecked=0, Total=506 [2021-05-03 00:17:39,356 INFO L87 Difference]: Start difference. First operand 290 states and 349 transitions. Second operand has 22 states, 22 states have (on average 2.3636363636363638) internal successors, (52), 21 states have internal predecessors, (52), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:17:40,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:17:40,326 INFO L93 Difference]: Finished difference Result 635 states and 749 transitions. [2021-05-03 00:17:40,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-05-03 00:17:40,326 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 2.3636363636363638) internal successors, (52), 21 states have internal predecessors, (52), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 58 [2021-05-03 00:17:40,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:17:40,328 INFO L225 Difference]: With dead ends: 635 [2021-05-03 00:17:40,328 INFO L226 Difference]: Without dead ends: 392 [2021-05-03 00:17:40,330 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 12 SyntacticMatches, 21 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 281 ImplicationChecksByTransitivity, 612.1ms TimeCoverageRelationStatistics Valid=90, Invalid=510, Unknown=0, NotChecked=0, Total=600 [2021-05-03 00:17:40,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2021-05-03 00:17:40,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 290. [2021-05-03 00:17:40,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 290 states, 280 states have (on average 1.207142857142857) internal successors, (338), 280 states have internal predecessors, (338), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:17:40,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 349 transitions. [2021-05-03 00:17:40,513 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 349 transitions. Word has length 58 [2021-05-03 00:17:40,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:17:40,514 INFO L480 AbstractCegarLoop]: Abstraction has 290 states and 349 transitions. [2021-05-03 00:17:40,515 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 22 states, 22 states have (on average 2.3636363636363638) internal successors, (52), 21 states have internal predecessors, (52), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:17:40,515 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 349 transitions. [2021-05-03 00:17:40,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2021-05-03 00:17:40,515 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:17:40,515 INFO L523 BasicCegarLoop]: trace histogram [12, 12, 9, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:17:40,515 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable351 [2021-05-03 00:17:40,515 INFO L428 AbstractCegarLoop]: === Iteration 87 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:17:40,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:17:40,516 INFO L82 PathProgramCache]: Analyzing trace with hash -1096321316, now seen corresponding path program 58 times [2021-05-03 00:17:40,516 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:17:40,516 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1704021734] [2021-05-03 00:17:40,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:17:40,522 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_~last~0_283 v_main_~c~0_1301) (< (+ v_main_~c~0_1301 1) v_~SIZE~0_278)) InVars {~SIZE~0=v_~SIZE~0_278, main_~c~0=v_main_~c~0_1301, ~last~0=v_~last~0_283} OutVars{~SIZE~0=v_~SIZE~0_278, main_~c~0=v_main_~c~0_1301, ~last~0=v_~last~0_283} AuxVars[] AssignedVars[] [2021-05-03 00:17:40,526 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size [2021-05-03 00:17:40,527 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:40,528 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:40,537 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:17:40,539 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:17:40,562 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size 78 [2021-05-03 00:17:40,580 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_1303 v_~last~0_284) (< (+ v_main_~c~0_1303 1) v_~SIZE~0_279)) InVars {~SIZE~0=v_~SIZE~0_279, main_~c~0=v_main_~c~0_1303, ~last~0=v_~last~0_284} OutVars{~SIZE~0=v_~SIZE~0_279, main_~c~0=v_main_~c~0_1303, ~last~0=v_~last~0_284} AuxVars[] AssignedVars[] [2021-05-03 00:17:40,581 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:17:40,582 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:40,583 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:40,594 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:17:40,598 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:17:40,620 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:17:40,640 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:17:40,642 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_1305 v_~SIZE~0_280) (<= v_~last~0_285 v_main_~c~0_1305)) InVars {~SIZE~0=v_~SIZE~0_280, main_~c~0=v_main_~c~0_1305, ~last~0=v_~last~0_285} OutVars{~SIZE~0=v_~SIZE~0_280, main_~c~0=v_main_~c~0_1305, ~last~0=v_~last~0_285} AuxVars[] AssignedVars[] [2021-05-03 00:17:40,644 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:17:40,658 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:40,660 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:40,670 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:17:40,675 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:17:40,689 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:17:40,710 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_1307 v_~SIZE~0_281) (< v_main_~c~0_1307 v_~last~0_286)) InVars {~SIZE~0=v_~SIZE~0_281, main_~c~0=v_main_~c~0_1307, ~last~0=v_~last~0_286} OutVars{~SIZE~0=v_~SIZE~0_281, main_~c~0=v_main_~c~0_1307, ~last~0=v_~last~0_286} AuxVars[] AssignedVars[] [2021-05-03 00:17:40,711 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size [2021-05-03 00:17:40,723 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:40,724 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:40,736 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:17:40,740 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:17:40,754 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size 66 [2021-05-03 00:17:40,774 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:17:40,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:17:40,844 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:17:40,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:17:40,847 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:17:40,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:17:40,848 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:17:40,850 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:17:41,453 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:17:41,453 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1704021734] [2021-05-03 00:17:41,453 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1704021734] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:17:41,453 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:17:41,454 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2021-05-03 00:17:41,454 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775376487] [2021-05-03 00:17:41,454 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states [2021-05-03 00:17:41,454 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:17:41,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-05-03 00:17:41,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=509, Unknown=0, NotChecked=0, Total=600 [2021-05-03 00:17:41,454 INFO L87 Difference]: Start difference. First operand 290 states and 349 transitions. Second operand has 23 states, 23 states have (on average 2.260869565217391) internal successors, (52), 22 states have internal predecessors, (52), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:17:42,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:17:42,300 INFO L93 Difference]: Finished difference Result 623 states and 733 transitions. [2021-05-03 00:17:42,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-05-03 00:17:42,301 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.260869565217391) internal successors, (52), 22 states have internal predecessors, (52), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 58 [2021-05-03 00:17:42,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:17:42,302 INFO L225 Difference]: With dead ends: 623 [2021-05-03 00:17:42,302 INFO L226 Difference]: Without dead ends: 380 [2021-05-03 00:17:42,303 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 13 SyntacticMatches, 19 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 357 ImplicationChecksByTransitivity, 645.5ms TimeCoverageRelationStatistics Valid=106, Invalid=596, Unknown=0, NotChecked=0, Total=702 [2021-05-03 00:17:42,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2021-05-03 00:17:42,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 290. [2021-05-03 00:17:42,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 290 states, 280 states have (on average 1.207142857142857) internal successors, (338), 280 states have internal predecessors, (338), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:17:42,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 349 transitions. [2021-05-03 00:17:42,564 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 349 transitions. Word has length 58 [2021-05-03 00:17:42,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:17:42,564 INFO L480 AbstractCegarLoop]: Abstraction has 290 states and 349 transitions. [2021-05-03 00:17:42,564 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 23 states, 23 states have (on average 2.260869565217391) internal successors, (52), 22 states have internal predecessors, (52), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:17:42,564 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 349 transitions. [2021-05-03 00:17:42,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2021-05-03 00:17:42,564 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:17:42,565 INFO L523 BasicCegarLoop]: trace histogram [12, 12, 8, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:17:42,565 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable356 [2021-05-03 00:17:42,565 INFO L428 AbstractCegarLoop]: === Iteration 88 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:17:42,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:17:42,565 INFO L82 PathProgramCache]: Analyzing trace with hash -1940326818, now seen corresponding path program 59 times [2021-05-03 00:17:42,565 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:17:42,565 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1326702555] [2021-05-03 00:17:42,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:17:42,571 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (+ v_main_~c~0_1323 1) v_~SIZE~0_282) (<= v_~last~0_287 v_main_~c~0_1323)) InVars {~SIZE~0=v_~SIZE~0_282, main_~c~0=v_main_~c~0_1323, ~last~0=v_~last~0_287} OutVars{~SIZE~0=v_~SIZE~0_282, main_~c~0=v_main_~c~0_1323, ~last~0=v_~last~0_287} AuxVars[] AssignedVars[] [2021-05-03 00:17:42,572 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size [2021-05-03 00:17:42,586 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:42,588 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:42,596 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:17:42,598 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:17:42,611 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size 78 [2021-05-03 00:17:42,629 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_1325 v_~last~0_288) (< (+ v_main_~c~0_1325 1) v_~SIZE~0_283)) InVars {~SIZE~0=v_~SIZE~0_283, main_~c~0=v_main_~c~0_1325, ~last~0=v_~last~0_288} OutVars{~SIZE~0=v_~SIZE~0_283, main_~c~0=v_main_~c~0_1325, ~last~0=v_~last~0_288} AuxVars[] AssignedVars[] [2021-05-03 00:17:42,630 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:17:42,642 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:42,644 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:42,655 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:17:42,660 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:17:42,673 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:17:42,691 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:17:42,693 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_~last~0_289 v_main_~c~0_1327) (< v_main_~c~0_1327 v_~SIZE~0_284)) InVars {~SIZE~0=v_~SIZE~0_284, main_~c~0=v_main_~c~0_1327, ~last~0=v_~last~0_289} OutVars{~SIZE~0=v_~SIZE~0_284, main_~c~0=v_main_~c~0_1327, ~last~0=v_~last~0_289} AuxVars[] AssignedVars[] [2021-05-03 00:17:42,694 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:17:42,710 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:42,711 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:42,720 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:17:42,722 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:17:42,737 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:17:42,757 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_1329 v_~last~0_290) (< v_main_~c~0_1329 v_~SIZE~0_285)) InVars {~SIZE~0=v_~SIZE~0_285, main_~c~0=v_main_~c~0_1329, ~last~0=v_~last~0_290} OutVars{~SIZE~0=v_~SIZE~0_285, main_~c~0=v_main_~c~0_1329, ~last~0=v_~last~0_290} AuxVars[] AssignedVars[] [2021-05-03 00:17:42,758 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size [2021-05-03 00:17:42,759 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:42,760 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:42,772 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:17:42,776 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:17:42,800 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size 66 [2021-05-03 00:17:42,818 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:17:42,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:17:42,873 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:17:42,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:17:42,895 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:17:42,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:17:42,896 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:17:42,899 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:17:43,504 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:17:43,504 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1326702555] [2021-05-03 00:17:43,504 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1326702555] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:17:43,504 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:17:43,504 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2021-05-03 00:17:43,505 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1654432372] [2021-05-03 00:17:43,505 INFO L460 AbstractCegarLoop]: Interpolant automaton has 24 states [2021-05-03 00:17:43,505 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:17:43,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2021-05-03 00:17:43,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=508, Unknown=0, NotChecked=0, Total=600 [2021-05-03 00:17:43,505 INFO L87 Difference]: Start difference. First operand 290 states and 349 transitions. Second operand has 24 states, 24 states have (on average 2.1666666666666665) internal successors, (52), 23 states have internal predecessors, (52), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:17:44,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:17:44,850 INFO L93 Difference]: Finished difference Result 617 states and 731 transitions. [2021-05-03 00:17:44,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-05-03 00:17:44,850 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 2.1666666666666665) internal successors, (52), 23 states have internal predecessors, (52), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 58 [2021-05-03 00:17:44,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:17:44,852 INFO L225 Difference]: With dead ends: 617 [2021-05-03 00:17:44,852 INFO L226 Difference]: Without dead ends: 374 [2021-05-03 00:17:44,853 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 12 SyntacticMatches, 19 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 372 ImplicationChecksByTransitivity, 635.1ms TimeCoverageRelationStatistics Valid=110, Invalid=592, Unknown=0, NotChecked=0, Total=702 [2021-05-03 00:17:44,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2021-05-03 00:17:45,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 290. [2021-05-03 00:17:45,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 290 states, 280 states have (on average 1.207142857142857) internal successors, (338), 280 states have internal predecessors, (338), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:17:45,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 349 transitions. [2021-05-03 00:17:45,178 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 349 transitions. Word has length 58 [2021-05-03 00:17:45,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:17:45,178 INFO L480 AbstractCegarLoop]: Abstraction has 290 states and 349 transitions. [2021-05-03 00:17:45,178 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 24 states, 24 states have (on average 2.1666666666666665) internal successors, (52), 23 states have internal predecessors, (52), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:17:45,178 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 349 transitions. [2021-05-03 00:17:45,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2021-05-03 00:17:45,179 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:17:45,179 INFO L523 BasicCegarLoop]: trace histogram [12, 12, 7, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:17:45,179 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable361 [2021-05-03 00:17:45,179 INFO L428 AbstractCegarLoop]: === Iteration 89 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:17:45,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:17:45,179 INFO L82 PathProgramCache]: Analyzing trace with hash -1665567204, now seen corresponding path program 60 times [2021-05-03 00:17:45,179 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:17:45,179 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1999802857] [2021-05-03 00:17:45,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:17:45,195 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_~last~0_291 v_main_~c~0_1345) (< (+ v_main_~c~0_1345 1) v_~SIZE~0_286)) InVars {~SIZE~0=v_~SIZE~0_286, main_~c~0=v_main_~c~0_1345, ~last~0=v_~last~0_291} OutVars{~SIZE~0=v_~SIZE~0_286, main_~c~0=v_main_~c~0_1345, ~last~0=v_~last~0_291} AuxVars[] AssignedVars[] [2021-05-03 00:17:45,197 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size [2021-05-03 00:17:45,198 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:45,199 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:45,209 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:17:45,212 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:17:45,240 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size 78 [2021-05-03 00:17:45,261 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_1347 v_~last~0_292) (< (+ v_main_~c~0_1347 1) v_~SIZE~0_287)) InVars {~SIZE~0=v_~SIZE~0_287, main_~c~0=v_main_~c~0_1347, ~last~0=v_~last~0_292} OutVars{~SIZE~0=v_~SIZE~0_287, main_~c~0=v_main_~c~0_1347, ~last~0=v_~last~0_292} AuxVars[] AssignedVars[] [2021-05-03 00:17:45,263 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:17:45,264 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:45,265 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:45,279 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:17:45,283 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:17:45,308 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:17:45,327 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:17:45,329 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_1349 v_~SIZE~0_288) (<= v_~last~0_293 v_main_~c~0_1349)) InVars {~SIZE~0=v_~SIZE~0_288, main_~c~0=v_main_~c~0_1349, ~last~0=v_~last~0_293} OutVars{~SIZE~0=v_~SIZE~0_288, main_~c~0=v_main_~c~0_1349, ~last~0=v_~last~0_293} AuxVars[] AssignedVars[] [2021-05-03 00:17:45,331 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:17:45,332 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:45,334 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:45,345 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:17:45,350 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:17:45,377 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:17:45,396 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_1351 v_~SIZE~0_289) (< v_main_~c~0_1351 v_~last~0_294)) InVars {~SIZE~0=v_~SIZE~0_289, main_~c~0=v_main_~c~0_1351, ~last~0=v_~last~0_294} OutVars{~SIZE~0=v_~SIZE~0_289, main_~c~0=v_main_~c~0_1351, ~last~0=v_~last~0_294} AuxVars[] AssignedVars[] [2021-05-03 00:17:45,397 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size [2021-05-03 00:17:45,398 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:45,402 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:45,413 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:17:45,417 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:17:45,438 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size 66 [2021-05-03 00:17:45,455 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:17:45,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:17:45,508 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:17:45,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:17:45,514 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:17:45,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:17:45,523 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:17:45,526 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:17:46,080 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:17:46,081 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1999802857] [2021-05-03 00:17:46,081 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1999802857] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:17:46,081 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:17:46,081 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2021-05-03 00:17:46,081 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624630242] [2021-05-03 00:17:46,082 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states [2021-05-03 00:17:46,082 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:17:46,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-05-03 00:17:46,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=550, Unknown=0, NotChecked=0, Total=650 [2021-05-03 00:17:46,082 INFO L87 Difference]: Start difference. First operand 290 states and 349 transitions. Second operand has 25 states, 25 states have (on average 2.08) internal successors, (52), 24 states have internal predecessors, (52), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:17:47,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:17:47,249 INFO L93 Difference]: Finished difference Result 608 states and 722 transitions. [2021-05-03 00:17:47,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2021-05-03 00:17:47,250 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 2.08) internal successors, (52), 24 states have internal predecessors, (52), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 58 [2021-05-03 00:17:47,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:17:47,252 INFO L225 Difference]: With dead ends: 608 [2021-05-03 00:17:47,252 INFO L226 Difference]: Without dead ends: 365 [2021-05-03 00:17:47,252 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 12 SyntacticMatches, 18 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 404 ImplicationChecksByTransitivity, 583.4ms TimeCoverageRelationStatistics Valid=120, Invalid=636, Unknown=0, NotChecked=0, Total=756 [2021-05-03 00:17:47,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2021-05-03 00:17:47,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 290. [2021-05-03 00:17:47,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 290 states, 280 states have (on average 1.207142857142857) internal successors, (338), 280 states have internal predecessors, (338), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:17:47,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 349 transitions. [2021-05-03 00:17:47,540 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 349 transitions. Word has length 58 [2021-05-03 00:17:47,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:17:47,540 INFO L480 AbstractCegarLoop]: Abstraction has 290 states and 349 transitions. [2021-05-03 00:17:47,540 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 25 states, 25 states have (on average 2.08) internal successors, (52), 24 states have internal predecessors, (52), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:17:47,541 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 349 transitions. [2021-05-03 00:17:47,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2021-05-03 00:17:47,541 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:17:47,541 INFO L523 BasicCegarLoop]: trace histogram [12, 12, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:17:47,541 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable366 [2021-05-03 00:17:47,541 INFO L428 AbstractCegarLoop]: === Iteration 90 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:17:47,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:17:47,542 INFO L82 PathProgramCache]: Analyzing trace with hash -279363810, now seen corresponding path program 61 times [2021-05-03 00:17:47,542 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:17:47,542 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [660667576] [2021-05-03 00:17:47,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:17:47,549 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (+ v_main_~c~0_1367 1) v_~SIZE~0_290) (<= v_~last~0_295 v_main_~c~0_1367)) InVars {~SIZE~0=v_~SIZE~0_290, main_~c~0=v_main_~c~0_1367, ~last~0=v_~last~0_295} OutVars{~SIZE~0=v_~SIZE~0_290, main_~c~0=v_main_~c~0_1367, ~last~0=v_~last~0_295} AuxVars[] AssignedVars[] [2021-05-03 00:17:47,551 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size [2021-05-03 00:17:47,552 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:47,554 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:47,565 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:17:47,568 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:17:47,598 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size 78 [2021-05-03 00:17:47,620 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (+ v_main_~c~0_1369 1) v_~SIZE~0_291) (< v_main_~c~0_1369 v_~last~0_296)) InVars {~SIZE~0=v_~SIZE~0_291, main_~c~0=v_main_~c~0_1369, ~last~0=v_~last~0_296} OutVars{~SIZE~0=v_~SIZE~0_291, main_~c~0=v_main_~c~0_1369, ~last~0=v_~last~0_296} AuxVars[] AssignedVars[] [2021-05-03 00:17:47,622 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:17:47,623 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:47,625 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:47,641 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:17:47,647 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:17:47,677 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:17:47,702 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:17:47,705 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_~last~0_297 v_main_~c~0_1371) (< v_main_~c~0_1371 v_~SIZE~0_292)) InVars {~SIZE~0=v_~SIZE~0_292, main_~c~0=v_main_~c~0_1371, ~last~0=v_~last~0_297} OutVars{~SIZE~0=v_~SIZE~0_292, main_~c~0=v_main_~c~0_1371, ~last~0=v_~last~0_297} AuxVars[] AssignedVars[] [2021-05-03 00:17:47,707 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:17:47,727 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:47,730 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:47,741 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:17:47,744 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:17:47,764 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:17:47,788 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_1373 v_~SIZE~0_293) (< v_main_~c~0_1373 v_~last~0_298)) InVars {~SIZE~0=v_~SIZE~0_293, main_~c~0=v_main_~c~0_1373, ~last~0=v_~last~0_298} OutVars{~SIZE~0=v_~SIZE~0_293, main_~c~0=v_main_~c~0_1373, ~last~0=v_~last~0_298} AuxVars[] AssignedVars[] [2021-05-03 00:17:47,790 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size [2021-05-03 00:17:47,791 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:47,793 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:47,809 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:17:47,815 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:17:47,846 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size 66 [2021-05-03 00:17:47,868 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:17:47,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:17:47,930 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:17:47,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:17:47,935 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:17:47,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:17:47,938 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:17:47,941 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:17:48,682 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:17:48,682 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [660667576] [2021-05-03 00:17:48,683 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [660667576] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:17:48,683 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:17:48,683 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2021-05-03 00:17:48,683 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1426027340] [2021-05-03 00:17:48,683 INFO L460 AbstractCegarLoop]: Interpolant automaton has 26 states [2021-05-03 00:17:48,683 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:17:48,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2021-05-03 00:17:48,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=594, Unknown=0, NotChecked=0, Total=702 [2021-05-03 00:17:48,684 INFO L87 Difference]: Start difference. First operand 290 states and 349 transitions. Second operand has 26 states, 26 states have (on average 2.0) internal successors, (52), 25 states have internal predecessors, (52), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:17:49,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:17:49,867 INFO L93 Difference]: Finished difference Result 599 states and 713 transitions. [2021-05-03 00:17:49,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2021-05-03 00:17:49,868 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 2.0) internal successors, (52), 25 states have internal predecessors, (52), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 58 [2021-05-03 00:17:49,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:17:49,870 INFO L225 Difference]: With dead ends: 599 [2021-05-03 00:17:49,870 INFO L226 Difference]: Without dead ends: 356 [2021-05-03 00:17:49,871 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 13 SyntacticMatches, 16 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 411 ImplicationChecksByTransitivity, 792.4ms TimeCoverageRelationStatistics Valid=130, Invalid=682, Unknown=0, NotChecked=0, Total=812 [2021-05-03 00:17:49,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2021-05-03 00:17:50,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 290. [2021-05-03 00:17:50,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 290 states, 280 states have (on average 1.207142857142857) internal successors, (338), 280 states have internal predecessors, (338), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:17:50,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 349 transitions. [2021-05-03 00:17:50,157 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 349 transitions. Word has length 58 [2021-05-03 00:17:50,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:17:50,158 INFO L480 AbstractCegarLoop]: Abstraction has 290 states and 349 transitions. [2021-05-03 00:17:50,158 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 26 states, 26 states have (on average 2.0) internal successors, (52), 25 states have internal predecessors, (52), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:17:50,158 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 349 transitions. [2021-05-03 00:17:50,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2021-05-03 00:17:50,158 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:17:50,158 INFO L523 BasicCegarLoop]: trace histogram [12, 12, 7, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:17:50,159 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable371 [2021-05-03 00:17:50,159 INFO L428 AbstractCegarLoop]: === Iteration 91 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:17:50,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:17:50,159 INFO L82 PathProgramCache]: Analyzing trace with hash -217324196, now seen corresponding path program 62 times [2021-05-03 00:17:50,159 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:17:50,159 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1480917167] [2021-05-03 00:17:50,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:17:50,167 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_~last~0_299 v_main_~c~0_1389) (< (+ v_main_~c~0_1389 1) v_~SIZE~0_294)) InVars {~SIZE~0=v_~SIZE~0_294, main_~c~0=v_main_~c~0_1389, ~last~0=v_~last~0_299} OutVars{~SIZE~0=v_~SIZE~0_294, main_~c~0=v_main_~c~0_1389, ~last~0=v_~last~0_299} AuxVars[] AssignedVars[] [2021-05-03 00:17:50,169 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size [2021-05-03 00:17:50,188 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:50,190 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:50,201 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:17:50,204 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:17:50,222 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size 78 [2021-05-03 00:17:50,247 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_1391 v_~last~0_300) (< (+ v_main_~c~0_1391 1) v_~SIZE~0_295)) InVars {~SIZE~0=v_~SIZE~0_295, main_~c~0=v_main_~c~0_1391, ~last~0=v_~last~0_300} OutVars{~SIZE~0=v_~SIZE~0_295, main_~c~0=v_main_~c~0_1391, ~last~0=v_~last~0_300} AuxVars[] AssignedVars[] [2021-05-03 00:17:50,249 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:17:50,250 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:50,252 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:50,270 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:17:50,279 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:17:50,315 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:17:50,339 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:17:50,342 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_~last~0_301 v_main_~c~0_1393) (< v_main_~c~0_1393 v_~SIZE~0_296)) InVars {~SIZE~0=v_~SIZE~0_296, main_~c~0=v_main_~c~0_1393, ~last~0=v_~last~0_301} OutVars{~SIZE~0=v_~SIZE~0_296, main_~c~0=v_main_~c~0_1393, ~last~0=v_~last~0_301} AuxVars[] AssignedVars[] [2021-05-03 00:17:50,344 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:17:50,345 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:50,347 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:50,362 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:17:50,365 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:17:50,404 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:17:50,430 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_1395 v_~last~0_302) (< v_main_~c~0_1395 v_~SIZE~0_297)) InVars {~SIZE~0=v_~SIZE~0_297, main_~c~0=v_main_~c~0_1395, ~last~0=v_~last~0_302} OutVars{~SIZE~0=v_~SIZE~0_297, main_~c~0=v_main_~c~0_1395, ~last~0=v_~last~0_302} AuxVars[] AssignedVars[] [2021-05-03 00:17:50,433 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size [2021-05-03 00:17:50,448 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:50,450 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:50,464 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:17:50,469 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:17:50,482 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size 66 [2021-05-03 00:17:50,501 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:17:50,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:17:50,581 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:17:50,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:17:50,586 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:17:50,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:17:50,588 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:17:50,591 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:17:51,214 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:17:51,214 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1480917167] [2021-05-03 00:17:51,214 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1480917167] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:17:51,214 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:17:51,214 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2021-05-03 00:17:51,215 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [81359731] [2021-05-03 00:17:51,215 INFO L460 AbstractCegarLoop]: Interpolant automaton has 27 states [2021-05-03 00:17:51,215 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:17:51,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2021-05-03 00:17:51,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=640, Unknown=0, NotChecked=0, Total=756 [2021-05-03 00:17:51,215 INFO L87 Difference]: Start difference. First operand 290 states and 349 transitions. Second operand has 27 states, 27 states have (on average 1.9259259259259258) internal successors, (52), 26 states have internal predecessors, (52), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:17:52,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:17:52,206 INFO L93 Difference]: Finished difference Result 590 states and 704 transitions. [2021-05-03 00:17:52,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2021-05-03 00:17:52,207 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 1.9259259259259258) internal successors, (52), 26 states have internal predecessors, (52), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 58 [2021-05-03 00:17:52,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:17:52,208 INFO L225 Difference]: With dead ends: 590 [2021-05-03 00:17:52,208 INFO L226 Difference]: Without dead ends: 347 [2021-05-03 00:17:52,209 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 13 SyntacticMatches, 15 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 423 ImplicationChecksByTransitivity, 657.1ms TimeCoverageRelationStatistics Valid=140, Invalid=730, Unknown=0, NotChecked=0, Total=870 [2021-05-03 00:17:52,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2021-05-03 00:17:52,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 290. [2021-05-03 00:17:52,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 290 states, 280 states have (on average 1.207142857142857) internal successors, (338), 280 states have internal predecessors, (338), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:17:52,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 349 transitions. [2021-05-03 00:17:52,481 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 349 transitions. Word has length 58 [2021-05-03 00:17:52,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:17:52,481 INFO L480 AbstractCegarLoop]: Abstraction has 290 states and 349 transitions. [2021-05-03 00:17:52,481 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 27 states, 27 states have (on average 1.9259259259259258) internal successors, (52), 26 states have internal predecessors, (52), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:17:52,481 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 349 transitions. [2021-05-03 00:17:52,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2021-05-03 00:17:52,482 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:17:52,482 INFO L523 BasicCegarLoop]: trace histogram [12, 12, 8, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:17:52,482 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable376 [2021-05-03 00:17:52,482 INFO L428 AbstractCegarLoop]: === Iteration 92 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:17:52,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:17:52,482 INFO L82 PathProgramCache]: Analyzing trace with hash -2022762530, now seen corresponding path program 63 times [2021-05-03 00:17:52,482 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:17:52,482 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1795830604] [2021-05-03 00:17:52,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:17:52,492 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_~last~0_303 v_main_~c~0_1411) (< (+ v_main_~c~0_1411 1) v_~SIZE~0_298)) InVars {~SIZE~0=v_~SIZE~0_298, main_~c~0=v_main_~c~0_1411, ~last~0=v_~last~0_303} OutVars{~SIZE~0=v_~SIZE~0_298, main_~c~0=v_main_~c~0_1411, ~last~0=v_~last~0_303} AuxVars[] AssignedVars[] [2021-05-03 00:17:52,494 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size [2021-05-03 00:17:52,495 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:52,496 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:52,507 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:17:52,509 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:17:52,535 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size 78 [2021-05-03 00:17:52,553 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_1413 v_~last~0_304) (< (+ v_main_~c~0_1413 1) v_~SIZE~0_299)) InVars {~SIZE~0=v_~SIZE~0_299, main_~c~0=v_main_~c~0_1413, ~last~0=v_~last~0_304} OutVars{~SIZE~0=v_~SIZE~0_299, main_~c~0=v_main_~c~0_1413, ~last~0=v_~last~0_304} AuxVars[] AssignedVars[] [2021-05-03 00:17:52,555 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:17:52,567 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:52,568 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:52,580 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:17:52,584 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:17:52,597 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:17:52,613 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:17:52,615 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_~last~0_305 v_main_~c~0_1415) (< v_main_~c~0_1415 v_~SIZE~0_300)) InVars {~SIZE~0=v_~SIZE~0_300, main_~c~0=v_main_~c~0_1415, ~last~0=v_~last~0_305} OutVars{~SIZE~0=v_~SIZE~0_300, main_~c~0=v_main_~c~0_1415, ~last~0=v_~last~0_305} AuxVars[] AssignedVars[] [2021-05-03 00:17:52,617 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:17:52,631 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:52,633 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:52,642 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:17:52,644 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:17:52,657 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:17:52,675 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_1417 v_~last~0_306) (< v_main_~c~0_1417 v_~SIZE~0_301)) InVars {~SIZE~0=v_~SIZE~0_301, main_~c~0=v_main_~c~0_1417, ~last~0=v_~last~0_306} OutVars{~SIZE~0=v_~SIZE~0_301, main_~c~0=v_main_~c~0_1417, ~last~0=v_~last~0_306} AuxVars[] AssignedVars[] [2021-05-03 00:17:52,676 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size [2021-05-03 00:17:52,688 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:52,689 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:52,701 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:17:52,705 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:17:52,717 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size 66 [2021-05-03 00:17:52,735 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:17:52,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:17:52,797 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:17:52,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:17:52,802 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:17:52,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:17:52,805 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:17:52,808 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:17:53,363 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:17:53,363 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1795830604] [2021-05-03 00:17:53,363 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1795830604] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:17:53,363 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:17:53,363 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2021-05-03 00:17:53,363 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1461232617] [2021-05-03 00:17:53,363 INFO L460 AbstractCegarLoop]: Interpolant automaton has 28 states [2021-05-03 00:17:53,363 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:17:53,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2021-05-03 00:17:53,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=739, Unknown=0, NotChecked=0, Total=870 [2021-05-03 00:17:53,364 INFO L87 Difference]: Start difference. First operand 290 states and 349 transitions. Second operand has 28 states, 28 states have (on average 1.8571428571428572) internal successors, (52), 27 states have internal predecessors, (52), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:17:54,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:17:54,253 INFO L93 Difference]: Finished difference Result 593 states and 703 transitions. [2021-05-03 00:17:54,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2021-05-03 00:17:54,254 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 1.8571428571428572) internal successors, (52), 27 states have internal predecessors, (52), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 58 [2021-05-03 00:17:54,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:17:54,255 INFO L225 Difference]: With dead ends: 593 [2021-05-03 00:17:54,255 INFO L226 Difference]: Without dead ends: 350 [2021-05-03 00:17:54,255 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 14 SyntacticMatches, 13 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 436 ImplicationChecksByTransitivity, 589.7ms TimeCoverageRelationStatistics Valid=156, Invalid=836, Unknown=0, NotChecked=0, Total=992 [2021-05-03 00:17:54,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2021-05-03 00:17:54,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 290. [2021-05-03 00:17:54,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 290 states, 280 states have (on average 1.207142857142857) internal successors, (338), 280 states have internal predecessors, (338), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:17:54,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 349 transitions. [2021-05-03 00:17:54,454 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 349 transitions. Word has length 58 [2021-05-03 00:17:54,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:17:54,454 INFO L480 AbstractCegarLoop]: Abstraction has 290 states and 349 transitions. [2021-05-03 00:17:54,454 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 28 states, 28 states have (on average 1.8571428571428572) internal successors, (52), 27 states have internal predecessors, (52), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:17:54,454 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 349 transitions. [2021-05-03 00:17:54,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2021-05-03 00:17:54,454 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:17:54,454 INFO L523 BasicCegarLoop]: trace histogram [12, 12, 9, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:17:54,454 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable381 [2021-05-03 00:17:54,455 INFO L428 AbstractCegarLoop]: === Iteration 93 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:17:54,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:17:54,455 INFO L82 PathProgramCache]: Analyzing trace with hash 1454556316, now seen corresponding path program 64 times [2021-05-03 00:17:54,455 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:17:54,455 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [33369926] [2021-05-03 00:17:54,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:17:54,464 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_~last~0_307 v_main_~c~0_1433) (< (+ v_main_~c~0_1433 1) v_~SIZE~0_302)) InVars {~SIZE~0=v_~SIZE~0_302, main_~c~0=v_main_~c~0_1433, ~last~0=v_~last~0_307} OutVars{~SIZE~0=v_~SIZE~0_302, main_~c~0=v_main_~c~0_1433, ~last~0=v_~last~0_307} AuxVars[] AssignedVars[] [2021-05-03 00:17:54,465 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size [2021-05-03 00:17:54,466 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:54,471 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:54,484 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:17:54,486 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:17:54,510 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size 78 [2021-05-03 00:17:54,529 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (+ v_main_~c~0_1435 1) v_~SIZE~0_303) (< v_main_~c~0_1435 v_~last~0_308)) InVars {~SIZE~0=v_~SIZE~0_303, main_~c~0=v_main_~c~0_1435, ~last~0=v_~last~0_308} OutVars{~SIZE~0=v_~SIZE~0_303, main_~c~0=v_main_~c~0_1435, ~last~0=v_~last~0_308} AuxVars[] AssignedVars[] [2021-05-03 00:17:54,530 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:17:54,541 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:54,548 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:54,560 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:17:54,565 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:17:54,578 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:17:54,597 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:17:54,599 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_~last~0_309 v_main_~c~0_1437) (< v_main_~c~0_1437 v_~SIZE~0_304)) InVars {~SIZE~0=v_~SIZE~0_304, main_~c~0=v_main_~c~0_1437, ~last~0=v_~last~0_309} OutVars{~SIZE~0=v_~SIZE~0_304, main_~c~0=v_main_~c~0_1437, ~last~0=v_~last~0_309} AuxVars[] AssignedVars[] [2021-05-03 00:17:54,600 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:17:54,601 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:54,602 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:54,611 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:17:54,613 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:17:54,640 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:17:54,661 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_1439 v_~last~0_310) (< v_main_~c~0_1439 v_~SIZE~0_305)) InVars {~SIZE~0=v_~SIZE~0_305, main_~c~0=v_main_~c~0_1439, ~last~0=v_~last~0_310} OutVars{~SIZE~0=v_~SIZE~0_305, main_~c~0=v_main_~c~0_1439, ~last~0=v_~last~0_310} AuxVars[] AssignedVars[] [2021-05-03 00:17:54,662 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size [2021-05-03 00:17:54,675 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:54,677 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:54,693 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:17:54,699 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:17:54,714 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size 66 [2021-05-03 00:17:54,735 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:17:54,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:17:54,798 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:17:54,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:17:54,802 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:17:54,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:17:54,803 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:17:54,805 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:17:55,474 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:17:55,474 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [33369926] [2021-05-03 00:17:55,474 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [33369926] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:17:55,474 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:17:55,474 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2021-05-03 00:17:55,474 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1010847739] [2021-05-03 00:17:55,475 INFO L460 AbstractCegarLoop]: Interpolant automaton has 29 states [2021-05-03 00:17:55,475 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:17:55,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2021-05-03 00:17:55,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=791, Unknown=0, NotChecked=0, Total=930 [2021-05-03 00:17:55,475 INFO L87 Difference]: Start difference. First operand 290 states and 349 transitions. Second operand has 29 states, 29 states have (on average 1.793103448275862) internal successors, (52), 28 states have internal predecessors, (52), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:17:56,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:17:56,482 INFO L93 Difference]: Finished difference Result 590 states and 700 transitions. [2021-05-03 00:17:56,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2021-05-03 00:17:56,483 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 1.793103448275862) internal successors, (52), 28 states have internal predecessors, (52), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 58 [2021-05-03 00:17:56,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:17:56,484 INFO L225 Difference]: With dead ends: 590 [2021-05-03 00:17:56,484 INFO L226 Difference]: Without dead ends: 347 [2021-05-03 00:17:56,485 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 12 SyntacticMatches, 14 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 473 ImplicationChecksByTransitivity, 704.7ms TimeCoverageRelationStatistics Valid=166, Invalid=890, Unknown=0, NotChecked=0, Total=1056 [2021-05-03 00:17:56,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2021-05-03 00:17:56,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 290. [2021-05-03 00:17:56,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 290 states, 280 states have (on average 1.207142857142857) internal successors, (338), 280 states have internal predecessors, (338), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:17:56,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 349 transitions. [2021-05-03 00:17:56,684 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 349 transitions. Word has length 58 [2021-05-03 00:17:56,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:17:56,684 INFO L480 AbstractCegarLoop]: Abstraction has 290 states and 349 transitions. [2021-05-03 00:17:56,684 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 29 states, 29 states have (on average 1.793103448275862) internal successors, (52), 28 states have internal predecessors, (52), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:17:56,684 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 349 transitions. [2021-05-03 00:17:56,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2021-05-03 00:17:56,685 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:17:56,685 INFO L523 BasicCegarLoop]: trace histogram [12, 12, 10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:17:56,685 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable386 [2021-05-03 00:17:56,685 INFO L428 AbstractCegarLoop]: === Iteration 94 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:17:56,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:17:56,685 INFO L82 PathProgramCache]: Analyzing trace with hash -133791586, now seen corresponding path program 65 times [2021-05-03 00:17:56,685 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:17:56,686 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1903401661] [2021-05-03 00:17:56,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:17:56,692 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (+ v_main_~c~0_1455 1) v_~SIZE~0_306) (<= v_~last~0_311 v_main_~c~0_1455)) InVars {~SIZE~0=v_~SIZE~0_306, main_~c~0=v_main_~c~0_1455, ~last~0=v_~last~0_311} OutVars{~SIZE~0=v_~SIZE~0_306, main_~c~0=v_main_~c~0_1455, ~last~0=v_~last~0_311} AuxVars[] AssignedVars[] [2021-05-03 00:17:56,693 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size [2021-05-03 00:17:56,707 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:56,708 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:56,717 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:17:56,720 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:17:56,733 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size 78 [2021-05-03 00:17:56,751 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_1457 v_~last~0_312) (< (+ v_main_~c~0_1457 1) v_~SIZE~0_307)) InVars {~SIZE~0=v_~SIZE~0_307, main_~c~0=v_main_~c~0_1457, ~last~0=v_~last~0_312} OutVars{~SIZE~0=v_~SIZE~0_307, main_~c~0=v_main_~c~0_1457, ~last~0=v_~last~0_312} AuxVars[] AssignedVars[] [2021-05-03 00:17:56,753 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:17:56,753 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:56,754 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:56,766 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:17:56,770 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:17:56,793 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:17:56,812 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:17:56,815 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_~last~0_313 v_main_~c~0_1459) (< v_main_~c~0_1459 v_~SIZE~0_308)) InVars {~SIZE~0=v_~SIZE~0_308, main_~c~0=v_main_~c~0_1459, ~last~0=v_~last~0_313} OutVars{~SIZE~0=v_~SIZE~0_308, main_~c~0=v_main_~c~0_1459, ~last~0=v_~last~0_313} AuxVars[] AssignedVars[] [2021-05-03 00:17:56,816 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:17:56,831 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:56,833 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:56,842 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:17:56,844 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:17:56,859 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:17:56,879 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_1461 v_~SIZE~0_309) (< v_main_~c~0_1461 v_~last~0_314)) InVars {~SIZE~0=v_~SIZE~0_309, main_~c~0=v_main_~c~0_1461, ~last~0=v_~last~0_314} OutVars{~SIZE~0=v_~SIZE~0_309, main_~c~0=v_main_~c~0_1461, ~last~0=v_~last~0_314} AuxVars[] AssignedVars[] [2021-05-03 00:17:56,880 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size [2021-05-03 00:17:56,893 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:56,894 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:56,906 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:17:56,911 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:17:56,927 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size 66 [2021-05-03 00:17:56,950 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:17:56,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:17:57,020 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:17:57,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:17:57,024 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:17:57,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:17:57,025 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:17:57,027 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:17:57,715 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:17:57,715 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1903401661] [2021-05-03 00:17:57,716 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1903401661] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:17:57,716 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:17:57,716 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [30] imperfect sequences [] total 30 [2021-05-03 00:17:57,716 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208869415] [2021-05-03 00:17:57,716 INFO L460 AbstractCegarLoop]: Interpolant automaton has 30 states [2021-05-03 00:17:57,716 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:17:57,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2021-05-03 00:17:57,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=845, Unknown=0, NotChecked=0, Total=992 [2021-05-03 00:17:57,717 INFO L87 Difference]: Start difference. First operand 290 states and 349 transitions. Second operand has 30 states, 30 states have (on average 1.7333333333333334) internal successors, (52), 29 states have internal predecessors, (52), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:17:58,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:17:58,597 INFO L93 Difference]: Finished difference Result 595 states and 714 transitions. [2021-05-03 00:17:58,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2021-05-03 00:17:58,598 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 1.7333333333333334) internal successors, (52), 29 states have internal predecessors, (52), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 58 [2021-05-03 00:17:58,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:17:58,599 INFO L225 Difference]: With dead ends: 595 [2021-05-03 00:17:58,599 INFO L226 Difference]: Without dead ends: 352 [2021-05-03 00:17:58,600 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 13 SyntacticMatches, 12 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 434 ImplicationChecksByTransitivity, 734.8ms TimeCoverageRelationStatistics Valid=176, Invalid=946, Unknown=0, NotChecked=0, Total=1122 [2021-05-03 00:17:58,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states. [2021-05-03 00:17:58,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 299. [2021-05-03 00:17:58,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 299 states, 289 states have (on average 1.2110726643598615) internal successors, (350), 289 states have internal predecessors, (350), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:17:58,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 361 transitions. [2021-05-03 00:17:58,804 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 361 transitions. Word has length 58 [2021-05-03 00:17:58,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:17:58,804 INFO L480 AbstractCegarLoop]: Abstraction has 299 states and 361 transitions. [2021-05-03 00:17:58,804 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 30 states, 30 states have (on average 1.7333333333333334) internal successors, (52), 29 states have internal predecessors, (52), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:17:58,804 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 361 transitions. [2021-05-03 00:17:58,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2021-05-03 00:17:58,805 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:17:58,805 INFO L523 BasicCegarLoop]: trace histogram [12, 12, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:17:58,805 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable391 [2021-05-03 00:17:58,805 INFO L428 AbstractCegarLoop]: === Iteration 95 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:17:58,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:17:58,806 INFO L82 PathProgramCache]: Analyzing trace with hash -1144908836, now seen corresponding path program 66 times [2021-05-03 00:17:58,806 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:17:58,806 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [532529740] [2021-05-03 00:17:58,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:17:58,810 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (+ v_main_~c~0_1477 1) v_~SIZE~0_310) (< v_main_~c~0_1477 v_~last~0_315)) InVars {~SIZE~0=v_~SIZE~0_310, main_~c~0=v_main_~c~0_1477, ~last~0=v_~last~0_315} OutVars{~SIZE~0=v_~SIZE~0_310, main_~c~0=v_main_~c~0_1477, ~last~0=v_~last~0_315} AuxVars[] AssignedVars[] [2021-05-03 00:17:58,812 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:17:58,823 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:58,824 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:58,835 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:17:58,839 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:17:58,851 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:17:58,868 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:17:58,870 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_~last~0_316 v_main_~c~0_1479) (< v_main_~c~0_1479 v_~SIZE~0_311)) InVars {~SIZE~0=v_~SIZE~0_311, main_~c~0=v_main_~c~0_1479, ~last~0=v_~last~0_316} OutVars{~SIZE~0=v_~SIZE~0_311, main_~c~0=v_main_~c~0_1479, ~last~0=v_~last~0_316} AuxVars[] AssignedVars[] [2021-05-03 00:17:58,872 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:17:58,873 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:58,874 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:58,883 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:17:58,886 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:17:58,932 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:17:58,951 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_1481 v_~SIZE~0_312) (< v_main_~c~0_1481 v_~last~0_317)) InVars {~SIZE~0=v_~SIZE~0_312, main_~c~0=v_main_~c~0_1481, ~last~0=v_~last~0_317} OutVars{~SIZE~0=v_~SIZE~0_312, main_~c~0=v_main_~c~0_1481, ~last~0=v_~last~0_317} AuxVars[] AssignedVars[] [2021-05-03 00:17:58,953 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size [2021-05-03 00:17:58,965 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:58,966 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:58,979 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:17:58,983 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:17:58,997 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size 66 [2021-05-03 00:17:59,018 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:17:59,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:17:59,085 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:17:59,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:17:59,089 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:17:59,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:17:59,090 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:17:59,092 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:17:59,866 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:17:59,867 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [532529740] [2021-05-03 00:17:59,867 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [532529740] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:17:59,867 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:17:59,867 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [31] imperfect sequences [] total 31 [2021-05-03 00:17:59,867 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427190340] [2021-05-03 00:17:59,867 INFO L460 AbstractCegarLoop]: Interpolant automaton has 31 states [2021-05-03 00:17:59,867 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:17:59,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2021-05-03 00:17:59,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=901, Unknown=0, NotChecked=0, Total=1056 [2021-05-03 00:17:59,868 INFO L87 Difference]: Start difference. First operand 299 states and 361 transitions. Second operand has 31 states, 31 states have (on average 1.6774193548387097) internal successors, (52), 30 states have internal predecessors, (52), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:18:00,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:18:00,665 INFO L93 Difference]: Finished difference Result 605 states and 727 transitions. [2021-05-03 00:18:00,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2021-05-03 00:18:00,666 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 1.6774193548387097) internal successors, (52), 30 states have internal predecessors, (52), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 58 [2021-05-03 00:18:00,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:18:00,667 INFO L225 Difference]: With dead ends: 605 [2021-05-03 00:18:00,667 INFO L226 Difference]: Without dead ends: 353 [2021-05-03 00:18:00,668 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 12 SyntacticMatches, 12 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 436 ImplicationChecksByTransitivity, 810.7ms TimeCoverageRelationStatistics Valid=186, Invalid=1004, Unknown=0, NotChecked=0, Total=1190 [2021-05-03 00:18:00,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2021-05-03 00:18:00,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 273. [2021-05-03 00:18:00,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 273 states, 263 states have (on average 1.2015209125475286) internal successors, (316), 264 states have internal predecessors, (316), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:18:00,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 327 transitions. [2021-05-03 00:18:00,868 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 327 transitions. Word has length 58 [2021-05-03 00:18:00,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:18:00,868 INFO L480 AbstractCegarLoop]: Abstraction has 273 states and 327 transitions. [2021-05-03 00:18:00,868 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 31 states, 31 states have (on average 1.6774193548387097) internal successors, (52), 30 states have internal predecessors, (52), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:18:00,868 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 327 transitions. [2021-05-03 00:18:00,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2021-05-03 00:18:00,869 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:18:00,869 INFO L523 BasicCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:18:00,869 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable395 [2021-05-03 00:18:00,869 INFO L428 AbstractCegarLoop]: === Iteration 96 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:18:00,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:18:00,869 INFO L82 PathProgramCache]: Analyzing trace with hash -1310449186, now seen corresponding path program 12 times [2021-05-03 00:18:00,869 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:18:00,869 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1079279381] [2021-05-03 00:18:00,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:18:00,873 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (+ v_main_~c~0_1497 1) v_~SIZE~0_313) (< v_main_~c~0_1497 v_~last~0_318)) InVars {~SIZE~0=v_~SIZE~0_313, main_~c~0=v_main_~c~0_1497, ~last~0=v_~last~0_318} OutVars{~SIZE~0=v_~SIZE~0_313, main_~c~0=v_main_~c~0_1497, ~last~0=v_~last~0_318} AuxVars[] AssignedVars[] [2021-05-03 00:18:00,874 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:18:00,884 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:18:00,885 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:18:00,896 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:18:00,899 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:18:00,911 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:18:00,928 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:18:00,930 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_1499 v_~last~0_319) (< v_main_~c~0_1499 v_~SIZE~0_314)) InVars {~SIZE~0=v_~SIZE~0_314, main_~c~0=v_main_~c~0_1499, ~last~0=v_~last~0_319} OutVars{~SIZE~0=v_~SIZE~0_314, main_~c~0=v_main_~c~0_1499, ~last~0=v_~last~0_319} AuxVars[] AssignedVars[] [2021-05-03 00:18:00,931 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size [2021-05-03 00:18:00,941 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:18:00,943 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:18:00,954 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:18:00,958 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:18:00,972 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size 66 [2021-05-03 00:18:00,990 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:18:00,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:18:01,080 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:18:01,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:18:01,084 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:18:01,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:18:01,086 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:18:02,017 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:18:02,017 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1079279381] [2021-05-03 00:18:02,017 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1079279381] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:18:02,017 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:18:02,018 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [35] imperfect sequences [] total 35 [2021-05-03 00:18:02,018 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756786220] [2021-05-03 00:18:02,018 INFO L460 AbstractCegarLoop]: Interpolant automaton has 35 states [2021-05-03 00:18:02,018 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:18:02,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2021-05-03 00:18:02,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=172, Invalid=1160, Unknown=0, NotChecked=0, Total=1332 [2021-05-03 00:18:02,019 INFO L87 Difference]: Start difference. First operand 273 states and 327 transitions. Second operand has 35 states, 35 states have (on average 1.4857142857142858) internal successors, (52), 33 states have internal predecessors, (52), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:18:03,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:18:03,739 INFO L93 Difference]: Finished difference Result 629 states and 755 transitions. [2021-05-03 00:18:03,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2021-05-03 00:18:03,740 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 1.4857142857142858) internal successors, (52), 33 states have internal predecessors, (52), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 58 [2021-05-03 00:18:03,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:18:03,741 INFO L225 Difference]: With dead ends: 629 [2021-05-03 00:18:03,741 INFO L226 Difference]: Without dead ends: 368 [2021-05-03 00:18:03,742 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 6 SyntacticMatches, 11 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 692 ImplicationChecksByTransitivity, 1433.5ms TimeCoverageRelationStatistics Valid=278, Invalid=2272, Unknown=0, NotChecked=0, Total=2550 [2021-05-03 00:18:03,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368 states. [2021-05-03 00:18:04,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368 to 311. [2021-05-03 00:18:04,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 311 states, 301 states have (on average 1.2159468438538206) internal successors, (366), 301 states have internal predecessors, (366), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:18:04,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 377 transitions. [2021-05-03 00:18:04,007 INFO L78 Accepts]: Start accepts. Automaton has 311 states and 377 transitions. Word has length 58 [2021-05-03 00:18:04,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:18:04,007 INFO L480 AbstractCegarLoop]: Abstraction has 311 states and 377 transitions. [2021-05-03 00:18:04,007 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 35 states, 35 states have (on average 1.4857142857142858) internal successors, (52), 33 states have internal predecessors, (52), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:18:04,008 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 377 transitions. [2021-05-03 00:18:04,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2021-05-03 00:18:04,008 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:18:04,008 INFO L523 BasicCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:18:04,008 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable398 [2021-05-03 00:18:04,008 INFO L428 AbstractCegarLoop]: === Iteration 97 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:18:04,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:18:04,008 INFO L82 PathProgramCache]: Analyzing trace with hash 1184998237, now seen corresponding path program 13 times [2021-05-03 00:18:04,009 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:18:04,009 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [19595929] [2021-05-03 00:18:04,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:18:04,013 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_~last~0_320 v_main_~c~0_1514) (< (+ v_main_~c~0_1514 1) v_~SIZE~0_315)) InVars {~SIZE~0=v_~SIZE~0_315, main_~c~0=v_main_~c~0_1514, ~last~0=v_~last~0_320} OutVars{~SIZE~0=v_~SIZE~0_315, main_~c~0=v_main_~c~0_1514, ~last~0=v_~last~0_320} AuxVars[] AssignedVars[] [2021-05-03 00:18:04,014 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size [2021-05-03 00:18:04,015 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:18:04,016 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:18:04,025 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:18:04,027 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:18:04,049 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size 78 [2021-05-03 00:18:04,067 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:18:04,069 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_~last~0_321 v_main_~c~0_1516) (< v_main_~c~0_1516 v_~SIZE~0_316)) InVars {~SIZE~0=v_~SIZE~0_316, main_~c~0=v_main_~c~0_1516, ~last~0=v_~last~0_321} OutVars{~SIZE~0=v_~SIZE~0_316, main_~c~0=v_main_~c~0_1516, ~last~0=v_~last~0_321} AuxVars[] AssignedVars[] [2021-05-03 00:18:04,070 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:18:04,071 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:18:04,072 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:18:04,081 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:18:04,083 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:18:04,107 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:18:04,125 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:18:04,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:18:04,172 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:18:04,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:18:04,176 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:18:04,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:18:04,178 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:18:04,834 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:18:04,834 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [19595929] [2021-05-03 00:18:04,834 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [19595929] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:18:04,834 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:18:04,834 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2021-05-03 00:18:04,835 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078146988] [2021-05-03 00:18:04,835 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states [2021-05-03 00:18:04,835 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:18:04,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-05-03 00:18:04,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=386, Unknown=0, NotChecked=0, Total=462 [2021-05-03 00:18:04,835 INFO L87 Difference]: Start difference. First operand 311 states and 377 transitions. Second operand has 21 states, 21 states have (on average 2.619047619047619) internal successors, (55), 20 states have internal predecessors, (55), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:18:05,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:18:05,864 INFO L93 Difference]: Finished difference Result 683 states and 806 transitions. [2021-05-03 00:18:05,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-05-03 00:18:05,865 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.619047619047619) internal successors, (55), 20 states have internal predecessors, (55), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 61 [2021-05-03 00:18:05,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:18:05,866 INFO L225 Difference]: With dead ends: 683 [2021-05-03 00:18:05,866 INFO L226 Difference]: Without dead ends: 422 [2021-05-03 00:18:05,867 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 14 SyntacticMatches, 24 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 661.2ms TimeCoverageRelationStatistics Valid=80, Invalid=426, Unknown=0, NotChecked=0, Total=506 [2021-05-03 00:18:05,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 422 states. [2021-05-03 00:18:06,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 422 to 320. [2021-05-03 00:18:06,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 320 states, 310 states have (on average 1.2096774193548387) internal successors, (375), 310 states have internal predecessors, (375), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:18:06,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 386 transitions. [2021-05-03 00:18:06,136 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 386 transitions. Word has length 61 [2021-05-03 00:18:06,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:18:06,136 INFO L480 AbstractCegarLoop]: Abstraction has 320 states and 386 transitions. [2021-05-03 00:18:06,136 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 21 states, 21 states have (on average 2.619047619047619) internal successors, (55), 20 states have internal predecessors, (55), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:18:06,136 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 386 transitions. [2021-05-03 00:18:06,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2021-05-03 00:18:06,136 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:18:06,137 INFO L523 BasicCegarLoop]: trace histogram [13, 13, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:18:06,137 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable401 [2021-05-03 00:18:06,137 INFO L428 AbstractCegarLoop]: === Iteration 98 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:18:06,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:18:06,137 INFO L82 PathProgramCache]: Analyzing trace with hash 831909855, now seen corresponding path program 67 times [2021-05-03 00:18:06,137 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:18:06,137 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [278671193] [2021-05-03 00:18:06,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:18:06,143 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (+ v_main_~c~0_1532 1) v_~SIZE~0_317) (<= v_~last~0_322 v_main_~c~0_1532)) InVars {~SIZE~0=v_~SIZE~0_317, main_~c~0=v_main_~c~0_1532, ~last~0=v_~last~0_322} OutVars{~SIZE~0=v_~SIZE~0_317, main_~c~0=v_main_~c~0_1532, ~last~0=v_~last~0_322} AuxVars[] AssignedVars[] [2021-05-03 00:18:06,145 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size [2021-05-03 00:18:06,145 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:18:06,146 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:18:06,155 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:18:06,158 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:18:06,182 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size 78 [2021-05-03 00:18:06,201 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_1534 v_~last~0_323) (< (+ v_main_~c~0_1534 1) v_~SIZE~0_318)) InVars {~SIZE~0=v_~SIZE~0_318, main_~c~0=v_main_~c~0_1534, ~last~0=v_~last~0_323} OutVars{~SIZE~0=v_~SIZE~0_318, main_~c~0=v_main_~c~0_1534, ~last~0=v_~last~0_323} AuxVars[] AssignedVars[] [2021-05-03 00:18:06,202 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:18:06,203 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:18:06,204 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:18:06,216 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:18:06,221 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:18:06,247 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:18:06,266 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:18:06,269 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_~last~0_324 v_main_~c~0_1536) (< v_main_~c~0_1536 v_~SIZE~0_319)) InVars {~SIZE~0=v_~SIZE~0_319, main_~c~0=v_main_~c~0_1536, ~last~0=v_~last~0_324} OutVars{~SIZE~0=v_~SIZE~0_319, main_~c~0=v_main_~c~0_1536, ~last~0=v_~last~0_324} AuxVars[] AssignedVars[] [2021-05-03 00:18:06,271 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:18:06,287 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:18:06,288 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:18:06,297 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:18:06,300 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:18:06,316 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:18:06,338 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_1538 v_~SIZE~0_320) (< v_main_~c~0_1538 v_~last~0_325)) InVars {~SIZE~0=v_~SIZE~0_320, main_~c~0=v_main_~c~0_1538, ~last~0=v_~last~0_325} OutVars{~SIZE~0=v_~SIZE~0_320, main_~c~0=v_main_~c~0_1538, ~last~0=v_~last~0_325} AuxVars[] AssignedVars[] [2021-05-03 00:18:06,339 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size [2021-05-03 00:18:06,352 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:18:06,354 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:18:06,367 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:18:06,371 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:18:06,387 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size 66 [2021-05-03 00:18:06,409 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:18:06,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:18:06,473 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:18:06,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:18:06,476 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:18:06,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:18:06,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-03 00:18:06,479 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:18:07,181 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:18:07,181 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [278671193] [2021-05-03 00:18:07,181 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [278671193] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:18:07,181 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:18:07,182 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2021-05-03 00:18:07,182 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709629179] [2021-05-03 00:18:07,182 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states [2021-05-03 00:18:07,182 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:18:07,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2021-05-03 00:18:07,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=474, Unknown=0, NotChecked=0, Total=552 [2021-05-03 00:18:07,182 INFO L87 Difference]: Start difference. First operand 320 states and 386 transitions. Second operand has 22 states, 22 states have (on average 2.5) internal successors, (55), 21 states have internal predecessors, (55), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:18:08,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:18:08,310 INFO L93 Difference]: Finished difference Result 701 states and 824 transitions. [2021-05-03 00:18:08,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-05-03 00:18:08,312 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 2.5) internal successors, (55), 21 states have internal predecessors, (55), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 61 [2021-05-03 00:18:08,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:18:08,313 INFO L225 Difference]: With dead ends: 701 [2021-05-03 00:18:08,313 INFO L226 Difference]: Without dead ends: 431 [2021-05-03 00:18:08,315 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 13 SyntacticMatches, 23 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 275 ImplicationChecksByTransitivity, 742.5ms TimeCoverageRelationStatistics Valid=89, Invalid=561, Unknown=0, NotChecked=0, Total=650 [2021-05-03 00:18:08,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 431 states. [2021-05-03 00:18:08,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 431 to 320. [2021-05-03 00:18:08,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 320 states, 310 states have (on average 1.2096774193548387) internal successors, (375), 310 states have internal predecessors, (375), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:18:08,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 386 transitions. [2021-05-03 00:18:08,576 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 386 transitions. Word has length 61 [2021-05-03 00:18:08,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:18:08,576 INFO L480 AbstractCegarLoop]: Abstraction has 320 states and 386 transitions. [2021-05-03 00:18:08,576 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 22 states, 22 states have (on average 2.5) internal successors, (55), 21 states have internal predecessors, (55), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:18:08,576 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 386 transitions. [2021-05-03 00:18:08,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2021-05-03 00:18:08,577 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:18:08,577 INFO L523 BasicCegarLoop]: trace histogram [13, 13, 11, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:18:08,577 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable406 [2021-05-03 00:18:08,577 INFO L428 AbstractCegarLoop]: === Iteration 99 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:18:08,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:18:08,577 INFO L82 PathProgramCache]: Analyzing trace with hash -1217477987, now seen corresponding path program 68 times [2021-05-03 00:18:08,577 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:18:08,577 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1049889774] [2021-05-03 00:18:08,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:18:08,583 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (+ v_main_~c~0_1555 1) v_~SIZE~0_321) (<= v_~last~0_326 v_main_~c~0_1555)) InVars {~SIZE~0=v_~SIZE~0_321, main_~c~0=v_main_~c~0_1555, ~last~0=v_~last~0_326} OutVars{~SIZE~0=v_~SIZE~0_321, main_~c~0=v_main_~c~0_1555, ~last~0=v_~last~0_326} AuxVars[] AssignedVars[] [2021-05-03 00:18:08,584 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size [2021-05-03 00:18:08,585 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:18:08,586 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:18:08,595 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:18:08,597 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:18:08,621 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size 78 [2021-05-03 00:18:08,640 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (+ v_main_~c~0_1557 1) v_~SIZE~0_322) (< v_main_~c~0_1557 v_~last~0_327)) InVars {~SIZE~0=v_~SIZE~0_322, main_~c~0=v_main_~c~0_1557, ~last~0=v_~last~0_327} OutVars{~SIZE~0=v_~SIZE~0_322, main_~c~0=v_main_~c~0_1557, ~last~0=v_~last~0_327} AuxVars[] AssignedVars[] [2021-05-03 00:18:08,641 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:18:08,642 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:18:08,643 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:18:08,655 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:18:08,659 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:18:08,683 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:18:08,703 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:18:08,706 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_1559 v_~SIZE~0_323) (<= v_~last~0_328 v_main_~c~0_1559)) InVars {~SIZE~0=v_~SIZE~0_323, main_~c~0=v_main_~c~0_1559, ~last~0=v_~last~0_328} OutVars{~SIZE~0=v_~SIZE~0_323, main_~c~0=v_main_~c~0_1559, ~last~0=v_~last~0_328} AuxVars[] AssignedVars[] [2021-05-03 00:18:08,707 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:18:08,708 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:18:08,709 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:18:08,720 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:18:08,724 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:18:08,755 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:18:08,777 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_1561 v_~SIZE~0_324) (< v_main_~c~0_1561 v_~last~0_329)) InVars {~SIZE~0=v_~SIZE~0_324, main_~c~0=v_main_~c~0_1561, ~last~0=v_~last~0_329} OutVars{~SIZE~0=v_~SIZE~0_324, main_~c~0=v_main_~c~0_1561, ~last~0=v_~last~0_329} AuxVars[] AssignedVars[] [2021-05-03 00:18:08,778 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size [2021-05-03 00:18:08,779 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:18:08,780 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:18:08,793 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:18:08,797 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:18:08,823 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size 66 [2021-05-03 00:18:08,842 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:18:08,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:18:08,914 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:18:08,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:18:08,918 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:18:08,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:18:08,920 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:18:08,922 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:18:09,622 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:18:09,623 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1049889774] [2021-05-03 00:18:09,623 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1049889774] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:18:09,623 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:18:09,623 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2021-05-03 00:18:09,623 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464329658] [2021-05-03 00:18:09,623 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states [2021-05-03 00:18:09,623 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:18:09,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-05-03 00:18:09,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=514, Unknown=0, NotChecked=0, Total=600 [2021-05-03 00:18:09,624 INFO L87 Difference]: Start difference. First operand 320 states and 386 transitions. Second operand has 23 states, 23 states have (on average 2.391304347826087) internal successors, (55), 22 states have internal predecessors, (55), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:18:10,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:18:10,681 INFO L93 Difference]: Finished difference Result 695 states and 818 transitions. [2021-05-03 00:18:10,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-05-03 00:18:10,682 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.391304347826087) internal successors, (55), 22 states have internal predecessors, (55), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 61 [2021-05-03 00:18:10,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:18:10,683 INFO L225 Difference]: With dead ends: 695 [2021-05-03 00:18:10,683 INFO L226 Difference]: Without dead ends: 425 [2021-05-03 00:18:10,684 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 12 SyntacticMatches, 23 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 346 ImplicationChecksByTransitivity, 750.1ms TimeCoverageRelationStatistics Valid=99, Invalid=603, Unknown=0, NotChecked=0, Total=702 [2021-05-03 00:18:10,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 425 states. [2021-05-03 00:18:10,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 425 to 320. [2021-05-03 00:18:10,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 320 states, 310 states have (on average 1.2096774193548387) internal successors, (375), 310 states have internal predecessors, (375), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:18:10,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 386 transitions. [2021-05-03 00:18:10,935 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 386 transitions. Word has length 61 [2021-05-03 00:18:10,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:18:10,935 INFO L480 AbstractCegarLoop]: Abstraction has 320 states and 386 transitions. [2021-05-03 00:18:10,935 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 23 states, 23 states have (on average 2.391304347826087) internal successors, (55), 22 states have internal predecessors, (55), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:18:10,935 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 386 transitions. [2021-05-03 00:18:10,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2021-05-03 00:18:10,936 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:18:10,936 INFO L523 BasicCegarLoop]: trace histogram [13, 13, 10, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:18:10,936 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable411 [2021-05-03 00:18:10,936 INFO L428 AbstractCegarLoop]: === Iteration 100 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:18:10,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:18:10,936 INFO L82 PathProgramCache]: Analyzing trace with hash -793831265, now seen corresponding path program 69 times [2021-05-03 00:18:10,936 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:18:10,936 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1705661585] [2021-05-03 00:18:10,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:18:10,942 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_~last~0_330 v_main_~c~0_1578) (< (+ v_main_~c~0_1578 1) v_~SIZE~0_325)) InVars {~SIZE~0=v_~SIZE~0_325, main_~c~0=v_main_~c~0_1578, ~last~0=v_~last~0_330} OutVars{~SIZE~0=v_~SIZE~0_325, main_~c~0=v_main_~c~0_1578, ~last~0=v_~last~0_330} AuxVars[] AssignedVars[] [2021-05-03 00:18:10,944 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size [2021-05-03 00:18:10,958 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:18:10,959 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:18:10,968 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:18:10,970 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:18:10,983 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size 78 [2021-05-03 00:18:11,002 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_1580 v_~last~0_331) (< (+ v_main_~c~0_1580 1) v_~SIZE~0_326)) InVars {~SIZE~0=v_~SIZE~0_326, main_~c~0=v_main_~c~0_1580, ~last~0=v_~last~0_331} OutVars{~SIZE~0=v_~SIZE~0_326, main_~c~0=v_main_~c~0_1580, ~last~0=v_~last~0_331} AuxVars[] AssignedVars[] [2021-05-03 00:18:11,003 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:18:11,014 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:18:11,016 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:18:11,029 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:18:11,034 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:18:11,048 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:18:11,071 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:18:11,074 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_~last~0_332 v_main_~c~0_1582) (< v_main_~c~0_1582 v_~SIZE~0_327)) InVars {~SIZE~0=v_~SIZE~0_327, main_~c~0=v_main_~c~0_1582, ~last~0=v_~last~0_332} OutVars{~SIZE~0=v_~SIZE~0_327, main_~c~0=v_main_~c~0_1582, ~last~0=v_~last~0_332} AuxVars[] AssignedVars[] [2021-05-03 00:18:11,076 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:18:11,092 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:18:11,094 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:18:11,103 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:18:11,105 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:18:11,121 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:18:11,143 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_1584 v_~SIZE~0_328) (< v_main_~c~0_1584 v_~last~0_333)) InVars {~SIZE~0=v_~SIZE~0_328, main_~c~0=v_main_~c~0_1584, ~last~0=v_~last~0_333} OutVars{~SIZE~0=v_~SIZE~0_328, main_~c~0=v_main_~c~0_1584, ~last~0=v_~last~0_333} AuxVars[] AssignedVars[] [2021-05-03 00:18:11,144 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size [2021-05-03 00:18:11,156 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:18:11,158 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:18:11,170 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:18:11,174 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:18:11,188 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size 66 [2021-05-03 00:18:11,208 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:18:11,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:18:11,259 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:18:11,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:18:11,263 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:18:11,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:18:11,264 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:18:11,267 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:18:11,938 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:18:11,938 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1705661585] [2021-05-03 00:18:11,938 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1705661585] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:18:11,938 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:18:11,938 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2021-05-03 00:18:11,938 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818925554] [2021-05-03 00:18:11,939 INFO L460 AbstractCegarLoop]: Interpolant automaton has 24 states [2021-05-03 00:18:11,939 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:18:11,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2021-05-03 00:18:11,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=513, Unknown=0, NotChecked=0, Total=600 [2021-05-03 00:18:11,939 INFO L87 Difference]: Start difference. First operand 320 states and 386 transitions. Second operand has 24 states, 24 states have (on average 2.2916666666666665) internal successors, (55), 23 states have internal predecessors, (55), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:18:13,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:18:13,120 INFO L93 Difference]: Finished difference Result 692 states and 819 transitions. [2021-05-03 00:18:13,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-05-03 00:18:13,121 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 2.2916666666666665) internal successors, (55), 23 states have internal predecessors, (55), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 61 [2021-05-03 00:18:13,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:18:13,122 INFO L225 Difference]: With dead ends: 692 [2021-05-03 00:18:13,122 INFO L226 Difference]: Without dead ends: 422 [2021-05-03 00:18:13,123 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 12 SyntacticMatches, 22 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 361 ImplicationChecksByTransitivity, 694.3ms TimeCoverageRelationStatistics Valid=103, Invalid=599, Unknown=0, NotChecked=0, Total=702 [2021-05-03 00:18:13,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 422 states. [2021-05-03 00:18:13,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 422 to 320. [2021-05-03 00:18:13,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 320 states, 310 states have (on average 1.2096774193548387) internal successors, (375), 310 states have internal predecessors, (375), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:18:13,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 386 transitions. [2021-05-03 00:18:13,400 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 386 transitions. Word has length 61 [2021-05-03 00:18:13,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:18:13,400 INFO L480 AbstractCegarLoop]: Abstraction has 320 states and 386 transitions. [2021-05-03 00:18:13,401 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 24 states, 24 states have (on average 2.2916666666666665) internal successors, (55), 23 states have internal predecessors, (55), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:18:13,401 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 386 transitions. [2021-05-03 00:18:13,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2021-05-03 00:18:13,401 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:18:13,401 INFO L523 BasicCegarLoop]: trace histogram [13, 13, 9, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:18:13,401 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable416 [2021-05-03 00:18:13,401 INFO L428 AbstractCegarLoop]: === Iteration 101 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:18:13,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:18:13,402 INFO L82 PathProgramCache]: Analyzing trace with hash -1823190563, now seen corresponding path program 70 times [2021-05-03 00:18:13,402 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:18:13,402 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [826914305] [2021-05-03 00:18:13,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:18:13,408 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (+ v_main_~c~0_1601 1) v_~SIZE~0_329) (<= v_~last~0_334 v_main_~c~0_1601)) InVars {~SIZE~0=v_~SIZE~0_329, main_~c~0=v_main_~c~0_1601, ~last~0=v_~last~0_334} OutVars{~SIZE~0=v_~SIZE~0_329, main_~c~0=v_main_~c~0_1601, ~last~0=v_~last~0_334} AuxVars[] AssignedVars[] [2021-05-03 00:18:13,410 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size [2021-05-03 00:18:13,411 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:18:13,413 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:18:13,425 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:18:13,428 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:18:13,478 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size 78 [2021-05-03 00:18:13,499 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (+ v_main_~c~0_1603 1) v_~SIZE~0_330) (< v_main_~c~0_1603 v_~last~0_335)) InVars {~SIZE~0=v_~SIZE~0_330, main_~c~0=v_main_~c~0_1603, ~last~0=v_~last~0_335} OutVars{~SIZE~0=v_~SIZE~0_330, main_~c~0=v_main_~c~0_1603, ~last~0=v_~last~0_335} AuxVars[] AssignedVars[] [2021-05-03 00:18:13,500 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:18:13,513 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:18:13,514 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:18:13,526 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:18:13,531 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:18:13,544 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:18:13,562 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:18:13,564 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_~last~0_336 v_main_~c~0_1605) (< v_main_~c~0_1605 v_~SIZE~0_331)) InVars {~SIZE~0=v_~SIZE~0_331, main_~c~0=v_main_~c~0_1605, ~last~0=v_~last~0_336} OutVars{~SIZE~0=v_~SIZE~0_331, main_~c~0=v_main_~c~0_1605, ~last~0=v_~last~0_336} AuxVars[] AssignedVars[] [2021-05-03 00:18:13,566 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:18:13,566 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:18:13,568 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:18:13,578 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:18:13,580 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:18:13,606 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:18:13,626 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_1607 v_~last~0_337) (< v_main_~c~0_1607 v_~SIZE~0_332)) InVars {~SIZE~0=v_~SIZE~0_332, main_~c~0=v_main_~c~0_1607, ~last~0=v_~last~0_337} OutVars{~SIZE~0=v_~SIZE~0_332, main_~c~0=v_main_~c~0_1607, ~last~0=v_~last~0_337} AuxVars[] AssignedVars[] [2021-05-03 00:18:13,627 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size [2021-05-03 00:18:13,639 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:18:13,641 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:18:13,655 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:18:13,660 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:18:13,673 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size 66 [2021-05-03 00:18:13,693 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:18:13,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:18:13,779 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:18:13,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:18:13,785 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:18:13,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:18:13,787 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:18:13,789 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:18:15,099 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:18:15,100 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [826914305] [2021-05-03 00:18:15,100 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [826914305] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:18:15,100 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:18:15,100 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2021-05-03 00:18:15,100 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2015815379] [2021-05-03 00:18:15,100 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states [2021-05-03 00:18:15,100 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:18:15,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-05-03 00:18:15,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=555, Unknown=0, NotChecked=0, Total=650 [2021-05-03 00:18:15,101 INFO L87 Difference]: Start difference. First operand 320 states and 386 transitions. Second operand has 25 states, 25 states have (on average 2.2) internal successors, (55), 24 states have internal predecessors, (55), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:18:16,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:18:16,451 INFO L93 Difference]: Finished difference Result 683 states and 810 transitions. [2021-05-03 00:18:16,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2021-05-03 00:18:16,452 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 2.2) internal successors, (55), 24 states have internal predecessors, (55), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 61 [2021-05-03 00:18:16,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:18:16,453 INFO L225 Difference]: With dead ends: 683 [2021-05-03 00:18:16,453 INFO L226 Difference]: Without dead ends: 413 [2021-05-03 00:18:16,454 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 12 SyntacticMatches, 21 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 408 ImplicationChecksByTransitivity, 1360.3ms TimeCoverageRelationStatistics Valid=113, Invalid=643, Unknown=0, NotChecked=0, Total=756 [2021-05-03 00:18:16,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states. [2021-05-03 00:18:16,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 320. [2021-05-03 00:18:16,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 320 states, 310 states have (on average 1.2096774193548387) internal successors, (375), 310 states have internal predecessors, (375), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:18:16,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 386 transitions. [2021-05-03 00:18:16,712 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 386 transitions. Word has length 61 [2021-05-03 00:18:16,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:18:16,712 INFO L480 AbstractCegarLoop]: Abstraction has 320 states and 386 transitions. [2021-05-03 00:18:16,712 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 25 states, 25 states have (on average 2.2) internal successors, (55), 24 states have internal predecessors, (55), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:18:16,712 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 386 transitions. [2021-05-03 00:18:16,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2021-05-03 00:18:16,713 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:18:16,713 INFO L523 BasicCegarLoop]: trace histogram [13, 13, 8, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:18:16,713 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable421 [2021-05-03 00:18:16,713 INFO L428 AbstractCegarLoop]: === Iteration 102 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:18:16,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:18:16,713 INFO L82 PathProgramCache]: Analyzing trace with hash 1627771231, now seen corresponding path program 71 times [2021-05-03 00:18:16,713 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:18:16,713 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [877553197] [2021-05-03 00:18:16,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:18:16,725 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_~last~0_338 v_main_~c~0_1624) (< (+ v_main_~c~0_1624 1) v_~SIZE~0_333)) InVars {~SIZE~0=v_~SIZE~0_333, main_~c~0=v_main_~c~0_1624, ~last~0=v_~last~0_338} OutVars{~SIZE~0=v_~SIZE~0_333, main_~c~0=v_main_~c~0_1624, ~last~0=v_~last~0_338} AuxVars[] AssignedVars[] [2021-05-03 00:18:16,727 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size [2021-05-03 00:18:16,727 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:18:16,729 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:18:16,739 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:18:16,742 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:18:16,771 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size 78 [2021-05-03 00:18:16,792 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (+ v_main_~c~0_1626 1) v_~SIZE~0_334) (< v_main_~c~0_1626 v_~last~0_339)) InVars {~SIZE~0=v_~SIZE~0_334, main_~c~0=v_main_~c~0_1626, ~last~0=v_~last~0_339} OutVars{~SIZE~0=v_~SIZE~0_334, main_~c~0=v_main_~c~0_1626, ~last~0=v_~last~0_339} AuxVars[] AssignedVars[] [2021-05-03 00:18:16,794 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:18:16,808 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:18:16,810 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:18:16,824 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:18:16,828 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:18:16,842 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:18:16,861 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:18:16,863 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_1628 v_~SIZE~0_335) (<= v_~last~0_340 v_main_~c~0_1628)) InVars {~SIZE~0=v_~SIZE~0_335, main_~c~0=v_main_~c~0_1628, ~last~0=v_~last~0_340} OutVars{~SIZE~0=v_~SIZE~0_335, main_~c~0=v_main_~c~0_1628, ~last~0=v_~last~0_340} AuxVars[] AssignedVars[] [2021-05-03 00:18:16,864 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:18:16,865 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:18:16,872 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:18:16,881 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:18:16,884 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:18:16,911 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:18:16,931 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_1630 v_~last~0_341) (< v_main_~c~0_1630 v_~SIZE~0_336)) InVars {~SIZE~0=v_~SIZE~0_336, main_~c~0=v_main_~c~0_1630, ~last~0=v_~last~0_341} OutVars{~SIZE~0=v_~SIZE~0_336, main_~c~0=v_main_~c~0_1630, ~last~0=v_~last~0_341} AuxVars[] AssignedVars[] [2021-05-03 00:18:16,932 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size [2021-05-03 00:18:16,945 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:18:16,947 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:18:16,960 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:18:16,964 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:18:16,978 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size 66 [2021-05-03 00:18:16,996 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:18:17,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:18:17,097 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:18:17,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:18:17,101 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:18:17,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:18:17,103 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:18:17,105 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:18:17,901 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:18:17,902 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [877553197] [2021-05-03 00:18:17,902 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [877553197] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:18:17,902 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:18:17,902 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2021-05-03 00:18:17,902 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2020171927] [2021-05-03 00:18:17,902 INFO L460 AbstractCegarLoop]: Interpolant automaton has 26 states [2021-05-03 00:18:17,902 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:18:17,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2021-05-03 00:18:17,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=599, Unknown=0, NotChecked=0, Total=702 [2021-05-03 00:18:17,903 INFO L87 Difference]: Start difference. First operand 320 states and 386 transitions. Second operand has 26 states, 26 states have (on average 2.1153846153846154) internal successors, (55), 25 states have internal predecessors, (55), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:18:19,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:18:19,573 INFO L93 Difference]: Finished difference Result 674 states and 801 transitions. [2021-05-03 00:18:19,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2021-05-03 00:18:19,575 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 2.1153846153846154) internal successors, (55), 25 states have internal predecessors, (55), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 61 [2021-05-03 00:18:19,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:18:19,576 INFO L225 Difference]: With dead ends: 674 [2021-05-03 00:18:19,597 INFO L226 Difference]: Without dead ends: 404 [2021-05-03 00:18:19,598 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 12 SyntacticMatches, 20 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 446 ImplicationChecksByTransitivity, 849.1ms TimeCoverageRelationStatistics Valid=123, Invalid=689, Unknown=0, NotChecked=0, Total=812 [2021-05-03 00:18:19,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 404 states. [2021-05-03 00:18:20,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 404 to 320. [2021-05-03 00:18:20,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 320 states, 310 states have (on average 1.2096774193548387) internal successors, (375), 310 states have internal predecessors, (375), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:18:20,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 386 transitions. [2021-05-03 00:18:20,045 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 386 transitions. Word has length 61 [2021-05-03 00:18:20,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:18:20,045 INFO L480 AbstractCegarLoop]: Abstraction has 320 states and 386 transitions. [2021-05-03 00:18:20,045 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 26 states, 26 states have (on average 2.1153846153846154) internal successors, (55), 25 states have internal predecessors, (55), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:18:20,046 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 386 transitions. [2021-05-03 00:18:20,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2021-05-03 00:18:20,046 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:18:20,046 INFO L523 BasicCegarLoop]: trace histogram [13, 13, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:18:20,046 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable426 [2021-05-03 00:18:20,046 INFO L428 AbstractCegarLoop]: === Iteration 103 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:18:20,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:18:20,047 INFO L82 PathProgramCache]: Analyzing trace with hash 1902530845, now seen corresponding path program 72 times [2021-05-03 00:18:20,047 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:18:20,047 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1491803455] [2021-05-03 00:18:20,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:18:20,055 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (+ v_main_~c~0_1647 1) v_~SIZE~0_337) (<= v_~last~0_342 v_main_~c~0_1647)) InVars {~SIZE~0=v_~SIZE~0_337, main_~c~0=v_main_~c~0_1647, ~last~0=v_~last~0_342} OutVars{~SIZE~0=v_~SIZE~0_337, main_~c~0=v_main_~c~0_1647, ~last~0=v_~last~0_342} AuxVars[] AssignedVars[] [2021-05-03 00:18:20,058 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size [2021-05-03 00:18:20,078 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:18:20,081 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:18:20,095 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:18:20,098 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:18:20,119 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size 78 [2021-05-03 00:18:20,145 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (+ v_main_~c~0_1649 1) v_~SIZE~0_338) (< v_main_~c~0_1649 v_~last~0_343)) InVars {~SIZE~0=v_~SIZE~0_338, main_~c~0=v_main_~c~0_1649, ~last~0=v_~last~0_343} OutVars{~SIZE~0=v_~SIZE~0_338, main_~c~0=v_main_~c~0_1649, ~last~0=v_~last~0_343} AuxVars[] AssignedVars[] [2021-05-03 00:18:20,147 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:18:20,148 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:18:20,150 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:18:20,167 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:18:20,173 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:18:20,206 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:18:20,229 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:18:20,232 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_1651 v_~SIZE~0_339) (<= v_~last~0_344 v_main_~c~0_1651)) InVars {~SIZE~0=v_~SIZE~0_339, main_~c~0=v_main_~c~0_1651, ~last~0=v_~last~0_344} OutVars{~SIZE~0=v_~SIZE~0_339, main_~c~0=v_main_~c~0_1651, ~last~0=v_~last~0_344} AuxVars[] AssignedVars[] [2021-05-03 00:18:20,234 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:18:20,235 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:18:20,237 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:18:20,250 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:18:20,253 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:18:20,290 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:18:20,318 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_1653 v_~last~0_345) (< v_main_~c~0_1653 v_~SIZE~0_340)) InVars {~SIZE~0=v_~SIZE~0_340, main_~c~0=v_main_~c~0_1653, ~last~0=v_~last~0_345} OutVars{~SIZE~0=v_~SIZE~0_340, main_~c~0=v_main_~c~0_1653, ~last~0=v_~last~0_345} AuxVars[] AssignedVars[] [2021-05-03 00:18:20,320 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size [2021-05-03 00:18:20,342 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:18:20,345 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:18:20,364 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:18:20,370 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:18:20,389 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size 66 [2021-05-03 00:18:20,412 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:18:20,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:18:20,506 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:18:20,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:18:20,514 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:18:20,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:18:20,518 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:18:20,521 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:18:21,355 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:18:21,355 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1491803455] [2021-05-03 00:18:21,355 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1491803455] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:18:21,355 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:18:21,355 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2021-05-03 00:18:21,356 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738432063] [2021-05-03 00:18:21,356 INFO L460 AbstractCegarLoop]: Interpolant automaton has 27 states [2021-05-03 00:18:21,356 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:18:21,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2021-05-03 00:18:21,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=694, Unknown=0, NotChecked=0, Total=812 [2021-05-03 00:18:21,357 INFO L87 Difference]: Start difference. First operand 320 states and 386 transitions. Second operand has 27 states, 27 states have (on average 2.037037037037037) internal successors, (55), 26 states have internal predecessors, (55), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:18:23,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:18:23,038 INFO L93 Difference]: Finished difference Result 671 states and 794 transitions. [2021-05-03 00:18:23,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2021-05-03 00:18:23,040 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 2.037037037037037) internal successors, (55), 26 states have internal predecessors, (55), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 61 [2021-05-03 00:18:23,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:18:23,041 INFO L225 Difference]: With dead ends: 671 [2021-05-03 00:18:23,041 INFO L226 Difference]: Without dead ends: 401 [2021-05-03 00:18:23,042 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 12 SyntacticMatches, 19 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 512 ImplicationChecksByTransitivity, 886.1ms TimeCoverageRelationStatistics Valid=139, Invalid=791, Unknown=0, NotChecked=0, Total=930 [2021-05-03 00:18:23,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 401 states. [2021-05-03 00:18:23,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 401 to 320. [2021-05-03 00:18:23,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 320 states, 310 states have (on average 1.2096774193548387) internal successors, (375), 310 states have internal predecessors, (375), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:18:23,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 386 transitions. [2021-05-03 00:18:23,581 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 386 transitions. Word has length 61 [2021-05-03 00:18:23,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:18:23,581 INFO L480 AbstractCegarLoop]: Abstraction has 320 states and 386 transitions. [2021-05-03 00:18:23,582 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 27 states, 27 states have (on average 2.037037037037037) internal successors, (55), 26 states have internal predecessors, (55), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:18:23,582 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 386 transitions. [2021-05-03 00:18:23,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2021-05-03 00:18:23,582 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:18:23,582 INFO L523 BasicCegarLoop]: trace histogram [13, 13, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:18:23,582 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable431 [2021-05-03 00:18:23,582 INFO L428 AbstractCegarLoop]: === Iteration 104 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:18:23,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:18:23,583 INFO L82 PathProgramCache]: Analyzing trace with hash -1006233057, now seen corresponding path program 73 times [2021-05-03 00:18:23,583 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:18:23,583 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1065934283] [2021-05-03 00:18:23,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:18:23,591 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (+ v_main_~c~0_1670 1) v_~SIZE~0_341) (<= v_~last~0_346 v_main_~c~0_1670)) InVars {~SIZE~0=v_~SIZE~0_341, main_~c~0=v_main_~c~0_1670, ~last~0=v_~last~0_346} OutVars{~SIZE~0=v_~SIZE~0_341, main_~c~0=v_main_~c~0_1670, ~last~0=v_~last~0_346} AuxVars[] AssignedVars[] [2021-05-03 00:18:23,593 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size [2021-05-03 00:18:23,594 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:18:23,596 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:18:23,606 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:18:23,609 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:18:23,641 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size 78 [2021-05-03 00:18:23,664 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (+ v_main_~c~0_1672 1) v_~SIZE~0_342) (< v_main_~c~0_1672 v_~last~0_347)) InVars {~SIZE~0=v_~SIZE~0_342, main_~c~0=v_main_~c~0_1672, ~last~0=v_~last~0_347} OutVars{~SIZE~0=v_~SIZE~0_342, main_~c~0=v_main_~c~0_1672, ~last~0=v_~last~0_347} AuxVars[] AssignedVars[] [2021-05-03 00:18:23,666 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:18:23,667 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:18:23,668 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:18:23,685 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:18:23,691 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:18:23,723 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:18:23,743 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:18:23,745 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_1674 v_~SIZE~0_343) (<= v_~last~0_348 v_main_~c~0_1674)) InVars {~SIZE~0=v_~SIZE~0_343, main_~c~0=v_main_~c~0_1674, ~last~0=v_~last~0_348} OutVars{~SIZE~0=v_~SIZE~0_343, main_~c~0=v_main_~c~0_1674, ~last~0=v_~last~0_348} AuxVars[] AssignedVars[] [2021-05-03 00:18:23,748 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:18:23,749 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:18:23,750 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:18:23,762 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:18:23,766 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:18:23,804 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:18:23,828 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_1676 v_~SIZE~0_344) (< v_main_~c~0_1676 v_~last~0_349)) InVars {~SIZE~0=v_~SIZE~0_344, main_~c~0=v_main_~c~0_1676, ~last~0=v_~last~0_349} OutVars{~SIZE~0=v_~SIZE~0_344, main_~c~0=v_main_~c~0_1676, ~last~0=v_~last~0_349} AuxVars[] AssignedVars[] [2021-05-03 00:18:23,830 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size [2021-05-03 00:18:23,831 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:18:23,833 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:18:23,849 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:18:23,855 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:18:23,887 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size 66 [2021-05-03 00:18:23,910 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:18:23,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:18:23,997 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:18:23,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:18:24,002 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:18:24,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:18:24,006 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:18:24,009 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:18:24,838 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:18:24,838 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1065934283] [2021-05-03 00:18:24,839 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1065934283] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:18:24,839 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:18:24,839 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2021-05-03 00:18:24,839 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [170862998] [2021-05-03 00:18:24,839 INFO L460 AbstractCegarLoop]: Interpolant automaton has 28 states [2021-05-03 00:18:24,839 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:18:24,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2021-05-03 00:18:24,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=744, Unknown=0, NotChecked=0, Total=870 [2021-05-03 00:18:24,840 INFO L87 Difference]: Start difference. First operand 320 states and 386 transitions. Second operand has 28 states, 28 states have (on average 1.9642857142857142) internal successors, (55), 27 states have internal predecessors, (55), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:18:25,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:18:25,945 INFO L93 Difference]: Finished difference Result 665 states and 788 transitions. [2021-05-03 00:18:25,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2021-05-03 00:18:25,946 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 1.9642857142857142) internal successors, (55), 27 states have internal predecessors, (55), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 61 [2021-05-03 00:18:25,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:18:25,946 INFO L225 Difference]: With dead ends: 665 [2021-05-03 00:18:25,946 INFO L226 Difference]: Without dead ends: 395 [2021-05-03 00:18:25,949 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 12 SyntacticMatches, 18 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 531 ImplicationChecksByTransitivity, 870.9ms TimeCoverageRelationStatistics Valid=149, Invalid=843, Unknown=0, NotChecked=0, Total=992 [2021-05-03 00:18:25,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2021-05-03 00:18:26,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 320. [2021-05-03 00:18:26,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 320 states, 310 states have (on average 1.2096774193548387) internal successors, (375), 310 states have internal predecessors, (375), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:18:26,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 386 transitions. [2021-05-03 00:18:26,324 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 386 transitions. Word has length 61 [2021-05-03 00:18:26,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:18:26,324 INFO L480 AbstractCegarLoop]: Abstraction has 320 states and 386 transitions. [2021-05-03 00:18:26,324 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 28 states, 28 states have (on average 1.9642857142857142) internal successors, (55), 27 states have internal predecessors, (55), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:18:26,324 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 386 transitions. [2021-05-03 00:18:26,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2021-05-03 00:18:26,325 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:18:26,325 INFO L523 BasicCegarLoop]: trace histogram [13, 13, 8, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:18:26,325 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable436 [2021-05-03 00:18:26,325 INFO L428 AbstractCegarLoop]: === Iteration 105 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:18:26,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:18:26,325 INFO L82 PathProgramCache]: Analyzing trace with hash -944193443, now seen corresponding path program 74 times [2021-05-03 00:18:26,326 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:18:26,326 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [741342520] [2021-05-03 00:18:26,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:18:26,332 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_~last~0_350 v_main_~c~0_1693) (< (+ v_main_~c~0_1693 1) v_~SIZE~0_345)) InVars {~SIZE~0=v_~SIZE~0_345, main_~c~0=v_main_~c~0_1693, ~last~0=v_~last~0_350} OutVars{~SIZE~0=v_~SIZE~0_345, main_~c~0=v_main_~c~0_1693, ~last~0=v_~last~0_350} AuxVars[] AssignedVars[] [2021-05-03 00:18:26,334 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size [2021-05-03 00:18:26,335 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:18:26,336 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:18:26,347 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:18:26,349 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:18:26,380 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size 78 [2021-05-03 00:18:26,412 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (+ v_main_~c~0_1695 1) v_~SIZE~0_346) (< v_main_~c~0_1695 v_~last~0_351)) InVars {~SIZE~0=v_~SIZE~0_346, main_~c~0=v_main_~c~0_1695, ~last~0=v_~last~0_351} OutVars{~SIZE~0=v_~SIZE~0_346, main_~c~0=v_main_~c~0_1695, ~last~0=v_~last~0_351} AuxVars[] AssignedVars[] [2021-05-03 00:18:26,415 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:18:26,433 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:18:26,435 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:18:26,455 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:18:26,462 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:18:26,480 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:18:26,504 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:18:26,507 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_~last~0_352 v_main_~c~0_1697) (< v_main_~c~0_1697 v_~SIZE~0_347)) InVars {~SIZE~0=v_~SIZE~0_347, main_~c~0=v_main_~c~0_1697, ~last~0=v_~last~0_352} OutVars{~SIZE~0=v_~SIZE~0_347, main_~c~0=v_main_~c~0_1697, ~last~0=v_~last~0_352} AuxVars[] AssignedVars[] [2021-05-03 00:18:26,508 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:18:26,529 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:18:26,531 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:18:26,543 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:18:26,547 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:18:26,566 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:18:26,589 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_1699 v_~last~0_353) (< v_main_~c~0_1699 v_~SIZE~0_348)) InVars {~SIZE~0=v_~SIZE~0_348, main_~c~0=v_main_~c~0_1699, ~last~0=v_~last~0_353} OutVars{~SIZE~0=v_~SIZE~0_348, main_~c~0=v_main_~c~0_1699, ~last~0=v_~last~0_353} AuxVars[] AssignedVars[] [2021-05-03 00:18:26,591 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size [2021-05-03 00:18:26,606 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:18:26,608 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:18:26,623 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:18:26,629 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:18:26,647 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size 66 [2021-05-03 00:18:26,668 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:18:26,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:18:26,729 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:18:26,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:18:26,734 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:18:26,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:18:26,736 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:18:26,740 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:18:27,613 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:18:27,613 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [741342520] [2021-05-03 00:18:27,613 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [741342520] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:18:27,613 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:18:27,613 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2021-05-03 00:18:27,613 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1448455693] [2021-05-03 00:18:27,613 INFO L460 AbstractCegarLoop]: Interpolant automaton has 29 states [2021-05-03 00:18:27,613 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:18:27,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2021-05-03 00:18:27,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=743, Unknown=0, NotChecked=0, Total=870 [2021-05-03 00:18:27,614 INFO L87 Difference]: Start difference. First operand 320 states and 386 transitions. Second operand has 29 states, 29 states have (on average 1.896551724137931) internal successors, (55), 28 states have internal predecessors, (55), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:18:28,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:18:28,915 INFO L93 Difference]: Finished difference Result 647 states and 774 transitions. [2021-05-03 00:18:28,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2021-05-03 00:18:28,916 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 1.896551724137931) internal successors, (55), 28 states have internal predecessors, (55), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 61 [2021-05-03 00:18:28,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:18:28,917 INFO L225 Difference]: With dead ends: 647 [2021-05-03 00:18:28,917 INFO L226 Difference]: Without dead ends: 377 [2021-05-03 00:18:28,917 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 14 SyntacticMatches, 15 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 466 ImplicationChecksByTransitivity, 900.7ms TimeCoverageRelationStatistics Valid=153, Invalid=839, Unknown=0, NotChecked=0, Total=992 [2021-05-03 00:18:28,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2021-05-03 00:18:29,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 320. [2021-05-03 00:18:29,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 320 states, 310 states have (on average 1.2096774193548387) internal successors, (375), 310 states have internal predecessors, (375), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:18:29,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 386 transitions. [2021-05-03 00:18:29,274 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 386 transitions. Word has length 61 [2021-05-03 00:18:29,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:18:29,275 INFO L480 AbstractCegarLoop]: Abstraction has 320 states and 386 transitions. [2021-05-03 00:18:29,275 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 29 states, 29 states have (on average 1.896551724137931) internal successors, (55), 28 states have internal predecessors, (55), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:18:29,275 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 386 transitions. [2021-05-03 00:18:29,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2021-05-03 00:18:29,275 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:18:29,275 INFO L523 BasicCegarLoop]: trace histogram [13, 13, 9, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:18:29,275 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable441 [2021-05-03 00:18:29,275 INFO L428 AbstractCegarLoop]: === Iteration 106 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:18:29,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:18:29,276 INFO L82 PathProgramCache]: Analyzing trace with hash 1545335519, now seen corresponding path program 75 times [2021-05-03 00:18:29,276 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:18:29,276 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [37709136] [2021-05-03 00:18:29,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:18:29,284 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_~last~0_354 v_main_~c~0_1716) (< (+ v_main_~c~0_1716 1) v_~SIZE~0_349)) InVars {~SIZE~0=v_~SIZE~0_349, main_~c~0=v_main_~c~0_1716, ~last~0=v_~last~0_354} OutVars{~SIZE~0=v_~SIZE~0_349, main_~c~0=v_main_~c~0_1716, ~last~0=v_~last~0_354} AuxVars[] AssignedVars[] [2021-05-03 00:18:29,286 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size [2021-05-03 00:18:29,306 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:18:29,309 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:18:29,321 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:18:29,324 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:18:29,345 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size 78 [2021-05-03 00:18:29,369 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (+ v_main_~c~0_1718 1) v_~SIZE~0_350) (< v_main_~c~0_1718 v_~last~0_355)) InVars {~SIZE~0=v_~SIZE~0_350, main_~c~0=v_main_~c~0_1718, ~last~0=v_~last~0_355} OutVars{~SIZE~0=v_~SIZE~0_350, main_~c~0=v_main_~c~0_1718, ~last~0=v_~last~0_355} AuxVars[] AssignedVars[] [2021-05-03 00:18:29,371 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:18:29,390 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:18:29,391 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:18:29,408 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:18:29,414 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:18:29,433 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:18:29,455 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:18:29,458 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_~last~0_356 v_main_~c~0_1720) (< v_main_~c~0_1720 v_~SIZE~0_351)) InVars {~SIZE~0=v_~SIZE~0_351, main_~c~0=v_main_~c~0_1720, ~last~0=v_~last~0_356} OutVars{~SIZE~0=v_~SIZE~0_351, main_~c~0=v_main_~c~0_1720, ~last~0=v_~last~0_356} AuxVars[] AssignedVars[] [2021-05-03 00:18:29,460 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:18:29,461 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:18:29,462 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:18:29,474 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:18:29,478 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:18:29,517 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:18:29,544 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_1722 v_~last~0_357) (< v_main_~c~0_1722 v_~SIZE~0_352)) InVars {~SIZE~0=v_~SIZE~0_352, main_~c~0=v_main_~c~0_1722, ~last~0=v_~last~0_357} OutVars{~SIZE~0=v_~SIZE~0_352, main_~c~0=v_main_~c~0_1722, ~last~0=v_~last~0_357} AuxVars[] AssignedVars[] [2021-05-03 00:18:29,545 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size [2021-05-03 00:18:29,546 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:18:29,548 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:18:29,565 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:18:29,570 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:18:29,595 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size 66 [2021-05-03 00:18:29,614 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:18:29,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:18:29,667 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:18:29,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:18:29,672 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:18:29,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:18:29,677 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:18:29,679 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:18:30,452 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:18:30,452 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [37709136] [2021-05-03 00:18:30,452 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [37709136] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:18:30,452 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:18:30,452 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [30] imperfect sequences [] total 30 [2021-05-03 00:18:30,452 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901373423] [2021-05-03 00:18:30,452 INFO L460 AbstractCegarLoop]: Interpolant automaton has 30 states [2021-05-03 00:18:30,452 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:18:30,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2021-05-03 00:18:30,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=795, Unknown=0, NotChecked=0, Total=930 [2021-05-03 00:18:30,453 INFO L87 Difference]: Start difference. First operand 320 states and 386 transitions. Second operand has 30 states, 30 states have (on average 1.8333333333333333) internal successors, (55), 29 states have internal predecessors, (55), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:18:31,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:18:31,365 INFO L93 Difference]: Finished difference Result 638 states and 765 transitions. [2021-05-03 00:18:31,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2021-05-03 00:18:31,366 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 1.8333333333333333) internal successors, (55), 29 states have internal predecessors, (55), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 61 [2021-05-03 00:18:31,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:18:31,367 INFO L225 Difference]: With dead ends: 638 [2021-05-03 00:18:31,367 INFO L226 Difference]: Without dead ends: 368 [2021-05-03 00:18:31,369 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 13 SyntacticMatches, 15 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 486 ImplicationChecksByTransitivity, 800.5ms TimeCoverageRelationStatistics Valid=163, Invalid=893, Unknown=0, NotChecked=0, Total=1056 [2021-05-03 00:18:31,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368 states. [2021-05-03 00:18:31,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368 to 320. [2021-05-03 00:18:31,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 320 states, 310 states have (on average 1.2096774193548387) internal successors, (375), 310 states have internal predecessors, (375), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:18:31,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 386 transitions. [2021-05-03 00:18:31,647 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 386 transitions. Word has length 61 [2021-05-03 00:18:31,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:18:31,647 INFO L480 AbstractCegarLoop]: Abstraction has 320 states and 386 transitions. [2021-05-03 00:18:31,647 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 30 states, 30 states have (on average 1.8333333333333333) internal successors, (55), 29 states have internal predecessors, (55), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:18:31,647 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 386 transitions. [2021-05-03 00:18:31,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2021-05-03 00:18:31,648 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:18:31,648 INFO L523 BasicCegarLoop]: trace histogram [13, 13, 10, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:18:31,648 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable446 [2021-05-03 00:18:31,648 INFO L428 AbstractCegarLoop]: === Iteration 107 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:18:31,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:18:31,648 INFO L82 PathProgramCache]: Analyzing trace with hash 727687069, now seen corresponding path program 76 times [2021-05-03 00:18:31,649 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:18:31,649 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1005342598] [2021-05-03 00:18:31,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:18:31,655 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (+ v_main_~c~0_1739 1) v_~SIZE~0_353) (<= v_~last~0_358 v_main_~c~0_1739)) InVars {~SIZE~0=v_~SIZE~0_353, main_~c~0=v_main_~c~0_1739, ~last~0=v_~last~0_358} OutVars{~SIZE~0=v_~SIZE~0_353, main_~c~0=v_main_~c~0_1739, ~last~0=v_~last~0_358} AuxVars[] AssignedVars[] [2021-05-03 00:18:31,657 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size [2021-05-03 00:18:31,657 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:18:31,658 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:18:31,669 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:18:31,672 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:18:31,703 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size 78 [2021-05-03 00:18:31,723 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (+ v_main_~c~0_1741 1) v_~SIZE~0_354) (< v_main_~c~0_1741 v_~last~0_359)) InVars {~SIZE~0=v_~SIZE~0_354, main_~c~0=v_main_~c~0_1741, ~last~0=v_~last~0_359} OutVars{~SIZE~0=v_~SIZE~0_354, main_~c~0=v_main_~c~0_1741, ~last~0=v_~last~0_359} AuxVars[] AssignedVars[] [2021-05-03 00:18:31,724 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:18:31,737 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:18:31,738 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:18:31,751 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:18:31,755 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:18:31,767 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:18:31,786 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:18:31,787 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_1743 v_~SIZE~0_355) (<= v_~last~0_360 v_main_~c~0_1743)) InVars {~SIZE~0=v_~SIZE~0_355, main_~c~0=v_main_~c~0_1743, ~last~0=v_~last~0_360} OutVars{~SIZE~0=v_~SIZE~0_355, main_~c~0=v_main_~c~0_1743, ~last~0=v_~last~0_360} AuxVars[] AssignedVars[] [2021-05-03 00:18:31,788 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:18:31,804 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:18:31,805 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:18:31,814 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:18:31,817 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:18:31,830 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:18:31,848 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_1745 v_~SIZE~0_356) (< v_main_~c~0_1745 v_~last~0_361)) InVars {~SIZE~0=v_~SIZE~0_356, main_~c~0=v_main_~c~0_1745, ~last~0=v_~last~0_361} OutVars{~SIZE~0=v_~SIZE~0_356, main_~c~0=v_main_~c~0_1745, ~last~0=v_~last~0_361} AuxVars[] AssignedVars[] [2021-05-03 00:18:31,849 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size [2021-05-03 00:18:31,861 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:18:31,862 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:18:31,873 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:18:31,878 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:18:31,891 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size 66 [2021-05-03 00:18:31,908 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:18:31,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:18:31,968 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:18:31,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:18:31,971 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:18:31,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:18:31,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-03 00:18:31,974 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:18:32,895 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:18:32,900 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1005342598] [2021-05-03 00:18:32,900 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1005342598] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:18:32,900 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:18:32,900 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [31] imperfect sequences [] total 31 [2021-05-03 00:18:32,900 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844974526] [2021-05-03 00:18:32,900 INFO L460 AbstractCegarLoop]: Interpolant automaton has 31 states [2021-05-03 00:18:32,901 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:18:32,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2021-05-03 00:18:32,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=849, Unknown=0, NotChecked=0, Total=992 [2021-05-03 00:18:32,901 INFO L87 Difference]: Start difference. First operand 320 states and 386 transitions. Second operand has 31 states, 31 states have (on average 1.7741935483870968) internal successors, (55), 30 states have internal predecessors, (55), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:18:34,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:18:34,260 INFO L93 Difference]: Finished difference Result 629 states and 756 transitions. [2021-05-03 00:18:34,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2021-05-03 00:18:34,262 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 1.7741935483870968) internal successors, (55), 30 states have internal predecessors, (55), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 61 [2021-05-03 00:18:34,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:18:34,263 INFO L225 Difference]: With dead ends: 629 [2021-05-03 00:18:34,263 INFO L226 Difference]: Without dead ends: 359 [2021-05-03 00:18:34,263 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 13 SyntacticMatches, 14 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 477 ImplicationChecksByTransitivity, 952.4ms TimeCoverageRelationStatistics Valid=173, Invalid=949, Unknown=0, NotChecked=0, Total=1122 [2021-05-03 00:18:34,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2021-05-03 00:18:34,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 320. [2021-05-03 00:18:34,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 320 states, 310 states have (on average 1.2096774193548387) internal successors, (375), 310 states have internal predecessors, (375), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:18:34,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 386 transitions. [2021-05-03 00:18:34,669 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 386 transitions. Word has length 61 [2021-05-03 00:18:34,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:18:34,669 INFO L480 AbstractCegarLoop]: Abstraction has 320 states and 386 transitions. [2021-05-03 00:18:34,669 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 31 states, 31 states have (on average 1.7741935483870968) internal successors, (55), 30 states have internal predecessors, (55), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:18:34,669 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 386 transitions. [2021-05-03 00:18:34,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2021-05-03 00:18:34,670 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:18:34,670 INFO L523 BasicCegarLoop]: trace histogram [13, 13, 11, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:18:34,670 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable451 [2021-05-03 00:18:34,670 INFO L428 AbstractCegarLoop]: === Iteration 108 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:18:34,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:18:34,671 INFO L82 PathProgramCache]: Analyzing trace with hash -860660833, now seen corresponding path program 77 times [2021-05-03 00:18:34,671 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:18:34,671 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [754406457] [2021-05-03 00:18:34,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:18:34,679 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_~last~0_362 v_main_~c~0_1762) (< (+ v_main_~c~0_1762 1) v_~SIZE~0_357)) InVars {~SIZE~0=v_~SIZE~0_357, main_~c~0=v_main_~c~0_1762, ~last~0=v_~last~0_362} OutVars{~SIZE~0=v_~SIZE~0_357, main_~c~0=v_main_~c~0_1762, ~last~0=v_~last~0_362} AuxVars[] AssignedVars[] [2021-05-03 00:18:34,681 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size [2021-05-03 00:18:34,683 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:18:34,685 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:18:34,697 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:18:34,701 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:18:34,744 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size 78 [2021-05-03 00:18:34,770 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (+ v_main_~c~0_1764 1) v_~SIZE~0_358) (< v_main_~c~0_1764 v_~last~0_363)) InVars {~SIZE~0=v_~SIZE~0_358, main_~c~0=v_main_~c~0_1764, ~last~0=v_~last~0_363} OutVars{~SIZE~0=v_~SIZE~0_358, main_~c~0=v_main_~c~0_1764, ~last~0=v_~last~0_363} AuxVars[] AssignedVars[] [2021-05-03 00:18:34,773 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:18:34,790 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:18:34,792 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:18:34,808 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:18:34,814 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:18:34,834 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:18:34,860 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:18:34,862 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_~last~0_364 v_main_~c~0_1766) (< v_main_~c~0_1766 v_~SIZE~0_359)) InVars {~SIZE~0=v_~SIZE~0_359, main_~c~0=v_main_~c~0_1766, ~last~0=v_~last~0_364} OutVars{~SIZE~0=v_~SIZE~0_359, main_~c~0=v_main_~c~0_1766, ~last~0=v_~last~0_364} AuxVars[] AssignedVars[] [2021-05-03 00:18:34,864 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:18:34,866 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:18:34,867 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:18:34,882 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:18:34,886 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:18:34,925 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:18:34,952 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_1768 v_~SIZE~0_360) (< v_main_~c~0_1768 v_~last~0_365)) InVars {~SIZE~0=v_~SIZE~0_360, main_~c~0=v_main_~c~0_1768, ~last~0=v_~last~0_365} OutVars{~SIZE~0=v_~SIZE~0_360, main_~c~0=v_main_~c~0_1768, ~last~0=v_~last~0_365} AuxVars[] AssignedVars[] [2021-05-03 00:18:34,954 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size [2021-05-03 00:18:34,956 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:18:34,957 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:18:34,976 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:18:34,983 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:18:35,021 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size 66 [2021-05-03 00:18:35,045 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:18:35,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:18:35,119 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:18:35,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:18:35,124 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:18:35,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:18:35,127 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:18:35,131 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:18:36,294 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:18:36,294 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [754406457] [2021-05-03 00:18:36,294 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [754406457] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:18:36,294 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:18:36,294 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [32] imperfect sequences [] total 32 [2021-05-03 00:18:36,294 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982766432] [2021-05-03 00:18:36,296 INFO L460 AbstractCegarLoop]: Interpolant automaton has 32 states [2021-05-03 00:18:36,296 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:18:36,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2021-05-03 00:18:36,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=905, Unknown=0, NotChecked=0, Total=1056 [2021-05-03 00:18:36,300 INFO L87 Difference]: Start difference. First operand 320 states and 386 transitions. Second operand has 32 states, 32 states have (on average 1.71875) internal successors, (55), 31 states have internal predecessors, (55), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:18:37,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:18:37,708 INFO L93 Difference]: Finished difference Result 623 states and 750 transitions. [2021-05-03 00:18:37,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2021-05-03 00:18:37,709 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 1.71875) internal successors, (55), 31 states have internal predecessors, (55), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 61 [2021-05-03 00:18:37,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:18:37,710 INFO L225 Difference]: With dead ends: 623 [2021-05-03 00:18:37,710 INFO L226 Difference]: Without dead ends: 353 [2021-05-03 00:18:37,711 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 12 SyntacticMatches, 14 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 485 ImplicationChecksByTransitivity, 1189.4ms TimeCoverageRelationStatistics Valid=183, Invalid=1007, Unknown=0, NotChecked=0, Total=1190 [2021-05-03 00:18:37,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2021-05-03 00:18:38,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 320. [2021-05-03 00:18:38,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 320 states, 310 states have (on average 1.2096774193548387) internal successors, (375), 310 states have internal predecessors, (375), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:18:38,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 386 transitions. [2021-05-03 00:18:38,128 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 386 transitions. Word has length 61 [2021-05-03 00:18:38,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:18:38,129 INFO L480 AbstractCegarLoop]: Abstraction has 320 states and 386 transitions. [2021-05-03 00:18:38,129 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 32 states, 32 states have (on average 1.71875) internal successors, (55), 31 states have internal predecessors, (55), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:18:38,129 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 386 transitions. [2021-05-03 00:18:38,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2021-05-03 00:18:38,129 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:18:38,129 INFO L523 BasicCegarLoop]: trace histogram [13, 13, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:18:38,130 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable456 [2021-05-03 00:18:38,130 INFO L428 AbstractCegarLoop]: === Iteration 109 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:18:38,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:18:38,130 INFO L82 PathProgramCache]: Analyzing trace with hash -1871778083, now seen corresponding path program 78 times [2021-05-03 00:18:38,130 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:18:38,130 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [207921360] [2021-05-03 00:18:38,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:18:38,137 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (+ v_main_~c~0_1785 1) v_~SIZE~0_361) (< v_main_~c~0_1785 v_~last~0_366)) InVars {~SIZE~0=v_~SIZE~0_361, main_~c~0=v_main_~c~0_1785, ~last~0=v_~last~0_366} OutVars{~SIZE~0=v_~SIZE~0_361, main_~c~0=v_main_~c~0_1785, ~last~0=v_~last~0_366} AuxVars[] AssignedVars[] [2021-05-03 00:18:38,139 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:18:38,155 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:18:38,158 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:18:38,175 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:18:38,182 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:18:38,204 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:18:38,228 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:18:38,231 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_~last~0_367 v_main_~c~0_1787) (< v_main_~c~0_1787 v_~SIZE~0_362)) InVars {~SIZE~0=v_~SIZE~0_362, main_~c~0=v_main_~c~0_1787, ~last~0=v_~last~0_367} OutVars{~SIZE~0=v_~SIZE~0_362, main_~c~0=v_main_~c~0_1787, ~last~0=v_~last~0_367} AuxVars[] AssignedVars[] [2021-05-03 00:18:38,233 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:18:38,235 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:18:38,237 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:18:38,251 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:18:38,255 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:18:38,293 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:18:38,316 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_1789 v_~SIZE~0_363) (< v_main_~c~0_1789 v_~last~0_368)) InVars {~SIZE~0=v_~SIZE~0_363, main_~c~0=v_main_~c~0_1789, ~last~0=v_~last~0_368} OutVars{~SIZE~0=v_~SIZE~0_363, main_~c~0=v_main_~c~0_1789, ~last~0=v_~last~0_368} AuxVars[] AssignedVars[] [2021-05-03 00:18:38,319 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size [2021-05-03 00:18:38,320 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:18:38,322 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:18:38,341 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:18:38,347 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:18:38,381 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size 66 [2021-05-03 00:18:38,404 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:18:38,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:18:38,470 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:18:38,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:18:38,475 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:18:38,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:18:38,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-03 00:18:38,482 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:18:39,565 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:18:39,566 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [207921360] [2021-05-03 00:18:39,566 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [207921360] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:18:39,566 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:18:39,566 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [33] imperfect sequences [] total 33 [2021-05-03 00:18:39,566 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399512960] [2021-05-03 00:18:39,567 INFO L460 AbstractCegarLoop]: Interpolant automaton has 33 states [2021-05-03 00:18:39,567 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:18:39,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2021-05-03 00:18:39,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=963, Unknown=0, NotChecked=0, Total=1122 [2021-05-03 00:18:39,568 INFO L87 Difference]: Start difference. First operand 320 states and 386 transitions. Second operand has 33 states, 33 states have (on average 1.6666666666666667) internal successors, (55), 32 states have internal predecessors, (55), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:18:40,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:18:40,826 INFO L93 Difference]: Finished difference Result 623 states and 756 transitions. [2021-05-03 00:18:40,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2021-05-03 00:18:40,827 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 1.6666666666666667) internal successors, (55), 32 states have internal predecessors, (55), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 61 [2021-05-03 00:18:40,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:18:40,828 INFO L225 Difference]: With dead ends: 623 [2021-05-03 00:18:40,828 INFO L226 Difference]: Without dead ends: 353 [2021-05-03 00:18:40,829 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 12 SyntacticMatches, 13 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 460 ImplicationChecksByTransitivity, 1110.5ms TimeCoverageRelationStatistics Valid=193, Invalid=1067, Unknown=0, NotChecked=0, Total=1260 [2021-05-03 00:18:40,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2021-05-03 00:18:41,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 291. [2021-05-03 00:18:41,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 291 states, 281 states have (on average 1.199288256227758) internal successors, (337), 282 states have internal predecessors, (337), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:18:41,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 348 transitions. [2021-05-03 00:18:41,180 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 348 transitions. Word has length 61 [2021-05-03 00:18:41,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:18:41,180 INFO L480 AbstractCegarLoop]: Abstraction has 291 states and 348 transitions. [2021-05-03 00:18:41,180 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 33 states, 33 states have (on average 1.6666666666666667) internal successors, (55), 32 states have internal predecessors, (55), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:18:41,180 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 348 transitions. [2021-05-03 00:18:41,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2021-05-03 00:18:41,181 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:18:41,181 INFO L523 BasicCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:18:41,181 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable460 [2021-05-03 00:18:41,181 INFO L428 AbstractCegarLoop]: === Iteration 110 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:18:41,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:18:41,181 INFO L82 PathProgramCache]: Analyzing trace with hash -2037318433, now seen corresponding path program 13 times [2021-05-03 00:18:41,182 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:18:41,182 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [293105876] [2021-05-03 00:18:41,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:18:41,188 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (+ v_main_~c~0_1806 1) v_~SIZE~0_364) (< v_main_~c~0_1806 v_~last~0_369)) InVars {~SIZE~0=v_~SIZE~0_364, main_~c~0=v_main_~c~0_1806, ~last~0=v_~last~0_369} OutVars{~SIZE~0=v_~SIZE~0_364, main_~c~0=v_main_~c~0_1806, ~last~0=v_~last~0_369} AuxVars[] AssignedVars[] [2021-05-03 00:18:41,190 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:18:41,191 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:18:41,193 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:18:41,210 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:18:41,216 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:18:41,250 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:18:41,273 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:18:41,276 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_1808 v_~SIZE~0_365) (< v_main_~c~0_1808 v_~last~0_370)) InVars {~SIZE~0=v_~SIZE~0_365, main_~c~0=v_main_~c~0_1808, ~last~0=v_~last~0_370} OutVars{~SIZE~0=v_~SIZE~0_365, main_~c~0=v_main_~c~0_1808, ~last~0=v_~last~0_370} AuxVars[] AssignedVars[] [2021-05-03 00:18:41,278 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size [2021-05-03 00:18:41,295 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:18:41,298 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:18:41,314 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:18:41,320 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:18:41,341 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size 66 [2021-05-03 00:18:41,365 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:18:41,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:18:41,496 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:18:41,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:18:41,501 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:18:41,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:18:41,504 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:18:43,166 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:18:43,166 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [293105876] [2021-05-03 00:18:43,166 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [293105876] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:18:43,166 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:18:43,166 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [37] imperfect sequences [] total 37 [2021-05-03 00:18:43,166 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1728122984] [2021-05-03 00:18:43,167 INFO L460 AbstractCegarLoop]: Interpolant automaton has 37 states [2021-05-03 00:18:43,167 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:18:43,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2021-05-03 00:18:43,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=183, Invalid=1299, Unknown=0, NotChecked=0, Total=1482 [2021-05-03 00:18:43,168 INFO L87 Difference]: Start difference. First operand 291 states and 348 transitions. Second operand has 37 states, 37 states have (on average 1.4864864864864864) internal successors, (55), 35 states have internal predecessors, (55), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:18:45,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:18:45,940 INFO L93 Difference]: Finished difference Result 672 states and 805 transitions. [2021-05-03 00:18:45,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2021-05-03 00:18:45,941 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 1.4864864864864864) internal successors, (55), 35 states have internal predecessors, (55), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 61 [2021-05-03 00:18:45,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:18:45,942 INFO L225 Difference]: With dead ends: 672 [2021-05-03 00:18:45,943 INFO L226 Difference]: Without dead ends: 393 [2021-05-03 00:18:45,943 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 6 SyntacticMatches, 12 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 786 ImplicationChecksByTransitivity, 2395.1ms TimeCoverageRelationStatistics Valid=297, Invalid=2565, Unknown=0, NotChecked=0, Total=2862 [2021-05-03 00:18:45,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2021-05-03 00:18:46,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 332. [2021-05-03 00:18:46,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 332 states, 322 states have (on average 1.2142857142857142) internal successors, (391), 322 states have internal predecessors, (391), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:18:46,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 402 transitions. [2021-05-03 00:18:46,377 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 402 transitions. Word has length 61 [2021-05-03 00:18:46,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:18:46,377 INFO L480 AbstractCegarLoop]: Abstraction has 332 states and 402 transitions. [2021-05-03 00:18:46,377 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 37 states, 37 states have (on average 1.4864864864864864) internal successors, (55), 35 states have internal predecessors, (55), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:18:46,377 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 402 transitions. [2021-05-03 00:18:46,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2021-05-03 00:18:46,377 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:18:46,378 INFO L523 BasicCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:18:46,378 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable463 [2021-05-03 00:18:46,378 INFO L428 AbstractCegarLoop]: === Iteration 111 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:18:46,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:18:46,378 INFO L82 PathProgramCache]: Analyzing trace with hash -1565519746, now seen corresponding path program 14 times [2021-05-03 00:18:46,378 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:18:46,378 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [439835306] [2021-05-03 00:18:46,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:18:46,385 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (+ v_main_~c~0_1824 1) v_~SIZE~0_366) (<= v_~last~0_371 v_main_~c~0_1824)) InVars {~SIZE~0=v_~SIZE~0_366, main_~c~0=v_main_~c~0_1824, ~last~0=v_~last~0_371} OutVars{~SIZE~0=v_~SIZE~0_366, main_~c~0=v_main_~c~0_1824, ~last~0=v_~last~0_371} AuxVars[] AssignedVars[] [2021-05-03 00:18:46,387 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size [2021-05-03 00:18:46,409 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:18:46,411 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:18:46,427 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:18:46,430 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:18:46,452 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size 78 [2021-05-03 00:18:46,476 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:18:46,478 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_~last~0_372 v_main_~c~0_1826) (< v_main_~c~0_1826 v_~SIZE~0_367)) InVars {~SIZE~0=v_~SIZE~0_367, main_~c~0=v_main_~c~0_1826, ~last~0=v_~last~0_372} OutVars{~SIZE~0=v_~SIZE~0_367, main_~c~0=v_main_~c~0_1826, ~last~0=v_~last~0_372} AuxVars[] AssignedVars[] [2021-05-03 00:18:46,480 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:18:46,503 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:18:46,505 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:18:46,517 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:18:46,521 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:18:46,542 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:18:46,566 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:18:46,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:18:46,634 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:18:46,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:18:46,640 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:18:46,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:18:46,643 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:18:47,376 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:18:47,376 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [439835306] [2021-05-03 00:18:47,376 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [439835306] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:18:47,376 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:18:47,376 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2021-05-03 00:18:47,376 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1720609265] [2021-05-03 00:18:47,377 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states [2021-05-03 00:18:47,377 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:18:47,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2021-05-03 00:18:47,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=426, Unknown=0, NotChecked=0, Total=506 [2021-05-03 00:18:47,377 INFO L87 Difference]: Start difference. First operand 332 states and 402 transitions. Second operand has 22 states, 22 states have (on average 2.6363636363636362) internal successors, (58), 21 states have internal predecessors, (58), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:18:48,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:18:48,611 INFO L93 Difference]: Finished difference Result 731 states and 861 transitions. [2021-05-03 00:18:48,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-05-03 00:18:48,612 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 2.6363636363636362) internal successors, (58), 21 states have internal predecessors, (58), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 64 [2021-05-03 00:18:48,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:18:48,613 INFO L225 Difference]: With dead ends: 731 [2021-05-03 00:18:48,613 INFO L226 Difference]: Without dead ends: 452 [2021-05-03 00:18:48,614 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 13 SyntacticMatches, 27 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 740.2ms TimeCoverageRelationStatistics Valid=84, Invalid=468, Unknown=0, NotChecked=0, Total=552 [2021-05-03 00:18:48,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 452 states. [2021-05-03 00:18:48,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 452 to 341. [2021-05-03 00:18:48,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 341 states, 331 states have (on average 1.2084592145015105) internal successors, (400), 331 states have internal predecessors, (400), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:18:48,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 411 transitions. [2021-05-03 00:18:48,945 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 411 transitions. Word has length 64 [2021-05-03 00:18:48,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:18:48,945 INFO L480 AbstractCegarLoop]: Abstraction has 341 states and 411 transitions. [2021-05-03 00:18:48,945 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 22 states, 22 states have (on average 2.6363636363636362) internal successors, (58), 21 states have internal predecessors, (58), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:18:48,945 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 411 transitions. [2021-05-03 00:18:48,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2021-05-03 00:18:48,946 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:18:48,946 INFO L523 BasicCegarLoop]: trace histogram [14, 14, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:18:48,946 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable466 [2021-05-03 00:18:48,946 INFO L428 AbstractCegarLoop]: === Iteration 112 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:18:48,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:18:48,946 INFO L82 PathProgramCache]: Analyzing trace with hash -2046600004, now seen corresponding path program 79 times [2021-05-03 00:18:48,947 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:18:48,947 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [855125719] [2021-05-03 00:18:48,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:18:48,954 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_~last~0_373 v_main_~c~0_1843) (< (+ v_main_~c~0_1843 1) v_~SIZE~0_368)) InVars {~SIZE~0=v_~SIZE~0_368, main_~c~0=v_main_~c~0_1843, ~last~0=v_~last~0_373} OutVars{~SIZE~0=v_~SIZE~0_368, main_~c~0=v_main_~c~0_1843, ~last~0=v_~last~0_373} AuxVars[] AssignedVars[] [2021-05-03 00:18:48,956 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size [2021-05-03 00:18:48,970 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:18:48,971 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:18:48,979 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:18:48,981 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:18:48,994 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size 78 [2021-05-03 00:18:49,011 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (+ v_main_~c~0_1845 1) v_~SIZE~0_369) (< v_main_~c~0_1845 v_~last~0_374)) InVars {~SIZE~0=v_~SIZE~0_369, main_~c~0=v_main_~c~0_1845, ~last~0=v_~last~0_374} OutVars{~SIZE~0=v_~SIZE~0_369, main_~c~0=v_main_~c~0_1845, ~last~0=v_~last~0_374} AuxVars[] AssignedVars[] [2021-05-03 00:18:49,013 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:18:49,013 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:18:49,014 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:18:49,025 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:18:49,029 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:18:49,052 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:18:49,069 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:18:49,071 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_1847 v_~SIZE~0_370) (<= v_~last~0_375 v_main_~c~0_1847)) InVars {~SIZE~0=v_~SIZE~0_370, main_~c~0=v_main_~c~0_1847, ~last~0=v_~last~0_375} OutVars{~SIZE~0=v_~SIZE~0_370, main_~c~0=v_main_~c~0_1847, ~last~0=v_~last~0_375} AuxVars[] AssignedVars[] [2021-05-03 00:18:49,072 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:18:49,073 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:18:49,074 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:18:49,083 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:18:49,086 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:18:49,110 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:18:49,128 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_1849 v_~last~0_376) (< v_main_~c~0_1849 v_~SIZE~0_371)) InVars {~SIZE~0=v_~SIZE~0_371, main_~c~0=v_main_~c~0_1849, ~last~0=v_~last~0_376} OutVars{~SIZE~0=v_~SIZE~0_371, main_~c~0=v_main_~c~0_1849, ~last~0=v_~last~0_376} AuxVars[] AssignedVars[] [2021-05-03 00:18:49,129 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size [2021-05-03 00:18:49,139 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:18:49,141 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:18:49,151 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:18:49,155 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:18:49,167 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size 66 [2021-05-03 00:18:49,183 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:18:49,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:18:49,229 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:18:49,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:18:49,233 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:18:49,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:18:49,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-03 00:18:49,238 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:18:49,919 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:18:49,919 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [855125719] [2021-05-03 00:18:49,919 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [855125719] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:18:49,919 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:18:49,919 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2021-05-03 00:18:49,919 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [161964386] [2021-05-03 00:18:49,919 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states [2021-05-03 00:18:49,919 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:18:49,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-05-03 00:18:49,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=478, Unknown=0, NotChecked=0, Total=552 [2021-05-03 00:18:49,920 INFO L87 Difference]: Start difference. First operand 341 states and 411 transitions. Second operand has 23 states, 23 states have (on average 2.5217391304347827) internal successors, (58), 22 states have internal predecessors, (58), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:18:51,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:18:51,312 INFO L93 Difference]: Finished difference Result 758 states and 892 transitions. [2021-05-03 00:18:51,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-05-03 00:18:51,312 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.5217391304347827) internal successors, (58), 22 states have internal predecessors, (58), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 64 [2021-05-03 00:18:51,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:18:51,313 INFO L225 Difference]: With dead ends: 758 [2021-05-03 00:18:51,313 INFO L226 Difference]: Without dead ends: 470 [2021-05-03 00:18:51,314 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 12 SyntacticMatches, 26 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 258 ImplicationChecksByTransitivity, 703.2ms TimeCoverageRelationStatistics Valid=86, Invalid=564, Unknown=0, NotChecked=0, Total=650 [2021-05-03 00:18:51,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 470 states. [2021-05-03 00:18:51,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 470 to 341. [2021-05-03 00:18:51,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 341 states, 331 states have (on average 1.2084592145015105) internal successors, (400), 331 states have internal predecessors, (400), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:18:51,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 411 transitions. [2021-05-03 00:18:51,645 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 411 transitions. Word has length 64 [2021-05-03 00:18:51,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:18:51,645 INFO L480 AbstractCegarLoop]: Abstraction has 341 states and 411 transitions. [2021-05-03 00:18:51,646 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 23 states, 23 states have (on average 2.5217391304347827) internal successors, (58), 22 states have internal predecessors, (58), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:18:51,646 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 411 transitions. [2021-05-03 00:18:51,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2021-05-03 00:18:51,646 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:18:51,646 INFO L523 BasicCegarLoop]: trace histogram [14, 14, 12, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:18:51,646 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable471 [2021-05-03 00:18:51,646 INFO L428 AbstractCegarLoop]: === Iteration 113 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:18:51,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:18:51,646 INFO L82 PathProgramCache]: Analyzing trace with hash 1895278910, now seen corresponding path program 80 times [2021-05-03 00:18:51,647 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:18:51,647 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1904885899] [2021-05-03 00:18:51,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:18:51,652 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_~last~0_377 v_main_~c~0_1867) (< (+ v_main_~c~0_1867 1) v_~SIZE~0_372)) InVars {~SIZE~0=v_~SIZE~0_372, main_~c~0=v_main_~c~0_1867, ~last~0=v_~last~0_377} OutVars{~SIZE~0=v_~SIZE~0_372, main_~c~0=v_main_~c~0_1867, ~last~0=v_~last~0_377} AuxVars[] AssignedVars[] [2021-05-03 00:18:51,653 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size [2021-05-03 00:18:51,667 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:18:51,668 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:18:51,677 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:18:51,679 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:18:51,692 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size 78 [2021-05-03 00:18:51,712 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_1869 v_~last~0_378) (< (+ v_main_~c~0_1869 1) v_~SIZE~0_373)) InVars {~SIZE~0=v_~SIZE~0_373, main_~c~0=v_main_~c~0_1869, ~last~0=v_~last~0_378} OutVars{~SIZE~0=v_~SIZE~0_373, main_~c~0=v_main_~c~0_1869, ~last~0=v_~last~0_378} AuxVars[] AssignedVars[] [2021-05-03 00:18:51,714 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:18:51,714 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:18:51,715 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:18:51,727 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:18:51,731 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:18:51,758 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:18:51,779 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:18:51,781 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_~last~0_379 v_main_~c~0_1871) (< v_main_~c~0_1871 v_~SIZE~0_374)) InVars {~SIZE~0=v_~SIZE~0_374, main_~c~0=v_main_~c~0_1871, ~last~0=v_~last~0_379} OutVars{~SIZE~0=v_~SIZE~0_374, main_~c~0=v_main_~c~0_1871, ~last~0=v_~last~0_379} AuxVars[] AssignedVars[] [2021-05-03 00:18:51,783 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:18:51,784 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:18:51,785 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:18:51,798 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:18:51,801 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:18:51,833 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:18:51,860 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_1873 v_~SIZE~0_375) (< v_main_~c~0_1873 v_~last~0_380)) InVars {~SIZE~0=v_~SIZE~0_375, main_~c~0=v_main_~c~0_1873, ~last~0=v_~last~0_380} OutVars{~SIZE~0=v_~SIZE~0_375, main_~c~0=v_main_~c~0_1873, ~last~0=v_~last~0_380} AuxVars[] AssignedVars[] [2021-05-03 00:18:51,861 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size [2021-05-03 00:18:51,875 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:18:51,877 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:18:51,890 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:18:51,895 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:18:51,909 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size 66 [2021-05-03 00:18:51,929 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:18:51,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:18:52,017 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:18:52,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:18:52,022 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:18:52,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:18:52,023 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:18:52,026 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:18:52,856 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:18:52,856 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1904885899] [2021-05-03 00:18:52,856 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1904885899] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:18:52,856 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:18:52,856 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2021-05-03 00:18:52,856 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201012204] [2021-05-03 00:18:52,856 INFO L460 AbstractCegarLoop]: Interpolant automaton has 24 states [2021-05-03 00:18:52,856 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:18:52,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2021-05-03 00:18:52,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=561, Unknown=0, NotChecked=0, Total=650 [2021-05-03 00:18:52,857 INFO L87 Difference]: Start difference. First operand 341 states and 411 transitions. Second operand has 24 states, 24 states have (on average 2.4166666666666665) internal successors, (58), 23 states have internal predecessors, (58), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:18:54,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:18:54,244 INFO L93 Difference]: Finished difference Result 743 states and 873 transitions. [2021-05-03 00:18:54,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-05-03 00:18:54,245 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 2.4166666666666665) internal successors, (58), 23 states have internal predecessors, (58), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 64 [2021-05-03 00:18:54,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:18:54,246 INFO L225 Difference]: With dead ends: 743 [2021-05-03 00:18:54,247 INFO L226 Difference]: Without dead ends: 455 [2021-05-03 00:18:54,247 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 12 SyntacticMatches, 25 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 373 ImplicationChecksByTransitivity, 890.6ms TimeCoverageRelationStatistics Valid=102, Invalid=654, Unknown=0, NotChecked=0, Total=756 [2021-05-03 00:18:54,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 455 states. [2021-05-03 00:18:54,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 455 to 341. [2021-05-03 00:18:54,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 341 states, 331 states have (on average 1.2084592145015105) internal successors, (400), 331 states have internal predecessors, (400), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:18:54,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 411 transitions. [2021-05-03 00:18:54,618 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 411 transitions. Word has length 64 [2021-05-03 00:18:54,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:18:54,618 INFO L480 AbstractCegarLoop]: Abstraction has 341 states and 411 transitions. [2021-05-03 00:18:54,618 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 24 states, 24 states have (on average 2.4166666666666665) internal successors, (58), 23 states have internal predecessors, (58), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:18:54,618 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 411 transitions. [2021-05-03 00:18:54,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2021-05-03 00:18:54,619 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:18:54,619 INFO L523 BasicCegarLoop]: trace histogram [14, 14, 11, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:18:54,619 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable476 [2021-05-03 00:18:54,619 INFO L428 AbstractCegarLoop]: === Iteration 114 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:18:54,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:18:54,619 INFO L82 PathProgramCache]: Analyzing trace with hash -154108932, now seen corresponding path program 81 times [2021-05-03 00:18:54,619 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:18:54,619 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1191569463] [2021-05-03 00:18:54,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:18:54,626 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (+ v_main_~c~0_1891 1) v_~SIZE~0_376) (<= v_~last~0_381 v_main_~c~0_1891)) InVars {~SIZE~0=v_~SIZE~0_376, main_~c~0=v_main_~c~0_1891, ~last~0=v_~last~0_381} OutVars{~SIZE~0=v_~SIZE~0_376, main_~c~0=v_main_~c~0_1891, ~last~0=v_~last~0_381} AuxVars[] AssignedVars[] [2021-05-03 00:18:54,628 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size [2021-05-03 00:18:54,641 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:18:54,658 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:18:54,667 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:18:54,669 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:18:54,683 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size 78 [2021-05-03 00:18:54,703 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (+ v_main_~c~0_1893 1) v_~SIZE~0_377) (< v_main_~c~0_1893 v_~last~0_382)) InVars {~SIZE~0=v_~SIZE~0_377, main_~c~0=v_main_~c~0_1893, ~last~0=v_~last~0_382} OutVars{~SIZE~0=v_~SIZE~0_377, main_~c~0=v_main_~c~0_1893, ~last~0=v_~last~0_382} AuxVars[] AssignedVars[] [2021-05-03 00:18:54,704 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:18:54,717 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:18:54,719 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:18:54,732 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:18:54,736 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:18:54,750 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:18:54,769 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:18:54,771 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_~last~0_383 v_main_~c~0_1895) (< v_main_~c~0_1895 v_~SIZE~0_378)) InVars {~SIZE~0=v_~SIZE~0_378, main_~c~0=v_main_~c~0_1895, ~last~0=v_~last~0_383} OutVars{~SIZE~0=v_~SIZE~0_378, main_~c~0=v_main_~c~0_1895, ~last~0=v_~last~0_383} AuxVars[] AssignedVars[] [2021-05-03 00:18:54,773 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:18:54,774 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:18:54,776 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:18:54,788 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:18:54,791 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:18:54,818 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:18:54,838 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_1897 v_~SIZE~0_379) (< v_main_~c~0_1897 v_~last~0_384)) InVars {~SIZE~0=v_~SIZE~0_379, main_~c~0=v_main_~c~0_1897, ~last~0=v_~last~0_384} OutVars{~SIZE~0=v_~SIZE~0_379, main_~c~0=v_main_~c~0_1897, ~last~0=v_~last~0_384} AuxVars[] AssignedVars[] [2021-05-03 00:18:54,839 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size [2021-05-03 00:18:54,850 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:18:54,854 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:18:54,866 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:18:54,870 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:18:54,882 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size 66 [2021-05-03 00:18:54,900 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:18:54,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:18:54,949 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:18:54,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:18:54,953 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:18:54,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:18:54,955 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:18:54,957 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:18:55,683 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:18:55,683 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1191569463] [2021-05-03 00:18:55,683 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1191569463] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:18:55,683 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:18:55,684 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2021-05-03 00:18:55,684 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582053195] [2021-05-03 00:18:55,684 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states [2021-05-03 00:18:55,684 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:18:55,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-05-03 00:18:55,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=560, Unknown=0, NotChecked=0, Total=650 [2021-05-03 00:18:55,685 INFO L87 Difference]: Start difference. First operand 341 states and 411 transitions. Second operand has 25 states, 25 states have (on average 2.32) internal successors, (58), 24 states have internal predecessors, (58), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:18:57,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:18:57,150 INFO L93 Difference]: Finished difference Result 740 states and 874 transitions. [2021-05-03 00:18:57,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2021-05-03 00:18:57,150 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 2.32) internal successors, (58), 24 states have internal predecessors, (58), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 64 [2021-05-03 00:18:57,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:18:57,151 INFO L225 Difference]: With dead ends: 740 [2021-05-03 00:18:57,151 INFO L226 Difference]: Without dead ends: 452 [2021-05-03 00:18:57,152 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 12 SyntacticMatches, 24 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 391 ImplicationChecksByTransitivity, 750.4ms TimeCoverageRelationStatistics Valid=106, Invalid=650, Unknown=0, NotChecked=0, Total=756 [2021-05-03 00:18:57,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 452 states. [2021-05-03 00:18:57,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 452 to 341. [2021-05-03 00:18:57,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 341 states, 331 states have (on average 1.2084592145015105) internal successors, (400), 331 states have internal predecessors, (400), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:18:57,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 411 transitions. [2021-05-03 00:18:57,536 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 411 transitions. Word has length 64 [2021-05-03 00:18:57,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:18:57,536 INFO L480 AbstractCegarLoop]: Abstraction has 341 states and 411 transitions. [2021-05-03 00:18:57,536 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 25 states, 25 states have (on average 2.32) internal successors, (58), 24 states have internal predecessors, (58), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:18:57,536 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 411 transitions. [2021-05-03 00:18:57,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2021-05-03 00:18:57,537 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:18:57,537 INFO L523 BasicCegarLoop]: trace histogram [14, 14, 10, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:18:57,537 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable481 [2021-05-03 00:18:57,537 INFO L428 AbstractCegarLoop]: === Iteration 115 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:18:57,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:18:57,537 INFO L82 PathProgramCache]: Analyzing trace with hash 269537790, now seen corresponding path program 82 times [2021-05-03 00:18:57,537 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:18:57,537 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [951384733] [2021-05-03 00:18:57,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:18:57,544 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_~last~0_385 v_main_~c~0_1915) (< (+ v_main_~c~0_1915 1) v_~SIZE~0_380)) InVars {~SIZE~0=v_~SIZE~0_380, main_~c~0=v_main_~c~0_1915, ~last~0=v_~last~0_385} OutVars{~SIZE~0=v_~SIZE~0_380, main_~c~0=v_main_~c~0_1915, ~last~0=v_~last~0_385} AuxVars[] AssignedVars[] [2021-05-03 00:18:57,546 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size [2021-05-03 00:18:57,546 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:18:57,548 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:18:57,556 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:18:57,559 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:18:57,582 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size 78 [2021-05-03 00:18:57,603 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (+ v_main_~c~0_1917 1) v_~SIZE~0_381) (< v_main_~c~0_1917 v_~last~0_386)) InVars {~SIZE~0=v_~SIZE~0_381, main_~c~0=v_main_~c~0_1917, ~last~0=v_~last~0_386} OutVars{~SIZE~0=v_~SIZE~0_381, main_~c~0=v_main_~c~0_1917, ~last~0=v_~last~0_386} AuxVars[] AssignedVars[] [2021-05-03 00:18:57,604 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:18:57,617 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:18:57,618 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:18:57,631 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:18:57,636 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:18:57,651 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:18:57,671 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:18:57,673 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_1919 v_~SIZE~0_382) (<= v_~last~0_387 v_main_~c~0_1919)) InVars {~SIZE~0=v_~SIZE~0_382, main_~c~0=v_main_~c~0_1919, ~last~0=v_~last~0_387} OutVars{~SIZE~0=v_~SIZE~0_382, main_~c~0=v_main_~c~0_1919, ~last~0=v_~last~0_387} AuxVars[] AssignedVars[] [2021-05-03 00:18:57,675 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:18:57,676 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:18:57,677 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:18:57,688 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:18:57,691 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:18:57,719 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:18:57,740 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_1921 v_~last~0_388) (< v_main_~c~0_1921 v_~SIZE~0_383)) InVars {~SIZE~0=v_~SIZE~0_383, main_~c~0=v_main_~c~0_1921, ~last~0=v_~last~0_388} OutVars{~SIZE~0=v_~SIZE~0_383, main_~c~0=v_main_~c~0_1921, ~last~0=v_~last~0_388} AuxVars[] AssignedVars[] [2021-05-03 00:18:57,742 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size [2021-05-03 00:18:57,742 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:18:57,744 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:18:57,756 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:18:57,760 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:18:57,784 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size 66 [2021-05-03 00:18:57,802 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:18:57,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:18:57,874 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:18:57,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:18:57,878 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:18:57,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:18:57,880 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:18:57,882 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:18:58,647 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:18:58,648 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [951384733] [2021-05-03 00:18:58,648 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [951384733] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:18:58,648 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:18:58,648 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2021-05-03 00:18:58,648 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1341467001] [2021-05-03 00:18:58,648 INFO L460 AbstractCegarLoop]: Interpolant automaton has 26 states [2021-05-03 00:18:58,648 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:18:58,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2021-05-03 00:18:58,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=651, Unknown=0, NotChecked=0, Total=756 [2021-05-03 00:18:58,649 INFO L87 Difference]: Start difference. First operand 341 states and 411 transitions. Second operand has 26 states, 26 states have (on average 2.230769230769231) internal successors, (58), 25 states have internal predecessors, (58), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:19:00,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:19:00,143 INFO L93 Difference]: Finished difference Result 731 states and 861 transitions. [2021-05-03 00:19:00,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2021-05-03 00:19:00,144 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 2.230769230769231) internal successors, (58), 25 states have internal predecessors, (58), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 64 [2021-05-03 00:19:00,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:19:00,145 INFO L225 Difference]: With dead ends: 731 [2021-05-03 00:19:00,145 INFO L226 Difference]: Without dead ends: 443 [2021-05-03 00:19:00,146 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 13 SyntacticMatches, 22 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 473 ImplicationChecksByTransitivity, 814.9ms TimeCoverageRelationStatistics Valid=122, Invalid=748, Unknown=0, NotChecked=0, Total=870 [2021-05-03 00:19:00,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 443 states. [2021-05-03 00:19:00,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 443 to 341. [2021-05-03 00:19:00,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 341 states, 331 states have (on average 1.2084592145015105) internal successors, (400), 331 states have internal predecessors, (400), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:19:00,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 411 transitions. [2021-05-03 00:19:00,545 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 411 transitions. Word has length 64 [2021-05-03 00:19:00,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:19:00,545 INFO L480 AbstractCegarLoop]: Abstraction has 341 states and 411 transitions. [2021-05-03 00:19:00,545 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 26 states, 26 states have (on average 2.230769230769231) internal successors, (58), 25 states have internal predecessors, (58), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:19:00,545 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 411 transitions. [2021-05-03 00:19:00,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2021-05-03 00:19:00,554 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:19:00,554 INFO L523 BasicCegarLoop]: trace histogram [14, 14, 9, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:19:00,554 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable486 [2021-05-03 00:19:00,555 INFO L428 AbstractCegarLoop]: === Iteration 116 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:19:00,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:19:00,555 INFO L82 PathProgramCache]: Analyzing trace with hash -759821508, now seen corresponding path program 83 times [2021-05-03 00:19:00,555 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:19:00,555 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2042369583] [2021-05-03 00:19:00,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:19:00,561 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_~last~0_389 v_main_~c~0_1939) (< (+ v_main_~c~0_1939 1) v_~SIZE~0_384)) InVars {~SIZE~0=v_~SIZE~0_384, main_~c~0=v_main_~c~0_1939, ~last~0=v_~last~0_389} OutVars{~SIZE~0=v_~SIZE~0_384, main_~c~0=v_main_~c~0_1939, ~last~0=v_~last~0_389} AuxVars[] AssignedVars[] [2021-05-03 00:19:00,562 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size [2021-05-03 00:19:00,576 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:19:00,577 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:19:00,586 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:19:00,588 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:19:00,602 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size 78 [2021-05-03 00:19:00,620 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (+ v_main_~c~0_1941 1) v_~SIZE~0_385) (< v_main_~c~0_1941 v_~last~0_390)) InVars {~SIZE~0=v_~SIZE~0_385, main_~c~0=v_main_~c~0_1941, ~last~0=v_~last~0_390} OutVars{~SIZE~0=v_~SIZE~0_385, main_~c~0=v_main_~c~0_1941, ~last~0=v_~last~0_390} AuxVars[] AssignedVars[] [2021-05-03 00:19:00,621 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:19:00,633 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:19:00,635 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:19:00,647 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:19:00,651 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:19:00,673 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:19:00,692 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:19:00,694 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_1943 v_~SIZE~0_386) (<= v_~last~0_391 v_main_~c~0_1943)) InVars {~SIZE~0=v_~SIZE~0_386, main_~c~0=v_main_~c~0_1943, ~last~0=v_~last~0_391} OutVars{~SIZE~0=v_~SIZE~0_386, main_~c~0=v_main_~c~0_1943, ~last~0=v_~last~0_391} AuxVars[] AssignedVars[] [2021-05-03 00:19:00,695 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:19:00,708 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:19:00,709 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:19:00,717 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:19:00,720 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:19:00,733 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:19:00,751 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_1945 v_~SIZE~0_387) (< v_main_~c~0_1945 v_~last~0_392)) InVars {~SIZE~0=v_~SIZE~0_387, main_~c~0=v_main_~c~0_1945, ~last~0=v_~last~0_392} OutVars{~SIZE~0=v_~SIZE~0_387, main_~c~0=v_main_~c~0_1945, ~last~0=v_~last~0_392} AuxVars[] AssignedVars[] [2021-05-03 00:19:00,752 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size [2021-05-03 00:19:00,753 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:19:00,754 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:19:00,765 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:19:00,769 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:19:00,789 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size 66 [2021-05-03 00:19:00,806 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:19:00,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:19:00,860 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:19:00,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:19:00,864 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:19:00,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:19:00,865 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:19:00,867 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:19:01,547 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:19:01,547 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2042369583] [2021-05-03 00:19:01,547 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [2042369583] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:19:01,547 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:19:01,547 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2021-05-03 00:19:01,547 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20782103] [2021-05-03 00:19:01,547 INFO L460 AbstractCegarLoop]: Interpolant automaton has 27 states [2021-05-03 00:19:01,547 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:19:01,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2021-05-03 00:19:01,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=650, Unknown=0, NotChecked=0, Total=756 [2021-05-03 00:19:01,548 INFO L87 Difference]: Start difference. First operand 341 states and 411 transitions. Second operand has 27 states, 27 states have (on average 2.1481481481481484) internal successors, (58), 26 states have internal predecessors, (58), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:19:02,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:19:02,920 INFO L93 Difference]: Finished difference Result 722 states and 856 transitions. [2021-05-03 00:19:02,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2021-05-03 00:19:02,921 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 2.1481481481481484) internal successors, (58), 26 states have internal predecessors, (58), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 64 [2021-05-03 00:19:02,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:19:02,922 INFO L225 Difference]: With dead ends: 722 [2021-05-03 00:19:02,922 INFO L226 Difference]: Without dead ends: 434 [2021-05-03 00:19:02,922 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 12 SyntacticMatches, 22 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 488 ImplicationChecksByTransitivity, 697.7ms TimeCoverageRelationStatistics Valid=126, Invalid=744, Unknown=0, NotChecked=0, Total=870 [2021-05-03 00:19:02,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 434 states. [2021-05-03 00:19:03,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 434 to 341. [2021-05-03 00:19:03,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 341 states, 331 states have (on average 1.2084592145015105) internal successors, (400), 331 states have internal predecessors, (400), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:19:03,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 411 transitions. [2021-05-03 00:19:03,261 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 411 transitions. Word has length 64 [2021-05-03 00:19:03,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:19:03,261 INFO L480 AbstractCegarLoop]: Abstraction has 341 states and 411 transitions. [2021-05-03 00:19:03,261 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 27 states, 27 states have (on average 2.1481481481481484) internal successors, (58), 26 states have internal predecessors, (58), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:19:03,261 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 411 transitions. [2021-05-03 00:19:03,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2021-05-03 00:19:03,261 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:19:03,261 INFO L523 BasicCegarLoop]: trace histogram [14, 14, 8, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:19:03,262 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable491 [2021-05-03 00:19:03,262 INFO L428 AbstractCegarLoop]: === Iteration 117 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:19:03,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:19:03,262 INFO L82 PathProgramCache]: Analyzing trace with hash -1603827010, now seen corresponding path program 84 times [2021-05-03 00:19:03,262 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:19:03,262 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1065365423] [2021-05-03 00:19:03,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:19:03,268 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_~last~0_393 v_main_~c~0_1963) (< (+ v_main_~c~0_1963 1) v_~SIZE~0_388)) InVars {~SIZE~0=v_~SIZE~0_388, main_~c~0=v_main_~c~0_1963, ~last~0=v_~last~0_393} OutVars{~SIZE~0=v_~SIZE~0_388, main_~c~0=v_main_~c~0_1963, ~last~0=v_~last~0_393} AuxVars[] AssignedVars[] [2021-05-03 00:19:03,270 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size [2021-05-03 00:19:03,271 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:19:03,272 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:19:03,281 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:19:03,284 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:19:03,309 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size 78 [2021-05-03 00:19:03,332 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_1965 v_~last~0_394) (< (+ v_main_~c~0_1965 1) v_~SIZE~0_389)) InVars {~SIZE~0=v_~SIZE~0_389, main_~c~0=v_main_~c~0_1965, ~last~0=v_~last~0_394} OutVars{~SIZE~0=v_~SIZE~0_389, main_~c~0=v_main_~c~0_1965, ~last~0=v_~last~0_394} AuxVars[] AssignedVars[] [2021-05-03 00:19:03,334 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:19:03,335 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:19:03,336 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:19:03,352 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:19:03,358 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:19:03,389 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:19:03,417 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:19:03,420 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_~last~0_395 v_main_~c~0_1967) (< v_main_~c~0_1967 v_~SIZE~0_390)) InVars {~SIZE~0=v_~SIZE~0_390, main_~c~0=v_main_~c~0_1967, ~last~0=v_~last~0_395} OutVars{~SIZE~0=v_~SIZE~0_390, main_~c~0=v_main_~c~0_1967, ~last~0=v_~last~0_395} AuxVars[] AssignedVars[] [2021-05-03 00:19:03,421 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:19:03,442 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:19:03,444 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:19:03,456 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:19:03,460 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:19:03,481 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:19:03,508 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_1969 v_~last~0_396) (< v_main_~c~0_1969 v_~SIZE~0_391)) InVars {~SIZE~0=v_~SIZE~0_391, main_~c~0=v_main_~c~0_1969, ~last~0=v_~last~0_396} OutVars{~SIZE~0=v_~SIZE~0_391, main_~c~0=v_main_~c~0_1969, ~last~0=v_~last~0_396} AuxVars[] AssignedVars[] [2021-05-03 00:19:03,510 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size [2021-05-03 00:19:03,526 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:19:03,527 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:19:03,545 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:19:03,551 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:19:03,571 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size 66 [2021-05-03 00:19:03,597 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:19:03,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:19:03,699 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:19:03,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:19:03,704 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:19:03,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:19:03,706 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:19:03,708 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:19:04,646 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:19:04,647 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1065365423] [2021-05-03 00:19:04,647 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1065365423] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:19:04,647 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:19:04,647 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2021-05-03 00:19:04,647 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [505670222] [2021-05-03 00:19:04,647 INFO L460 AbstractCegarLoop]: Interpolant automaton has 28 states [2021-05-03 00:19:04,647 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:19:04,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2021-05-03 00:19:04,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=749, Unknown=0, NotChecked=0, Total=870 [2021-05-03 00:19:04,648 INFO L87 Difference]: Start difference. First operand 341 states and 411 transitions. Second operand has 28 states, 28 states have (on average 2.0714285714285716) internal successors, (58), 27 states have internal predecessors, (58), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:19:06,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:19:06,348 INFO L93 Difference]: Finished difference Result 719 states and 849 transitions. [2021-05-03 00:19:06,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2021-05-03 00:19:06,349 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 2.0714285714285716) internal successors, (58), 27 states have internal predecessors, (58), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 64 [2021-05-03 00:19:06,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:19:06,350 INFO L225 Difference]: With dead ends: 719 [2021-05-03 00:19:06,350 INFO L226 Difference]: Without dead ends: 431 [2021-05-03 00:19:06,351 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 13 SyntacticMatches, 20 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 546 ImplicationChecksByTransitivity, 993.8ms TimeCoverageRelationStatistics Valid=142, Invalid=850, Unknown=0, NotChecked=0, Total=992 [2021-05-03 00:19:06,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 431 states. [2021-05-03 00:19:06,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 431 to 341. [2021-05-03 00:19:06,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 341 states, 331 states have (on average 1.2084592145015105) internal successors, (400), 331 states have internal predecessors, (400), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:19:06,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 411 transitions. [2021-05-03 00:19:06,731 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 411 transitions. Word has length 64 [2021-05-03 00:19:06,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:19:06,731 INFO L480 AbstractCegarLoop]: Abstraction has 341 states and 411 transitions. [2021-05-03 00:19:06,731 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 28 states, 28 states have (on average 2.0714285714285716) internal successors, (58), 27 states have internal predecessors, (58), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:19:06,731 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 411 transitions. [2021-05-03 00:19:06,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2021-05-03 00:19:06,732 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:19:06,732 INFO L523 BasicCegarLoop]: trace histogram [14, 14, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:19:06,732 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable496 [2021-05-03 00:19:06,732 INFO L428 AbstractCegarLoop]: === Iteration 118 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:19:06,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:19:06,732 INFO L82 PathProgramCache]: Analyzing trace with hash -1329067396, now seen corresponding path program 85 times [2021-05-03 00:19:06,732 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:19:06,732 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [562294043] [2021-05-03 00:19:06,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:19:06,747 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_~last~0_397 v_main_~c~0_1987) (< (+ v_main_~c~0_1987 1) v_~SIZE~0_392)) InVars {~SIZE~0=v_~SIZE~0_392, main_~c~0=v_main_~c~0_1987, ~last~0=v_~last~0_397} OutVars{~SIZE~0=v_~SIZE~0_392, main_~c~0=v_main_~c~0_1987, ~last~0=v_~last~0_397} AuxVars[] AssignedVars[] [2021-05-03 00:19:06,749 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size [2021-05-03 00:19:06,770 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:19:06,771 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:19:06,780 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:19:06,782 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:19:06,799 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size 78 [2021-05-03 00:19:06,820 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (+ v_main_~c~0_1989 1) v_~SIZE~0_393) (< v_main_~c~0_1989 v_~last~0_398)) InVars {~SIZE~0=v_~SIZE~0_393, main_~c~0=v_main_~c~0_1989, ~last~0=v_~last~0_398} OutVars{~SIZE~0=v_~SIZE~0_393, main_~c~0=v_main_~c~0_1989, ~last~0=v_~last~0_398} AuxVars[] AssignedVars[] [2021-05-03 00:19:06,824 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:19:06,837 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:19:06,841 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:19:06,854 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:19:06,859 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:19:06,874 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:19:06,896 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:19:06,899 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_1991 v_~SIZE~0_394) (<= v_~last~0_399 v_main_~c~0_1991)) InVars {~SIZE~0=v_~SIZE~0_394, main_~c~0=v_main_~c~0_1991, ~last~0=v_~last~0_399} OutVars{~SIZE~0=v_~SIZE~0_394, main_~c~0=v_main_~c~0_1991, ~last~0=v_~last~0_399} AuxVars[] AssignedVars[] [2021-05-03 00:19:06,900 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:19:06,915 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:19:06,917 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:19:06,926 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:19:06,928 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:19:06,942 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:19:06,972 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_1993 v_~last~0_400) (< v_main_~c~0_1993 v_~SIZE~0_395)) InVars {~SIZE~0=v_~SIZE~0_395, main_~c~0=v_main_~c~0_1993, ~last~0=v_~last~0_400} OutVars{~SIZE~0=v_~SIZE~0_395, main_~c~0=v_main_~c~0_1993, ~last~0=v_~last~0_400} AuxVars[] AssignedVars[] [2021-05-03 00:19:06,981 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size [2021-05-03 00:19:06,982 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:19:06,989 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:19:07,004 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:19:07,009 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:19:07,037 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size 66 [2021-05-03 00:19:07,059 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:19:07,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:19:07,155 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:19:07,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:19:07,160 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:19:07,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:19:07,163 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:19:07,166 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:19:08,302 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:19:08,302 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [562294043] [2021-05-03 00:19:08,302 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [562294043] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:19:08,303 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:19:08,303 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2021-05-03 00:19:08,303 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2005646561] [2021-05-03 00:19:08,303 INFO L460 AbstractCegarLoop]: Interpolant automaton has 29 states [2021-05-03 00:19:08,303 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:19:08,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2021-05-03 00:19:08,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=748, Unknown=0, NotChecked=0, Total=870 [2021-05-03 00:19:08,304 INFO L87 Difference]: Start difference. First operand 341 states and 411 transitions. Second operand has 29 states, 29 states have (on average 2.0) internal successors, (58), 28 states have internal predecessors, (58), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:19:09,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:19:09,567 INFO L93 Difference]: Finished difference Result 704 states and 838 transitions. [2021-05-03 00:19:09,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2021-05-03 00:19:09,567 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 2.0) internal successors, (58), 28 states have internal predecessors, (58), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 64 [2021-05-03 00:19:09,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:19:09,568 INFO L225 Difference]: With dead ends: 704 [2021-05-03 00:19:09,568 INFO L226 Difference]: Without dead ends: 416 [2021-05-03 00:19:09,569 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 12 SyntacticMatches, 20 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 549 ImplicationChecksByTransitivity, 1135.2ms TimeCoverageRelationStatistics Valid=146, Invalid=846, Unknown=0, NotChecked=0, Total=992 [2021-05-03 00:19:09,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 416 states. [2021-05-03 00:19:09,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 416 to 341. [2021-05-03 00:19:09,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 341 states, 331 states have (on average 1.2084592145015105) internal successors, (400), 331 states have internal predecessors, (400), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:19:09,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 411 transitions. [2021-05-03 00:19:09,977 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 411 transitions. Word has length 64 [2021-05-03 00:19:09,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:19:09,977 INFO L480 AbstractCegarLoop]: Abstraction has 341 states and 411 transitions. [2021-05-03 00:19:09,977 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 29 states, 29 states have (on average 2.0) internal successors, (58), 28 states have internal predecessors, (58), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:19:09,978 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 411 transitions. [2021-05-03 00:19:09,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2021-05-03 00:19:09,978 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:19:09,978 INFO L523 BasicCegarLoop]: trace histogram [14, 14, 8, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:19:09,978 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable501 [2021-05-03 00:19:09,978 INFO L428 AbstractCegarLoop]: === Iteration 119 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:19:09,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:19:09,978 INFO L82 PathProgramCache]: Analyzing trace with hash 57135998, now seen corresponding path program 86 times [2021-05-03 00:19:09,979 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:19:09,979 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [867230354] [2021-05-03 00:19:09,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:19:09,991 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_~last~0_401 v_main_~c~0_2011) (< (+ v_main_~c~0_2011 1) v_~SIZE~0_396)) InVars {~SIZE~0=v_~SIZE~0_396, main_~c~0=v_main_~c~0_2011, ~last~0=v_~last~0_401} OutVars{~SIZE~0=v_~SIZE~0_396, main_~c~0=v_main_~c~0_2011, ~last~0=v_~last~0_401} AuxVars[] AssignedVars[] [2021-05-03 00:19:09,993 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size [2021-05-03 00:19:09,994 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:19:09,995 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:19:10,005 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:19:10,008 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:19:10,033 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size 78 [2021-05-03 00:19:10,055 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (+ v_main_~c~0_2013 1) v_~SIZE~0_397) (< v_main_~c~0_2013 v_~last~0_402)) InVars {~SIZE~0=v_~SIZE~0_397, main_~c~0=v_main_~c~0_2013, ~last~0=v_~last~0_402} OutVars{~SIZE~0=v_~SIZE~0_397, main_~c~0=v_main_~c~0_2013, ~last~0=v_~last~0_402} AuxVars[] AssignedVars[] [2021-05-03 00:19:10,056 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:19:10,069 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:19:10,070 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:19:10,083 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:19:10,089 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:19:10,104 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:19:10,124 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:19:10,126 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_2015 v_~SIZE~0_398) (<= v_~last~0_403 v_main_~c~0_2015)) InVars {~SIZE~0=v_~SIZE~0_398, main_~c~0=v_main_~c~0_2015, ~last~0=v_~last~0_403} OutVars{~SIZE~0=v_~SIZE~0_398, main_~c~0=v_main_~c~0_2015, ~last~0=v_~last~0_403} AuxVars[] AssignedVars[] [2021-05-03 00:19:10,128 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:19:10,144 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:19:10,146 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:19:10,156 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:19:10,159 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:19:10,175 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:19:10,196 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_2017 v_~SIZE~0_399) (< v_main_~c~0_2017 v_~last~0_404)) InVars {~SIZE~0=v_~SIZE~0_399, main_~c~0=v_main_~c~0_2017, ~last~0=v_~last~0_404} OutVars{~SIZE~0=v_~SIZE~0_399, main_~c~0=v_main_~c~0_2017, ~last~0=v_~last~0_404} AuxVars[] AssignedVars[] [2021-05-03 00:19:10,197 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size [2021-05-03 00:19:10,209 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:19:10,211 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:19:10,223 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:19:10,228 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:19:10,242 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size 66 [2021-05-03 00:19:10,262 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:19:10,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:19:10,316 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:19:10,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:19:10,320 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:19:10,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:19:10,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-03 00:19:10,328 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:19:11,296 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:19:11,296 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [867230354] [2021-05-03 00:19:11,296 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [867230354] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:19:11,296 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:19:11,296 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [30] imperfect sequences [] total 30 [2021-05-03 00:19:11,296 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785852397] [2021-05-03 00:19:11,296 INFO L460 AbstractCegarLoop]: Interpolant automaton has 30 states [2021-05-03 00:19:11,296 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:19:11,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2021-05-03 00:19:11,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=800, Unknown=0, NotChecked=0, Total=930 [2021-05-03 00:19:11,297 INFO L87 Difference]: Start difference. First operand 341 states and 411 transitions. Second operand has 30 states, 30 states have (on average 1.9333333333333333) internal successors, (58), 29 states have internal predecessors, (58), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:19:12,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:19:12,654 INFO L93 Difference]: Finished difference Result 695 states and 829 transitions. [2021-05-03 00:19:12,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2021-05-03 00:19:12,654 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 1.9333333333333333) internal successors, (58), 29 states have internal predecessors, (58), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 64 [2021-05-03 00:19:12,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:19:12,655 INFO L225 Difference]: With dead ends: 695 [2021-05-03 00:19:12,655 INFO L226 Difference]: Without dead ends: 407 [2021-05-03 00:19:12,657 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 12 SyntacticMatches, 19 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 566 ImplicationChecksByTransitivity, 984.0ms TimeCoverageRelationStatistics Valid=156, Invalid=900, Unknown=0, NotChecked=0, Total=1056 [2021-05-03 00:19:12,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 407 states. [2021-05-03 00:19:13,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 407 to 341. [2021-05-03 00:19:13,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 341 states, 331 states have (on average 1.2084592145015105) internal successors, (400), 331 states have internal predecessors, (400), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:19:13,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 411 transitions. [2021-05-03 00:19:13,048 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 411 transitions. Word has length 64 [2021-05-03 00:19:13,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:19:13,048 INFO L480 AbstractCegarLoop]: Abstraction has 341 states and 411 transitions. [2021-05-03 00:19:13,048 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 30 states, 30 states have (on average 1.9333333333333333) internal successors, (58), 29 states have internal predecessors, (58), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:19:13,048 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 411 transitions. [2021-05-03 00:19:13,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2021-05-03 00:19:13,048 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:19:13,048 INFO L523 BasicCegarLoop]: trace histogram [14, 14, 9, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:19:13,049 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable506 [2021-05-03 00:19:13,049 INFO L428 AbstractCegarLoop]: === Iteration 120 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:19:13,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:19:13,049 INFO L82 PathProgramCache]: Analyzing trace with hash 119175612, now seen corresponding path program 87 times [2021-05-03 00:19:13,049 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:19:13,049 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1461693523] [2021-05-03 00:19:13,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:19:13,055 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_~last~0_405 v_main_~c~0_2035) (< (+ v_main_~c~0_2035 1) v_~SIZE~0_400)) InVars {~SIZE~0=v_~SIZE~0_400, main_~c~0=v_main_~c~0_2035, ~last~0=v_~last~0_405} OutVars{~SIZE~0=v_~SIZE~0_400, main_~c~0=v_main_~c~0_2035, ~last~0=v_~last~0_405} AuxVars[] AssignedVars[] [2021-05-03 00:19:13,056 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size [2021-05-03 00:19:13,070 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:19:13,071 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:19:13,079 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:19:13,081 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:19:13,096 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size 78 [2021-05-03 00:19:13,115 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_2037 v_~last~0_406) (< (+ v_main_~c~0_2037 1) v_~SIZE~0_401)) InVars {~SIZE~0=v_~SIZE~0_401, main_~c~0=v_main_~c~0_2037, ~last~0=v_~last~0_406} OutVars{~SIZE~0=v_~SIZE~0_401, main_~c~0=v_main_~c~0_2037, ~last~0=v_~last~0_406} AuxVars[] AssignedVars[] [2021-05-03 00:19:13,116 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:19:13,117 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:19:13,118 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:19:13,129 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:19:13,133 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:19:13,155 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:19:13,172 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:19:13,174 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_2039 v_~SIZE~0_402) (<= v_~last~0_407 v_main_~c~0_2039)) InVars {~SIZE~0=v_~SIZE~0_402, main_~c~0=v_main_~c~0_2039, ~last~0=v_~last~0_407} OutVars{~SIZE~0=v_~SIZE~0_402, main_~c~0=v_main_~c~0_2039, ~last~0=v_~last~0_407} AuxVars[] AssignedVars[] [2021-05-03 00:19:13,175 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:19:13,176 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:19:13,181 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:19:13,190 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:19:13,193 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:19:13,216 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:19:13,234 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_2041 v_~SIZE~0_403) (< v_main_~c~0_2041 v_~last~0_408)) InVars {~SIZE~0=v_~SIZE~0_403, main_~c~0=v_main_~c~0_2041, ~last~0=v_~last~0_408} OutVars{~SIZE~0=v_~SIZE~0_403, main_~c~0=v_main_~c~0_2041, ~last~0=v_~last~0_408} AuxVars[] AssignedVars[] [2021-05-03 00:19:13,235 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size [2021-05-03 00:19:13,236 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:19:13,238 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:19:13,249 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:19:13,253 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:19:13,276 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size 66 [2021-05-03 00:19:13,292 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:19:13,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:19:13,360 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:19:13,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:19:13,365 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:19:13,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:19:13,367 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:19:13,369 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:19:14,177 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:19:14,177 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1461693523] [2021-05-03 00:19:14,177 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1461693523] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:19:14,177 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:19:14,178 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [31] imperfect sequences [] total 31 [2021-05-03 00:19:14,178 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530977632] [2021-05-03 00:19:14,178 INFO L460 AbstractCegarLoop]: Interpolant automaton has 31 states [2021-05-03 00:19:14,178 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:19:14,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2021-05-03 00:19:14,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=911, Unknown=0, NotChecked=0, Total=1056 [2021-05-03 00:19:14,179 INFO L87 Difference]: Start difference. First operand 341 states and 411 transitions. Second operand has 31 states, 31 states have (on average 1.8709677419354838) internal successors, (58), 30 states have internal predecessors, (58), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:19:15,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:19:15,645 INFO L93 Difference]: Finished difference Result 701 states and 831 transitions. [2021-05-03 00:19:15,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2021-05-03 00:19:15,646 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 1.8709677419354838) internal successors, (58), 30 states have internal predecessors, (58), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 64 [2021-05-03 00:19:15,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:19:15,647 INFO L225 Difference]: With dead ends: 701 [2021-05-03 00:19:15,647 INFO L226 Difference]: Without dead ends: 413 [2021-05-03 00:19:15,648 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 12 SyntacticMatches, 18 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 611 ImplicationChecksByTransitivity, 843.1ms TimeCoverageRelationStatistics Valid=172, Invalid=1018, Unknown=0, NotChecked=0, Total=1190 [2021-05-03 00:19:15,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states. [2021-05-03 00:19:16,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 341. [2021-05-03 00:19:16,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 341 states, 331 states have (on average 1.2084592145015105) internal successors, (400), 331 states have internal predecessors, (400), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:19:16,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 411 transitions. [2021-05-03 00:19:16,025 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 411 transitions. Word has length 64 [2021-05-03 00:19:16,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:19:16,025 INFO L480 AbstractCegarLoop]: Abstraction has 341 states and 411 transitions. [2021-05-03 00:19:16,025 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 31 states, 31 states have (on average 1.8709677419354838) internal successors, (58), 30 states have internal predecessors, (58), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:19:16,026 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 411 transitions. [2021-05-03 00:19:16,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2021-05-03 00:19:16,026 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:19:16,026 INFO L523 BasicCegarLoop]: trace histogram [14, 14, 10, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:19:16,026 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable511 [2021-05-03 00:19:16,026 INFO L428 AbstractCegarLoop]: === Iteration 121 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:19:16,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:19:16,026 INFO L82 PathProgramCache]: Analyzing trace with hash -1686262722, now seen corresponding path program 88 times [2021-05-03 00:19:16,027 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:19:16,027 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1191147488] [2021-05-03 00:19:16,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:19:16,033 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (+ v_main_~c~0_2059 1) v_~SIZE~0_404) (<= v_~last~0_409 v_main_~c~0_2059)) InVars {~SIZE~0=v_~SIZE~0_404, main_~c~0=v_main_~c~0_2059, ~last~0=v_~last~0_409} OutVars{~SIZE~0=v_~SIZE~0_404, main_~c~0=v_main_~c~0_2059, ~last~0=v_~last~0_409} AuxVars[] AssignedVars[] [2021-05-03 00:19:16,034 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size [2021-05-03 00:19:16,048 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:19:16,049 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:19:16,057 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:19:16,060 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:19:16,074 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size 78 [2021-05-03 00:19:16,095 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (+ v_main_~c~0_2061 1) v_~SIZE~0_405) (< v_main_~c~0_2061 v_~last~0_410)) InVars {~SIZE~0=v_~SIZE~0_405, main_~c~0=v_main_~c~0_2061, ~last~0=v_~last~0_410} OutVars{~SIZE~0=v_~SIZE~0_405, main_~c~0=v_main_~c~0_2061, ~last~0=v_~last~0_410} AuxVars[] AssignedVars[] [2021-05-03 00:19:16,096 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:19:16,109 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:19:16,110 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:19:16,123 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:19:16,127 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:19:16,142 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:19:16,162 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:19:16,164 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_~last~0_411 v_main_~c~0_2063) (< v_main_~c~0_2063 v_~SIZE~0_406)) InVars {~SIZE~0=v_~SIZE~0_406, main_~c~0=v_main_~c~0_2063, ~last~0=v_~last~0_411} OutVars{~SIZE~0=v_~SIZE~0_406, main_~c~0=v_main_~c~0_2063, ~last~0=v_~last~0_411} AuxVars[] AssignedVars[] [2021-05-03 00:19:16,165 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:19:16,166 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:19:16,167 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:19:16,176 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:19:16,179 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:19:16,204 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:19:16,224 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_2065 v_~last~0_412) (< v_main_~c~0_2065 v_~SIZE~0_407)) InVars {~SIZE~0=v_~SIZE~0_407, main_~c~0=v_main_~c~0_2065, ~last~0=v_~last~0_412} OutVars{~SIZE~0=v_~SIZE~0_407, main_~c~0=v_main_~c~0_2065, ~last~0=v_~last~0_412} AuxVars[] AssignedVars[] [2021-05-03 00:19:16,225 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size [2021-05-03 00:19:16,236 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:19:16,238 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:19:16,249 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:19:16,253 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:19:16,267 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size 66 [2021-05-03 00:19:16,285 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:19:16,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:19:16,338 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:19:16,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:19:16,341 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:19:16,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:19:16,343 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:19:16,345 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:19:17,178 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:19:17,179 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1191147488] [2021-05-03 00:19:17,179 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1191147488] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:19:17,179 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:19:17,179 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [32] imperfect sequences [] total 32 [2021-05-03 00:19:17,179 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89916994] [2021-05-03 00:19:17,179 INFO L460 AbstractCegarLoop]: Interpolant automaton has 32 states [2021-05-03 00:19:17,179 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:19:17,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2021-05-03 00:19:17,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=910, Unknown=0, NotChecked=0, Total=1056 [2021-05-03 00:19:17,180 INFO L87 Difference]: Start difference. First operand 341 states and 411 transitions. Second operand has 32 states, 32 states have (on average 1.8125) internal successors, (58), 31 states have internal predecessors, (58), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:19:18,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:19:18,351 INFO L93 Difference]: Finished difference Result 677 states and 811 transitions. [2021-05-03 00:19:18,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2021-05-03 00:19:18,351 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 1.8125) internal successors, (58), 31 states have internal predecessors, (58), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 64 [2021-05-03 00:19:18,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:19:18,352 INFO L225 Difference]: With dead ends: 677 [2021-05-03 00:19:18,352 INFO L226 Difference]: Without dead ends: 389 [2021-05-03 00:19:18,353 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 12 SyntacticMatches, 17 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 573 ImplicationChecksByTransitivity, 859.5ms TimeCoverageRelationStatistics Valid=176, Invalid=1014, Unknown=0, NotChecked=0, Total=1190 [2021-05-03 00:19:18,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389 states. [2021-05-03 00:19:18,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389 to 341. [2021-05-03 00:19:18,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 341 states, 331 states have (on average 1.2084592145015105) internal successors, (400), 331 states have internal predecessors, (400), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:19:18,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 411 transitions. [2021-05-03 00:19:18,729 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 411 transitions. Word has length 64 [2021-05-03 00:19:18,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:19:18,729 INFO L480 AbstractCegarLoop]: Abstraction has 341 states and 411 transitions. [2021-05-03 00:19:18,729 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 32 states, 32 states have (on average 1.8125) internal successors, (58), 31 states have internal predecessors, (58), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:19:18,729 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 411 transitions. [2021-05-03 00:19:18,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2021-05-03 00:19:18,730 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:19:18,730 INFO L523 BasicCegarLoop]: trace histogram [14, 14, 11, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:19:18,730 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable516 [2021-05-03 00:19:18,730 INFO L428 AbstractCegarLoop]: === Iteration 122 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:19:18,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:19:18,730 INFO L82 PathProgramCache]: Analyzing trace with hash 1791056124, now seen corresponding path program 89 times [2021-05-03 00:19:18,730 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:19:18,731 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1076969784] [2021-05-03 00:19:18,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:19:18,737 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_~last~0_413 v_main_~c~0_2083) (< (+ v_main_~c~0_2083 1) v_~SIZE~0_408)) InVars {~SIZE~0=v_~SIZE~0_408, main_~c~0=v_main_~c~0_2083, ~last~0=v_~last~0_413} OutVars{~SIZE~0=v_~SIZE~0_408, main_~c~0=v_main_~c~0_2083, ~last~0=v_~last~0_413} AuxVars[] AssignedVars[] [2021-05-03 00:19:18,738 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size [2021-05-03 00:19:18,753 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:19:18,754 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:19:18,764 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:19:18,767 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:19:18,781 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size 78 [2021-05-03 00:19:18,803 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (+ v_main_~c~0_2085 1) v_~SIZE~0_409) (< v_main_~c~0_2085 v_~last~0_414)) InVars {~SIZE~0=v_~SIZE~0_409, main_~c~0=v_main_~c~0_2085, ~last~0=v_~last~0_414} OutVars{~SIZE~0=v_~SIZE~0_409, main_~c~0=v_main_~c~0_2085, ~last~0=v_~last~0_414} AuxVars[] AssignedVars[] [2021-05-03 00:19:18,805 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:19:18,817 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:19:18,819 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:19:18,832 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:19:18,837 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:19:18,852 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:19:18,872 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:19:18,874 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_2087 v_~SIZE~0_410) (<= v_~last~0_415 v_main_~c~0_2087)) InVars {~SIZE~0=v_~SIZE~0_410, main_~c~0=v_main_~c~0_2087, ~last~0=v_~last~0_415} OutVars{~SIZE~0=v_~SIZE~0_410, main_~c~0=v_main_~c~0_2087, ~last~0=v_~last~0_415} AuxVars[] AssignedVars[] [2021-05-03 00:19:18,876 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:19:18,893 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:19:18,894 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:19:18,904 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:19:18,907 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:19:18,921 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:19:18,941 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_2089 v_~last~0_416) (< v_main_~c~0_2089 v_~SIZE~0_411)) InVars {~SIZE~0=v_~SIZE~0_411, main_~c~0=v_main_~c~0_2089, ~last~0=v_~last~0_416} OutVars{~SIZE~0=v_~SIZE~0_411, main_~c~0=v_main_~c~0_2089, ~last~0=v_~last~0_416} AuxVars[] AssignedVars[] [2021-05-03 00:19:18,943 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size [2021-05-03 00:19:18,943 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:19:18,945 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:19:18,958 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:19:18,963 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:19:18,993 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size 66 [2021-05-03 00:19:19,018 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:19:19,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:19:19,080 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:19:19,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:19:19,084 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:19:19,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:19:19,086 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:19:19,089 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:19:19,948 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:19:19,948 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1076969784] [2021-05-03 00:19:19,948 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1076969784] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:19:19,949 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:19:19,949 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [33] imperfect sequences [] total 33 [2021-05-03 00:19:19,949 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971970770] [2021-05-03 00:19:19,949 INFO L460 AbstractCegarLoop]: Interpolant automaton has 33 states [2021-05-03 00:19:19,949 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:19:19,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2021-05-03 00:19:19,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=968, Unknown=0, NotChecked=0, Total=1122 [2021-05-03 00:19:19,950 INFO L87 Difference]: Start difference. First operand 341 states and 411 transitions. Second operand has 33 states, 33 states have (on average 1.7575757575757576) internal successors, (58), 32 states have internal predecessors, (58), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:19:21,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:19:21,366 INFO L93 Difference]: Finished difference Result 668 states and 802 transitions. [2021-05-03 00:19:21,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2021-05-03 00:19:21,367 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 1.7575757575757576) internal successors, (58), 32 states have internal predecessors, (58), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 64 [2021-05-03 00:19:21,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:19:21,367 INFO L225 Difference]: With dead ends: 668 [2021-05-03 00:19:21,367 INFO L226 Difference]: Without dead ends: 380 [2021-05-03 00:19:21,368 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 14 SyntacticMatches, 14 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 511 ImplicationChecksByTransitivity, 883.3ms TimeCoverageRelationStatistics Valid=186, Invalid=1074, Unknown=0, NotChecked=0, Total=1260 [2021-05-03 00:19:21,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2021-05-03 00:19:21,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 341. [2021-05-03 00:19:21,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 341 states, 331 states have (on average 1.2084592145015105) internal successors, (400), 331 states have internal predecessors, (400), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:19:21,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 411 transitions. [2021-05-03 00:19:21,729 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 411 transitions. Word has length 64 [2021-05-03 00:19:21,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:19:21,729 INFO L480 AbstractCegarLoop]: Abstraction has 341 states and 411 transitions. [2021-05-03 00:19:21,730 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 33 states, 33 states have (on average 1.7575757575757576) internal successors, (58), 32 states have internal predecessors, (58), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:19:21,730 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 411 transitions. [2021-05-03 00:19:21,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2021-05-03 00:19:21,730 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:19:21,730 INFO L523 BasicCegarLoop]: trace histogram [14, 14, 12, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:19:21,730 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable521 [2021-05-03 00:19:21,730 INFO L428 AbstractCegarLoop]: === Iteration 123 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:19:21,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:19:21,731 INFO L82 PathProgramCache]: Analyzing trace with hash 202708222, now seen corresponding path program 90 times [2021-05-03 00:19:21,731 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:19:21,731 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1085398268] [2021-05-03 00:19:21,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:19:21,738 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (+ v_main_~c~0_2107 1) v_~SIZE~0_412) (<= v_~last~0_417 v_main_~c~0_2107)) InVars {~SIZE~0=v_~SIZE~0_412, main_~c~0=v_main_~c~0_2107, ~last~0=v_~last~0_417} OutVars{~SIZE~0=v_~SIZE~0_412, main_~c~0=v_main_~c~0_2107, ~last~0=v_~last~0_417} AuxVars[] AssignedVars[] [2021-05-03 00:19:21,740 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size [2021-05-03 00:19:21,741 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:19:21,742 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:19:21,754 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:19:21,757 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:19:21,792 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size 78 [2021-05-03 00:19:21,818 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (+ v_main_~c~0_2109 1) v_~SIZE~0_413) (< v_main_~c~0_2109 v_~last~0_418)) InVars {~SIZE~0=v_~SIZE~0_413, main_~c~0=v_main_~c~0_2109, ~last~0=v_~last~0_418} OutVars{~SIZE~0=v_~SIZE~0_413, main_~c~0=v_main_~c~0_2109, ~last~0=v_~last~0_418} AuxVars[] AssignedVars[] [2021-05-03 00:19:21,819 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:19:21,820 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:19:21,821 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:19:21,835 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:19:21,842 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:19:21,876 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:19:21,897 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:19:21,900 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_~last~0_419 v_main_~c~0_2111) (< v_main_~c~0_2111 v_~SIZE~0_414)) InVars {~SIZE~0=v_~SIZE~0_414, main_~c~0=v_main_~c~0_2111, ~last~0=v_~last~0_419} OutVars{~SIZE~0=v_~SIZE~0_414, main_~c~0=v_main_~c~0_2111, ~last~0=v_~last~0_419} AuxVars[] AssignedVars[] [2021-05-03 00:19:21,901 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:19:21,917 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:19:21,919 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:19:21,928 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:19:21,931 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:19:21,946 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:19:21,982 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_2113 v_~last~0_420) (< v_main_~c~0_2113 v_~SIZE~0_415)) InVars {~SIZE~0=v_~SIZE~0_415, main_~c~0=v_main_~c~0_2113, ~last~0=v_~last~0_420} OutVars{~SIZE~0=v_~SIZE~0_415, main_~c~0=v_main_~c~0_2113, ~last~0=v_~last~0_420} AuxVars[] AssignedVars[] [2021-05-03 00:19:21,983 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size [2021-05-03 00:19:21,997 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:19:21,999 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:19:22,014 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:19:22,020 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:19:22,036 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size 66 [2021-05-03 00:19:22,056 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:19:22,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:19:22,128 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:19:22,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:19:22,134 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:19:22,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:19:22,136 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:19:22,139 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:19:23,062 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:19:23,062 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1085398268] [2021-05-03 00:19:23,062 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1085398268] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:19:23,062 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:19:23,062 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [34] imperfect sequences [] total 34 [2021-05-03 00:19:23,062 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756734010] [2021-05-03 00:19:23,062 INFO L460 AbstractCegarLoop]: Interpolant automaton has 34 states [2021-05-03 00:19:23,062 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:19:23,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2021-05-03 00:19:23,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=162, Invalid=1028, Unknown=0, NotChecked=0, Total=1190 [2021-05-03 00:19:23,063 INFO L87 Difference]: Start difference. First operand 341 states and 411 transitions. Second operand has 34 states, 34 states have (on average 1.7058823529411764) internal successors, (58), 33 states have internal predecessors, (58), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:19:24,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:19:24,903 INFO L93 Difference]: Finished difference Result 662 states and 796 transitions. [2021-05-03 00:19:24,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2021-05-03 00:19:24,904 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 1.7058823529411764) internal successors, (58), 33 states have internal predecessors, (58), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 64 [2021-05-03 00:19:24,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:19:24,905 INFO L225 Difference]: With dead ends: 662 [2021-05-03 00:19:24,905 INFO L226 Difference]: Without dead ends: 374 [2021-05-03 00:19:24,905 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 12 SyntacticMatches, 15 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 544 ImplicationChecksByTransitivity, 953.3ms TimeCoverageRelationStatistics Valid=196, Invalid=1136, Unknown=0, NotChecked=0, Total=1332 [2021-05-03 00:19:24,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2021-05-03 00:19:25,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 341. [2021-05-03 00:19:25,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 341 states, 331 states have (on average 1.2084592145015105) internal successors, (400), 331 states have internal predecessors, (400), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:19:25,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 411 transitions. [2021-05-03 00:19:25,279 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 411 transitions. Word has length 64 [2021-05-03 00:19:25,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:19:25,279 INFO L480 AbstractCegarLoop]: Abstraction has 341 states and 411 transitions. [2021-05-03 00:19:25,279 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 34 states, 34 states have (on average 1.7058823529411764) internal successors, (58), 33 states have internal predecessors, (58), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:19:25,279 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 411 transitions. [2021-05-03 00:19:25,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2021-05-03 00:19:25,280 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:19:25,280 INFO L523 BasicCegarLoop]: trace histogram [14, 14, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:19:25,281 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable526 [2021-05-03 00:19:25,281 INFO L428 AbstractCegarLoop]: === Iteration 124 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:19:25,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:19:25,281 INFO L82 PathProgramCache]: Analyzing trace with hash -808409028, now seen corresponding path program 91 times [2021-05-03 00:19:25,281 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:19:25,281 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2013982312] [2021-05-03 00:19:25,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:19:25,286 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_2131 v_~last~0_421) (< (+ v_main_~c~0_2131 1) v_~SIZE~0_416)) InVars {~SIZE~0=v_~SIZE~0_416, main_~c~0=v_main_~c~0_2131, ~last~0=v_~last~0_421} OutVars{~SIZE~0=v_~SIZE~0_416, main_~c~0=v_main_~c~0_2131, ~last~0=v_~last~0_421} AuxVars[] AssignedVars[] [2021-05-03 00:19:25,287 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:19:25,288 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:19:25,289 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:19:25,304 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:19:25,308 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:19:25,334 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:19:25,355 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:19:25,357 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_2133 v_~SIZE~0_417) (<= v_~last~0_422 v_main_~c~0_2133)) InVars {~SIZE~0=v_~SIZE~0_417, main_~c~0=v_main_~c~0_2133, ~last~0=v_~last~0_422} OutVars{~SIZE~0=v_~SIZE~0_417, main_~c~0=v_main_~c~0_2133, ~last~0=v_~last~0_422} AuxVars[] AssignedVars[] [2021-05-03 00:19:25,358 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:19:25,359 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:19:25,363 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:19:25,373 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:19:25,376 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:19:25,409 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:19:25,458 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_2135 v_~last~0_423) (< v_main_~c~0_2135 v_~SIZE~0_418)) InVars {~SIZE~0=v_~SIZE~0_418, main_~c~0=v_main_~c~0_2135, ~last~0=v_~last~0_423} OutVars{~SIZE~0=v_~SIZE~0_418, main_~c~0=v_main_~c~0_2135, ~last~0=v_~last~0_423} AuxVars[] AssignedVars[] [2021-05-03 00:19:25,459 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size [2021-05-03 00:19:25,460 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:19:25,461 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:19:25,476 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:19:25,482 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:19:25,506 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size 66 [2021-05-03 00:19:25,535 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:19:25,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:19:25,591 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:19:25,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:19:25,597 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:19:25,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:19:25,601 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:19:25,603 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:19:26,351 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:19:26,351 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2013982312] [2021-05-03 00:19:26,351 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [2013982312] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:19:26,351 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:19:26,351 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [35] imperfect sequences [] total 35 [2021-05-03 00:19:26,351 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217593286] [2021-05-03 00:19:26,352 INFO L460 AbstractCegarLoop]: Interpolant automaton has 35 states [2021-05-03 00:19:26,352 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:19:26,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2021-05-03 00:19:26,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=177, Invalid=1155, Unknown=0, NotChecked=0, Total=1332 [2021-05-03 00:19:26,352 INFO L87 Difference]: Start difference. First operand 341 states and 411 transitions. Second operand has 35 states, 35 states have (on average 1.6571428571428573) internal successors, (58), 34 states have internal predecessors, (58), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:19:27,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:19:27,681 INFO L93 Difference]: Finished difference Result 689 states and 825 transitions. [2021-05-03 00:19:27,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2021-05-03 00:19:27,682 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 1.6571428571428573) internal successors, (58), 34 states have internal predecessors, (58), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 64 [2021-05-03 00:19:27,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:19:27,683 INFO L225 Difference]: With dead ends: 689 [2021-05-03 00:19:27,683 INFO L226 Difference]: Without dead ends: 401 [2021-05-03 00:19:27,684 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 12 SyntacticMatches, 14 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 549 ImplicationChecksByTransitivity, 786.5ms TimeCoverageRelationStatistics Valid=212, Invalid=1270, Unknown=0, NotChecked=0, Total=1482 [2021-05-03 00:19:27,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 401 states. [2021-05-03 00:19:28,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 401 to 309. [2021-05-03 00:19:28,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 309 states, 299 states have (on average 1.1973244147157192) internal successors, (358), 300 states have internal predecessors, (358), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:19:28,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 369 transitions. [2021-05-03 00:19:28,039 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 369 transitions. Word has length 64 [2021-05-03 00:19:28,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:19:28,039 INFO L480 AbstractCegarLoop]: Abstraction has 309 states and 369 transitions. [2021-05-03 00:19:28,039 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 35 states, 35 states have (on average 1.6571428571428573) internal successors, (58), 34 states have internal predecessors, (58), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:19:28,039 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 369 transitions. [2021-05-03 00:19:28,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2021-05-03 00:19:28,039 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:19:28,039 INFO L523 BasicCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:19:28,039 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable530 [2021-05-03 00:19:28,039 INFO L428 AbstractCegarLoop]: === Iteration 125 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:19:28,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:19:28,040 INFO L82 PathProgramCache]: Analyzing trace with hash -973949378, now seen corresponding path program 14 times [2021-05-03 00:19:28,040 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:19:28,040 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [685326887] [2021-05-03 00:19:28,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:19:28,044 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_2153 v_~last~0_424) (< (+ v_main_~c~0_2153 1) v_~SIZE~0_419)) InVars {~SIZE~0=v_~SIZE~0_419, main_~c~0=v_main_~c~0_2153, ~last~0=v_~last~0_424} OutVars{~SIZE~0=v_~SIZE~0_419, main_~c~0=v_main_~c~0_2153, ~last~0=v_~last~0_424} AuxVars[] AssignedVars[] [2021-05-03 00:19:28,046 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:19:28,046 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:19:28,047 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:19:28,059 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:19:28,063 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:19:28,084 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:19:28,104 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:19:28,105 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_2155 v_~SIZE~0_420) (< v_main_~c~0_2155 v_~last~0_425)) InVars {~SIZE~0=v_~SIZE~0_420, main_~c~0=v_main_~c~0_2155, ~last~0=v_~last~0_425} OutVars{~SIZE~0=v_~SIZE~0_420, main_~c~0=v_main_~c~0_2155, ~last~0=v_~last~0_425} AuxVars[] AssignedVars[] [2021-05-03 00:19:28,107 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size [2021-05-03 00:19:28,107 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:19:28,108 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:19:28,120 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:19:28,124 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:19:28,146 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size 66 [2021-05-03 00:19:28,166 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:19:28,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:19:28,271 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:19:28,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:19:28,275 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:19:28,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:19:28,276 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:19:29,522 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:19:29,522 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [685326887] [2021-05-03 00:19:29,523 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [685326887] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:19:29,523 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:19:29,523 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [39] imperfect sequences [] total 39 [2021-05-03 00:19:29,523 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126859656] [2021-05-03 00:19:29,523 INFO L460 AbstractCegarLoop]: Interpolant automaton has 39 states [2021-05-03 00:19:29,523 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:19:29,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2021-05-03 00:19:29,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=194, Invalid=1446, Unknown=0, NotChecked=0, Total=1640 [2021-05-03 00:19:29,524 INFO L87 Difference]: Start difference. First operand 309 states and 369 transitions. Second operand has 39 states, 39 states have (on average 1.4871794871794872) internal successors, (58), 37 states have internal predecessors, (58), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:19:31,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:19:31,906 INFO L93 Difference]: Finished difference Result 715 states and 855 transitions. [2021-05-03 00:19:31,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2021-05-03 00:19:31,907 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 1.4871794871794872) internal successors, (58), 37 states have internal predecessors, (58), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 64 [2021-05-03 00:19:31,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:19:31,908 INFO L225 Difference]: With dead ends: 715 [2021-05-03 00:19:31,908 INFO L226 Difference]: Without dead ends: 418 [2021-05-03 00:19:31,909 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 6 SyntacticMatches, 13 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 886 ImplicationChecksByTransitivity, 1839.3ms TimeCoverageRelationStatistics Valid=316, Invalid=2876, Unknown=0, NotChecked=0, Total=3192 [2021-05-03 00:19:31,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 418 states. [2021-05-03 00:19:32,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 418 to 353. [2021-05-03 00:19:32,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 353 states, 343 states have (on average 1.2128279883381925) internal successors, (416), 343 states have internal predecessors, (416), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:19:32,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 427 transitions. [2021-05-03 00:19:32,276 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 427 transitions. Word has length 64 [2021-05-03 00:19:32,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:19:32,276 INFO L480 AbstractCegarLoop]: Abstraction has 353 states and 427 transitions. [2021-05-03 00:19:32,277 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 39 states, 39 states have (on average 1.4871794871794872) internal successors, (58), 37 states have internal predecessors, (58), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:19:32,277 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 427 transitions. [2021-05-03 00:19:32,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2021-05-03 00:19:32,277 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:19:32,277 INFO L523 BasicCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:19:32,277 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable533 [2021-05-03 00:19:32,277 INFO L428 AbstractCegarLoop]: === Iteration 126 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:19:32,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:19:32,278 INFO L82 PathProgramCache]: Analyzing trace with hash 1434289085, now seen corresponding path program 15 times [2021-05-03 00:19:32,278 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:19:32,278 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2126403072] [2021-05-03 00:19:32,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:19:32,283 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_~last~0_426 v_main_~c~0_2172) (< (+ v_main_~c~0_2172 1) v_~SIZE~0_421)) InVars {~SIZE~0=v_~SIZE~0_421, main_~c~0=v_main_~c~0_2172, ~last~0=v_~last~0_426} OutVars{~SIZE~0=v_~SIZE~0_421, main_~c~0=v_main_~c~0_2172, ~last~0=v_~last~0_426} AuxVars[] AssignedVars[] [2021-05-03 00:19:32,285 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size [2021-05-03 00:19:32,305 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:19:32,307 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:19:32,315 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:19:32,317 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:19:32,330 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size 78 [2021-05-03 00:19:32,349 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:19:32,351 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_~last~0_427 v_main_~c~0_2174) (< v_main_~c~0_2174 v_~SIZE~0_422)) InVars {~SIZE~0=v_~SIZE~0_422, main_~c~0=v_main_~c~0_2174, ~last~0=v_~last~0_427} OutVars{~SIZE~0=v_~SIZE~0_422, main_~c~0=v_main_~c~0_2174, ~last~0=v_~last~0_427} AuxVars[] AssignedVars[] [2021-05-03 00:19:32,352 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:19:32,366 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:19:32,367 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:19:32,375 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:19:32,377 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:19:32,391 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:19:32,409 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:19:32,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:19:32,454 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:19:32,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:19:32,458 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:19:32,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:19:32,460 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:19:33,383 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:19:33,383 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2126403072] [2021-05-03 00:19:33,383 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [2126403072] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:19:33,384 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:19:33,384 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2021-05-03 00:19:33,384 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1883639288] [2021-05-03 00:19:33,384 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states [2021-05-03 00:19:33,384 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:19:33,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-05-03 00:19:33,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=468, Unknown=0, NotChecked=0, Total=552 [2021-05-03 00:19:33,385 INFO L87 Difference]: Start difference. First operand 353 states and 427 transitions. Second operand has 23 states, 23 states have (on average 2.652173913043478) internal successors, (61), 22 states have internal predecessors, (61), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:19:34,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:19:34,893 INFO L93 Difference]: Finished difference Result 779 states and 916 transitions. [2021-05-03 00:19:34,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-05-03 00:19:34,894 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.652173913043478) internal successors, (61), 22 states have internal predecessors, (61), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 67 [2021-05-03 00:19:34,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:19:34,895 INFO L225 Difference]: With dead ends: 779 [2021-05-03 00:19:34,895 INFO L226 Difference]: Without dead ends: 482 [2021-05-03 00:19:34,896 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 12 SyntacticMatches, 29 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 157 ImplicationChecksByTransitivity, 896.2ms TimeCoverageRelationStatistics Valid=88, Invalid=512, Unknown=0, NotChecked=0, Total=600 [2021-05-03 00:19:34,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482 states. [2021-05-03 00:19:35,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 362. [2021-05-03 00:19:35,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 362 states, 352 states have (on average 1.2073863636363635) internal successors, (425), 352 states have internal predecessors, (425), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:19:35,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 436 transitions. [2021-05-03 00:19:35,363 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 436 transitions. Word has length 67 [2021-05-03 00:19:35,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:19:35,364 INFO L480 AbstractCegarLoop]: Abstraction has 362 states and 436 transitions. [2021-05-03 00:19:35,364 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 23 states, 23 states have (on average 2.652173913043478) internal successors, (61), 22 states have internal predecessors, (61), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:19:35,364 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 436 transitions. [2021-05-03 00:19:35,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2021-05-03 00:19:35,364 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:19:35,364 INFO L523 BasicCegarLoop]: trace histogram [15, 15, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:19:35,365 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable536 [2021-05-03 00:19:35,365 INFO L428 AbstractCegarLoop]: === Iteration 127 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:19:35,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:19:35,365 INFO L82 PathProgramCache]: Analyzing trace with hash 1878189759, now seen corresponding path program 92 times [2021-05-03 00:19:35,365 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:19:35,365 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [28545110] [2021-05-03 00:19:35,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:19:35,378 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_~last~0_428 v_main_~c~0_2192) (< (+ v_main_~c~0_2192 1) v_~SIZE~0_423)) InVars {~SIZE~0=v_~SIZE~0_423, main_~c~0=v_main_~c~0_2192, ~last~0=v_~last~0_428} OutVars{~SIZE~0=v_~SIZE~0_423, main_~c~0=v_main_~c~0_2192, ~last~0=v_~last~0_428} AuxVars[] AssignedVars[] [2021-05-03 00:19:35,380 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size [2021-05-03 00:19:35,405 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:19:35,408 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:19:35,426 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:19:35,430 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:19:35,451 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size 78 [2021-05-03 00:19:35,480 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_2194 v_~last~0_429) (< (+ v_main_~c~0_2194 1) v_~SIZE~0_424)) InVars {~SIZE~0=v_~SIZE~0_424, main_~c~0=v_main_~c~0_2194, ~last~0=v_~last~0_429} OutVars{~SIZE~0=v_~SIZE~0_424, main_~c~0=v_main_~c~0_2194, ~last~0=v_~last~0_429} AuxVars[] AssignedVars[] [2021-05-03 00:19:35,482 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:19:35,499 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:19:35,511 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:19:35,532 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:19:35,538 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:19:35,556 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:19:35,583 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:19:35,587 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_2196 v_~SIZE~0_425) (<= v_~last~0_430 v_main_~c~0_2196)) InVars {~SIZE~0=v_~SIZE~0_425, main_~c~0=v_main_~c~0_2196, ~last~0=v_~last~0_430} OutVars{~SIZE~0=v_~SIZE~0_425, main_~c~0=v_main_~c~0_2196, ~last~0=v_~last~0_430} AuxVars[] AssignedVars[] [2021-05-03 00:19:35,589 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:19:35,616 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:19:35,618 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:19:35,636 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:19:35,640 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:19:35,659 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:19:35,684 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_2198 v_~SIZE~0_426) (< v_main_~c~0_2198 v_~last~0_431)) InVars {~SIZE~0=v_~SIZE~0_426, main_~c~0=v_main_~c~0_2198, ~last~0=v_~last~0_431} OutVars{~SIZE~0=v_~SIZE~0_426, main_~c~0=v_main_~c~0_2198, ~last~0=v_~last~0_431} AuxVars[] AssignedVars[] [2021-05-03 00:19:35,687 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size [2021-05-03 00:19:35,706 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:19:35,708 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:19:35,723 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:19:35,729 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:19:35,747 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size 66 [2021-05-03 00:19:35,769 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:19:35,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:19:35,832 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:19:35,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:19:35,837 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:19:35,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:19:35,840 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:19:35,843 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:19:36,819 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:19:36,819 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [28545110] [2021-05-03 00:19:36,819 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [28545110] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:19:36,819 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:19:36,819 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2021-05-03 00:19:36,819 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2115289428] [2021-05-03 00:19:36,819 INFO L460 AbstractCegarLoop]: Interpolant automaton has 24 states [2021-05-03 00:19:36,820 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:19:36,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2021-05-03 00:19:36,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=523, Unknown=0, NotChecked=0, Total=600 [2021-05-03 00:19:36,820 INFO L87 Difference]: Start difference. First operand 362 states and 436 transitions. Second operand has 24 states, 24 states have (on average 2.5416666666666665) internal successors, (61), 23 states have internal predecessors, (61), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:19:38,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:19:38,969 INFO L93 Difference]: Finished difference Result 806 states and 947 transitions. [2021-05-03 00:19:38,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-05-03 00:19:38,970 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 2.5416666666666665) internal successors, (61), 23 states have internal predecessors, (61), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 67 [2021-05-03 00:19:38,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:19:38,971 INFO L225 Difference]: With dead ends: 806 [2021-05-03 00:19:38,972 INFO L226 Difference]: Without dead ends: 500 [2021-05-03 00:19:38,972 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 12 SyntacticMatches, 28 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 276 ImplicationChecksByTransitivity, 1016.2ms TimeCoverageRelationStatistics Valid=89, Invalid=613, Unknown=0, NotChecked=0, Total=702 [2021-05-03 00:19:38,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 500 states. [2021-05-03 00:19:39,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 500 to 362. [2021-05-03 00:19:39,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 362 states, 352 states have (on average 1.2073863636363635) internal successors, (425), 352 states have internal predecessors, (425), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:19:39,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 436 transitions. [2021-05-03 00:19:39,519 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 436 transitions. Word has length 67 [2021-05-03 00:19:39,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:19:39,519 INFO L480 AbstractCegarLoop]: Abstraction has 362 states and 436 transitions. [2021-05-03 00:19:39,519 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 24 states, 24 states have (on average 2.5416666666666665) internal successors, (61), 23 states have internal predecessors, (61), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:19:39,519 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 436 transitions. [2021-05-03 00:19:39,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2021-05-03 00:19:39,520 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:19:39,520 INFO L523 BasicCegarLoop]: trace histogram [15, 15, 13, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:19:39,520 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable541 [2021-05-03 00:19:39,520 INFO L428 AbstractCegarLoop]: === Iteration 128 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:19:39,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:19:39,520 INFO L82 PathProgramCache]: Analyzing trace with hash 1397109501, now seen corresponding path program 93 times [2021-05-03 00:19:39,521 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:19:39,521 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [800699474] [2021-05-03 00:19:39,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:19:39,529 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_~last~0_432 v_main_~c~0_2217) (< (+ v_main_~c~0_2217 1) v_~SIZE~0_427)) InVars {~SIZE~0=v_~SIZE~0_427, main_~c~0=v_main_~c~0_2217, ~last~0=v_~last~0_432} OutVars{~SIZE~0=v_~SIZE~0_427, main_~c~0=v_main_~c~0_2217, ~last~0=v_~last~0_432} AuxVars[] AssignedVars[] [2021-05-03 00:19:39,532 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size [2021-05-03 00:19:39,533 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:19:39,534 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:19:39,547 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:19:39,550 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:19:39,588 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size 78 [2021-05-03 00:19:39,614 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (+ v_main_~c~0_2219 1) v_~SIZE~0_428) (< v_main_~c~0_2219 v_~last~0_433)) InVars {~SIZE~0=v_~SIZE~0_428, main_~c~0=v_main_~c~0_2219, ~last~0=v_~last~0_433} OutVars{~SIZE~0=v_~SIZE~0_428, main_~c~0=v_main_~c~0_2219, ~last~0=v_~last~0_433} AuxVars[] AssignedVars[] [2021-05-03 00:19:39,616 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:19:39,617 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:19:39,619 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:19:39,637 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:19:39,643 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:19:39,683 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:19:39,708 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:19:39,710 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_2221 v_~SIZE~0_429) (<= v_~last~0_434 v_main_~c~0_2221)) InVars {~SIZE~0=v_~SIZE~0_429, main_~c~0=v_main_~c~0_2221, ~last~0=v_~last~0_434} OutVars{~SIZE~0=v_~SIZE~0_429, main_~c~0=v_main_~c~0_2221, ~last~0=v_~last~0_434} AuxVars[] AssignedVars[] [2021-05-03 00:19:39,712 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:19:39,737 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:19:39,740 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:19:39,754 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:19:39,758 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:19:39,781 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:19:39,810 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_2223 v_~SIZE~0_430) (< v_main_~c~0_2223 v_~last~0_435)) InVars {~SIZE~0=v_~SIZE~0_430, main_~c~0=v_main_~c~0_2223, ~last~0=v_~last~0_435} OutVars{~SIZE~0=v_~SIZE~0_430, main_~c~0=v_main_~c~0_2223, ~last~0=v_~last~0_435} AuxVars[] AssignedVars[] [2021-05-03 00:19:39,813 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size [2021-05-03 00:19:39,814 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:19:39,816 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:19:39,833 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:19:39,839 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:19:39,870 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size 66 [2021-05-03 00:19:39,896 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:19:39,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:19:39,966 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:19:39,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:19:39,973 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:19:39,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:19:39,980 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:19:39,984 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:19:41,003 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:19:41,003 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [800699474] [2021-05-03 00:19:41,003 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [800699474] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:19:41,003 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:19:41,003 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2021-05-03 00:19:41,003 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [271371661] [2021-05-03 00:19:41,004 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states [2021-05-03 00:19:41,004 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:19:41,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-05-03 00:19:41,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=565, Unknown=0, NotChecked=0, Total=650 [2021-05-03 00:19:41,005 INFO L87 Difference]: Start difference. First operand 362 states and 436 transitions. Second operand has 25 states, 25 states have (on average 2.44) internal successors, (61), 24 states have internal predecessors, (61), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:19:42,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:19:42,988 INFO L93 Difference]: Finished difference Result 797 states and 938 transitions. [2021-05-03 00:19:42,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2021-05-03 00:19:42,989 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 2.44) internal successors, (61), 24 states have internal predecessors, (61), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 67 [2021-05-03 00:19:42,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:19:42,991 INFO L225 Difference]: With dead ends: 797 [2021-05-03 00:19:42,991 INFO L226 Difference]: Without dead ends: 491 [2021-05-03 00:19:42,991 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 12 SyntacticMatches, 27 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 353 ImplicationChecksByTransitivity, 1054.9ms TimeCoverageRelationStatistics Valid=99, Invalid=657, Unknown=0, NotChecked=0, Total=756 [2021-05-03 00:19:42,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 491 states. [2021-05-03 00:19:43,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 491 to 362. [2021-05-03 00:19:43,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 362 states, 352 states have (on average 1.2073863636363635) internal successors, (425), 352 states have internal predecessors, (425), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:19:43,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 436 transitions. [2021-05-03 00:19:43,677 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 436 transitions. Word has length 67 [2021-05-03 00:19:43,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:19:43,678 INFO L480 AbstractCegarLoop]: Abstraction has 362 states and 436 transitions. [2021-05-03 00:19:43,678 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 25 states, 25 states have (on average 2.44) internal successors, (61), 24 states have internal predecessors, (61), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:19:43,678 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 436 transitions. [2021-05-03 00:19:43,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2021-05-03 00:19:43,678 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:19:43,678 INFO L523 BasicCegarLoop]: trace histogram [15, 15, 12, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:19:43,678 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable546 [2021-05-03 00:19:43,679 INFO L428 AbstractCegarLoop]: === Iteration 129 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:19:43,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:19:43,679 INFO L82 PathProgramCache]: Analyzing trace with hash 1044021119, now seen corresponding path program 94 times [2021-05-03 00:19:43,679 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:19:43,679 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1536841622] [2021-05-03 00:19:43,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:19:43,690 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_~last~0_436 v_main_~c~0_2242) (< (+ v_main_~c~0_2242 1) v_~SIZE~0_431)) InVars {~SIZE~0=v_~SIZE~0_431, main_~c~0=v_main_~c~0_2242, ~last~0=v_~last~0_436} OutVars{~SIZE~0=v_~SIZE~0_431, main_~c~0=v_main_~c~0_2242, ~last~0=v_~last~0_436} AuxVars[] AssignedVars[] [2021-05-03 00:19:43,693 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size [2021-05-03 00:19:43,720 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:19:43,722 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:19:43,739 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:19:43,743 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:19:43,768 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size 78 [2021-05-03 00:19:43,801 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (+ v_main_~c~0_2244 1) v_~SIZE~0_432) (< v_main_~c~0_2244 v_~last~0_437)) InVars {~SIZE~0=v_~SIZE~0_432, main_~c~0=v_main_~c~0_2244, ~last~0=v_~last~0_437} OutVars{~SIZE~0=v_~SIZE~0_432, main_~c~0=v_main_~c~0_2244, ~last~0=v_~last~0_437} AuxVars[] AssignedVars[] [2021-05-03 00:19:43,803 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:19:43,824 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:19:43,827 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:19:43,848 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:19:43,855 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:19:43,878 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:19:43,907 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:19:43,911 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_2246 v_~SIZE~0_433) (<= v_~last~0_438 v_main_~c~0_2246)) InVars {~SIZE~0=v_~SIZE~0_433, main_~c~0=v_main_~c~0_2246, ~last~0=v_~last~0_438} OutVars{~SIZE~0=v_~SIZE~0_433, main_~c~0=v_main_~c~0_2246, ~last~0=v_~last~0_438} AuxVars[] AssignedVars[] [2021-05-03 00:19:43,913 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:19:43,915 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:19:43,918 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:19:43,935 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:19:43,940 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:19:43,988 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:19:44,024 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_2248 v_~last~0_439) (< v_main_~c~0_2248 v_~SIZE~0_434)) InVars {~SIZE~0=v_~SIZE~0_434, main_~c~0=v_main_~c~0_2248, ~last~0=v_~last~0_439} OutVars{~SIZE~0=v_~SIZE~0_434, main_~c~0=v_main_~c~0_2248, ~last~0=v_~last~0_439} AuxVars[] AssignedVars[] [2021-05-03 00:19:44,026 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size [2021-05-03 00:19:44,028 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:19:44,031 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:19:44,054 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:19:44,062 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:19:44,107 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size 66 [2021-05-03 00:19:44,144 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:19:44,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:19:44,255 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:19:44,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:19:44,261 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:19:44,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:19:44,265 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:19:44,269 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:19:45,756 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:19:45,757 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1536841622] [2021-05-03 00:19:45,757 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1536841622] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:19:45,757 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:19:45,757 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2021-05-03 00:19:45,757 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1867414003] [2021-05-03 00:19:45,757 INFO L460 AbstractCegarLoop]: Interpolant automaton has 26 states [2021-05-03 00:19:45,757 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:19:45,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2021-05-03 00:19:45,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=656, Unknown=0, NotChecked=0, Total=756 [2021-05-03 00:19:45,758 INFO L87 Difference]: Start difference. First operand 362 states and 436 transitions. Second operand has 26 states, 26 states have (on average 2.3461538461538463) internal successors, (61), 25 states have internal predecessors, (61), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:19:47,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:19:47,644 INFO L93 Difference]: Finished difference Result 785 states and 922 transitions. [2021-05-03 00:19:47,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2021-05-03 00:19:47,645 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 2.3461538461538463) internal successors, (61), 25 states have internal predecessors, (61), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 67 [2021-05-03 00:19:47,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:19:47,646 INFO L225 Difference]: With dead ends: 785 [2021-05-03 00:19:47,646 INFO L226 Difference]: Without dead ends: 479 [2021-05-03 00:19:47,647 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 12 SyntacticMatches, 26 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 467 ImplicationChecksByTransitivity, 1536.3ms TimeCoverageRelationStatistics Valid=115, Invalid=755, Unknown=0, NotChecked=0, Total=870 [2021-05-03 00:19:47,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 479 states. [2021-05-03 00:19:48,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 479 to 362. [2021-05-03 00:19:48,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 362 states, 352 states have (on average 1.2073863636363635) internal successors, (425), 352 states have internal predecessors, (425), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:19:48,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 436 transitions. [2021-05-03 00:19:48,143 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 436 transitions. Word has length 67 [2021-05-03 00:19:48,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:19:48,143 INFO L480 AbstractCegarLoop]: Abstraction has 362 states and 436 transitions. [2021-05-03 00:19:48,143 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 26 states, 26 states have (on average 2.3461538461538463) internal successors, (61), 25 states have internal predecessors, (61), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:19:48,143 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 436 transitions. [2021-05-03 00:19:48,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2021-05-03 00:19:48,143 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:19:48,143 INFO L523 BasicCegarLoop]: trace histogram [15, 15, 11, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:19:48,143 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable551 [2021-05-03 00:19:48,143 INFO L428 AbstractCegarLoop]: === Iteration 130 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:19:48,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:19:48,144 INFO L82 PathProgramCache]: Analyzing trace with hash -1005366723, now seen corresponding path program 95 times [2021-05-03 00:19:48,144 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:19:48,144 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [115242520] [2021-05-03 00:19:48,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:19:48,152 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_~last~0_440 v_main_~c~0_2267) (< (+ v_main_~c~0_2267 1) v_~SIZE~0_435)) InVars {~SIZE~0=v_~SIZE~0_435, main_~c~0=v_main_~c~0_2267, ~last~0=v_~last~0_440} OutVars{~SIZE~0=v_~SIZE~0_435, main_~c~0=v_main_~c~0_2267, ~last~0=v_~last~0_440} AuxVars[] AssignedVars[] [2021-05-03 00:19:48,154 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size [2021-05-03 00:19:48,155 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:19:48,157 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:19:48,167 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:19:48,170 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:19:48,202 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size 78 [2021-05-03 00:19:48,228 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_2269 v_~last~0_441) (< (+ v_main_~c~0_2269 1) v_~SIZE~0_436)) InVars {~SIZE~0=v_~SIZE~0_436, main_~c~0=v_main_~c~0_2269, ~last~0=v_~last~0_441} OutVars{~SIZE~0=v_~SIZE~0_436, main_~c~0=v_main_~c~0_2269, ~last~0=v_~last~0_441} AuxVars[] AssignedVars[] [2021-05-03 00:19:48,230 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:19:48,244 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:19:48,246 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:19:48,261 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:19:48,267 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:19:48,283 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:19:48,307 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:19:48,309 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_2271 v_~SIZE~0_437) (<= v_~last~0_442 v_main_~c~0_2271)) InVars {~SIZE~0=v_~SIZE~0_437, main_~c~0=v_main_~c~0_2271, ~last~0=v_~last~0_442} OutVars{~SIZE~0=v_~SIZE~0_437, main_~c~0=v_main_~c~0_2271, ~last~0=v_~last~0_442} AuxVars[] AssignedVars[] [2021-05-03 00:19:48,311 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:19:48,312 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:19:48,314 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:19:48,325 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:19:48,328 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:19:48,362 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:19:48,386 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_2273 v_~last~0_443) (< v_main_~c~0_2273 v_~SIZE~0_438)) InVars {~SIZE~0=v_~SIZE~0_438, main_~c~0=v_main_~c~0_2273, ~last~0=v_~last~0_443} OutVars{~SIZE~0=v_~SIZE~0_438, main_~c~0=v_main_~c~0_2273, ~last~0=v_~last~0_443} AuxVars[] AssignedVars[] [2021-05-03 00:19:48,388 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size [2021-05-03 00:19:48,404 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:19:48,406 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:19:48,421 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:19:48,427 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:19:48,445 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size 66 [2021-05-03 00:19:48,467 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:19:48,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:19:48,533 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:19:48,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:19:48,538 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:19:48,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:19:48,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-03 00:19:48,544 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:19:49,587 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:19:49,588 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [115242520] [2021-05-03 00:19:49,588 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [115242520] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:19:49,588 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:19:49,588 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2021-05-03 00:19:49,588 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1746628112] [2021-05-03 00:19:49,588 INFO L460 AbstractCegarLoop]: Interpolant automaton has 27 states [2021-05-03 00:19:49,588 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:19:49,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2021-05-03 00:19:49,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=655, Unknown=0, NotChecked=0, Total=756 [2021-05-03 00:19:49,589 INFO L87 Difference]: Start difference. First operand 362 states and 436 transitions. Second operand has 27 states, 27 states have (on average 2.259259259259259) internal successors, (61), 26 states have internal predecessors, (61), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:19:51,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:19:51,222 INFO L93 Difference]: Finished difference Result 779 states and 920 transitions. [2021-05-03 00:19:51,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2021-05-03 00:19:51,223 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 2.259259259259259) internal successors, (61), 26 states have internal predecessors, (61), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 67 [2021-05-03 00:19:51,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:19:51,224 INFO L225 Difference]: With dead ends: 779 [2021-05-03 00:19:51,224 INFO L226 Difference]: Without dead ends: 473 [2021-05-03 00:19:51,225 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 12 SyntacticMatches, 25 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 480 ImplicationChecksByTransitivity, 1059.5ms TimeCoverageRelationStatistics Valid=119, Invalid=751, Unknown=0, NotChecked=0, Total=870 [2021-05-03 00:19:51,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 473 states. [2021-05-03 00:19:51,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 473 to 362. [2021-05-03 00:19:51,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 362 states, 352 states have (on average 1.2073863636363635) internal successors, (425), 352 states have internal predecessors, (425), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:19:51,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 436 transitions. [2021-05-03 00:19:51,677 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 436 transitions. Word has length 67 [2021-05-03 00:19:51,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:19:51,678 INFO L480 AbstractCegarLoop]: Abstraction has 362 states and 436 transitions. [2021-05-03 00:19:51,678 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 27 states, 27 states have (on average 2.259259259259259) internal successors, (61), 26 states have internal predecessors, (61), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:19:51,678 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 436 transitions. [2021-05-03 00:19:51,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2021-05-03 00:19:51,678 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:19:51,678 INFO L523 BasicCegarLoop]: trace histogram [15, 15, 10, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:19:51,678 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable556 [2021-05-03 00:19:51,678 INFO L428 AbstractCegarLoop]: === Iteration 131 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:19:51,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:19:51,679 INFO L82 PathProgramCache]: Analyzing trace with hash -581720001, now seen corresponding path program 96 times [2021-05-03 00:19:51,679 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:19:51,679 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1374296910] [2021-05-03 00:19:51,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:19:51,688 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_~last~0_444 v_main_~c~0_2292) (< (+ v_main_~c~0_2292 1) v_~SIZE~0_439)) InVars {~SIZE~0=v_~SIZE~0_439, main_~c~0=v_main_~c~0_2292, ~last~0=v_~last~0_444} OutVars{~SIZE~0=v_~SIZE~0_439, main_~c~0=v_main_~c~0_2292, ~last~0=v_~last~0_444} AuxVars[] AssignedVars[] [2021-05-03 00:19:51,690 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size [2021-05-03 00:19:51,718 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:19:51,720 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:19:51,734 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:19:51,737 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:19:51,758 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size 78 [2021-05-03 00:19:51,795 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_2294 v_~last~0_445) (< (+ v_main_~c~0_2294 1) v_~SIZE~0_440)) InVars {~SIZE~0=v_~SIZE~0_440, main_~c~0=v_main_~c~0_2294, ~last~0=v_~last~0_445} OutVars{~SIZE~0=v_~SIZE~0_440, main_~c~0=v_main_~c~0_2294, ~last~0=v_~last~0_445} AuxVars[] AssignedVars[] [2021-05-03 00:19:51,797 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:19:51,799 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:19:51,801 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:19:51,824 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:19:51,832 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:19:51,875 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:19:51,909 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:19:51,913 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_2296 v_~SIZE~0_441) (<= v_~last~0_446 v_main_~c~0_2296)) InVars {~SIZE~0=v_~SIZE~0_441, main_~c~0=v_main_~c~0_2296, ~last~0=v_~last~0_446} OutVars{~SIZE~0=v_~SIZE~0_441, main_~c~0=v_main_~c~0_2296, ~last~0=v_~last~0_446} AuxVars[] AssignedVars[] [2021-05-03 00:19:51,915 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:19:51,916 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:19:51,917 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:19:51,931 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:19:51,934 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:19:51,972 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:19:52,021 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_2298 v_~SIZE~0_442) (< v_main_~c~0_2298 v_~last~0_447)) InVars {~SIZE~0=v_~SIZE~0_442, main_~c~0=v_main_~c~0_2298, ~last~0=v_~last~0_447} OutVars{~SIZE~0=v_~SIZE~0_442, main_~c~0=v_main_~c~0_2298, ~last~0=v_~last~0_447} AuxVars[] AssignedVars[] [2021-05-03 00:19:52,023 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size [2021-05-03 00:19:52,024 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:19:52,025 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:19:52,039 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:19:52,044 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:19:52,070 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size 66 [2021-05-03 00:19:52,093 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:19:52,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:19:52,152 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:19:52,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:19:52,156 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:19:52,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:19:52,159 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:19:52,161 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:19:53,067 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:19:53,067 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1374296910] [2021-05-03 00:19:53,067 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1374296910] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:19:53,067 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:19:53,067 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2021-05-03 00:19:53,067 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352148111] [2021-05-03 00:19:53,067 INFO L460 AbstractCegarLoop]: Interpolant automaton has 28 states [2021-05-03 00:19:53,067 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:19:53,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2021-05-03 00:19:53,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=703, Unknown=0, NotChecked=0, Total=812 [2021-05-03 00:19:53,068 INFO L87 Difference]: Start difference. First operand 362 states and 436 transitions. Second operand has 28 states, 28 states have (on average 2.1785714285714284) internal successors, (61), 27 states have internal predecessors, (61), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:19:55,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:19:55,003 INFO L93 Difference]: Finished difference Result 770 states and 911 transitions. [2021-05-03 00:19:55,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2021-05-03 00:19:55,004 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 2.1785714285714284) internal successors, (61), 27 states have internal predecessors, (61), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 67 [2021-05-03 00:19:55,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:19:55,005 INFO L225 Difference]: With dead ends: 770 [2021-05-03 00:19:55,005 INFO L226 Difference]: Without dead ends: 464 [2021-05-03 00:19:55,006 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 12 SyntacticMatches, 24 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 530 ImplicationChecksByTransitivity, 945.9ms TimeCoverageRelationStatistics Valid=129, Invalid=801, Unknown=0, NotChecked=0, Total=930 [2021-05-03 00:19:55,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 464 states. [2021-05-03 00:19:55,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 464 to 362. [2021-05-03 00:19:55,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 362 states, 352 states have (on average 1.2073863636363635) internal successors, (425), 352 states have internal predecessors, (425), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:19:55,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 436 transitions. [2021-05-03 00:19:55,644 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 436 transitions. Word has length 67 [2021-05-03 00:19:55,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:19:55,644 INFO L480 AbstractCegarLoop]: Abstraction has 362 states and 436 transitions. [2021-05-03 00:19:55,644 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 28 states, 28 states have (on average 2.1785714285714284) internal successors, (61), 27 states have internal predecessors, (61), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:19:55,644 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 436 transitions. [2021-05-03 00:19:55,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2021-05-03 00:19:55,645 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:19:55,645 INFO L523 BasicCegarLoop]: trace histogram [15, 15, 9, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:19:55,645 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable561 [2021-05-03 00:19:55,645 INFO L428 AbstractCegarLoop]: === Iteration 132 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:19:55,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:19:55,646 INFO L82 PathProgramCache]: Analyzing trace with hash -1611079299, now seen corresponding path program 97 times [2021-05-03 00:19:55,646 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:19:55,646 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1334236420] [2021-05-03 00:19:55,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:19:55,653 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (+ v_main_~c~0_2317 1) v_~SIZE~0_443) (<= v_~last~0_448 v_main_~c~0_2317)) InVars {~SIZE~0=v_~SIZE~0_443, main_~c~0=v_main_~c~0_2317, ~last~0=v_~last~0_448} OutVars{~SIZE~0=v_~SIZE~0_443, main_~c~0=v_main_~c~0_2317, ~last~0=v_~last~0_448} AuxVars[] AssignedVars[] [2021-05-03 00:19:55,656 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size [2021-05-03 00:19:55,657 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:19:55,658 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:19:55,669 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:19:55,672 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:19:55,701 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size 78 [2021-05-03 00:19:55,725 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_2319 v_~last~0_449) (< (+ v_main_~c~0_2319 1) v_~SIZE~0_444)) InVars {~SIZE~0=v_~SIZE~0_444, main_~c~0=v_main_~c~0_2319, ~last~0=v_~last~0_449} OutVars{~SIZE~0=v_~SIZE~0_444, main_~c~0=v_main_~c~0_2319, ~last~0=v_~last~0_449} AuxVars[] AssignedVars[] [2021-05-03 00:19:55,727 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:19:55,728 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:19:55,729 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:19:55,745 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:19:55,750 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:19:55,775 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:19:55,795 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:19:55,798 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_~last~0_450 v_main_~c~0_2321) (< v_main_~c~0_2321 v_~SIZE~0_445)) InVars {~SIZE~0=v_~SIZE~0_445, main_~c~0=v_main_~c~0_2321, ~last~0=v_~last~0_450} OutVars{~SIZE~0=v_~SIZE~0_445, main_~c~0=v_main_~c~0_2321, ~last~0=v_~last~0_450} AuxVars[] AssignedVars[] [2021-05-03 00:19:55,800 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:19:55,817 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:19:55,818 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:19:55,827 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:19:55,831 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:19:55,879 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:19:55,901 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_2323 v_~last~0_451) (< v_main_~c~0_2323 v_~SIZE~0_446)) InVars {~SIZE~0=v_~SIZE~0_446, main_~c~0=v_main_~c~0_2323, ~last~0=v_~last~0_451} OutVars{~SIZE~0=v_~SIZE~0_446, main_~c~0=v_main_~c~0_2323, ~last~0=v_~last~0_451} AuxVars[] AssignedVars[] [2021-05-03 00:19:55,903 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size [2021-05-03 00:19:55,915 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:19:55,917 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:19:55,928 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:19:55,932 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:19:55,945 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size 66 [2021-05-03 00:19:55,964 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:19:55,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:19:56,037 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:19:56,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:19:56,041 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:19:56,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:19:56,044 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:19:56,046 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:19:56,966 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:19:56,967 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1334236420] [2021-05-03 00:19:56,967 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1334236420] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:19:56,967 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:19:56,967 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2021-05-03 00:19:56,967 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [639683833] [2021-05-03 00:19:56,967 INFO L460 AbstractCegarLoop]: Interpolant automaton has 29 states [2021-05-03 00:19:56,967 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:19:56,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2021-05-03 00:19:56,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=806, Unknown=0, NotChecked=0, Total=930 [2021-05-03 00:19:56,968 INFO L87 Difference]: Start difference. First operand 362 states and 436 transitions. Second operand has 29 states, 29 states have (on average 2.103448275862069) internal successors, (61), 28 states have internal predecessors, (61), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:19:58,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:19:58,883 INFO L93 Difference]: Finished difference Result 767 states and 904 transitions. [2021-05-03 00:19:58,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2021-05-03 00:19:58,884 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 2.103448275862069) internal successors, (61), 28 states have internal predecessors, (61), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 67 [2021-05-03 00:19:58,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:19:58,885 INFO L225 Difference]: With dead ends: 767 [2021-05-03 00:19:58,885 INFO L226 Difference]: Without dead ends: 461 [2021-05-03 00:19:58,886 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 12 SyntacticMatches, 23 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 614 ImplicationChecksByTransitivity, 957.2ms TimeCoverageRelationStatistics Valid=145, Invalid=911, Unknown=0, NotChecked=0, Total=1056 [2021-05-03 00:19:58,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 461 states. [2021-05-03 00:19:59,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 461 to 362. [2021-05-03 00:19:59,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 362 states, 352 states have (on average 1.2073863636363635) internal successors, (425), 352 states have internal predecessors, (425), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:19:59,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 436 transitions. [2021-05-03 00:19:59,373 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 436 transitions. Word has length 67 [2021-05-03 00:19:59,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:19:59,374 INFO L480 AbstractCegarLoop]: Abstraction has 362 states and 436 transitions. [2021-05-03 00:19:59,374 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 29 states, 29 states have (on average 2.103448275862069) internal successors, (61), 28 states have internal predecessors, (61), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:19:59,374 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 436 transitions. [2021-05-03 00:19:59,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2021-05-03 00:19:59,374 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:19:59,374 INFO L523 BasicCegarLoop]: trace histogram [15, 15, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:19:59,374 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable566 [2021-05-03 00:19:59,374 INFO L428 AbstractCegarLoop]: === Iteration 133 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:19:59,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:19:59,375 INFO L82 PathProgramCache]: Analyzing trace with hash 1839882495, now seen corresponding path program 98 times [2021-05-03 00:19:59,375 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:19:59,375 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1042022828] [2021-05-03 00:19:59,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:19:59,382 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (+ v_main_~c~0_2342 1) v_~SIZE~0_447) (<= v_~last~0_452 v_main_~c~0_2342)) InVars {~SIZE~0=v_~SIZE~0_447, main_~c~0=v_main_~c~0_2342, ~last~0=v_~last~0_452} OutVars{~SIZE~0=v_~SIZE~0_447, main_~c~0=v_main_~c~0_2342, ~last~0=v_~last~0_452} AuxVars[] AssignedVars[] [2021-05-03 00:19:59,383 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size [2021-05-03 00:19:59,384 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:19:59,385 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:19:59,396 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:19:59,400 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:19:59,441 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size 78 [2021-05-03 00:19:59,476 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (+ v_main_~c~0_2344 1) v_~SIZE~0_448) (< v_main_~c~0_2344 v_~last~0_453)) InVars {~SIZE~0=v_~SIZE~0_448, main_~c~0=v_main_~c~0_2344, ~last~0=v_~last~0_453} OutVars{~SIZE~0=v_~SIZE~0_448, main_~c~0=v_main_~c~0_2344, ~last~0=v_~last~0_453} AuxVars[] AssignedVars[] [2021-05-03 00:19:59,479 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:19:59,506 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:19:59,510 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:19:59,538 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:19:59,548 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:19:59,584 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:19:59,621 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:19:59,625 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_~last~0_454 v_main_~c~0_2346) (< v_main_~c~0_2346 v_~SIZE~0_449)) InVars {~SIZE~0=v_~SIZE~0_449, main_~c~0=v_main_~c~0_2346, ~last~0=v_~last~0_454} OutVars{~SIZE~0=v_~SIZE~0_449, main_~c~0=v_main_~c~0_2346, ~last~0=v_~last~0_454} AuxVars[] AssignedVars[] [2021-05-03 00:19:59,628 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:19:59,630 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:19:59,633 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:19:59,652 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:19:59,657 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:19:59,707 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:19:59,745 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_2348 v_~last~0_455) (< v_main_~c~0_2348 v_~SIZE~0_450)) InVars {~SIZE~0=v_~SIZE~0_450, main_~c~0=v_main_~c~0_2348, ~last~0=v_~last~0_455} OutVars{~SIZE~0=v_~SIZE~0_450, main_~c~0=v_main_~c~0_2348, ~last~0=v_~last~0_455} AuxVars[] AssignedVars[] [2021-05-03 00:19:59,747 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size [2021-05-03 00:19:59,770 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:19:59,772 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:19:59,795 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:19:59,803 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:19:59,828 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size 66 [2021-05-03 00:19:59,863 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:19:59,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:19:59,996 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:19:59,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:20:00,002 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:20:00,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:20:00,006 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:20:00,018 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:20:00,960 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:20:00,960 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1042022828] [2021-05-03 00:20:00,960 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1042022828] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:20:00,960 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:20:00,960 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [30] imperfect sequences [] total 30 [2021-05-03 00:20:00,960 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [304610610] [2021-05-03 00:20:00,961 INFO L460 AbstractCegarLoop]: Interpolant automaton has 30 states [2021-05-03 00:20:00,961 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:20:00,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2021-05-03 00:20:00,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=860, Unknown=0, NotChecked=0, Total=992 [2021-05-03 00:20:00,961 INFO L87 Difference]: Start difference. First operand 362 states and 436 transitions. Second operand has 30 states, 30 states have (on average 2.033333333333333) internal successors, (61), 29 states have internal predecessors, (61), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:20:02,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:20:02,903 INFO L93 Difference]: Finished difference Result 761 states and 898 transitions. [2021-05-03 00:20:02,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2021-05-03 00:20:02,905 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 2.033333333333333) internal successors, (61), 29 states have internal predecessors, (61), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 67 [2021-05-03 00:20:02,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:20:02,906 INFO L225 Difference]: With dead ends: 761 [2021-05-03 00:20:02,906 INFO L226 Difference]: Without dead ends: 455 [2021-05-03 00:20:02,907 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 12 SyntacticMatches, 22 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 645 ImplicationChecksByTransitivity, 1018.7ms TimeCoverageRelationStatistics Valid=155, Invalid=967, Unknown=0, NotChecked=0, Total=1122 [2021-05-03 00:20:02,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 455 states. [2021-05-03 00:20:03,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 455 to 362. [2021-05-03 00:20:03,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 362 states, 352 states have (on average 1.2073863636363635) internal successors, (425), 352 states have internal predecessors, (425), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:20:03,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 436 transitions. [2021-05-03 00:20:03,534 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 436 transitions. Word has length 67 [2021-05-03 00:20:03,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:20:03,535 INFO L480 AbstractCegarLoop]: Abstraction has 362 states and 436 transitions. [2021-05-03 00:20:03,535 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 30 states, 30 states have (on average 2.033333333333333) internal successors, (61), 29 states have internal predecessors, (61), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:20:03,535 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 436 transitions. [2021-05-03 00:20:03,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2021-05-03 00:20:03,535 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:20:03,535 INFO L523 BasicCegarLoop]: trace histogram [15, 15, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:20:03,535 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable571 [2021-05-03 00:20:03,535 INFO L428 AbstractCegarLoop]: === Iteration 134 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:20:03,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:20:03,536 INFO L82 PathProgramCache]: Analyzing trace with hash 2114642109, now seen corresponding path program 99 times [2021-05-03 00:20:03,536 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:20:03,536 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2035990608] [2021-05-03 00:20:03,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:20:03,543 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_~last~0_456 v_main_~c~0_2367) (< (+ v_main_~c~0_2367 1) v_~SIZE~0_451)) InVars {~SIZE~0=v_~SIZE~0_451, main_~c~0=v_main_~c~0_2367, ~last~0=v_~last~0_456} OutVars{~SIZE~0=v_~SIZE~0_451, main_~c~0=v_main_~c~0_2367, ~last~0=v_~last~0_456} AuxVars[] AssignedVars[] [2021-05-03 00:20:03,545 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size [2021-05-03 00:20:03,546 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:20:03,548 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:20:03,559 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:20:03,562 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:20:03,592 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size 78 [2021-05-03 00:20:03,617 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (+ v_main_~c~0_2369 1) v_~SIZE~0_452) (< v_main_~c~0_2369 v_~last~0_457)) InVars {~SIZE~0=v_~SIZE~0_452, main_~c~0=v_main_~c~0_2369, ~last~0=v_~last~0_457} OutVars{~SIZE~0=v_~SIZE~0_452, main_~c~0=v_main_~c~0_2369, ~last~0=v_~last~0_457} AuxVars[] AssignedVars[] [2021-05-03 00:20:03,618 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:20:03,634 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:20:03,635 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:20:03,650 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:20:03,654 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:20:03,669 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:20:03,691 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:20:03,694 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_2371 v_~SIZE~0_453) (<= v_~last~0_458 v_main_~c~0_2371)) InVars {~SIZE~0=v_~SIZE~0_453, main_~c~0=v_main_~c~0_2371, ~last~0=v_~last~0_458} OutVars{~SIZE~0=v_~SIZE~0_453, main_~c~0=v_main_~c~0_2371, ~last~0=v_~last~0_458} AuxVars[] AssignedVars[] [2021-05-03 00:20:03,695 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:20:03,696 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:20:03,697 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:20:03,708 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:20:03,710 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:20:03,738 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:20:03,763 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_2373 v_~last~0_459) (< v_main_~c~0_2373 v_~SIZE~0_454)) InVars {~SIZE~0=v_~SIZE~0_454, main_~c~0=v_main_~c~0_2373, ~last~0=v_~last~0_459} OutVars{~SIZE~0=v_~SIZE~0_454, main_~c~0=v_main_~c~0_2373, ~last~0=v_~last~0_459} AuxVars[] AssignedVars[] [2021-05-03 00:20:03,765 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size [2021-05-03 00:20:03,783 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:20:03,785 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:20:03,802 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:20:03,807 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:20:03,824 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size 66 [2021-05-03 00:20:03,846 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:20:03,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:20:03,932 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:20:03,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:20:03,938 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:20:03,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:20:03,940 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:20:03,943 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:20:04,992 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:20:04,992 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2035990608] [2021-05-03 00:20:04,992 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [2035990608] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:20:04,993 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:20:04,993 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [31] imperfect sequences [] total 31 [2021-05-03 00:20:04,993 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417162247] [2021-05-03 00:20:04,993 INFO L460 AbstractCegarLoop]: Interpolant automaton has 31 states [2021-05-03 00:20:04,993 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:20:04,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2021-05-03 00:20:04,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=916, Unknown=0, NotChecked=0, Total=1056 [2021-05-03 00:20:04,994 INFO L87 Difference]: Start difference. First operand 362 states and 436 transitions. Second operand has 31 states, 31 states have (on average 1.967741935483871) internal successors, (61), 30 states have internal predecessors, (61), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:20:07,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:20:07,240 INFO L93 Difference]: Finished difference Result 755 states and 892 transitions. [2021-05-03 00:20:07,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2021-05-03 00:20:07,242 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 1.967741935483871) internal successors, (61), 30 states have internal predecessors, (61), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 67 [2021-05-03 00:20:07,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:20:07,243 INFO L225 Difference]: With dead ends: 755 [2021-05-03 00:20:07,243 INFO L226 Difference]: Without dead ends: 449 [2021-05-03 00:20:07,244 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 12 SyntacticMatches, 21 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 667 ImplicationChecksByTransitivity, 1102.7ms TimeCoverageRelationStatistics Valid=165, Invalid=1025, Unknown=0, NotChecked=0, Total=1190 [2021-05-03 00:20:07,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 449 states. [2021-05-03 00:20:07,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 449 to 362. [2021-05-03 00:20:07,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 362 states, 352 states have (on average 1.2073863636363635) internal successors, (425), 352 states have internal predecessors, (425), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:20:07,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 436 transitions. [2021-05-03 00:20:07,834 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 436 transitions. Word has length 67 [2021-05-03 00:20:07,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:20:07,834 INFO L480 AbstractCegarLoop]: Abstraction has 362 states and 436 transitions. [2021-05-03 00:20:07,835 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 31 states, 31 states have (on average 1.967741935483871) internal successors, (61), 30 states have internal predecessors, (61), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:20:07,835 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 436 transitions. [2021-05-03 00:20:07,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2021-05-03 00:20:07,835 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:20:07,835 INFO L523 BasicCegarLoop]: trace histogram [15, 15, 9, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:20:07,835 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable576 [2021-05-03 00:20:07,835 INFO L428 AbstractCegarLoop]: === Iteration 135 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:20:07,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:20:07,835 INFO L82 PathProgramCache]: Analyzing trace with hash -794121793, now seen corresponding path program 100 times [2021-05-03 00:20:07,836 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:20:07,836 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1194213017] [2021-05-03 00:20:07,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:20:07,843 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_~last~0_460 v_main_~c~0_2392) (< (+ v_main_~c~0_2392 1) v_~SIZE~0_455)) InVars {~SIZE~0=v_~SIZE~0_455, main_~c~0=v_main_~c~0_2392, ~last~0=v_~last~0_460} OutVars{~SIZE~0=v_~SIZE~0_455, main_~c~0=v_main_~c~0_2392, ~last~0=v_~last~0_460} AuxVars[] AssignedVars[] [2021-05-03 00:20:07,845 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size [2021-05-03 00:20:07,865 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:20:07,867 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:20:07,878 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:20:07,881 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:20:07,898 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size 78 [2021-05-03 00:20:07,923 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (+ v_main_~c~0_2394 1) v_~SIZE~0_456) (< v_main_~c~0_2394 v_~last~0_461)) InVars {~SIZE~0=v_~SIZE~0_456, main_~c~0=v_main_~c~0_2394, ~last~0=v_~last~0_461} OutVars{~SIZE~0=v_~SIZE~0_456, main_~c~0=v_main_~c~0_2394, ~last~0=v_~last~0_461} AuxVars[] AssignedVars[] [2021-05-03 00:20:07,925 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:20:07,941 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:20:07,943 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:20:07,959 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:20:07,965 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:20:07,984 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:20:08,008 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:20:08,011 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_2396 v_~SIZE~0_457) (<= v_~last~0_462 v_main_~c~0_2396)) InVars {~SIZE~0=v_~SIZE~0_457, main_~c~0=v_main_~c~0_2396, ~last~0=v_~last~0_462} OutVars{~SIZE~0=v_~SIZE~0_457, main_~c~0=v_main_~c~0_2396, ~last~0=v_~last~0_462} AuxVars[] AssignedVars[] [2021-05-03 00:20:08,014 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:20:08,015 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:20:08,017 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:20:08,032 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:20:08,036 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:20:08,075 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:20:08,101 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_2398 v_~SIZE~0_458) (< v_main_~c~0_2398 v_~last~0_463)) InVars {~SIZE~0=v_~SIZE~0_458, main_~c~0=v_main_~c~0_2398, ~last~0=v_~last~0_463} OutVars{~SIZE~0=v_~SIZE~0_458, main_~c~0=v_main_~c~0_2398, ~last~0=v_~last~0_463} AuxVars[] AssignedVars[] [2021-05-03 00:20:08,104 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size [2021-05-03 00:20:08,105 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:20:08,107 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:20:08,126 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:20:08,132 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:20:08,163 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size 66 [2021-05-03 00:20:08,186 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:20:08,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:20:08,258 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:20:08,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:20:08,265 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:20:08,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:20:08,268 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:20:08,272 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:20:09,408 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:20:09,409 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1194213017] [2021-05-03 00:20:09,409 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1194213017] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:20:09,409 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:20:09,409 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [32] imperfect sequences [] total 32 [2021-05-03 00:20:09,409 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [518474127] [2021-05-03 00:20:09,409 INFO L460 AbstractCegarLoop]: Interpolant automaton has 32 states [2021-05-03 00:20:09,409 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:20:09,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2021-05-03 00:20:09,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=915, Unknown=0, NotChecked=0, Total=1056 [2021-05-03 00:20:09,410 INFO L87 Difference]: Start difference. First operand 362 states and 436 transitions. Second operand has 32 states, 32 states have (on average 1.90625) internal successors, (61), 31 states have internal predecessors, (61), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:20:11,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:20:11,553 INFO L93 Difference]: Finished difference Result 734 states and 875 transitions. [2021-05-03 00:20:11,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2021-05-03 00:20:11,554 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 1.90625) internal successors, (61), 31 states have internal predecessors, (61), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 67 [2021-05-03 00:20:11,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:20:11,555 INFO L225 Difference]: With dead ends: 734 [2021-05-03 00:20:11,555 INFO L226 Difference]: Without dead ends: 428 [2021-05-03 00:20:11,556 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 13 SyntacticMatches, 19 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 618 ImplicationChecksByTransitivity, 1161.2ms TimeCoverageRelationStatistics Valid=169, Invalid=1021, Unknown=0, NotChecked=0, Total=1190 [2021-05-03 00:20:11,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 428 states. [2021-05-03 00:20:12,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 428 to 362. [2021-05-03 00:20:12,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 362 states, 352 states have (on average 1.2073863636363635) internal successors, (425), 352 states have internal predecessors, (425), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:20:12,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 436 transitions. [2021-05-03 00:20:12,107 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 436 transitions. Word has length 67 [2021-05-03 00:20:12,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:20:12,108 INFO L480 AbstractCegarLoop]: Abstraction has 362 states and 436 transitions. [2021-05-03 00:20:12,108 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 32 states, 32 states have (on average 1.90625) internal successors, (61), 31 states have internal predecessors, (61), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:20:12,108 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 436 transitions. [2021-05-03 00:20:12,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2021-05-03 00:20:12,108 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:20:12,108 INFO L523 BasicCegarLoop]: trace histogram [15, 15, 10, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:20:12,109 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable581 [2021-05-03 00:20:12,109 INFO L428 AbstractCegarLoop]: === Iteration 136 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:20:12,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:20:12,109 INFO L82 PathProgramCache]: Analyzing trace with hash -732082179, now seen corresponding path program 101 times [2021-05-03 00:20:12,109 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:20:12,109 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1042026440] [2021-05-03 00:20:12,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:20:12,119 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (+ v_main_~c~0_2417 1) v_~SIZE~0_459) (<= v_~last~0_464 v_main_~c~0_2417)) InVars {~SIZE~0=v_~SIZE~0_459, main_~c~0=v_main_~c~0_2417, ~last~0=v_~last~0_464} OutVars{~SIZE~0=v_~SIZE~0_459, main_~c~0=v_main_~c~0_2417, ~last~0=v_~last~0_464} AuxVars[] AssignedVars[] [2021-05-03 00:20:12,122 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size [2021-05-03 00:20:12,147 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:20:12,149 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:20:12,181 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:20:12,184 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:20:12,203 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size 78 [2021-05-03 00:20:12,227 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (+ v_main_~c~0_2419 1) v_~SIZE~0_460) (< v_main_~c~0_2419 v_~last~0_465)) InVars {~SIZE~0=v_~SIZE~0_460, main_~c~0=v_main_~c~0_2419, ~last~0=v_~last~0_465} OutVars{~SIZE~0=v_~SIZE~0_460, main_~c~0=v_main_~c~0_2419, ~last~0=v_~last~0_465} AuxVars[] AssignedVars[] [2021-05-03 00:20:12,228 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:20:12,243 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:20:12,245 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:20:12,261 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:20:12,267 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:20:12,282 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:20:12,306 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:20:12,309 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_~last~0_466 v_main_~c~0_2421) (< v_main_~c~0_2421 v_~SIZE~0_461)) InVars {~SIZE~0=v_~SIZE~0_461, main_~c~0=v_main_~c~0_2421, ~last~0=v_~last~0_466} OutVars{~SIZE~0=v_~SIZE~0_461, main_~c~0=v_main_~c~0_2421, ~last~0=v_~last~0_466} AuxVars[] AssignedVars[] [2021-05-03 00:20:12,310 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:20:12,328 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:20:12,330 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:20:12,343 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:20:12,346 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:20:12,366 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:20:12,391 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_2423 v_~last~0_467) (< v_main_~c~0_2423 v_~SIZE~0_462)) InVars {~SIZE~0=v_~SIZE~0_462, main_~c~0=v_main_~c~0_2423, ~last~0=v_~last~0_467} OutVars{~SIZE~0=v_~SIZE~0_462, main_~c~0=v_main_~c~0_2423, ~last~0=v_~last~0_467} AuxVars[] AssignedVars[] [2021-05-03 00:20:12,393 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size [2021-05-03 00:20:12,394 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:20:12,395 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:20:12,412 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:20:12,418 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:20:12,449 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size 66 [2021-05-03 00:20:12,471 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:20:12,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:20:12,534 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:20:12,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:20:12,539 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:20:12,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:20:12,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-03 00:20:12,544 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:20:13,628 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:20:13,629 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1042026440] [2021-05-03 00:20:13,629 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1042026440] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:20:13,629 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:20:13,629 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [33] imperfect sequences [] total 33 [2021-05-03 00:20:13,629 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664918964] [2021-05-03 00:20:13,629 INFO L460 AbstractCegarLoop]: Interpolant automaton has 33 states [2021-05-03 00:20:13,629 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:20:13,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2021-05-03 00:20:13,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=973, Unknown=0, NotChecked=0, Total=1122 [2021-05-03 00:20:13,630 INFO L87 Difference]: Start difference. First operand 362 states and 436 transitions. Second operand has 33 states, 33 states have (on average 1.8484848484848484) internal successors, (61), 32 states have internal predecessors, (61), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:20:15,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:20:15,998 INFO L93 Difference]: Finished difference Result 725 states and 866 transitions. [2021-05-03 00:20:15,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2021-05-03 00:20:15,999 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 1.8484848484848484) internal successors, (61), 32 states have internal predecessors, (61), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 67 [2021-05-03 00:20:15,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:20:16,000 INFO L225 Difference]: With dead ends: 725 [2021-05-03 00:20:16,000 INFO L226 Difference]: Without dead ends: 419 [2021-05-03 00:20:16,001 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 13 SyntacticMatches, 18 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 621 ImplicationChecksByTransitivity, 1114.9ms TimeCoverageRelationStatistics Valid=179, Invalid=1081, Unknown=0, NotChecked=0, Total=1260 [2021-05-03 00:20:16,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419 states. [2021-05-03 00:20:16,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419 to 362. [2021-05-03 00:20:16,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 362 states, 352 states have (on average 1.2073863636363635) internal successors, (425), 352 states have internal predecessors, (425), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:20:16,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 436 transitions. [2021-05-03 00:20:16,630 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 436 transitions. Word has length 67 [2021-05-03 00:20:16,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:20:16,630 INFO L480 AbstractCegarLoop]: Abstraction has 362 states and 436 transitions. [2021-05-03 00:20:16,630 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 33 states, 33 states have (on average 1.8484848484848484) internal successors, (61), 32 states have internal predecessors, (61), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:20:16,630 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 436 transitions. [2021-05-03 00:20:16,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2021-05-03 00:20:16,631 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:20:16,631 INFO L523 BasicCegarLoop]: trace histogram [15, 15, 11, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:20:16,631 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable586 [2021-05-03 00:20:16,631 INFO L428 AbstractCegarLoop]: === Iteration 137 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:20:16,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:20:16,631 INFO L82 PathProgramCache]: Analyzing trace with hash 1757446783, now seen corresponding path program 102 times [2021-05-03 00:20:16,632 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:20:16,632 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1693707056] [2021-05-03 00:20:16,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:20:16,640 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_~last~0_468 v_main_~c~0_2442) (< (+ v_main_~c~0_2442 1) v_~SIZE~0_463)) InVars {~SIZE~0=v_~SIZE~0_463, main_~c~0=v_main_~c~0_2442, ~last~0=v_~last~0_468} OutVars{~SIZE~0=v_~SIZE~0_463, main_~c~0=v_main_~c~0_2442, ~last~0=v_~last~0_468} AuxVars[] AssignedVars[] [2021-05-03 00:20:16,642 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size [2021-05-03 00:20:16,660 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:20:16,661 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:20:16,670 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:20:16,673 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:20:16,702 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size 78 [2021-05-03 00:20:16,725 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_2444 v_~last~0_469) (< (+ v_main_~c~0_2444 1) v_~SIZE~0_464)) InVars {~SIZE~0=v_~SIZE~0_464, main_~c~0=v_main_~c~0_2444, ~last~0=v_~last~0_469} OutVars{~SIZE~0=v_~SIZE~0_464, main_~c~0=v_main_~c~0_2444, ~last~0=v_~last~0_469} AuxVars[] AssignedVars[] [2021-05-03 00:20:16,727 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:20:16,728 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:20:16,729 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:20:16,744 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:20:16,750 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:20:16,778 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:20:16,800 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:20:16,802 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_~last~0_470 v_main_~c~0_2446) (< v_main_~c~0_2446 v_~SIZE~0_465)) InVars {~SIZE~0=v_~SIZE~0_465, main_~c~0=v_main_~c~0_2446, ~last~0=v_~last~0_470} OutVars{~SIZE~0=v_~SIZE~0_465, main_~c~0=v_main_~c~0_2446, ~last~0=v_~last~0_470} AuxVars[] AssignedVars[] [2021-05-03 00:20:16,803 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:20:16,819 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:20:16,820 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:20:16,829 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:20:16,832 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:20:16,848 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:20:16,870 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_2448 v_~SIZE~0_466) (< v_main_~c~0_2448 v_~last~0_471)) InVars {~SIZE~0=v_~SIZE~0_466, main_~c~0=v_main_~c~0_2448, ~last~0=v_~last~0_471} OutVars{~SIZE~0=v_~SIZE~0_466, main_~c~0=v_main_~c~0_2448, ~last~0=v_~last~0_471} AuxVars[] AssignedVars[] [2021-05-03 00:20:16,872 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size [2021-05-03 00:20:16,885 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:20:16,886 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:20:16,902 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:20:16,908 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:20:16,922 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size 66 [2021-05-03 00:20:16,943 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:20:16,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:20:17,003 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:20:17,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:20:17,007 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:20:17,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:20:17,009 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:20:17,011 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:20:18,058 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:20:18,058 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1693707056] [2021-05-03 00:20:18,058 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1693707056] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:20:18,058 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:20:18,058 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [34] imperfect sequences [] total 34 [2021-05-03 00:20:18,058 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [683896646] [2021-05-03 00:20:18,059 INFO L460 AbstractCegarLoop]: Interpolant automaton has 34 states [2021-05-03 00:20:18,059 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:20:18,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2021-05-03 00:20:18,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=1033, Unknown=0, NotChecked=0, Total=1190 [2021-05-03 00:20:18,060 INFO L87 Difference]: Start difference. First operand 362 states and 436 transitions. Second operand has 34 states, 34 states have (on average 1.7941176470588236) internal successors, (61), 33 states have internal predecessors, (61), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:20:19,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:20:19,999 INFO L93 Difference]: Finished difference Result 716 states and 857 transitions. [2021-05-03 00:20:19,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2021-05-03 00:20:20,000 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 1.7941176470588236) internal successors, (61), 33 states have internal predecessors, (61), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 67 [2021-05-03 00:20:20,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:20:20,001 INFO L225 Difference]: With dead ends: 716 [2021-05-03 00:20:20,001 INFO L226 Difference]: Without dead ends: 410 [2021-05-03 00:20:20,002 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 12 SyntacticMatches, 18 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 641 ImplicationChecksByTransitivity, 1097.8ms TimeCoverageRelationStatistics Valid=189, Invalid=1143, Unknown=0, NotChecked=0, Total=1332 [2021-05-03 00:20:20,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410 states. [2021-05-03 00:20:20,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410 to 362. [2021-05-03 00:20:20,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 362 states, 352 states have (on average 1.2073863636363635) internal successors, (425), 352 states have internal predecessors, (425), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:20:20,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 436 transitions. [2021-05-03 00:20:20,683 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 436 transitions. Word has length 67 [2021-05-03 00:20:20,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:20:20,683 INFO L480 AbstractCegarLoop]: Abstraction has 362 states and 436 transitions. [2021-05-03 00:20:20,683 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 34 states, 34 states have (on average 1.7941176470588236) internal successors, (61), 33 states have internal predecessors, (61), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:20:20,683 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 436 transitions. [2021-05-03 00:20:20,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2021-05-03 00:20:20,684 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:20:20,684 INFO L523 BasicCegarLoop]: trace histogram [15, 15, 12, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:20:20,684 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable591 [2021-05-03 00:20:20,684 INFO L428 AbstractCegarLoop]: === Iteration 138 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:20:20,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:20:20,684 INFO L82 PathProgramCache]: Analyzing trace with hash 939798333, now seen corresponding path program 103 times [2021-05-03 00:20:20,684 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:20:20,684 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1217246226] [2021-05-03 00:20:20,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:20:20,692 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (+ v_main_~c~0_2467 1) v_~SIZE~0_467) (<= v_~last~0_472 v_main_~c~0_2467)) InVars {~SIZE~0=v_~SIZE~0_467, main_~c~0=v_main_~c~0_2467, ~last~0=v_~last~0_472} OutVars{~SIZE~0=v_~SIZE~0_467, main_~c~0=v_main_~c~0_2467, ~last~0=v_~last~0_472} AuxVars[] AssignedVars[] [2021-05-03 00:20:20,694 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size [2021-05-03 00:20:20,695 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:20:20,697 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:20:20,709 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:20:20,711 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:20:20,739 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size 78 [2021-05-03 00:20:20,763 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_2469 v_~last~0_473) (< (+ v_main_~c~0_2469 1) v_~SIZE~0_468)) InVars {~SIZE~0=v_~SIZE~0_468, main_~c~0=v_main_~c~0_2469, ~last~0=v_~last~0_473} OutVars{~SIZE~0=v_~SIZE~0_468, main_~c~0=v_main_~c~0_2469, ~last~0=v_~last~0_473} AuxVars[] AssignedVars[] [2021-05-03 00:20:20,765 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:20:20,779 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:20:20,781 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:20:20,795 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:20:20,800 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:20:20,816 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:20:20,838 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:20:20,841 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_2471 v_~SIZE~0_469) (<= v_~last~0_474 v_main_~c~0_2471)) InVars {~SIZE~0=v_~SIZE~0_469, main_~c~0=v_main_~c~0_2471, ~last~0=v_~last~0_474} OutVars{~SIZE~0=v_~SIZE~0_469, main_~c~0=v_main_~c~0_2471, ~last~0=v_~last~0_474} AuxVars[] AssignedVars[] [2021-05-03 00:20:20,843 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:20:20,860 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:20:20,862 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:20:20,874 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:20:20,877 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:20:20,896 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:20:20,920 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_2473 v_~SIZE~0_470) (< v_main_~c~0_2473 v_~last~0_475)) InVars {~SIZE~0=v_~SIZE~0_470, main_~c~0=v_main_~c~0_2473, ~last~0=v_~last~0_475} OutVars{~SIZE~0=v_~SIZE~0_470, main_~c~0=v_main_~c~0_2473, ~last~0=v_~last~0_475} AuxVars[] AssignedVars[] [2021-05-03 00:20:20,922 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size [2021-05-03 00:20:20,938 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:20:20,940 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:20:20,955 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:20:20,960 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:20:20,977 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size 66 [2021-05-03 00:20:21,001 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:20:21,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:20:21,090 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:20:21,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:20:21,097 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:20:21,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:20:21,100 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:20:21,104 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:20:22,187 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:20:22,187 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1217246226] [2021-05-03 00:20:22,187 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1217246226] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:20:22,187 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:20:22,188 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [35] imperfect sequences [] total 35 [2021-05-03 00:20:22,188 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456026652] [2021-05-03 00:20:22,188 INFO L460 AbstractCegarLoop]: Interpolant automaton has 35 states [2021-05-03 00:20:22,188 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:20:22,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2021-05-03 00:20:22,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=1095, Unknown=0, NotChecked=0, Total=1260 [2021-05-03 00:20:22,189 INFO L87 Difference]: Start difference. First operand 362 states and 436 transitions. Second operand has 35 states, 35 states have (on average 1.7428571428571429) internal successors, (61), 34 states have internal predecessors, (61), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:20:24,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:20:24,570 INFO L93 Difference]: Finished difference Result 707 states and 848 transitions. [2021-05-03 00:20:24,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2021-05-03 00:20:24,571 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 1.7428571428571429) internal successors, (61), 34 states have internal predecessors, (61), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 67 [2021-05-03 00:20:24,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:20:24,572 INFO L225 Difference]: With dead ends: 707 [2021-05-03 00:20:24,572 INFO L226 Difference]: Without dead ends: 401 [2021-05-03 00:20:24,572 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 14 SyntacticMatches, 15 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 572 ImplicationChecksByTransitivity, 1105.8ms TimeCoverageRelationStatistics Valid=199, Invalid=1207, Unknown=0, NotChecked=0, Total=1406 [2021-05-03 00:20:24,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 401 states. [2021-05-03 00:20:25,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 401 to 362. [2021-05-03 00:20:25,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 362 states, 352 states have (on average 1.2073863636363635) internal successors, (425), 352 states have internal predecessors, (425), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:20:25,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 436 transitions. [2021-05-03 00:20:25,195 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 436 transitions. Word has length 67 [2021-05-03 00:20:25,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:20:25,196 INFO L480 AbstractCegarLoop]: Abstraction has 362 states and 436 transitions. [2021-05-03 00:20:25,196 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 35 states, 35 states have (on average 1.7428571428571429) internal successors, (61), 34 states have internal predecessors, (61), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:20:25,196 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 436 transitions. [2021-05-03 00:20:25,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2021-05-03 00:20:25,196 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:20:25,196 INFO L523 BasicCegarLoop]: trace histogram [15, 15, 13, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:20:25,196 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable596 [2021-05-03 00:20:25,196 INFO L428 AbstractCegarLoop]: === Iteration 139 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:20:25,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:20:25,197 INFO L82 PathProgramCache]: Analyzing trace with hash -648549569, now seen corresponding path program 104 times [2021-05-03 00:20:25,197 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:20:25,197 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1201288794] [2021-05-03 00:20:25,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:20:25,205 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (+ v_main_~c~0_2492 1) v_~SIZE~0_471) (<= v_~last~0_476 v_main_~c~0_2492)) InVars {~SIZE~0=v_~SIZE~0_471, main_~c~0=v_main_~c~0_2492, ~last~0=v_~last~0_476} OutVars{~SIZE~0=v_~SIZE~0_471, main_~c~0=v_main_~c~0_2492, ~last~0=v_~last~0_476} AuxVars[] AssignedVars[] [2021-05-03 00:20:25,207 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size [2021-05-03 00:20:25,223 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:20:25,224 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:20:25,235 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:20:25,238 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:20:25,254 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size 78 [2021-05-03 00:20:25,278 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_2494 v_~last~0_477) (< (+ v_main_~c~0_2494 1) v_~SIZE~0_472)) InVars {~SIZE~0=v_~SIZE~0_472, main_~c~0=v_main_~c~0_2494, ~last~0=v_~last~0_477} OutVars{~SIZE~0=v_~SIZE~0_472, main_~c~0=v_main_~c~0_2494, ~last~0=v_~last~0_477} AuxVars[] AssignedVars[] [2021-05-03 00:20:25,280 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:20:25,295 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:20:25,297 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:20:25,309 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:20:25,314 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:20:25,328 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:20:25,352 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:20:25,355 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_~last~0_478 v_main_~c~0_2496) (< v_main_~c~0_2496 v_~SIZE~0_473)) InVars {~SIZE~0=v_~SIZE~0_473, main_~c~0=v_main_~c~0_2496, ~last~0=v_~last~0_478} OutVars{~SIZE~0=v_~SIZE~0_473, main_~c~0=v_main_~c~0_2496, ~last~0=v_~last~0_478} AuxVars[] AssignedVars[] [2021-05-03 00:20:25,357 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:20:25,358 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:20:25,359 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:20:25,370 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:20:25,374 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:20:25,406 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:20:25,428 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_2498 v_~last~0_479) (< v_main_~c~0_2498 v_~SIZE~0_474)) InVars {~SIZE~0=v_~SIZE~0_474, main_~c~0=v_main_~c~0_2498, ~last~0=v_~last~0_479} OutVars{~SIZE~0=v_~SIZE~0_474, main_~c~0=v_main_~c~0_2498, ~last~0=v_~last~0_479} AuxVars[] AssignedVars[] [2021-05-03 00:20:25,430 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size [2021-05-03 00:20:25,444 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:20:25,446 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:20:25,459 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:20:25,464 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:20:25,479 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size 66 [2021-05-03 00:20:25,502 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:20:25,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:20:25,570 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:20:25,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:20:25,575 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:20:25,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:20:25,576 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:20:25,579 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:20:26,642 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:20:26,642 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1201288794] [2021-05-03 00:20:26,642 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1201288794] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:20:26,642 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:20:26,642 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [36] imperfect sequences [] total 36 [2021-05-03 00:20:26,642 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880001418] [2021-05-03 00:20:26,643 INFO L460 AbstractCegarLoop]: Interpolant automaton has 36 states [2021-05-03 00:20:26,643 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:20:26,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2021-05-03 00:20:26,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=173, Invalid=1159, Unknown=0, NotChecked=0, Total=1332 [2021-05-03 00:20:26,643 INFO L87 Difference]: Start difference. First operand 362 states and 436 transitions. Second operand has 36 states, 36 states have (on average 1.6944444444444444) internal successors, (61), 35 states have internal predecessors, (61), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:20:28,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:20:28,467 INFO L93 Difference]: Finished difference Result 701 states and 842 transitions. [2021-05-03 00:20:28,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2021-05-03 00:20:28,468 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 1.6944444444444444) internal successors, (61), 35 states have internal predecessors, (61), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 67 [2021-05-03 00:20:28,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:20:28,469 INFO L225 Difference]: With dead ends: 701 [2021-05-03 00:20:28,469 INFO L226 Difference]: Without dead ends: 395 [2021-05-03 00:20:28,470 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 12 SyntacticMatches, 16 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 606 ImplicationChecksByTransitivity, 1093.0ms TimeCoverageRelationStatistics Valid=209, Invalid=1273, Unknown=0, NotChecked=0, Total=1482 [2021-05-03 00:20:28,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2021-05-03 00:20:29,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 362. [2021-05-03 00:20:29,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 362 states, 352 states have (on average 1.2073863636363635) internal successors, (425), 352 states have internal predecessors, (425), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:20:29,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 436 transitions. [2021-05-03 00:20:29,171 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 436 transitions. Word has length 67 [2021-05-03 00:20:29,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:20:29,172 INFO L480 AbstractCegarLoop]: Abstraction has 362 states and 436 transitions. [2021-05-03 00:20:29,172 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 36 states, 36 states have (on average 1.6944444444444444) internal successors, (61), 35 states have internal predecessors, (61), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:20:29,172 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 436 transitions. [2021-05-03 00:20:29,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2021-05-03 00:20:29,172 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:20:29,172 INFO L523 BasicCegarLoop]: trace histogram [15, 15, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:20:29,173 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable601 [2021-05-03 00:20:29,173 INFO L428 AbstractCegarLoop]: === Iteration 140 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:20:29,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:20:29,173 INFO L82 PathProgramCache]: Analyzing trace with hash -1659666819, now seen corresponding path program 105 times [2021-05-03 00:20:29,173 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:20:29,173 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [439566720] [2021-05-03 00:20:29,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:20:29,179 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (+ v_main_~c~0_2517 1) v_~SIZE~0_475) (< v_main_~c~0_2517 v_~last~0_480)) InVars {~SIZE~0=v_~SIZE~0_475, main_~c~0=v_main_~c~0_2517, ~last~0=v_~last~0_480} OutVars{~SIZE~0=v_~SIZE~0_475, main_~c~0=v_main_~c~0_2517, ~last~0=v_~last~0_480} AuxVars[] AssignedVars[] [2021-05-03 00:20:29,181 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:20:29,194 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:20:29,196 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:20:29,214 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:20:29,219 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:20:29,241 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:20:29,270 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:20:29,273 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_2519 v_~SIZE~0_476) (<= v_~last~0_481 v_main_~c~0_2519)) InVars {~SIZE~0=v_~SIZE~0_476, main_~c~0=v_main_~c~0_2519, ~last~0=v_~last~0_481} OutVars{~SIZE~0=v_~SIZE~0_476, main_~c~0=v_main_~c~0_2519, ~last~0=v_~last~0_481} AuxVars[] AssignedVars[] [2021-05-03 00:20:29,275 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:20:29,276 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:20:29,277 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:20:29,292 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:20:29,297 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:20:29,337 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:20:29,364 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_2521 v_~last~0_482) (< v_main_~c~0_2521 v_~SIZE~0_477)) InVars {~SIZE~0=v_~SIZE~0_477, main_~c~0=v_main_~c~0_2521, ~last~0=v_~last~0_482} OutVars{~SIZE~0=v_~SIZE~0_477, main_~c~0=v_main_~c~0_2521, ~last~0=v_~last~0_482} AuxVars[] AssignedVars[] [2021-05-03 00:20:29,366 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size [2021-05-03 00:20:29,385 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:20:29,386 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:20:29,399 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:20:29,404 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:20:29,421 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size 66 [2021-05-03 00:20:29,440 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:20:29,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:20:29,544 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:20:29,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:20:29,552 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:20:29,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:20:29,555 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:20:29,557 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:20:31,153 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:20:31,153 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [439566720] [2021-05-03 00:20:31,153 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [439566720] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:20:31,153 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:20:31,153 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [37] imperfect sequences [] total 37 [2021-05-03 00:20:31,153 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1216705596] [2021-05-03 00:20:31,154 INFO L460 AbstractCegarLoop]: Interpolant automaton has 37 states [2021-05-03 00:20:31,154 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:20:31,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2021-05-03 00:20:31,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=188, Invalid=1294, Unknown=0, NotChecked=0, Total=1482 [2021-05-03 00:20:31,155 INFO L87 Difference]: Start difference. First operand 362 states and 436 transitions. Second operand has 37 states, 37 states have (on average 1.6486486486486487) internal successors, (61), 36 states have internal predecessors, (61), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:20:33,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:20:33,464 INFO L93 Difference]: Finished difference Result 731 states and 874 transitions. [2021-05-03 00:20:33,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2021-05-03 00:20:33,466 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 1.6486486486486487) internal successors, (61), 36 states have internal predecessors, (61), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 67 [2021-05-03 00:20:33,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:20:33,467 INFO L225 Difference]: With dead ends: 731 [2021-05-03 00:20:33,467 INFO L226 Difference]: Without dead ends: 425 [2021-05-03 00:20:33,468 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 12 SyntacticMatches, 15 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 610 ImplicationChecksByTransitivity, 1656.6ms TimeCoverageRelationStatistics Valid=225, Invalid=1415, Unknown=0, NotChecked=0, Total=1640 [2021-05-03 00:20:33,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 425 states. [2021-05-03 00:20:33,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 425 to 327. [2021-05-03 00:20:33,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 327 states, 317 states have (on average 1.195583596214511) internal successors, (379), 318 states have internal predecessors, (379), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:20:33,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 390 transitions. [2021-05-03 00:20:33,997 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 390 transitions. Word has length 67 [2021-05-03 00:20:33,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:20:33,998 INFO L480 AbstractCegarLoop]: Abstraction has 327 states and 390 transitions. [2021-05-03 00:20:33,998 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 37 states, 37 states have (on average 1.6486486486486487) internal successors, (61), 36 states have internal predecessors, (61), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:20:33,998 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 390 transitions. [2021-05-03 00:20:33,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2021-05-03 00:20:33,998 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:20:33,998 INFO L523 BasicCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:20:33,998 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable605 [2021-05-03 00:20:33,998 INFO L428 AbstractCegarLoop]: === Iteration 141 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:20:33,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:20:33,999 INFO L82 PathProgramCache]: Analyzing trace with hash -1825207169, now seen corresponding path program 15 times [2021-05-03 00:20:33,999 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:20:33,999 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1266126400] [2021-05-03 00:20:33,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:20:34,004 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (+ v_main_~c~0_2540 1) v_~SIZE~0_478) (< v_main_~c~0_2540 v_~last~0_483)) InVars {~SIZE~0=v_~SIZE~0_478, main_~c~0=v_main_~c~0_2540, ~last~0=v_~last~0_483} OutVars{~SIZE~0=v_~SIZE~0_478, main_~c~0=v_main_~c~0_2540, ~last~0=v_~last~0_483} AuxVars[] AssignedVars[] [2021-05-03 00:20:34,006 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:20:34,007 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:20:34,009 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:20:34,024 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:20:34,029 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:20:34,059 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:20:34,086 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:20:34,088 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_2542 v_~last~0_484) (< v_main_~c~0_2542 v_~SIZE~0_479)) InVars {~SIZE~0=v_~SIZE~0_479, main_~c~0=v_main_~c~0_2542, ~last~0=v_~last~0_484} OutVars{~SIZE~0=v_~SIZE~0_479, main_~c~0=v_main_~c~0_2542, ~last~0=v_~last~0_484} AuxVars[] AssignedVars[] [2021-05-03 00:20:34,090 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size [2021-05-03 00:20:34,090 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:20:34,092 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:20:34,106 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:20:34,111 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:20:34,141 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size 66 [2021-05-03 00:20:34,166 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:20:34,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:20:34,279 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:20:34,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:20:34,283 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:20:34,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:20:34,285 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:20:36,687 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:20:36,688 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1266126400] [2021-05-03 00:20:36,688 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1266126400] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:20:36,688 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:20:36,688 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [41] imperfect sequences [] total 41 [2021-05-03 00:20:36,688 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2060591499] [2021-05-03 00:20:36,688 INFO L460 AbstractCegarLoop]: Interpolant automaton has 41 states [2021-05-03 00:20:36,688 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:20:36,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2021-05-03 00:20:36,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=205, Invalid=1601, Unknown=0, NotChecked=0, Total=1806 [2021-05-03 00:20:36,689 INFO L87 Difference]: Start difference. First operand 327 states and 390 transitions. Second operand has 41 states, 41 states have (on average 1.4878048780487805) internal successors, (61), 39 states have internal predecessors, (61), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:20:40,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:20:40,746 INFO L93 Difference]: Finished difference Result 758 states and 905 transitions. [2021-05-03 00:20:40,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2021-05-03 00:20:40,748 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 41 states have (on average 1.4878048780487805) internal successors, (61), 39 states have internal predecessors, (61), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 67 [2021-05-03 00:20:40,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:20:40,749 INFO L225 Difference]: With dead ends: 758 [2021-05-03 00:20:40,749 INFO L226 Difference]: Without dead ends: 443 [2021-05-03 00:20:40,750 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 6 SyntacticMatches, 14 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 992 ImplicationChecksByTransitivity, 3262.0ms TimeCoverageRelationStatistics Valid=335, Invalid=3205, Unknown=0, NotChecked=0, Total=3540 [2021-05-03 00:20:40,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 443 states. [2021-05-03 00:20:41,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 443 to 374. [2021-05-03 00:20:41,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 374 states, 364 states have (on average 1.2115384615384615) internal successors, (441), 364 states have internal predecessors, (441), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:20:41,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 452 transitions. [2021-05-03 00:20:41,319 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 452 transitions. Word has length 67 [2021-05-03 00:20:41,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:20:41,319 INFO L480 AbstractCegarLoop]: Abstraction has 374 states and 452 transitions. [2021-05-03 00:20:41,319 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 41 states, 41 states have (on average 1.4878048780487805) internal successors, (61), 39 states have internal predecessors, (61), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:20:41,320 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 452 transitions. [2021-05-03 00:20:41,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-05-03 00:20:41,320 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:20:41,320 INFO L523 BasicCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:20:41,320 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable608 [2021-05-03 00:20:41,320 INFO L428 AbstractCegarLoop]: === Iteration 142 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:20:41,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:20:41,321 INFO L82 PathProgramCache]: Analyzing trace with hash -940321762, now seen corresponding path program 16 times [2021-05-03 00:20:41,321 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:20:41,321 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1637991547] [2021-05-03 00:20:41,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:20:41,327 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (+ v_main_~c~0_2560 1) v_~SIZE~0_480) (<= v_~last~0_485 v_main_~c~0_2560)) InVars {~SIZE~0=v_~SIZE~0_480, main_~c~0=v_main_~c~0_2560, ~last~0=v_~last~0_485} OutVars{~SIZE~0=v_~SIZE~0_480, main_~c~0=v_main_~c~0_2560, ~last~0=v_~last~0_485} AuxVars[] AssignedVars[] [2021-05-03 00:20:41,329 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size [2021-05-03 00:20:41,351 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:20:41,352 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:20:41,364 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:20:41,367 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:20:41,385 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size 78 [2021-05-03 00:20:41,409 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:20:41,412 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_2562 v_~SIZE~0_481) (<= v_~last~0_486 v_main_~c~0_2562)) InVars {~SIZE~0=v_~SIZE~0_481, main_~c~0=v_main_~c~0_2562, ~last~0=v_~last~0_486} OutVars{~SIZE~0=v_~SIZE~0_481, main_~c~0=v_main_~c~0_2562, ~last~0=v_~last~0_486} AuxVars[] AssignedVars[] [2021-05-03 00:20:41,414 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:20:41,434 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:20:41,437 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:20:41,448 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:20:41,451 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:20:41,469 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:20:41,491 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:20:41,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:20:41,542 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:20:41,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:20:41,547 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:20:41,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:20:41,548 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:20:42,475 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:20:42,476 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1637991547] [2021-05-03 00:20:42,476 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1637991547] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:20:42,476 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:20:42,476 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2021-05-03 00:20:42,476 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18630510] [2021-05-03 00:20:42,476 INFO L460 AbstractCegarLoop]: Interpolant automaton has 24 states [2021-05-03 00:20:42,476 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:20:42,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2021-05-03 00:20:42,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=512, Unknown=0, NotChecked=0, Total=600 [2021-05-03 00:20:42,477 INFO L87 Difference]: Start difference. First operand 374 states and 452 transitions. Second operand has 24 states, 24 states have (on average 2.6666666666666665) internal successors, (64), 23 states have internal predecessors, (64), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:20:44,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:20:44,553 INFO L93 Difference]: Finished difference Result 827 states and 971 transitions. [2021-05-03 00:20:44,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-05-03 00:20:44,556 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 2.6666666666666665) internal successors, (64), 23 states have internal predecessors, (64), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 70 [2021-05-03 00:20:44,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:20:44,558 INFO L225 Difference]: With dead ends: 827 [2021-05-03 00:20:44,558 INFO L226 Difference]: Without dead ends: 512 [2021-05-03 00:20:44,559 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 13 SyntacticMatches, 31 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 167 ImplicationChecksByTransitivity, 930.4ms TimeCoverageRelationStatistics Valid=92, Invalid=558, Unknown=0, NotChecked=0, Total=650 [2021-05-03 00:20:44,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 512 states. [2021-05-03 00:20:45,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 512 to 383. [2021-05-03 00:20:45,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 383 states, 373 states have (on average 1.2064343163538873) internal successors, (450), 373 states have internal predecessors, (450), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:20:45,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 461 transitions. [2021-05-03 00:20:45,482 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 461 transitions. Word has length 70 [2021-05-03 00:20:45,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:20:45,483 INFO L480 AbstractCegarLoop]: Abstraction has 383 states and 461 transitions. [2021-05-03 00:20:45,483 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 24 states, 24 states have (on average 2.6666666666666665) internal successors, (64), 23 states have internal predecessors, (64), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:20:45,483 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 461 transitions. [2021-05-03 00:20:45,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-05-03 00:20:45,483 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:20:45,484 INFO L523 BasicCegarLoop]: trace histogram [16, 16, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:20:45,484 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable611 [2021-05-03 00:20:45,484 INFO L428 AbstractCegarLoop]: === Iteration 143 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:20:45,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:20:45,484 INFO L82 PathProgramCache]: Analyzing trace with hash -899647012, now seen corresponding path program 106 times [2021-05-03 00:20:45,484 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:20:45,484 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1594629434] [2021-05-03 00:20:45,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:20:45,495 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_~last~0_487 v_main_~c~0_2581) (< (+ v_main_~c~0_2581 1) v_~SIZE~0_482)) InVars {~SIZE~0=v_~SIZE~0_482, main_~c~0=v_main_~c~0_2581, ~last~0=v_~last~0_487} OutVars{~SIZE~0=v_~SIZE~0_482, main_~c~0=v_main_~c~0_2581, ~last~0=v_~last~0_487} AuxVars[] AssignedVars[] [2021-05-03 00:20:45,498 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size [2021-05-03 00:20:45,518 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:20:45,520 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:20:45,533 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:20:45,537 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:20:45,553 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size 78 [2021-05-03 00:20:45,575 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_2583 v_~last~0_488) (< (+ v_main_~c~0_2583 1) v_~SIZE~0_483)) InVars {~SIZE~0=v_~SIZE~0_483, main_~c~0=v_main_~c~0_2583, ~last~0=v_~last~0_488} OutVars{~SIZE~0=v_~SIZE~0_483, main_~c~0=v_main_~c~0_2583, ~last~0=v_~last~0_488} AuxVars[] AssignedVars[] [2021-05-03 00:20:45,576 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:20:45,590 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:20:45,591 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:20:45,605 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:20:45,611 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:20:45,626 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:20:45,647 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:20:45,650 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_~last~0_489 v_main_~c~0_2585) (< v_main_~c~0_2585 v_~SIZE~0_484)) InVars {~SIZE~0=v_~SIZE~0_484, main_~c~0=v_main_~c~0_2585, ~last~0=v_~last~0_489} OutVars{~SIZE~0=v_~SIZE~0_484, main_~c~0=v_main_~c~0_2585, ~last~0=v_~last~0_489} AuxVars[] AssignedVars[] [2021-05-03 00:20:45,652 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:20:45,670 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:20:45,672 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:20:45,682 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:20:45,685 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:20:45,701 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:20:45,725 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_2587 v_~SIZE~0_485) (< v_main_~c~0_2587 v_~last~0_490)) InVars {~SIZE~0=v_~SIZE~0_485, main_~c~0=v_main_~c~0_2587, ~last~0=v_~last~0_490} OutVars{~SIZE~0=v_~SIZE~0_485, main_~c~0=v_main_~c~0_2587, ~last~0=v_~last~0_490} AuxVars[] AssignedVars[] [2021-05-03 00:20:45,726 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size [2021-05-03 00:20:45,727 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:20:45,729 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:20:45,742 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:20:45,747 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:20:45,772 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size 66 [2021-05-03 00:20:45,791 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:20:45,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:20:45,845 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:20:45,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:20:45,849 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:20:45,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:20:45,851 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:20:45,853 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:20:47,193 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:20:47,193 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1594629434] [2021-05-03 00:20:47,193 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1594629434] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:20:47,193 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:20:47,193 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2021-05-03 00:20:47,193 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [397324376] [2021-05-03 00:20:47,194 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states [2021-05-03 00:20:47,194 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:20:47,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-05-03 00:20:47,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=570, Unknown=0, NotChecked=0, Total=650 [2021-05-03 00:20:47,194 INFO L87 Difference]: Start difference. First operand 383 states and 461 transitions. Second operand has 25 states, 25 states have (on average 2.56) internal successors, (64), 24 states have internal predecessors, (64), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:20:50,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:20:50,291 INFO L93 Difference]: Finished difference Result 854 states and 1002 transitions. [2021-05-03 00:20:50,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2021-05-03 00:20:50,292 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 2.56) internal successors, (64), 24 states have internal predecessors, (64), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 70 [2021-05-03 00:20:50,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:20:50,293 INFO L225 Difference]: With dead ends: 854 [2021-05-03 00:20:50,293 INFO L226 Difference]: Without dead ends: 530 [2021-05-03 00:20:50,294 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 12 SyntacticMatches, 30 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 294 ImplicationChecksByTransitivity, 1367.1ms TimeCoverageRelationStatistics Valid=92, Invalid=664, Unknown=0, NotChecked=0, Total=756 [2021-05-03 00:20:50,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 530 states. [2021-05-03 00:20:51,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 530 to 383. [2021-05-03 00:20:51,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 383 states, 373 states have (on average 1.2064343163538873) internal successors, (450), 373 states have internal predecessors, (450), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:20:51,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 461 transitions. [2021-05-03 00:20:51,095 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 461 transitions. Word has length 70 [2021-05-03 00:20:51,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:20:51,095 INFO L480 AbstractCegarLoop]: Abstraction has 383 states and 461 transitions. [2021-05-03 00:20:51,095 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 25 states, 25 states have (on average 2.56) internal successors, (64), 24 states have internal predecessors, (64), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:20:51,095 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 461 transitions. [2021-05-03 00:20:51,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-05-03 00:20:51,096 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:20:51,096 INFO L523 BasicCegarLoop]: trace histogram [16, 16, 14, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:20:51,096 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable616 [2021-05-03 00:20:51,096 INFO L428 AbstractCegarLoop]: === Iteration 144 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:20:51,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:20:51,096 INFO L82 PathProgramCache]: Analyzing trace with hash -455746338, now seen corresponding path program 107 times [2021-05-03 00:20:51,097 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:20:51,097 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [736594167] [2021-05-03 00:20:51,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:20:51,109 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (+ v_main_~c~0_2607 1) v_~SIZE~0_486) (<= v_~last~0_491 v_main_~c~0_2607)) InVars {~SIZE~0=v_~SIZE~0_486, main_~c~0=v_main_~c~0_2607, ~last~0=v_~last~0_491} OutVars{~SIZE~0=v_~SIZE~0_486, main_~c~0=v_main_~c~0_2607, ~last~0=v_~last~0_491} AuxVars[] AssignedVars[] [2021-05-03 00:20:51,112 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size [2021-05-03 00:20:51,114 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:20:51,117 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:20:51,134 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:20:51,138 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:20:51,181 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size 78 [2021-05-03 00:20:51,222 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (+ v_main_~c~0_2609 1) v_~SIZE~0_487) (< v_main_~c~0_2609 v_~last~0_492)) InVars {~SIZE~0=v_~SIZE~0_487, main_~c~0=v_main_~c~0_2609, ~last~0=v_~last~0_492} OutVars{~SIZE~0=v_~SIZE~0_487, main_~c~0=v_main_~c~0_2609, ~last~0=v_~last~0_492} AuxVars[] AssignedVars[] [2021-05-03 00:20:51,225 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:20:51,245 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:20:51,247 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:20:51,265 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:20:51,272 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:20:51,294 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:20:51,326 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:20:51,329 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_2611 v_~SIZE~0_488) (<= v_~last~0_493 v_main_~c~0_2611)) InVars {~SIZE~0=v_~SIZE~0_488, main_~c~0=v_main_~c~0_2611, ~last~0=v_~last~0_493} OutVars{~SIZE~0=v_~SIZE~0_488, main_~c~0=v_main_~c~0_2611, ~last~0=v_~last~0_493} AuxVars[] AssignedVars[] [2021-05-03 00:20:51,331 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:20:51,355 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:20:51,357 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:20:51,372 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:20:51,375 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:20:51,397 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:20:51,428 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_2613 v_~SIZE~0_489) (< v_main_~c~0_2613 v_~last~0_494)) InVars {~SIZE~0=v_~SIZE~0_489, main_~c~0=v_main_~c~0_2613, ~last~0=v_~last~0_494} OutVars{~SIZE~0=v_~SIZE~0_489, main_~c~0=v_main_~c~0_2613, ~last~0=v_~last~0_494} AuxVars[] AssignedVars[] [2021-05-03 00:20:51,430 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size [2021-05-03 00:20:51,447 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:20:51,450 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:20:51,468 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:20:51,475 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:20:51,496 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size 66 [2021-05-03 00:20:51,522 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:20:51,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:20:51,626 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:20:51,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:20:51,631 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:20:51,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:20:51,633 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:20:51,636 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:20:53,474 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:20:53,474 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [736594167] [2021-05-03 00:20:53,474 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [736594167] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:20:53,474 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:20:53,474 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2021-05-03 00:20:53,474 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [676964206] [2021-05-03 00:20:53,475 INFO L460 AbstractCegarLoop]: Interpolant automaton has 26 states [2021-05-03 00:20:53,475 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:20:53,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2021-05-03 00:20:53,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=661, Unknown=0, NotChecked=0, Total=756 [2021-05-03 00:20:53,475 INFO L87 Difference]: Start difference. First operand 383 states and 461 transitions. Second operand has 26 states, 26 states have (on average 2.4615384615384617) internal successors, (64), 25 states have internal predecessors, (64), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:20:56,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:20:56,330 INFO L93 Difference]: Finished difference Result 839 states and 983 transitions. [2021-05-03 00:20:56,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2021-05-03 00:20:56,331 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 2.4615384615384617) internal successors, (64), 25 states have internal predecessors, (64), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 70 [2021-05-03 00:20:56,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:20:56,333 INFO L225 Difference]: With dead ends: 839 [2021-05-03 00:20:56,333 INFO L226 Difference]: Without dead ends: 515 [2021-05-03 00:20:56,334 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 12 SyntacticMatches, 29 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 427 ImplicationChecksByTransitivity, 1887.1ms TimeCoverageRelationStatistics Valid=108, Invalid=762, Unknown=0, NotChecked=0, Total=870 [2021-05-03 00:20:56,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 515 states. [2021-05-03 00:20:57,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 515 to 383. [2021-05-03 00:20:57,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 383 states, 373 states have (on average 1.2064343163538873) internal successors, (450), 373 states have internal predecessors, (450), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:20:57,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 461 transitions. [2021-05-03 00:20:57,234 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 461 transitions. Word has length 70 [2021-05-03 00:20:57,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:20:57,234 INFO L480 AbstractCegarLoop]: Abstraction has 383 states and 461 transitions. [2021-05-03 00:20:57,234 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 26 states, 26 states have (on average 2.4615384615384617) internal successors, (64), 25 states have internal predecessors, (64), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:20:57,234 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 461 transitions. [2021-05-03 00:20:57,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-05-03 00:20:57,234 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:20:57,234 INFO L523 BasicCegarLoop]: trace histogram [16, 16, 13, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:20:57,235 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable621 [2021-05-03 00:20:57,235 INFO L428 AbstractCegarLoop]: === Iteration 145 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:20:57,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:20:57,235 INFO L82 PathProgramCache]: Analyzing trace with hash -936826596, now seen corresponding path program 108 times [2021-05-03 00:20:57,235 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:20:57,235 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [94118843] [2021-05-03 00:20:57,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:20:57,242 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_~last~0_495 v_main_~c~0_2633) (< (+ v_main_~c~0_2633 1) v_~SIZE~0_490)) InVars {~SIZE~0=v_~SIZE~0_490, main_~c~0=v_main_~c~0_2633, ~last~0=v_~last~0_495} OutVars{~SIZE~0=v_~SIZE~0_490, main_~c~0=v_main_~c~0_2633, ~last~0=v_~last~0_495} AuxVars[] AssignedVars[] [2021-05-03 00:20:57,244 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size [2021-05-03 00:20:57,259 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:20:57,260 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:20:57,293 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:20:57,299 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:20:57,323 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size 78 [2021-05-03 00:20:57,364 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (+ v_main_~c~0_2635 1) v_~SIZE~0_491) (< v_main_~c~0_2635 v_~last~0_496)) InVars {~SIZE~0=v_~SIZE~0_491, main_~c~0=v_main_~c~0_2635, ~last~0=v_~last~0_496} OutVars{~SIZE~0=v_~SIZE~0_491, main_~c~0=v_main_~c~0_2635, ~last~0=v_~last~0_496} AuxVars[] AssignedVars[] [2021-05-03 00:20:57,366 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:20:57,393 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:20:57,397 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:20:57,422 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:20:57,432 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:20:57,460 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:20:57,493 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:20:57,498 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_~last~0_497 v_main_~c~0_2637) (< v_main_~c~0_2637 v_~SIZE~0_492)) InVars {~SIZE~0=v_~SIZE~0_492, main_~c~0=v_main_~c~0_2637, ~last~0=v_~last~0_497} OutVars{~SIZE~0=v_~SIZE~0_492, main_~c~0=v_main_~c~0_2637, ~last~0=v_~last~0_497} AuxVars[] AssignedVars[] [2021-05-03 00:20:57,501 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:20:57,530 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:20:57,533 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:20:57,551 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:20:57,558 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:20:57,588 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:20:57,630 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_2639 v_~last~0_498) (< v_main_~c~0_2639 v_~SIZE~0_493)) InVars {~SIZE~0=v_~SIZE~0_493, main_~c~0=v_main_~c~0_2639, ~last~0=v_~last~0_498} OutVars{~SIZE~0=v_~SIZE~0_493, main_~c~0=v_main_~c~0_2639, ~last~0=v_~last~0_498} AuxVars[] AssignedVars[] [2021-05-03 00:20:57,632 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size [2021-05-03 00:20:57,633 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:20:57,636 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:20:57,659 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:20:57,668 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:20:57,723 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size 66 [2021-05-03 00:20:57,781 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:20:57,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:20:57,912 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:20:57,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:20:57,917 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:20:57,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:20:57,919 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:20:57,921 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:20:58,978 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:20:58,978 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [94118843] [2021-05-03 00:20:58,979 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [94118843] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:20:58,979 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:20:58,979 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2021-05-03 00:20:58,979 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12278868] [2021-05-03 00:20:58,979 INFO L460 AbstractCegarLoop]: Interpolant automaton has 27 states [2021-05-03 00:20:58,979 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:20:58,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2021-05-03 00:20:58,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=709, Unknown=0, NotChecked=0, Total=812 [2021-05-03 00:20:58,980 INFO L87 Difference]: Start difference. First operand 383 states and 461 transitions. Second operand has 27 states, 27 states have (on average 2.3703703703703702) internal successors, (64), 26 states have internal predecessors, (64), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:21:01,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:21:01,274 INFO L93 Difference]: Finished difference Result 833 states and 977 transitions. [2021-05-03 00:21:01,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2021-05-03 00:21:01,276 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 2.3703703703703702) internal successors, (64), 26 states have internal predecessors, (64), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 70 [2021-05-03 00:21:01,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:21:01,277 INFO L225 Difference]: With dead ends: 833 [2021-05-03 00:21:01,277 INFO L226 Difference]: Without dead ends: 509 [2021-05-03 00:21:01,278 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 12 SyntacticMatches, 28 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 500 ImplicationChecksByTransitivity, 1152.1ms TimeCoverageRelationStatistics Valid=118, Invalid=812, Unknown=0, NotChecked=0, Total=930 [2021-05-03 00:21:01,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 509 states. [2021-05-03 00:21:02,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 509 to 383. [2021-05-03 00:21:02,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 383 states, 373 states have (on average 1.2064343163538873) internal successors, (450), 373 states have internal predecessors, (450), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:21:02,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 461 transitions. [2021-05-03 00:21:02,072 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 461 transitions. Word has length 70 [2021-05-03 00:21:02,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:21:02,072 INFO L480 AbstractCegarLoop]: Abstraction has 383 states and 461 transitions. [2021-05-03 00:21:02,072 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 27 states, 27 states have (on average 2.3703703703703702) internal successors, (64), 26 states have internal predecessors, (64), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:21:02,072 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 461 transitions. [2021-05-03 00:21:02,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-05-03 00:21:02,072 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:21:02,073 INFO L523 BasicCegarLoop]: trace histogram [16, 16, 12, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:21:02,073 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable626 [2021-05-03 00:21:02,073 INFO L428 AbstractCegarLoop]: === Iteration 146 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:21:02,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:21:02,073 INFO L82 PathProgramCache]: Analyzing trace with hash -1289914978, now seen corresponding path program 109 times [2021-05-03 00:21:02,073 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:21:02,073 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2037363750] [2021-05-03 00:21:02,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:21:02,081 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_~last~0_499 v_main_~c~0_2659) (< (+ v_main_~c~0_2659 1) v_~SIZE~0_494)) InVars {~SIZE~0=v_~SIZE~0_494, main_~c~0=v_main_~c~0_2659, ~last~0=v_~last~0_499} OutVars{~SIZE~0=v_~SIZE~0_494, main_~c~0=v_main_~c~0_2659, ~last~0=v_~last~0_499} AuxVars[] AssignedVars[] [2021-05-03 00:21:02,083 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size [2021-05-03 00:21:02,084 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:21:02,086 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:21:02,097 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:21:02,101 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:21:02,133 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size 78 [2021-05-03 00:21:02,157 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (+ v_main_~c~0_2661 1) v_~SIZE~0_495) (< v_main_~c~0_2661 v_~last~0_500)) InVars {~SIZE~0=v_~SIZE~0_495, main_~c~0=v_main_~c~0_2661, ~last~0=v_~last~0_500} OutVars{~SIZE~0=v_~SIZE~0_495, main_~c~0=v_main_~c~0_2661, ~last~0=v_~last~0_500} AuxVars[] AssignedVars[] [2021-05-03 00:21:02,158 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:21:02,173 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:21:02,175 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:21:02,189 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:21:02,194 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:21:02,216 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:21:02,239 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:21:02,241 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_~last~0_501 v_main_~c~0_2663) (< v_main_~c~0_2663 v_~SIZE~0_496)) InVars {~SIZE~0=v_~SIZE~0_496, main_~c~0=v_main_~c~0_2663, ~last~0=v_~last~0_501} OutVars{~SIZE~0=v_~SIZE~0_496, main_~c~0=v_main_~c~0_2663, ~last~0=v_~last~0_501} AuxVars[] AssignedVars[] [2021-05-03 00:21:02,243 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:21:02,262 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:21:02,264 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:21:02,278 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:21:02,281 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:21:02,300 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:21:02,334 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_2665 v_~SIZE~0_497) (< v_main_~c~0_2665 v_~last~0_502)) InVars {~SIZE~0=v_~SIZE~0_497, main_~c~0=v_main_~c~0_2665, ~last~0=v_~last~0_502} OutVars{~SIZE~0=v_~SIZE~0_497, main_~c~0=v_main_~c~0_2665, ~last~0=v_~last~0_502} AuxVars[] AssignedVars[] [2021-05-03 00:21:02,336 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size [2021-05-03 00:21:02,337 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:21:02,339 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:21:02,363 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:21:02,374 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:21:02,416 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size 66 [2021-05-03 00:21:02,449 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:21:02,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:21:02,541 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:21:02,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:21:02,545 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:21:02,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:21:02,548 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:21:02,551 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:21:03,932 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:21:03,933 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2037363750] [2021-05-03 00:21:03,933 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [2037363750] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:21:03,933 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:21:03,933 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2021-05-03 00:21:03,933 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1331869819] [2021-05-03 00:21:03,933 INFO L460 AbstractCegarLoop]: Interpolant automaton has 28 states [2021-05-03 00:21:03,933 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:21:03,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2021-05-03 00:21:03,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=708, Unknown=0, NotChecked=0, Total=812 [2021-05-03 00:21:03,934 INFO L87 Difference]: Start difference. First operand 383 states and 461 transitions. Second operand has 28 states, 28 states have (on average 2.2857142857142856) internal successors, (64), 27 states have internal predecessors, (64), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:21:06,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:21:06,769 INFO L93 Difference]: Finished difference Result 827 states and 975 transitions. [2021-05-03 00:21:06,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2021-05-03 00:21:06,770 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 2.2857142857142856) internal successors, (64), 27 states have internal predecessors, (64), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 70 [2021-05-03 00:21:06,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:21:06,771 INFO L225 Difference]: With dead ends: 827 [2021-05-03 00:21:06,771 INFO L226 Difference]: Without dead ends: 503 [2021-05-03 00:21:06,772 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 12 SyntacticMatches, 27 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 516 ImplicationChecksByTransitivity, 1424.1ms TimeCoverageRelationStatistics Valid=122, Invalid=808, Unknown=0, NotChecked=0, Total=930 [2021-05-03 00:21:06,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 503 states. [2021-05-03 00:21:07,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 503 to 383. [2021-05-03 00:21:07,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 383 states, 373 states have (on average 1.2064343163538873) internal successors, (450), 373 states have internal predecessors, (450), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:21:07,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 461 transitions. [2021-05-03 00:21:07,809 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 461 transitions. Word has length 70 [2021-05-03 00:21:07,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:21:07,809 INFO L480 AbstractCegarLoop]: Abstraction has 383 states and 461 transitions. [2021-05-03 00:21:07,809 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 28 states, 28 states have (on average 2.2857142857142856) internal successors, (64), 27 states have internal predecessors, (64), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:21:07,809 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 461 transitions. [2021-05-03 00:21:07,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-05-03 00:21:07,810 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:21:07,810 INFO L523 BasicCegarLoop]: trace histogram [16, 16, 11, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:21:07,810 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable631 [2021-05-03 00:21:07,810 INFO L428 AbstractCegarLoop]: === Iteration 147 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:21:07,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:21:07,810 INFO L82 PathProgramCache]: Analyzing trace with hash 955664476, now seen corresponding path program 110 times [2021-05-03 00:21:07,810 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:21:07,810 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1397213012] [2021-05-03 00:21:07,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:21:07,819 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (+ v_main_~c~0_2685 1) v_~SIZE~0_498) (<= v_~last~0_503 v_main_~c~0_2685)) InVars {~SIZE~0=v_~SIZE~0_498, main_~c~0=v_main_~c~0_2685, ~last~0=v_~last~0_503} OutVars{~SIZE~0=v_~SIZE~0_498, main_~c~0=v_main_~c~0_2685, ~last~0=v_~last~0_503} AuxVars[] AssignedVars[] [2021-05-03 00:21:07,822 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size [2021-05-03 00:21:07,843 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:21:07,846 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:21:07,862 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:21:07,866 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:21:07,888 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size 78 [2021-05-03 00:21:07,915 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_2687 v_~last~0_504) (< (+ v_main_~c~0_2687 1) v_~SIZE~0_499)) InVars {~SIZE~0=v_~SIZE~0_499, main_~c~0=v_main_~c~0_2687, ~last~0=v_~last~0_504} OutVars{~SIZE~0=v_~SIZE~0_499, main_~c~0=v_main_~c~0_2687, ~last~0=v_~last~0_504} AuxVars[] AssignedVars[] [2021-05-03 00:21:07,917 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:21:07,933 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:21:07,935 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:21:07,951 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:21:07,957 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:21:07,977 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:21:08,005 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:21:08,007 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_~last~0_505 v_main_~c~0_2689) (< v_main_~c~0_2689 v_~SIZE~0_500)) InVars {~SIZE~0=v_~SIZE~0_500, main_~c~0=v_main_~c~0_2689, ~last~0=v_~last~0_505} OutVars{~SIZE~0=v_~SIZE~0_500, main_~c~0=v_main_~c~0_2689, ~last~0=v_~last~0_505} AuxVars[] AssignedVars[] [2021-05-03 00:21:08,009 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:21:08,010 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:21:08,011 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:21:08,023 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:21:08,027 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:21:08,060 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:21:08,086 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_2691 v_~SIZE~0_501) (< v_main_~c~0_2691 v_~last~0_506)) InVars {~SIZE~0=v_~SIZE~0_501, main_~c~0=v_main_~c~0_2691, ~last~0=v_~last~0_506} OutVars{~SIZE~0=v_~SIZE~0_501, main_~c~0=v_main_~c~0_2691, ~last~0=v_~last~0_506} AuxVars[] AssignedVars[] [2021-05-03 00:21:08,088 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size [2021-05-03 00:21:08,089 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:21:08,090 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:21:08,106 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:21:08,113 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:21:08,142 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size 66 [2021-05-03 00:21:08,163 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:21:08,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:21:08,224 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:21:08,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:21:08,227 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:21:08,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:21:08,229 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:21:08,231 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:21:09,568 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:21:09,568 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1397213012] [2021-05-03 00:21:09,568 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1397213012] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:21:09,568 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:21:09,568 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2021-05-03 00:21:09,568 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1719229261] [2021-05-03 00:21:09,568 INFO L460 AbstractCegarLoop]: Interpolant automaton has 29 states [2021-05-03 00:21:09,568 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:21:09,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2021-05-03 00:21:09,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=758, Unknown=0, NotChecked=0, Total=870 [2021-05-03 00:21:09,569 INFO L87 Difference]: Start difference. First operand 383 states and 461 transitions. Second operand has 29 states, 29 states have (on average 2.206896551724138) internal successors, (64), 28 states have internal predecessors, (64), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:21:11,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:21:11,699 INFO L93 Difference]: Finished difference Result 818 states and 966 transitions. [2021-05-03 00:21:11,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2021-05-03 00:21:11,700 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 2.206896551724138) internal successors, (64), 28 states have internal predecessors, (64), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 70 [2021-05-03 00:21:11,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:21:11,701 INFO L225 Difference]: With dead ends: 818 [2021-05-03 00:21:11,701 INFO L226 Difference]: Without dead ends: 494 [2021-05-03 00:21:11,702 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 12 SyntacticMatches, 26 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 572 ImplicationChecksByTransitivity, 1362.0ms TimeCoverageRelationStatistics Valid=132, Invalid=860, Unknown=0, NotChecked=0, Total=992 [2021-05-03 00:21:11,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 494 states. [2021-05-03 00:21:12,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 494 to 383. [2021-05-03 00:21:12,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 383 states, 373 states have (on average 1.2064343163538873) internal successors, (450), 373 states have internal predecessors, (450), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:21:12,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 461 transitions. [2021-05-03 00:21:12,285 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 461 transitions. Word has length 70 [2021-05-03 00:21:12,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:21:12,285 INFO L480 AbstractCegarLoop]: Abstraction has 383 states and 461 transitions. [2021-05-03 00:21:12,286 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 29 states, 29 states have (on average 2.206896551724138) internal successors, (64), 28 states have internal predecessors, (64), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:21:12,286 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 461 transitions. [2021-05-03 00:21:12,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-05-03 00:21:12,286 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:21:12,286 INFO L523 BasicCegarLoop]: trace histogram [16, 16, 10, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:21:12,286 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable636 [2021-05-03 00:21:12,286 INFO L428 AbstractCegarLoop]: === Iteration 148 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:21:12,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:21:12,286 INFO L82 PathProgramCache]: Analyzing trace with hash 1379311198, now seen corresponding path program 111 times [2021-05-03 00:21:12,287 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:21:12,287 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1294216088] [2021-05-03 00:21:12,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:21:12,295 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_~last~0_507 v_main_~c~0_2711) (< (+ v_main_~c~0_2711 1) v_~SIZE~0_502)) InVars {~SIZE~0=v_~SIZE~0_502, main_~c~0=v_main_~c~0_2711, ~last~0=v_~last~0_507} OutVars{~SIZE~0=v_~SIZE~0_502, main_~c~0=v_main_~c~0_2711, ~last~0=v_~last~0_507} AuxVars[] AssignedVars[] [2021-05-03 00:21:12,296 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size [2021-05-03 00:21:12,297 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:21:12,299 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:21:12,310 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:21:12,313 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:21:12,352 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size 78 [2021-05-03 00:21:12,384 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (+ v_main_~c~0_2713 1) v_~SIZE~0_503) (< v_main_~c~0_2713 v_~last~0_508)) InVars {~SIZE~0=v_~SIZE~0_503, main_~c~0=v_main_~c~0_2713, ~last~0=v_~last~0_508} OutVars{~SIZE~0=v_~SIZE~0_503, main_~c~0=v_main_~c~0_2713, ~last~0=v_~last~0_508} AuxVars[] AssignedVars[] [2021-05-03 00:21:12,386 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:21:12,387 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:21:12,389 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:21:12,406 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:21:12,411 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:21:12,442 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:21:12,468 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:21:12,471 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_2715 v_~SIZE~0_504) (<= v_~last~0_509 v_main_~c~0_2715)) InVars {~SIZE~0=v_~SIZE~0_504, main_~c~0=v_main_~c~0_2715, ~last~0=v_~last~0_509} OutVars{~SIZE~0=v_~SIZE~0_504, main_~c~0=v_main_~c~0_2715, ~last~0=v_~last~0_509} AuxVars[] AssignedVars[] [2021-05-03 00:21:12,472 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:21:12,473 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:21:12,474 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:21:12,484 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:21:12,486 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:21:12,514 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:21:12,537 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_2717 v_~last~0_510) (< v_main_~c~0_2717 v_~SIZE~0_505)) InVars {~SIZE~0=v_~SIZE~0_505, main_~c~0=v_main_~c~0_2717, ~last~0=v_~last~0_510} OutVars{~SIZE~0=v_~SIZE~0_505, main_~c~0=v_main_~c~0_2717, ~last~0=v_~last~0_510} AuxVars[] AssignedVars[] [2021-05-03 00:21:12,538 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size [2021-05-03 00:21:12,550 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:21:12,551 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:21:12,563 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:21:12,567 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:21:12,579 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size 66 [2021-05-03 00:21:12,598 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:21:12,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:21:12,683 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:21:12,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:21:12,687 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:21:12,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:21:12,689 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:21:12,691 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:21:14,099 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:21:14,099 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1294216088] [2021-05-03 00:21:14,099 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1294216088] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:21:14,099 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:21:14,099 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [30] imperfect sequences [] total 30 [2021-05-03 00:21:14,100 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009215878] [2021-05-03 00:21:14,100 INFO L460 AbstractCegarLoop]: Interpolant automaton has 30 states [2021-05-03 00:21:14,100 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:21:14,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2021-05-03 00:21:14,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=810, Unknown=0, NotChecked=0, Total=930 [2021-05-03 00:21:14,100 INFO L87 Difference]: Start difference. First operand 383 states and 461 transitions. Second operand has 30 states, 30 states have (on average 2.1333333333333333) internal successors, (64), 29 states have internal predecessors, (64), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:21:16,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:21:16,937 INFO L93 Difference]: Finished difference Result 809 states and 957 transitions. [2021-05-03 00:21:16,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2021-05-03 00:21:16,939 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 2.1333333333333333) internal successors, (64), 29 states have internal predecessors, (64), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 70 [2021-05-03 00:21:16,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:21:16,940 INFO L225 Difference]: With dead ends: 809 [2021-05-03 00:21:16,940 INFO L226 Difference]: Without dead ends: 485 [2021-05-03 00:21:16,941 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 15 SyntacticMatches, 22 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 571 ImplicationChecksByTransitivity, 1436.0ms TimeCoverageRelationStatistics Valid=142, Invalid=914, Unknown=0, NotChecked=0, Total=1056 [2021-05-03 00:21:16,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 485 states. [2021-05-03 00:21:17,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 485 to 383. [2021-05-03 00:21:17,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 383 states, 373 states have (on average 1.2064343163538873) internal successors, (450), 373 states have internal predecessors, (450), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:21:17,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 461 transitions. [2021-05-03 00:21:17,810 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 461 transitions. Word has length 70 [2021-05-03 00:21:17,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:21:17,810 INFO L480 AbstractCegarLoop]: Abstraction has 383 states and 461 transitions. [2021-05-03 00:21:17,810 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 30 states, 30 states have (on average 2.1333333333333333) internal successors, (64), 29 states have internal predecessors, (64), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:21:17,810 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 461 transitions. [2021-05-03 00:21:17,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-05-03 00:21:17,811 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:21:17,811 INFO L523 BasicCegarLoop]: trace histogram [16, 16, 9, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:21:17,811 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable641 [2021-05-03 00:21:17,811 INFO L428 AbstractCegarLoop]: === Iteration 149 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:21:17,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:21:17,811 INFO L82 PathProgramCache]: Analyzing trace with hash 349951900, now seen corresponding path program 112 times [2021-05-03 00:21:17,812 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:21:17,812 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [15576911] [2021-05-03 00:21:17,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:21:17,822 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_~last~0_511 v_main_~c~0_2737) (< (+ v_main_~c~0_2737 1) v_~SIZE~0_506)) InVars {~SIZE~0=v_~SIZE~0_506, main_~c~0=v_main_~c~0_2737, ~last~0=v_~last~0_511} OutVars{~SIZE~0=v_~SIZE~0_506, main_~c~0=v_main_~c~0_2737, ~last~0=v_~last~0_511} AuxVars[] AssignedVars[] [2021-05-03 00:21:17,825 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size [2021-05-03 00:21:17,827 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:21:17,830 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:21:17,851 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:21:17,857 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:21:17,919 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size 78 [2021-05-03 00:21:17,964 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (+ v_main_~c~0_2739 1) v_~SIZE~0_507) (< v_main_~c~0_2739 v_~last~0_512)) InVars {~SIZE~0=v_~SIZE~0_507, main_~c~0=v_main_~c~0_2739, ~last~0=v_~last~0_512} OutVars{~SIZE~0=v_~SIZE~0_507, main_~c~0=v_main_~c~0_2739, ~last~0=v_~last~0_512} AuxVars[] AssignedVars[] [2021-05-03 00:21:17,966 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:21:17,967 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:21:17,970 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:21:17,998 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:21:18,008 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:21:18,058 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:21:18,103 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:21:18,107 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_2741 v_~SIZE~0_508) (<= v_~last~0_513 v_main_~c~0_2741)) InVars {~SIZE~0=v_~SIZE~0_508, main_~c~0=v_main_~c~0_2741, ~last~0=v_~last~0_513} OutVars{~SIZE~0=v_~SIZE~0_508, main_~c~0=v_main_~c~0_2741, ~last~0=v_~last~0_513} AuxVars[] AssignedVars[] [2021-05-03 00:21:18,110 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:21:18,140 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:21:18,143 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:21:18,158 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:21:18,162 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:21:18,181 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:21:18,207 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_2743 v_~last~0_514) (< v_main_~c~0_2743 v_~SIZE~0_509)) InVars {~SIZE~0=v_~SIZE~0_509, main_~c~0=v_main_~c~0_2743, ~last~0=v_~last~0_514} OutVars{~SIZE~0=v_~SIZE~0_509, main_~c~0=v_main_~c~0_2743, ~last~0=v_~last~0_514} AuxVars[] AssignedVars[] [2021-05-03 00:21:18,210 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size [2021-05-03 00:21:18,227 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:21:18,229 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:21:18,248 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:21:18,254 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:21:18,269 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size 66 [2021-05-03 00:21:18,295 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:21:18,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:21:18,384 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:21:18,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:21:18,389 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:21:18,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:21:18,391 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:21:18,394 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:21:19,986 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:21:19,987 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [15576911] [2021-05-03 00:21:19,987 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [15576911] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:21:19,987 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:21:19,987 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [31] imperfect sequences [] total 31 [2021-05-03 00:21:19,987 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1121726290] [2021-05-03 00:21:19,987 INFO L460 AbstractCegarLoop]: Interpolant automaton has 31 states [2021-05-03 00:21:19,987 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:21:19,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2021-05-03 00:21:19,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=921, Unknown=0, NotChecked=0, Total=1056 [2021-05-03 00:21:19,988 INFO L87 Difference]: Start difference. First operand 383 states and 461 transitions. Second operand has 31 states, 31 states have (on average 2.064516129032258) internal successors, (64), 30 states have internal predecessors, (64), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:21:22,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:21:22,949 INFO L93 Difference]: Finished difference Result 809 states and 953 transitions. [2021-05-03 00:21:22,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2021-05-03 00:21:22,952 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 2.064516129032258) internal successors, (64), 30 states have internal predecessors, (64), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 70 [2021-05-03 00:21:22,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:21:22,953 INFO L225 Difference]: With dead ends: 809 [2021-05-03 00:21:22,953 INFO L226 Difference]: Without dead ends: 485 [2021-05-03 00:21:22,954 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 12 SyntacticMatches, 24 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 702 ImplicationChecksByTransitivity, 1631.0ms TimeCoverageRelationStatistics Valid=158, Invalid=1032, Unknown=0, NotChecked=0, Total=1190 [2021-05-03 00:21:22,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 485 states. [2021-05-03 00:21:23,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 485 to 383. [2021-05-03 00:21:23,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 383 states, 373 states have (on average 1.2064343163538873) internal successors, (450), 373 states have internal predecessors, (450), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:21:23,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 461 transitions. [2021-05-03 00:21:23,778 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 461 transitions. Word has length 70 [2021-05-03 00:21:23,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:21:23,778 INFO L480 AbstractCegarLoop]: Abstraction has 383 states and 461 transitions. [2021-05-03 00:21:23,779 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 31 states, 31 states have (on average 2.064516129032258) internal successors, (64), 30 states have internal predecessors, (64), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:21:23,779 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 461 transitions. [2021-05-03 00:21:23,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-05-03 00:21:23,779 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:21:23,779 INFO L523 BasicCegarLoop]: trace histogram [16, 16, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:21:23,779 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable646 [2021-05-03 00:21:23,779 INFO L428 AbstractCegarLoop]: === Iteration 150 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:21:23,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:21:23,780 INFO L82 PathProgramCache]: Analyzing trace with hash -494053602, now seen corresponding path program 113 times [2021-05-03 00:21:23,780 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:21:23,780 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [902906351] [2021-05-03 00:21:23,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:21:23,789 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (+ v_main_~c~0_2763 1) v_~SIZE~0_510) (<= v_~last~0_515 v_main_~c~0_2763)) InVars {~SIZE~0=v_~SIZE~0_510, main_~c~0=v_main_~c~0_2763, ~last~0=v_~last~0_515} OutVars{~SIZE~0=v_~SIZE~0_510, main_~c~0=v_main_~c~0_2763, ~last~0=v_~last~0_515} AuxVars[] AssignedVars[] [2021-05-03 00:21:23,791 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size [2021-05-03 00:21:23,792 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:21:23,794 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:21:23,810 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:21:23,814 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:21:23,860 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size 78 [2021-05-03 00:21:23,893 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_2765 v_~last~0_516) (< (+ v_main_~c~0_2765 1) v_~SIZE~0_511)) InVars {~SIZE~0=v_~SIZE~0_511, main_~c~0=v_main_~c~0_2765, ~last~0=v_~last~0_516} OutVars{~SIZE~0=v_~SIZE~0_511, main_~c~0=v_main_~c~0_2765, ~last~0=v_~last~0_516} AuxVars[] AssignedVars[] [2021-05-03 00:21:23,896 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:21:23,918 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:21:23,921 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:21:23,944 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:21:23,951 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:21:23,975 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:21:24,009 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:21:24,011 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_~last~0_517 v_main_~c~0_2767) (< v_main_~c~0_2767 v_~SIZE~0_512)) InVars {~SIZE~0=v_~SIZE~0_512, main_~c~0=v_main_~c~0_2767, ~last~0=v_~last~0_517} OutVars{~SIZE~0=v_~SIZE~0_512, main_~c~0=v_main_~c~0_2767, ~last~0=v_~last~0_517} AuxVars[] AssignedVars[] [2021-05-03 00:21:24,013 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:21:24,014 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:21:24,015 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:21:24,029 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:21:24,033 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:21:24,085 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:21:24,119 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_2769 v_~SIZE~0_513) (< v_main_~c~0_2769 v_~last~0_518)) InVars {~SIZE~0=v_~SIZE~0_513, main_~c~0=v_main_~c~0_2769, ~last~0=v_~last~0_518} OutVars{~SIZE~0=v_~SIZE~0_513, main_~c~0=v_main_~c~0_2769, ~last~0=v_~last~0_518} AuxVars[] AssignedVars[] [2021-05-03 00:21:24,121 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size [2021-05-03 00:21:24,123 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:21:24,125 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:21:24,146 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:21:24,153 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:21:24,198 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size 66 [2021-05-03 00:21:24,231 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:21:24,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:21:24,319 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:21:24,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:21:24,324 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:21:24,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:21:24,327 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:21:24,331 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:21:25,656 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:21:25,657 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [902906351] [2021-05-03 00:21:25,657 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [902906351] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:21:25,657 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:21:25,657 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [32] imperfect sequences [] total 32 [2021-05-03 00:21:25,657 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [978133375] [2021-05-03 00:21:25,657 INFO L460 AbstractCegarLoop]: Interpolant automaton has 32 states [2021-05-03 00:21:25,657 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:21:25,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2021-05-03 00:21:25,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=920, Unknown=0, NotChecked=0, Total=1056 [2021-05-03 00:21:25,658 INFO L87 Difference]: Start difference. First operand 383 states and 461 transitions. Second operand has 32 states, 32 states have (on average 2.0) internal successors, (64), 31 states have internal predecessors, (64), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:21:27,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:21:27,878 INFO L93 Difference]: Finished difference Result 791 states and 939 transitions. [2021-05-03 00:21:27,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2021-05-03 00:21:27,880 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 2.0) internal successors, (64), 31 states have internal predecessors, (64), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 70 [2021-05-03 00:21:27,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:21:27,882 INFO L225 Difference]: With dead ends: 791 [2021-05-03 00:21:27,882 INFO L226 Difference]: Without dead ends: 467 [2021-05-03 00:21:27,883 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 12 SyntacticMatches, 23 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 686 ImplicationChecksByTransitivity, 1346.5ms TimeCoverageRelationStatistics Valid=162, Invalid=1028, Unknown=0, NotChecked=0, Total=1190 [2021-05-03 00:21:27,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 467 states. [2021-05-03 00:21:28,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 467 to 383. [2021-05-03 00:21:28,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 383 states, 373 states have (on average 1.2064343163538873) internal successors, (450), 373 states have internal predecessors, (450), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:21:28,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 461 transitions. [2021-05-03 00:21:28,971 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 461 transitions. Word has length 70 [2021-05-03 00:21:28,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:21:28,971 INFO L480 AbstractCegarLoop]: Abstraction has 383 states and 461 transitions. [2021-05-03 00:21:28,972 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 32 states, 32 states have (on average 2.0) internal successors, (64), 31 states have internal predecessors, (64), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:21:28,972 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 461 transitions. [2021-05-03 00:21:28,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-05-03 00:21:28,972 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:21:28,972 INFO L523 BasicCegarLoop]: trace histogram [16, 16, 9, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:21:28,972 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable651 [2021-05-03 00:21:28,972 INFO L428 AbstractCegarLoop]: === Iteration 151 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:21:28,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:21:28,973 INFO L82 PathProgramCache]: Analyzing trace with hash -219293988, now seen corresponding path program 114 times [2021-05-03 00:21:28,973 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:21:28,973 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [174057313] [2021-05-03 00:21:28,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:21:28,985 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_~last~0_519 v_main_~c~0_2789) (< (+ v_main_~c~0_2789 1) v_~SIZE~0_514)) InVars {~SIZE~0=v_~SIZE~0_514, main_~c~0=v_main_~c~0_2789, ~last~0=v_~last~0_519} OutVars{~SIZE~0=v_~SIZE~0_514, main_~c~0=v_main_~c~0_2789, ~last~0=v_~last~0_519} AuxVars[] AssignedVars[] [2021-05-03 00:21:28,988 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size [2021-05-03 00:21:29,026 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:21:29,029 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:21:29,050 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:21:29,055 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:21:29,088 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size 78 [2021-05-03 00:21:29,140 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (+ v_main_~c~0_2791 1) v_~SIZE~0_515) (< v_main_~c~0_2791 v_~last~0_520)) InVars {~SIZE~0=v_~SIZE~0_515, main_~c~0=v_main_~c~0_2791, ~last~0=v_~last~0_520} OutVars{~SIZE~0=v_~SIZE~0_515, main_~c~0=v_main_~c~0_2791, ~last~0=v_~last~0_520} AuxVars[] AssignedVars[] [2021-05-03 00:21:29,142 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:21:29,174 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:21:29,178 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:21:29,215 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:21:29,227 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:21:29,266 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:21:29,332 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:21:29,340 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_~last~0_521 v_main_~c~0_2793) (< v_main_~c~0_2793 v_~SIZE~0_516)) InVars {~SIZE~0=v_~SIZE~0_516, main_~c~0=v_main_~c~0_2793, ~last~0=v_~last~0_521} OutVars{~SIZE~0=v_~SIZE~0_516, main_~c~0=v_main_~c~0_2793, ~last~0=v_~last~0_521} AuxVars[] AssignedVars[] [2021-05-03 00:21:29,343 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:21:29,345 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:21:29,349 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:21:29,372 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:21:29,378 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:21:29,442 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:21:29,498 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_2795 v_~last~0_522) (< v_main_~c~0_2795 v_~SIZE~0_517)) InVars {~SIZE~0=v_~SIZE~0_517, main_~c~0=v_main_~c~0_2795, ~last~0=v_~last~0_522} OutVars{~SIZE~0=v_~SIZE~0_517, main_~c~0=v_main_~c~0_2795, ~last~0=v_~last~0_522} AuxVars[] AssignedVars[] [2021-05-03 00:21:29,501 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size [2021-05-03 00:21:29,503 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:21:29,507 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:21:29,540 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:21:29,553 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:21:29,618 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size 66 [2021-05-03 00:21:29,673 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:21:29,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:21:29,754 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:21:29,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:21:29,758 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:21:29,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:21:29,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-03 00:21:29,763 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:21:30,749 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:21:30,750 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [174057313] [2021-05-03 00:21:30,750 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [174057313] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:21:30,750 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:21:30,750 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [33] imperfect sequences [] total 33 [2021-05-03 00:21:30,750 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2099273691] [2021-05-03 00:21:30,750 INFO L460 AbstractCegarLoop]: Interpolant automaton has 33 states [2021-05-03 00:21:30,750 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:21:30,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2021-05-03 00:21:30,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=1039, Unknown=0, NotChecked=0, Total=1190 [2021-05-03 00:21:30,751 INFO L87 Difference]: Start difference. First operand 383 states and 461 transitions. Second operand has 33 states, 33 states have (on average 1.9393939393939394) internal successors, (64), 32 states have internal predecessors, (64), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:21:32,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:21:32,812 INFO L93 Difference]: Finished difference Result 797 states and 941 transitions. [2021-05-03 00:21:32,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2021-05-03 00:21:32,814 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 1.9393939393939394) internal successors, (64), 32 states have internal predecessors, (64), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 70 [2021-05-03 00:21:32,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:21:32,815 INFO L225 Difference]: With dead ends: 797 [2021-05-03 00:21:32,815 INFO L226 Difference]: Without dead ends: 473 [2021-05-03 00:21:32,821 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 12 SyntacticMatches, 22 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 749 ImplicationChecksByTransitivity, 1034.5ms TimeCoverageRelationStatistics Valid=178, Invalid=1154, Unknown=0, NotChecked=0, Total=1332 [2021-05-03 00:21:32,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 473 states. [2021-05-03 00:21:33,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 473 to 383. [2021-05-03 00:21:33,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 383 states, 373 states have (on average 1.2064343163538873) internal successors, (450), 373 states have internal predecessors, (450), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:21:33,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 461 transitions. [2021-05-03 00:21:33,453 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 461 transitions. Word has length 70 [2021-05-03 00:21:33,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:21:33,453 INFO L480 AbstractCegarLoop]: Abstraction has 383 states and 461 transitions. [2021-05-03 00:21:33,453 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 33 states, 33 states have (on average 1.9393939393939394) internal successors, (64), 32 states have internal predecessors, (64), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:21:33,453 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 461 transitions. [2021-05-03 00:21:33,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-05-03 00:21:33,454 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:21:33,454 INFO L523 BasicCegarLoop]: trace histogram [16, 16, 10, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:21:33,454 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable656 [2021-05-03 00:21:33,454 INFO L428 AbstractCegarLoop]: === Iteration 152 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:21:33,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:21:33,454 INFO L82 PathProgramCache]: Analyzing trace with hash 1166909406, now seen corresponding path program 115 times [2021-05-03 00:21:33,454 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:21:33,454 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1484620725] [2021-05-03 00:21:33,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:21:33,461 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (+ v_main_~c~0_2815 1) v_~SIZE~0_518) (<= v_~last~0_523 v_main_~c~0_2815)) InVars {~SIZE~0=v_~SIZE~0_518, main_~c~0=v_main_~c~0_2815, ~last~0=v_~last~0_523} OutVars{~SIZE~0=v_~SIZE~0_518, main_~c~0=v_main_~c~0_2815, ~last~0=v_~last~0_523} AuxVars[] AssignedVars[] [2021-05-03 00:21:33,463 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size [2021-05-03 00:21:33,464 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:21:33,465 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:21:33,486 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:21:33,490 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:21:33,522 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size 78 [2021-05-03 00:21:33,545 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_2817 v_~last~0_524) (< (+ v_main_~c~0_2817 1) v_~SIZE~0_519)) InVars {~SIZE~0=v_~SIZE~0_519, main_~c~0=v_main_~c~0_2817, ~last~0=v_~last~0_524} OutVars{~SIZE~0=v_~SIZE~0_519, main_~c~0=v_main_~c~0_2817, ~last~0=v_~last~0_524} AuxVars[] AssignedVars[] [2021-05-03 00:21:33,547 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:21:33,548 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:21:33,549 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:21:33,564 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:21:33,570 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:21:33,597 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:21:33,621 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:21:33,624 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_2819 v_~SIZE~0_520) (<= v_~last~0_525 v_main_~c~0_2819)) InVars {~SIZE~0=v_~SIZE~0_520, main_~c~0=v_main_~c~0_2819, ~last~0=v_~last~0_525} OutVars{~SIZE~0=v_~SIZE~0_520, main_~c~0=v_main_~c~0_2819, ~last~0=v_~last~0_525} AuxVars[] AssignedVars[] [2021-05-03 00:21:33,625 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:21:33,626 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:21:33,627 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:21:33,639 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:21:33,642 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:21:33,673 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:21:33,696 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_2821 v_~SIZE~0_521) (< v_main_~c~0_2821 v_~last~0_526)) InVars {~SIZE~0=v_~SIZE~0_521, main_~c~0=v_main_~c~0_2821, ~last~0=v_~last~0_526} OutVars{~SIZE~0=v_~SIZE~0_521, main_~c~0=v_main_~c~0_2821, ~last~0=v_~last~0_526} AuxVars[] AssignedVars[] [2021-05-03 00:21:33,697 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size [2021-05-03 00:21:33,711 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:21:33,712 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:21:33,728 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:21:33,733 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:21:33,748 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size 66 [2021-05-03 00:21:33,771 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:21:33,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:21:33,871 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:21:33,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:21:33,875 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:21:33,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:21:33,876 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:21:33,879 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:21:35,006 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:21:35,007 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1484620725] [2021-05-03 00:21:35,007 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1484620725] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:21:35,007 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:21:35,007 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [34] imperfect sequences [] total 34 [2021-05-03 00:21:35,007 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [828160891] [2021-05-03 00:21:35,007 INFO L460 AbstractCegarLoop]: Interpolant automaton has 34 states [2021-05-03 00:21:35,007 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:21:35,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2021-05-03 00:21:35,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=152, Invalid=1038, Unknown=0, NotChecked=0, Total=1190 [2021-05-03 00:21:35,008 INFO L87 Difference]: Start difference. First operand 383 states and 461 transitions. Second operand has 34 states, 34 states have (on average 1.8823529411764706) internal successors, (64), 33 states have internal predecessors, (64), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:21:37,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:21:37,228 INFO L93 Difference]: Finished difference Result 773 states and 921 transitions. [2021-05-03 00:21:37,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2021-05-03 00:21:37,228 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 1.8823529411764706) internal successors, (64), 33 states have internal predecessors, (64), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 70 [2021-05-03 00:21:37,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:21:37,230 INFO L225 Difference]: With dead ends: 773 [2021-05-03 00:21:37,230 INFO L226 Difference]: Without dead ends: 449 [2021-05-03 00:21:37,230 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 12 SyntacticMatches, 21 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 717 ImplicationChecksByTransitivity, 1166.5ms TimeCoverageRelationStatistics Valid=182, Invalid=1150, Unknown=0, NotChecked=0, Total=1332 [2021-05-03 00:21:37,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 449 states. [2021-05-03 00:21:37,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 449 to 383. [2021-05-03 00:21:37,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 383 states, 373 states have (on average 1.2064343163538873) internal successors, (450), 373 states have internal predecessors, (450), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:21:37,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 461 transitions. [2021-05-03 00:21:37,912 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 461 transitions. Word has length 70 [2021-05-03 00:21:37,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:21:37,912 INFO L480 AbstractCegarLoop]: Abstraction has 383 states and 461 transitions. [2021-05-03 00:21:37,912 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 34 states, 34 states have (on average 1.8823529411764706) internal successors, (64), 33 states have internal predecessors, (64), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:21:37,913 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 461 transitions. [2021-05-03 00:21:37,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-05-03 00:21:37,913 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:21:37,913 INFO L523 BasicCegarLoop]: trace histogram [16, 16, 11, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:21:37,913 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable661 [2021-05-03 00:21:37,913 INFO L428 AbstractCegarLoop]: === Iteration 153 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:21:37,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:21:37,913 INFO L82 PathProgramCache]: Analyzing trace with hash 1228949020, now seen corresponding path program 116 times [2021-05-03 00:21:37,914 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:21:37,914 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [268937722] [2021-05-03 00:21:37,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:21:37,926 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (+ v_main_~c~0_2841 1) v_~SIZE~0_522) (<= v_~last~0_527 v_main_~c~0_2841)) InVars {~SIZE~0=v_~SIZE~0_522, main_~c~0=v_main_~c~0_2841, ~last~0=v_~last~0_527} OutVars{~SIZE~0=v_~SIZE~0_522, main_~c~0=v_main_~c~0_2841, ~last~0=v_~last~0_527} AuxVars[] AssignedVars[] [2021-05-03 00:21:37,928 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size [2021-05-03 00:21:37,950 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:21:37,952 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:21:37,964 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:21:37,967 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:21:37,987 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size 78 [2021-05-03 00:21:38,017 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (+ v_main_~c~0_2843 1) v_~SIZE~0_523) (< v_main_~c~0_2843 v_~last~0_528)) InVars {~SIZE~0=v_~SIZE~0_523, main_~c~0=v_main_~c~0_2843, ~last~0=v_~last~0_528} OutVars{~SIZE~0=v_~SIZE~0_523, main_~c~0=v_main_~c~0_2843, ~last~0=v_~last~0_528} AuxVars[] AssignedVars[] [2021-05-03 00:21:38,019 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:21:38,034 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:21:38,036 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:21:38,052 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:21:38,059 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:21:38,077 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:21:38,103 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:21:38,106 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_2845 v_~SIZE~0_524) (<= v_~last~0_529 v_main_~c~0_2845)) InVars {~SIZE~0=v_~SIZE~0_524, main_~c~0=v_main_~c~0_2845, ~last~0=v_~last~0_529} OutVars{~SIZE~0=v_~SIZE~0_524, main_~c~0=v_main_~c~0_2845, ~last~0=v_~last~0_529} AuxVars[] AssignedVars[] [2021-05-03 00:21:38,109 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:21:38,110 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:21:38,111 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:21:38,128 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:21:38,131 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:21:38,170 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:21:38,198 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_2847 v_~last~0_530) (< v_main_~c~0_2847 v_~SIZE~0_525)) InVars {~SIZE~0=v_~SIZE~0_525, main_~c~0=v_main_~c~0_2847, ~last~0=v_~last~0_530} OutVars{~SIZE~0=v_~SIZE~0_525, main_~c~0=v_main_~c~0_2847, ~last~0=v_~last~0_530} AuxVars[] AssignedVars[] [2021-05-03 00:21:38,200 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size [2021-05-03 00:21:38,216 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:21:38,218 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:21:38,235 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:21:38,243 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:21:38,263 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size 66 [2021-05-03 00:21:38,288 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:21:38,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:21:38,371 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:21:38,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:21:38,375 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:21:38,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:21:38,376 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:21:38,379 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:21:39,544 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:21:39,544 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [268937722] [2021-05-03 00:21:39,545 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [268937722] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:21:39,545 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:21:39,545 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [35] imperfect sequences [] total 35 [2021-05-03 00:21:39,545 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1687449482] [2021-05-03 00:21:39,545 INFO L460 AbstractCegarLoop]: Interpolant automaton has 35 states [2021-05-03 00:21:39,545 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:21:39,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2021-05-03 00:21:39,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=167, Invalid=1165, Unknown=0, NotChecked=0, Total=1332 [2021-05-03 00:21:39,546 INFO L87 Difference]: Start difference. First operand 383 states and 461 transitions. Second operand has 35 states, 35 states have (on average 1.8285714285714285) internal successors, (64), 34 states have internal predecessors, (64), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:21:41,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:21:41,655 INFO L93 Difference]: Finished difference Result 785 states and 929 transitions. [2021-05-03 00:21:41,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2021-05-03 00:21:41,656 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 1.8285714285714285) internal successors, (64), 34 states have internal predecessors, (64), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 70 [2021-05-03 00:21:41,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:21:41,657 INFO L225 Difference]: With dead ends: 785 [2021-05-03 00:21:41,657 INFO L226 Difference]: Without dead ends: 461 [2021-05-03 00:21:41,658 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 12 SyntacticMatches, 20 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 760 ImplicationChecksByTransitivity, 1215.4ms TimeCoverageRelationStatistics Valid=198, Invalid=1284, Unknown=0, NotChecked=0, Total=1482 [2021-05-03 00:21:41,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 461 states. [2021-05-03 00:21:42,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 461 to 383. [2021-05-03 00:21:42,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 383 states, 373 states have (on average 1.2064343163538873) internal successors, (450), 373 states have internal predecessors, (450), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:21:42,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 461 transitions. [2021-05-03 00:21:42,345 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 461 transitions. Word has length 70 [2021-05-03 00:21:42,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:21:42,345 INFO L480 AbstractCegarLoop]: Abstraction has 383 states and 461 transitions. [2021-05-03 00:21:42,345 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 35 states, 35 states have (on average 1.8285714285714285) internal successors, (64), 34 states have internal predecessors, (64), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:21:42,345 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 461 transitions. [2021-05-03 00:21:42,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-05-03 00:21:42,345 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:21:42,346 INFO L523 BasicCegarLoop]: trace histogram [16, 16, 12, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:21:42,346 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable666 [2021-05-03 00:21:42,346 INFO L428 AbstractCegarLoop]: === Iteration 154 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:21:42,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:21:42,346 INFO L82 PathProgramCache]: Analyzing trace with hash -576489314, now seen corresponding path program 117 times [2021-05-03 00:21:42,346 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:21:42,346 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1983263719] [2021-05-03 00:21:42,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:21:42,354 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_~last~0_531 v_main_~c~0_2867) (< (+ v_main_~c~0_2867 1) v_~SIZE~0_526)) InVars {~SIZE~0=v_~SIZE~0_526, main_~c~0=v_main_~c~0_2867, ~last~0=v_~last~0_531} OutVars{~SIZE~0=v_~SIZE~0_526, main_~c~0=v_main_~c~0_2867, ~last~0=v_~last~0_531} AuxVars[] AssignedVars[] [2021-05-03 00:21:42,355 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size [2021-05-03 00:21:42,356 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:21:42,358 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:21:42,371 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:21:42,374 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:21:42,408 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size 78 [2021-05-03 00:21:42,436 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_2869 v_~last~0_532) (< (+ v_main_~c~0_2869 1) v_~SIZE~0_527)) InVars {~SIZE~0=v_~SIZE~0_527, main_~c~0=v_main_~c~0_2869, ~last~0=v_~last~0_532} OutVars{~SIZE~0=v_~SIZE~0_527, main_~c~0=v_main_~c~0_2869, ~last~0=v_~last~0_532} AuxVars[] AssignedVars[] [2021-05-03 00:21:42,438 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:21:42,453 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:21:42,454 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:21:42,468 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:21:42,474 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:21:42,490 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:21:42,513 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:21:42,516 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_2871 v_~SIZE~0_528) (<= v_~last~0_533 v_main_~c~0_2871)) InVars {~SIZE~0=v_~SIZE~0_528, main_~c~0=v_main_~c~0_2871, ~last~0=v_~last~0_533} OutVars{~SIZE~0=v_~SIZE~0_528, main_~c~0=v_main_~c~0_2871, ~last~0=v_~last~0_533} AuxVars[] AssignedVars[] [2021-05-03 00:21:42,518 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:21:42,537 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:21:42,539 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:21:42,552 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:21:42,555 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:21:42,573 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:21:42,596 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_2873 v_~last~0_534) (< v_main_~c~0_2873 v_~SIZE~0_529)) InVars {~SIZE~0=v_~SIZE~0_529, main_~c~0=v_main_~c~0_2873, ~last~0=v_~last~0_534} OutVars{~SIZE~0=v_~SIZE~0_529, main_~c~0=v_main_~c~0_2873, ~last~0=v_~last~0_534} AuxVars[] AssignedVars[] [2021-05-03 00:21:42,597 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size [2021-05-03 00:21:42,612 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:21:42,613 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:21:42,628 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:21:42,633 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:21:42,649 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size 66 [2021-05-03 00:21:42,672 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:21:42,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:21:42,743 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:21:42,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:21:42,747 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:21:42,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:21:42,748 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:21:42,750 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:21:43,922 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:21:43,922 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1983263719] [2021-05-03 00:21:43,922 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1983263719] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:21:43,922 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:21:43,922 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [36] imperfect sequences [] total 36 [2021-05-03 00:21:43,922 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1423442441] [2021-05-03 00:21:43,922 INFO L460 AbstractCegarLoop]: Interpolant automaton has 36 states [2021-05-03 00:21:43,923 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:21:43,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2021-05-03 00:21:43,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=1231, Unknown=0, NotChecked=0, Total=1406 [2021-05-03 00:21:43,923 INFO L87 Difference]: Start difference. First operand 383 states and 461 transitions. Second operand has 36 states, 36 states have (on average 1.7777777777777777) internal successors, (64), 35 states have internal predecessors, (64), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:21:45,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:21:45,980 INFO L93 Difference]: Finished difference Result 779 states and 923 transitions. [2021-05-03 00:21:45,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2021-05-03 00:21:45,981 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 1.7777777777777777) internal successors, (64), 35 states have internal predecessors, (64), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 70 [2021-05-03 00:21:45,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:21:45,982 INFO L225 Difference]: With dead ends: 779 [2021-05-03 00:21:45,982 INFO L226 Difference]: Without dead ends: 455 [2021-05-03 00:21:45,983 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 14 SyntacticMatches, 17 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 694 ImplicationChecksByTransitivity, 1213.2ms TimeCoverageRelationStatistics Valid=208, Invalid=1352, Unknown=0, NotChecked=0, Total=1560 [2021-05-03 00:21:45,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 455 states. [2021-05-03 00:21:46,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 455 to 383. [2021-05-03 00:21:46,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 383 states, 373 states have (on average 1.2064343163538873) internal successors, (450), 373 states have internal predecessors, (450), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:21:46,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 461 transitions. [2021-05-03 00:21:46,749 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 461 transitions. Word has length 70 [2021-05-03 00:21:46,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:21:46,749 INFO L480 AbstractCegarLoop]: Abstraction has 383 states and 461 transitions. [2021-05-03 00:21:46,749 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 36 states, 36 states have (on average 1.7777777777777777) internal successors, (64), 35 states have internal predecessors, (64), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:21:46,749 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 461 transitions. [2021-05-03 00:21:46,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-05-03 00:21:46,749 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:21:46,749 INFO L523 BasicCegarLoop]: trace histogram [16, 16, 13, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:21:46,749 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable671 [2021-05-03 00:21:46,750 INFO L428 AbstractCegarLoop]: === Iteration 155 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:21:46,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:21:46,750 INFO L82 PathProgramCache]: Analyzing trace with hash -1394137764, now seen corresponding path program 118 times [2021-05-03 00:21:46,750 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:21:46,750 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1403670655] [2021-05-03 00:21:46,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:21:46,757 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_~last~0_535 v_main_~c~0_2893) (< (+ v_main_~c~0_2893 1) v_~SIZE~0_530)) InVars {~SIZE~0=v_~SIZE~0_530, main_~c~0=v_main_~c~0_2893, ~last~0=v_~last~0_535} OutVars{~SIZE~0=v_~SIZE~0_530, main_~c~0=v_main_~c~0_2893, ~last~0=v_~last~0_535} AuxVars[] AssignedVars[] [2021-05-03 00:21:46,758 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size [2021-05-03 00:21:46,759 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:21:46,760 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:21:46,771 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:21:46,774 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:21:46,802 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size 78 [2021-05-03 00:21:46,822 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_2895 v_~last~0_536) (< (+ v_main_~c~0_2895 1) v_~SIZE~0_531)) InVars {~SIZE~0=v_~SIZE~0_531, main_~c~0=v_main_~c~0_2895, ~last~0=v_~last~0_536} OutVars{~SIZE~0=v_~SIZE~0_531, main_~c~0=v_main_~c~0_2895, ~last~0=v_~last~0_536} AuxVars[] AssignedVars[] [2021-05-03 00:21:46,824 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:21:46,836 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:21:46,837 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:21:46,849 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:21:46,854 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:21:46,868 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:21:46,887 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:21:46,889 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_2897 v_~SIZE~0_532) (<= v_~last~0_537 v_main_~c~0_2897)) InVars {~SIZE~0=v_~SIZE~0_532, main_~c~0=v_main_~c~0_2897, ~last~0=v_~last~0_537} OutVars{~SIZE~0=v_~SIZE~0_532, main_~c~0=v_main_~c~0_2897, ~last~0=v_~last~0_537} AuxVars[] AssignedVars[] [2021-05-03 00:21:46,890 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:21:46,891 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:21:46,892 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:21:46,902 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:21:46,905 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:21:46,932 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:21:46,953 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_2899 v_~last~0_538) (< v_main_~c~0_2899 v_~SIZE~0_533)) InVars {~SIZE~0=v_~SIZE~0_533, main_~c~0=v_main_~c~0_2899, ~last~0=v_~last~0_538} OutVars{~SIZE~0=v_~SIZE~0_533, main_~c~0=v_main_~c~0_2899, ~last~0=v_~last~0_538} AuxVars[] AssignedVars[] [2021-05-03 00:21:46,959 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size [2021-05-03 00:21:46,959 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:21:46,961 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:21:46,973 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:21:46,977 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:21:47,000 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size 66 [2021-05-03 00:21:47,019 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:21:47,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:21:47,116 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:21:47,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:21:47,120 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:21:47,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:21:47,122 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:21:47,124 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:21:48,293 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:21:48,294 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1403670655] [2021-05-03 00:21:48,294 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1403670655] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:21:48,294 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:21:48,294 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [37] imperfect sequences [] total 37 [2021-05-03 00:21:48,294 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [725401528] [2021-05-03 00:21:48,294 INFO L460 AbstractCegarLoop]: Interpolant automaton has 37 states [2021-05-03 00:21:48,294 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:21:48,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2021-05-03 00:21:48,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=183, Invalid=1299, Unknown=0, NotChecked=0, Total=1482 [2021-05-03 00:21:48,295 INFO L87 Difference]: Start difference. First operand 383 states and 461 transitions. Second operand has 37 states, 37 states have (on average 1.7297297297297298) internal successors, (64), 36 states have internal predecessors, (64), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:21:50,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:21:50,247 INFO L93 Difference]: Finished difference Result 773 states and 917 transitions. [2021-05-03 00:21:50,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2021-05-03 00:21:50,249 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 1.7297297297297298) internal successors, (64), 36 states have internal predecessors, (64), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 70 [2021-05-03 00:21:50,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:21:50,249 INFO L225 Difference]: With dead ends: 773 [2021-05-03 00:21:50,249 INFO L226 Difference]: Without dead ends: 449 [2021-05-03 00:21:50,250 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 12 SyntacticMatches, 18 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 735 ImplicationChecksByTransitivity, 1207.4ms TimeCoverageRelationStatistics Valid=218, Invalid=1422, Unknown=0, NotChecked=0, Total=1640 [2021-05-03 00:21:50,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 449 states. [2021-05-03 00:21:50,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 449 to 383. [2021-05-03 00:21:50,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 383 states, 373 states have (on average 1.2064343163538873) internal successors, (450), 373 states have internal predecessors, (450), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:21:50,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 461 transitions. [2021-05-03 00:21:50,884 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 461 transitions. Word has length 70 [2021-05-03 00:21:50,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:21:50,885 INFO L480 AbstractCegarLoop]: Abstraction has 383 states and 461 transitions. [2021-05-03 00:21:50,885 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 37 states, 37 states have (on average 1.7297297297297298) internal successors, (64), 36 states have internal predecessors, (64), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:21:50,885 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 461 transitions. [2021-05-03 00:21:50,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-05-03 00:21:50,885 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:21:50,885 INFO L523 BasicCegarLoop]: trace histogram [16, 16, 14, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:21:50,885 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable676 [2021-05-03 00:21:50,885 INFO L428 AbstractCegarLoop]: === Iteration 156 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:21:50,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:21:50,886 INFO L82 PathProgramCache]: Analyzing trace with hash 1312481630, now seen corresponding path program 119 times [2021-05-03 00:21:50,886 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:21:50,886 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [281333055] [2021-05-03 00:21:50,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:21:50,892 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (+ v_main_~c~0_2919 1) v_~SIZE~0_534) (<= v_~last~0_539 v_main_~c~0_2919)) InVars {~SIZE~0=v_~SIZE~0_534, main_~c~0=v_main_~c~0_2919, ~last~0=v_~last~0_539} OutVars{~SIZE~0=v_~SIZE~0_534, main_~c~0=v_main_~c~0_2919, ~last~0=v_~last~0_539} AuxVars[] AssignedVars[] [2021-05-03 00:21:50,893 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size [2021-05-03 00:21:50,908 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:21:50,910 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:21:50,920 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:21:50,922 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:21:50,939 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size 78 [2021-05-03 00:21:50,961 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (+ v_main_~c~0_2921 1) v_~SIZE~0_535) (< v_main_~c~0_2921 v_~last~0_540)) InVars {~SIZE~0=v_~SIZE~0_535, main_~c~0=v_main_~c~0_2921, ~last~0=v_~last~0_540} OutVars{~SIZE~0=v_~SIZE~0_535, main_~c~0=v_main_~c~0_2921, ~last~0=v_~last~0_540} AuxVars[] AssignedVars[] [2021-05-03 00:21:50,962 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:21:50,975 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:21:50,976 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:21:50,988 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:21:50,992 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:21:51,006 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:21:51,026 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:21:51,028 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_~last~0_541 v_main_~c~0_2923) (< v_main_~c~0_2923 v_~SIZE~0_536)) InVars {~SIZE~0=v_~SIZE~0_536, main_~c~0=v_main_~c~0_2923, ~last~0=v_~last~0_541} OutVars{~SIZE~0=v_~SIZE~0_536, main_~c~0=v_main_~c~0_2923, ~last~0=v_~last~0_541} AuxVars[] AssignedVars[] [2021-05-03 00:21:51,030 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:21:51,030 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:21:51,032 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:21:51,043 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:21:51,046 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:21:51,073 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:21:51,098 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_2925 v_~last~0_542) (< v_main_~c~0_2925 v_~SIZE~0_537)) InVars {~SIZE~0=v_~SIZE~0_537, main_~c~0=v_main_~c~0_2925, ~last~0=v_~last~0_542} OutVars{~SIZE~0=v_~SIZE~0_537, main_~c~0=v_main_~c~0_2925, ~last~0=v_~last~0_542} AuxVars[] AssignedVars[] [2021-05-03 00:21:51,100 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size [2021-05-03 00:21:51,101 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:21:51,102 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:21:51,115 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:21:51,120 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:21:51,145 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size 66 [2021-05-03 00:21:51,167 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:21:51,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:21:51,224 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:21:51,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:21:51,228 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:21:51,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:21:51,230 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:21:51,232 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:21:52,387 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:21:52,388 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [281333055] [2021-05-03 00:21:52,388 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [281333055] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:21:52,388 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:21:52,388 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [38] imperfect sequences [] total 38 [2021-05-03 00:21:52,388 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990862202] [2021-05-03 00:21:52,388 INFO L460 AbstractCegarLoop]: Interpolant automaton has 38 states [2021-05-03 00:21:52,388 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:21:52,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2021-05-03 00:21:52,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=184, Invalid=1298, Unknown=0, NotChecked=0, Total=1482 [2021-05-03 00:21:52,393 INFO L87 Difference]: Start difference. First operand 383 states and 461 transitions. Second operand has 38 states, 38 states have (on average 1.6842105263157894) internal successors, (64), 37 states have internal predecessors, (64), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:21:54,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:21:54,562 INFO L93 Difference]: Finished difference Result 740 states and 888 transitions. [2021-05-03 00:21:54,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2021-05-03 00:21:54,563 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 1.6842105263157894) internal successors, (64), 37 states have internal predecessors, (64), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 70 [2021-05-03 00:21:54,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:21:54,564 INFO L225 Difference]: With dead ends: 740 [2021-05-03 00:21:54,564 INFO L226 Difference]: Without dead ends: 416 [2021-05-03 00:21:54,565 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 12 SyntacticMatches, 17 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 671 ImplicationChecksByTransitivity, 1166.7ms TimeCoverageRelationStatistics Valid=222, Invalid=1418, Unknown=0, NotChecked=0, Total=1640 [2021-05-03 00:21:54,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 416 states. [2021-05-03 00:21:55,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 416 to 383. [2021-05-03 00:21:55,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 383 states, 373 states have (on average 1.2064343163538873) internal successors, (450), 373 states have internal predecessors, (450), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:21:55,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 461 transitions. [2021-05-03 00:21:55,255 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 461 transitions. Word has length 70 [2021-05-03 00:21:55,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:21:55,255 INFO L480 AbstractCegarLoop]: Abstraction has 383 states and 461 transitions. [2021-05-03 00:21:55,255 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 38 states, 38 states have (on average 1.6842105263157894) internal successors, (64), 37 states have internal predecessors, (64), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:21:55,255 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 461 transitions. [2021-05-03 00:21:55,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-05-03 00:21:55,256 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:21:55,256 INFO L523 BasicCegarLoop]: trace histogram [16, 16, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:21:55,256 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable681 [2021-05-03 00:21:55,256 INFO L428 AbstractCegarLoop]: === Iteration 157 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:21:55,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:21:55,256 INFO L82 PathProgramCache]: Analyzing trace with hash 301364380, now seen corresponding path program 120 times [2021-05-03 00:21:55,256 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:21:55,256 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [821796504] [2021-05-03 00:21:55,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:21:55,262 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_2945 v_~last~0_543) (< (+ v_main_~c~0_2945 1) v_~SIZE~0_538)) InVars {~SIZE~0=v_~SIZE~0_538, main_~c~0=v_main_~c~0_2945, ~last~0=v_~last~0_543} OutVars{~SIZE~0=v_~SIZE~0_538, main_~c~0=v_main_~c~0_2945, ~last~0=v_~last~0_543} AuxVars[] AssignedVars[] [2021-05-03 00:21:55,263 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:21:55,276 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:21:55,277 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:21:55,290 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:21:55,294 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:21:55,308 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:21:55,329 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:21:55,332 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_~last~0_544 v_main_~c~0_2947) (< v_main_~c~0_2947 v_~SIZE~0_539)) InVars {~SIZE~0=v_~SIZE~0_539, main_~c~0=v_main_~c~0_2947, ~last~0=v_~last~0_544} OutVars{~SIZE~0=v_~SIZE~0_539, main_~c~0=v_main_~c~0_2947, ~last~0=v_~last~0_544} AuxVars[] AssignedVars[] [2021-05-03 00:21:55,333 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:21:55,334 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:21:55,335 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:21:55,346 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:21:55,349 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:21:55,379 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:21:55,402 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_2949 v_~SIZE~0_540) (< v_main_~c~0_2949 v_~last~0_545)) InVars {~SIZE~0=v_~SIZE~0_540, main_~c~0=v_main_~c~0_2949, ~last~0=v_~last~0_545} OutVars{~SIZE~0=v_~SIZE~0_540, main_~c~0=v_main_~c~0_2949, ~last~0=v_~last~0_545} AuxVars[] AssignedVars[] [2021-05-03 00:21:55,403 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size [2021-05-03 00:21:55,404 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:21:55,406 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:21:55,420 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:21:55,426 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:21:55,453 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size 66 [2021-05-03 00:21:55,476 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:21:55,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:21:55,547 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:21:55,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:21:55,552 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:21:55,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:21:55,554 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:21:55,556 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:21:57,038 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:21:57,039 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [821796504] [2021-05-03 00:21:57,039 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [821796504] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:21:57,039 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:21:57,039 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [39] imperfect sequences [] total 39 [2021-05-03 00:21:57,039 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [489740341] [2021-05-03 00:21:57,039 INFO L460 AbstractCegarLoop]: Interpolant automaton has 39 states [2021-05-03 00:21:57,039 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:21:57,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2021-05-03 00:21:57,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=199, Invalid=1441, Unknown=0, NotChecked=0, Total=1640 [2021-05-03 00:21:57,040 INFO L87 Difference]: Start difference. First operand 383 states and 461 transitions. Second operand has 39 states, 39 states have (on average 1.641025641025641) internal successors, (64), 38 states have internal predecessors, (64), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:22:00,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:22:00,646 INFO L93 Difference]: Finished difference Result 773 states and 923 transitions. [2021-05-03 00:22:00,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2021-05-03 00:22:00,649 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 1.641025641025641) internal successors, (64), 38 states have internal predecessors, (64), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 70 [2021-05-03 00:22:00,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:22:00,666 INFO L225 Difference]: With dead ends: 773 [2021-05-03 00:22:00,666 INFO L226 Difference]: Without dead ends: 449 [2021-05-03 00:22:00,666 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 12 SyntacticMatches, 16 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 674 ImplicationChecksByTransitivity, 1567.2ms TimeCoverageRelationStatistics Valid=238, Invalid=1568, Unknown=0, NotChecked=0, Total=1806 [2021-05-03 00:22:00,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 449 states. [2021-05-03 00:22:01,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 449 to 345. [2021-05-03 00:22:01,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 345 states, 335 states have (on average 1.1940298507462686) internal successors, (400), 336 states have internal predecessors, (400), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:22:01,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 411 transitions. [2021-05-03 00:22:01,367 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 411 transitions. Word has length 70 [2021-05-03 00:22:01,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:22:01,367 INFO L480 AbstractCegarLoop]: Abstraction has 345 states and 411 transitions. [2021-05-03 00:22:01,367 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 39 states, 39 states have (on average 1.641025641025641) internal successors, (64), 38 states have internal predecessors, (64), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:22:01,367 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 411 transitions. [2021-05-03 00:22:01,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-05-03 00:22:01,368 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:22:01,368 INFO L523 BasicCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:22:01,368 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable685 [2021-05-03 00:22:01,368 INFO L428 AbstractCegarLoop]: === Iteration 158 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:22:01,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:22:01,368 INFO L82 PathProgramCache]: Analyzing trace with hash 135824030, now seen corresponding path program 16 times [2021-05-03 00:22:01,368 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:22:01,368 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1517431980] [2021-05-03 00:22:01,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:22:01,374 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_2969 v_~last~0_546) (< (+ v_main_~c~0_2969 1) v_~SIZE~0_541)) InVars {~SIZE~0=v_~SIZE~0_541, main_~c~0=v_main_~c~0_2969, ~last~0=v_~last~0_546} OutVars{~SIZE~0=v_~SIZE~0_541, main_~c~0=v_main_~c~0_2969, ~last~0=v_~last~0_546} AuxVars[] AssignedVars[] [2021-05-03 00:22:01,377 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:22:01,378 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:22:01,380 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:22:01,398 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:22:01,409 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:22:01,451 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:22:01,486 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:22:01,489 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_2971 v_~SIZE~0_542) (< v_main_~c~0_2971 v_~last~0_547)) InVars {~SIZE~0=v_~SIZE~0_542, main_~c~0=v_main_~c~0_2971, ~last~0=v_~last~0_547} OutVars{~SIZE~0=v_~SIZE~0_542, main_~c~0=v_main_~c~0_2971, ~last~0=v_~last~0_547} AuxVars[] AssignedVars[] [2021-05-03 00:22:01,491 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size [2021-05-03 00:22:01,492 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:22:01,493 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:22:01,513 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:22:01,521 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:22:01,564 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size 66 [2021-05-03 00:22:01,596 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:22:01,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:22:01,761 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:22:01,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:22:01,765 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:22:01,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:22:01,767 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:22:03,984 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:22:03,984 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1517431980] [2021-05-03 00:22:03,984 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1517431980] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:22:03,984 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:22:03,984 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [43] imperfect sequences [] total 43 [2021-05-03 00:22:03,984 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002873542] [2021-05-03 00:22:03,984 INFO L460 AbstractCegarLoop]: Interpolant automaton has 43 states [2021-05-03 00:22:03,985 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:22:03,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2021-05-03 00:22:03,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=216, Invalid=1764, Unknown=0, NotChecked=0, Total=1980 [2021-05-03 00:22:03,985 INFO L87 Difference]: Start difference. First operand 345 states and 411 transitions. Second operand has 43 states, 43 states have (on average 1.4883720930232558) internal successors, (64), 41 states have internal predecessors, (64), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:22:09,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:22:09,735 INFO L93 Difference]: Finished difference Result 801 states and 955 transitions. [2021-05-03 00:22:09,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2021-05-03 00:22:09,736 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 43 states have (on average 1.4883720930232558) internal successors, (64), 41 states have internal predecessors, (64), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 70 [2021-05-03 00:22:09,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:22:09,737 INFO L225 Difference]: With dead ends: 801 [2021-05-03 00:22:09,737 INFO L226 Difference]: Without dead ends: 468 [2021-05-03 00:22:09,738 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 6 SyntacticMatches, 15 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1104 ImplicationChecksByTransitivity, 3339.3ms TimeCoverageRelationStatistics Valid=354, Invalid=3552, Unknown=0, NotChecked=0, Total=3906 [2021-05-03 00:22:09,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 468 states. [2021-05-03 00:22:10,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 468 to 395. [2021-05-03 00:22:10,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 395 states, 385 states have (on average 1.2103896103896103) internal successors, (466), 385 states have internal predecessors, (466), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:22:10,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 477 transitions. [2021-05-03 00:22:10,352 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 477 transitions. Word has length 70 [2021-05-03 00:22:10,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:22:10,352 INFO L480 AbstractCegarLoop]: Abstraction has 395 states and 477 transitions. [2021-05-03 00:22:10,352 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 43 states, 43 states have (on average 1.4883720930232558) internal successors, (64), 41 states have internal predecessors, (64), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:22:10,352 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 477 transitions. [2021-05-03 00:22:10,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2021-05-03 00:22:10,353 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:22:10,353 INFO L523 BasicCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:22:10,353 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable688 [2021-05-03 00:22:10,353 INFO L428 AbstractCegarLoop]: === Iteration 159 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:22:10,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:22:10,353 INFO L82 PathProgramCache]: Analyzing trace with hash -565732323, now seen corresponding path program 17 times [2021-05-03 00:22:10,353 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:22:10,353 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1578319843] [2021-05-03 00:22:10,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:22:10,358 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (+ v_main_~c~0_2990 1) v_~SIZE~0_543) (<= v_~last~0_548 v_main_~c~0_2990)) InVars {~SIZE~0=v_~SIZE~0_543, main_~c~0=v_main_~c~0_2990, ~last~0=v_~last~0_548} OutVars{~SIZE~0=v_~SIZE~0_543, main_~c~0=v_main_~c~0_2990, ~last~0=v_~last~0_548} AuxVars[] AssignedVars[] [2021-05-03 00:22:10,359 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size [2021-05-03 00:22:10,360 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:22:10,361 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:22:10,372 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:22:10,375 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:22:10,405 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size 78 [2021-05-03 00:22:10,427 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:22:10,429 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_2992 v_~SIZE~0_544) (<= v_~last~0_549 v_main_~c~0_2992)) InVars {~SIZE~0=v_~SIZE~0_544, main_~c~0=v_main_~c~0_2992, ~last~0=v_~last~0_549} OutVars{~SIZE~0=v_~SIZE~0_544, main_~c~0=v_main_~c~0_2992, ~last~0=v_~last~0_549} AuxVars[] AssignedVars[] [2021-05-03 00:22:10,431 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:22:10,432 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:22:10,433 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:22:10,444 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:22:10,447 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:22:10,478 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:22:10,499 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:22:10,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:22:10,556 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:22:10,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:22:10,560 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:22:10,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:22:10,561 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:22:11,599 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:22:11,599 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1578319843] [2021-05-03 00:22:11,599 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1578319843] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:22:11,600 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:22:11,600 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2021-05-03 00:22:11,600 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013461323] [2021-05-03 00:22:11,600 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states [2021-05-03 00:22:11,600 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:22:11,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-05-03 00:22:11,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=558, Unknown=0, NotChecked=0, Total=650 [2021-05-03 00:22:11,600 INFO L87 Difference]: Start difference. First operand 395 states and 477 transitions. Second operand has 25 states, 25 states have (on average 2.68) internal successors, (67), 24 states have internal predecessors, (67), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:22:13,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:22:13,943 INFO L93 Difference]: Finished difference Result 875 states and 1026 transitions. [2021-05-03 00:22:13,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-05-03 00:22:13,945 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 2.68) internal successors, (67), 24 states have internal predecessors, (67), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 73 [2021-05-03 00:22:13,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:22:13,946 INFO L225 Difference]: With dead ends: 875 [2021-05-03 00:22:13,946 INFO L226 Difference]: Without dead ends: 542 [2021-05-03 00:22:13,946 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 14 SyntacticMatches, 32 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 174 ImplicationChecksByTransitivity, 1038.4ms TimeCoverageRelationStatistics Valid=96, Invalid=606, Unknown=0, NotChecked=0, Total=702 [2021-05-03 00:22:13,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 542 states. [2021-05-03 00:22:14,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 542 to 404. [2021-05-03 00:22:14,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 404 states, 394 states have (on average 1.2055837563451777) internal successors, (475), 394 states have internal predecessors, (475), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:22:14,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 404 states to 404 states and 486 transitions. [2021-05-03 00:22:14,674 INFO L78 Accepts]: Start accepts. Automaton has 404 states and 486 transitions. Word has length 73 [2021-05-03 00:22:14,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:22:14,674 INFO L480 AbstractCegarLoop]: Abstraction has 404 states and 486 transitions. [2021-05-03 00:22:14,674 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 25 states, 25 states have (on average 2.68) internal successors, (67), 24 states have internal predecessors, (67), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:22:14,674 INFO L276 IsEmpty]: Start isEmpty. Operand 404 states and 486 transitions. [2021-05-03 00:22:14,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2021-05-03 00:22:14,674 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:22:14,674 INFO L523 BasicCegarLoop]: trace histogram [17, 17, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:22:14,674 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable691 [2021-05-03 00:22:14,674 INFO L428 AbstractCegarLoop]: === Iteration 160 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:22:14,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:22:14,675 INFO L82 PathProgramCache]: Analyzing trace with hash -5032545, now seen corresponding path program 121 times [2021-05-03 00:22:14,675 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:22:14,675 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1597240353] [2021-05-03 00:22:14,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:22:14,681 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_~last~0_550 v_main_~c~0_3012) (< (+ v_main_~c~0_3012 1) v_~SIZE~0_545)) InVars {~SIZE~0=v_~SIZE~0_545, main_~c~0=v_main_~c~0_3012, ~last~0=v_~last~0_550} OutVars{~SIZE~0=v_~SIZE~0_545, main_~c~0=v_main_~c~0_3012, ~last~0=v_~last~0_550} AuxVars[] AssignedVars[] [2021-05-03 00:22:14,682 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size [2021-05-03 00:22:14,683 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:22:14,684 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:22:14,694 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:22:14,696 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:22:14,725 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size 78 [2021-05-03 00:22:14,747 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (+ v_main_~c~0_3014 1) v_~SIZE~0_546) (< v_main_~c~0_3014 v_~last~0_551)) InVars {~SIZE~0=v_~SIZE~0_546, main_~c~0=v_main_~c~0_3014, ~last~0=v_~last~0_551} OutVars{~SIZE~0=v_~SIZE~0_546, main_~c~0=v_main_~c~0_3014, ~last~0=v_~last~0_551} AuxVars[] AssignedVars[] [2021-05-03 00:22:14,748 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:22:14,760 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:22:14,761 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:22:14,774 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:22:14,778 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:22:14,792 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:22:14,811 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:22:14,813 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_3016 v_~SIZE~0_547) (<= v_~last~0_552 v_main_~c~0_3016)) InVars {~SIZE~0=v_~SIZE~0_547, main_~c~0=v_main_~c~0_3016, ~last~0=v_~last~0_552} OutVars{~SIZE~0=v_~SIZE~0_547, main_~c~0=v_main_~c~0_3016, ~last~0=v_~last~0_552} AuxVars[] AssignedVars[] [2021-05-03 00:22:14,814 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:22:14,829 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:22:14,831 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:22:14,840 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:22:14,842 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:22:14,856 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:22:14,878 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_3018 v_~SIZE~0_548) (< v_main_~c~0_3018 v_~last~0_553)) InVars {~SIZE~0=v_~SIZE~0_548, main_~c~0=v_main_~c~0_3018, ~last~0=v_~last~0_553} OutVars{~SIZE~0=v_~SIZE~0_548, main_~c~0=v_main_~c~0_3018, ~last~0=v_~last~0_553} AuxVars[] AssignedVars[] [2021-05-03 00:22:14,879 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size [2021-05-03 00:22:14,891 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:22:14,892 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:22:14,905 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:22:14,909 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:22:14,923 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size 66 [2021-05-03 00:22:14,942 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:22:14,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:22:15,079 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:22:15,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:22:15,083 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:22:15,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:22:15,085 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:22:15,086 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:22:16,490 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:22:16,490 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1597240353] [2021-05-03 00:22:16,490 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1597240353] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:22:16,490 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:22:16,490 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [30] imperfect sequences [] total 30 [2021-05-03 00:22:16,490 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051039893] [2021-05-03 00:22:16,491 INFO L460 AbstractCegarLoop]: Interpolant automaton has 30 states [2021-05-03 00:22:16,491 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:22:16,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2021-05-03 00:22:16,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=838, Unknown=0, NotChecked=0, Total=992 [2021-05-03 00:22:16,491 INFO L87 Difference]: Start difference. First operand 404 states and 486 transitions. Second operand has 30 states, 30 states have (on average 2.2333333333333334) internal successors, (67), 28 states have internal predecessors, (67), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:22:19,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:22:19,082 INFO L93 Difference]: Finished difference Result 853 states and 1006 transitions. [2021-05-03 00:22:19,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2021-05-03 00:22:19,084 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 2.2333333333333334) internal successors, (67), 28 states have internal predecessors, (67), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 73 [2021-05-03 00:22:19,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:22:19,086 INFO L225 Difference]: With dead ends: 853 [2021-05-03 00:22:19,086 INFO L226 Difference]: Without dead ends: 511 [2021-05-03 00:22:19,087 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 6 SyntacticMatches, 32 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 462 ImplicationChecksByTransitivity, 1595.3ms TimeCoverageRelationStatistics Valid=180, Invalid=1080, Unknown=0, NotChecked=0, Total=1260 [2021-05-03 00:22:19,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 511 states. [2021-05-03 00:22:19,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 511 to 404. [2021-05-03 00:22:19,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 404 states, 394 states have (on average 1.2055837563451777) internal successors, (475), 394 states have internal predecessors, (475), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:22:19,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 404 states to 404 states and 486 transitions. [2021-05-03 00:22:19,956 INFO L78 Accepts]: Start accepts. Automaton has 404 states and 486 transitions. Word has length 73 [2021-05-03 00:22:19,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:22:19,956 INFO L480 AbstractCegarLoop]: Abstraction has 404 states and 486 transitions. [2021-05-03 00:22:19,956 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 30 states, 30 states have (on average 2.2333333333333334) internal successors, (67), 28 states have internal predecessors, (67), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:22:19,956 INFO L276 IsEmpty]: Start isEmpty. Operand 404 states and 486 transitions. [2021-05-03 00:22:19,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2021-05-03 00:22:19,957 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:22:19,957 INFO L523 BasicCegarLoop]: trace histogram [17, 17, 15, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:22:19,957 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable696 [2021-05-03 00:22:19,957 INFO L428 AbstractCegarLoop]: === Iteration 161 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:22:19,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:22:19,957 INFO L82 PathProgramCache]: Analyzing trace with hash 35642205, now seen corresponding path program 122 times [2021-05-03 00:22:19,957 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:22:19,957 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [435274834] [2021-05-03 00:22:19,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:22:19,972 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (+ v_main_~c~0_3039 1) v_~SIZE~0_549) (<= v_~last~0_554 v_main_~c~0_3039)) InVars {~SIZE~0=v_~SIZE~0_549, main_~c~0=v_main_~c~0_3039, ~last~0=v_~last~0_554} OutVars{~SIZE~0=v_~SIZE~0_549, main_~c~0=v_main_~c~0_3039, ~last~0=v_~last~0_554} AuxVars[] AssignedVars[] [2021-05-03 00:22:19,975 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size [2021-05-03 00:22:19,977 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:22:19,980 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:22:19,994 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:22:19,999 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:22:20,037 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size 78 [2021-05-03 00:22:20,071 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_3041 v_~last~0_555) (< (+ v_main_~c~0_3041 1) v_~SIZE~0_550)) InVars {~SIZE~0=v_~SIZE~0_550, main_~c~0=v_main_~c~0_3041, ~last~0=v_~last~0_555} OutVars{~SIZE~0=v_~SIZE~0_550, main_~c~0=v_main_~c~0_3041, ~last~0=v_~last~0_555} AuxVars[] AssignedVars[] [2021-05-03 00:22:20,072 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:22:20,073 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:22:20,075 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:22:20,090 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:22:20,096 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:22:20,132 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:22:20,172 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:22:20,174 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_3043 v_~SIZE~0_551) (<= v_~last~0_556 v_main_~c~0_3043)) InVars {~SIZE~0=v_~SIZE~0_551, main_~c~0=v_main_~c~0_3043, ~last~0=v_~last~0_556} OutVars{~SIZE~0=v_~SIZE~0_551, main_~c~0=v_main_~c~0_3043, ~last~0=v_~last~0_556} AuxVars[] AssignedVars[] [2021-05-03 00:22:20,176 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:22:20,177 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:22:20,178 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:22:20,196 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:22:20,200 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:22:20,243 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:22:20,282 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_3045 v_~SIZE~0_552) (< v_main_~c~0_3045 v_~last~0_557)) InVars {~SIZE~0=v_~SIZE~0_552, main_~c~0=v_main_~c~0_3045, ~last~0=v_~last~0_557} OutVars{~SIZE~0=v_~SIZE~0_552, main_~c~0=v_main_~c~0_3045, ~last~0=v_~last~0_557} AuxVars[] AssignedVars[] [2021-05-03 00:22:20,284 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size [2021-05-03 00:22:20,285 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:22:20,288 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:22:20,313 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:22:20,324 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:22:20,368 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size 66 [2021-05-03 00:22:20,416 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:22:20,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:22:20,543 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:22:20,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:22:20,548 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:22:20,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:22:20,552 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:22:20,556 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:22:22,644 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:22:22,644 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [435274834] [2021-05-03 00:22:22,644 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [435274834] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:22:22,644 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:22:22,644 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2021-05-03 00:22:22,644 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [78935855] [2021-05-03 00:22:22,644 INFO L460 AbstractCegarLoop]: Interpolant automaton has 27 states [2021-05-03 00:22:22,645 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:22:22,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2021-05-03 00:22:22,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=714, Unknown=0, NotChecked=0, Total=812 [2021-05-03 00:22:22,645 INFO L87 Difference]: Start difference. First operand 404 states and 486 transitions. Second operand has 27 states, 27 states have (on average 2.4814814814814814) internal successors, (67), 26 states have internal predecessors, (67), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:22:26,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:22:26,658 INFO L93 Difference]: Finished difference Result 888 states and 1039 transitions. [2021-05-03 00:22:26,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2021-05-03 00:22:26,659 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 2.4814814814814814) internal successors, (67), 26 states have internal predecessors, (67), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 73 [2021-05-03 00:22:26,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:22:26,660 INFO L225 Difference]: With dead ends: 888 [2021-05-03 00:22:26,660 INFO L226 Difference]: Without dead ends: 546 [2021-05-03 00:22:26,661 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 12 SyntacticMatches, 31 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 454 ImplicationChecksByTransitivity, 2220.6ms TimeCoverageRelationStatistics Valid=111, Invalid=819, Unknown=0, NotChecked=0, Total=930 [2021-05-03 00:22:26,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 546 states. [2021-05-03 00:22:27,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 546 to 404. [2021-05-03 00:22:27,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 404 states, 394 states have (on average 1.2055837563451777) internal successors, (475), 394 states have internal predecessors, (475), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:22:27,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 404 states to 404 states and 486 transitions. [2021-05-03 00:22:27,526 INFO L78 Accepts]: Start accepts. Automaton has 404 states and 486 transitions. Word has length 73 [2021-05-03 00:22:27,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:22:27,526 INFO L480 AbstractCegarLoop]: Abstraction has 404 states and 486 transitions. [2021-05-03 00:22:27,526 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 27 states, 27 states have (on average 2.4814814814814814) internal successors, (67), 26 states have internal predecessors, (67), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:22:27,526 INFO L276 IsEmpty]: Start isEmpty. Operand 404 states and 486 transitions. [2021-05-03 00:22:27,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2021-05-03 00:22:27,526 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:22:27,526 INFO L523 BasicCegarLoop]: trace histogram [17, 17, 14, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:22:27,527 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable701 [2021-05-03 00:22:27,527 INFO L428 AbstractCegarLoop]: === Iteration 162 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:22:27,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:22:27,527 INFO L82 PathProgramCache]: Analyzing trace with hash 479542879, now seen corresponding path program 123 times [2021-05-03 00:22:27,527 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:22:27,527 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1701566347] [2021-05-03 00:22:27,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:22:27,534 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_~last~0_558 v_main_~c~0_3066) (< (+ v_main_~c~0_3066 1) v_~SIZE~0_553)) InVars {~SIZE~0=v_~SIZE~0_553, main_~c~0=v_main_~c~0_3066, ~last~0=v_~last~0_558} OutVars{~SIZE~0=v_~SIZE~0_553, main_~c~0=v_main_~c~0_3066, ~last~0=v_~last~0_558} AuxVars[] AssignedVars[] [2021-05-03 00:22:27,536 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size [2021-05-03 00:22:27,554 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:22:27,556 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:22:27,567 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:22:27,570 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:22:27,587 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size 78 [2021-05-03 00:22:27,611 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (+ v_main_~c~0_3068 1) v_~SIZE~0_554) (< v_main_~c~0_3068 v_~last~0_559)) InVars {~SIZE~0=v_~SIZE~0_554, main_~c~0=v_main_~c~0_3068, ~last~0=v_~last~0_559} OutVars{~SIZE~0=v_~SIZE~0_554, main_~c~0=v_main_~c~0_3068, ~last~0=v_~last~0_559} AuxVars[] AssignedVars[] [2021-05-03 00:22:27,613 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:22:27,626 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:22:27,628 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:22:27,642 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:22:27,647 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:22:27,663 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:22:27,684 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:22:27,686 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_3070 v_~SIZE~0_555) (<= v_~last~0_560 v_main_~c~0_3070)) InVars {~SIZE~0=v_~SIZE~0_555, main_~c~0=v_main_~c~0_3070, ~last~0=v_~last~0_560} OutVars{~SIZE~0=v_~SIZE~0_555, main_~c~0=v_main_~c~0_3070, ~last~0=v_~last~0_560} AuxVars[] AssignedVars[] [2021-05-03 00:22:27,688 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:22:27,705 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:22:27,706 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:22:27,724 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:22:27,729 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:22:27,749 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:22:27,776 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_3072 v_~SIZE~0_556) (< v_main_~c~0_3072 v_~last~0_561)) InVars {~SIZE~0=v_~SIZE~0_556, main_~c~0=v_main_~c~0_3072, ~last~0=v_~last~0_561} OutVars{~SIZE~0=v_~SIZE~0_556, main_~c~0=v_main_~c~0_3072, ~last~0=v_~last~0_561} AuxVars[] AssignedVars[] [2021-05-03 00:22:27,778 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size [2021-05-03 00:22:27,793 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:22:27,795 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:22:27,811 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:22:27,817 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:22:27,835 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size 66 [2021-05-03 00:22:27,860 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:22:27,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:22:27,943 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:22:27,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:22:27,948 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:22:27,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:22:27,950 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:22:27,952 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:22:29,154 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:22:29,154 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1701566347] [2021-05-03 00:22:29,155 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1701566347] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:22:29,155 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:22:29,155 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2021-05-03 00:22:29,155 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770836135] [2021-05-03 00:22:29,155 INFO L460 AbstractCegarLoop]: Interpolant automaton has 28 states [2021-05-03 00:22:29,155 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:22:29,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2021-05-03 00:22:29,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=764, Unknown=0, NotChecked=0, Total=870 [2021-05-03 00:22:29,156 INFO L87 Difference]: Start difference. First operand 404 states and 486 transitions. Second operand has 28 states, 28 states have (on average 2.392857142857143) internal successors, (67), 27 states have internal predecessors, (67), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:22:31,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:22:31,501 INFO L93 Difference]: Finished difference Result 882 states and 1033 transitions. [2021-05-03 00:22:31,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2021-05-03 00:22:31,503 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 2.392857142857143) internal successors, (67), 27 states have internal predecessors, (67), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 73 [2021-05-03 00:22:31,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:22:31,504 INFO L225 Difference]: With dead ends: 882 [2021-05-03 00:22:31,504 INFO L226 Difference]: Without dead ends: 540 [2021-05-03 00:22:31,504 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 12 SyntacticMatches, 30 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 533 ImplicationChecksByTransitivity, 1246.2ms TimeCoverageRelationStatistics Valid=121, Invalid=871, Unknown=0, NotChecked=0, Total=992 [2021-05-03 00:22:31,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 540 states. [2021-05-03 00:22:32,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 540 to 404. [2021-05-03 00:22:32,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 404 states, 394 states have (on average 1.2055837563451777) internal successors, (475), 394 states have internal predecessors, (475), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:22:32,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 404 states to 404 states and 486 transitions. [2021-05-03 00:22:32,201 INFO L78 Accepts]: Start accepts. Automaton has 404 states and 486 transitions. Word has length 73 [2021-05-03 00:22:32,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:22:32,201 INFO L480 AbstractCegarLoop]: Abstraction has 404 states and 486 transitions. [2021-05-03 00:22:32,201 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 28 states, 28 states have (on average 2.392857142857143) internal successors, (67), 27 states have internal predecessors, (67), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:22:32,201 INFO L276 IsEmpty]: Start isEmpty. Operand 404 states and 486 transitions. [2021-05-03 00:22:32,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2021-05-03 00:22:32,202 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:22:32,202 INFO L523 BasicCegarLoop]: trace histogram [17, 17, 13, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:22:32,202 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable706 [2021-05-03 00:22:32,202 INFO L428 AbstractCegarLoop]: === Iteration 163 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:22:32,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:22:32,202 INFO L82 PathProgramCache]: Analyzing trace with hash -1537379, now seen corresponding path program 124 times [2021-05-03 00:22:32,202 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:22:32,202 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [787669702] [2021-05-03 00:22:32,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:22:32,210 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_~last~0_562 v_main_~c~0_3093) (< (+ v_main_~c~0_3093 1) v_~SIZE~0_557)) InVars {~SIZE~0=v_~SIZE~0_557, main_~c~0=v_main_~c~0_3093, ~last~0=v_~last~0_562} OutVars{~SIZE~0=v_~SIZE~0_557, main_~c~0=v_main_~c~0_3093, ~last~0=v_~last~0_562} AuxVars[] AssignedVars[] [2021-05-03 00:22:32,211 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size [2021-05-03 00:22:32,227 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:22:32,228 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:22:32,241 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:22:32,244 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:22:32,262 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size 78 [2021-05-03 00:22:32,285 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_3095 v_~last~0_563) (< (+ v_main_~c~0_3095 1) v_~SIZE~0_558)) InVars {~SIZE~0=v_~SIZE~0_558, main_~c~0=v_main_~c~0_3095, ~last~0=v_~last~0_563} OutVars{~SIZE~0=v_~SIZE~0_558, main_~c~0=v_main_~c~0_3095, ~last~0=v_~last~0_563} AuxVars[] AssignedVars[] [2021-05-03 00:22:32,286 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:22:32,299 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:22:32,300 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:22:32,314 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:22:32,318 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:22:32,333 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:22:32,355 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:22:32,357 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_~last~0_564 v_main_~c~0_3097) (< v_main_~c~0_3097 v_~SIZE~0_559)) InVars {~SIZE~0=v_~SIZE~0_559, main_~c~0=v_main_~c~0_3097, ~last~0=v_~last~0_564} OutVars{~SIZE~0=v_~SIZE~0_559, main_~c~0=v_main_~c~0_3097, ~last~0=v_~last~0_564} AuxVars[] AssignedVars[] [2021-05-03 00:22:32,359 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:22:32,374 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:22:32,376 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:22:32,385 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:22:32,388 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:22:32,408 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:22:32,436 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_3099 v_~SIZE~0_560) (< v_main_~c~0_3099 v_~last~0_565)) InVars {~SIZE~0=v_~SIZE~0_560, main_~c~0=v_main_~c~0_3099, ~last~0=v_~last~0_565} OutVars{~SIZE~0=v_~SIZE~0_560, main_~c~0=v_main_~c~0_3099, ~last~0=v_~last~0_565} AuxVars[] AssignedVars[] [2021-05-03 00:22:32,437 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size [2021-05-03 00:22:32,453 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:22:32,454 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:22:32,466 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:22:32,471 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:22:32,485 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size 66 [2021-05-03 00:22:32,507 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:22:32,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:22:32,563 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:22:32,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:22:32,567 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:22:32,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:22:32,569 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:22:32,571 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:22:33,600 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:22:33,600 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [787669702] [2021-05-03 00:22:33,600 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [787669702] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:22:33,600 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:22:33,600 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2021-05-03 00:22:33,600 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554289191] [2021-05-03 00:22:33,600 INFO L460 AbstractCegarLoop]: Interpolant automaton has 29 states [2021-05-03 00:22:33,600 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:22:33,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2021-05-03 00:22:33,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=763, Unknown=0, NotChecked=0, Total=870 [2021-05-03 00:22:33,601 INFO L87 Difference]: Start difference. First operand 404 states and 486 transitions. Second operand has 29 states, 29 states have (on average 2.310344827586207) internal successors, (67), 28 states have internal predecessors, (67), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:22:36,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:22:36,126 INFO L93 Difference]: Finished difference Result 875 states and 1030 transitions. [2021-05-03 00:22:36,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2021-05-03 00:22:36,126 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 2.310344827586207) internal successors, (67), 28 states have internal predecessors, (67), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 73 [2021-05-03 00:22:36,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:22:36,127 INFO L225 Difference]: With dead ends: 875 [2021-05-03 00:22:36,127 INFO L226 Difference]: Without dead ends: 533 [2021-05-03 00:22:36,128 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 12 SyntacticMatches, 29 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 552 ImplicationChecksByTransitivity, 1058.8ms TimeCoverageRelationStatistics Valid=125, Invalid=867, Unknown=0, NotChecked=0, Total=992 [2021-05-03 00:22:36,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 533 states. [2021-05-03 00:22:36,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 533 to 404. [2021-05-03 00:22:36,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 404 states, 394 states have (on average 1.2055837563451777) internal successors, (475), 394 states have internal predecessors, (475), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:22:36,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 404 states to 404 states and 486 transitions. [2021-05-03 00:22:36,961 INFO L78 Accepts]: Start accepts. Automaton has 404 states and 486 transitions. Word has length 73 [2021-05-03 00:22:36,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:22:36,961 INFO L480 AbstractCegarLoop]: Abstraction has 404 states and 486 transitions. [2021-05-03 00:22:36,961 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 29 states, 29 states have (on average 2.310344827586207) internal successors, (67), 28 states have internal predecessors, (67), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:22:36,961 INFO L276 IsEmpty]: Start isEmpty. Operand 404 states and 486 transitions. [2021-05-03 00:22:36,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2021-05-03 00:22:36,961 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:22:36,961 INFO L523 BasicCegarLoop]: trace histogram [17, 17, 12, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:22:36,962 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable711 [2021-05-03 00:22:36,962 INFO L428 AbstractCegarLoop]: === Iteration 164 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:22:36,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:22:36,962 INFO L82 PathProgramCache]: Analyzing trace with hash -354625761, now seen corresponding path program 125 times [2021-05-03 00:22:36,962 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:22:36,962 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1623382983] [2021-05-03 00:22:36,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:22:36,969 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_~last~0_566 v_main_~c~0_3120) (< (+ v_main_~c~0_3120 1) v_~SIZE~0_561)) InVars {~SIZE~0=v_~SIZE~0_561, main_~c~0=v_main_~c~0_3120, ~last~0=v_~last~0_566} OutVars{~SIZE~0=v_~SIZE~0_561, main_~c~0=v_main_~c~0_3120, ~last~0=v_~last~0_566} AuxVars[] AssignedVars[] [2021-05-03 00:22:36,971 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size [2021-05-03 00:22:36,972 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:22:36,974 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:22:36,986 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:22:36,989 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:22:37,022 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size 78 [2021-05-03 00:22:37,047 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_3122 v_~last~0_567) (< (+ v_main_~c~0_3122 1) v_~SIZE~0_562)) InVars {~SIZE~0=v_~SIZE~0_562, main_~c~0=v_main_~c~0_3122, ~last~0=v_~last~0_567} OutVars{~SIZE~0=v_~SIZE~0_562, main_~c~0=v_main_~c~0_3122, ~last~0=v_~last~0_567} AuxVars[] AssignedVars[] [2021-05-03 00:22:37,048 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:22:37,062 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:22:37,064 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:22:37,078 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:22:37,083 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:22:37,098 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:22:37,120 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:22:37,122 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_~last~0_568 v_main_~c~0_3124) (< v_main_~c~0_3124 v_~SIZE~0_563)) InVars {~SIZE~0=v_~SIZE~0_563, main_~c~0=v_main_~c~0_3124, ~last~0=v_~last~0_568} OutVars{~SIZE~0=v_~SIZE~0_563, main_~c~0=v_main_~c~0_3124, ~last~0=v_~last~0_568} AuxVars[] AssignedVars[] [2021-05-03 00:22:37,124 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:22:37,141 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:22:37,143 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:22:37,154 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:22:37,157 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:22:37,173 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:22:37,197 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_3126 v_~last~0_569) (< v_main_~c~0_3126 v_~SIZE~0_564)) InVars {~SIZE~0=v_~SIZE~0_564, main_~c~0=v_main_~c~0_3126, ~last~0=v_~last~0_569} OutVars{~SIZE~0=v_~SIZE~0_564, main_~c~0=v_main_~c~0_3126, ~last~0=v_~last~0_569} AuxVars[] AssignedVars[] [2021-05-03 00:22:37,198 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size [2021-05-03 00:22:37,211 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:22:37,213 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:22:37,226 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:22:37,231 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:22:37,250 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size 66 [2021-05-03 00:22:37,275 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:22:37,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:22:37,358 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:22:37,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:22:37,362 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:22:37,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:22:37,364 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:22:37,367 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:22:38,408 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:22:38,408 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1623382983] [2021-05-03 00:22:38,408 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1623382983] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:22:38,408 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:22:38,408 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [30] imperfect sequences [] total 30 [2021-05-03 00:22:38,408 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2104676353] [2021-05-03 00:22:38,408 INFO L460 AbstractCegarLoop]: Interpolant automaton has 30 states [2021-05-03 00:22:38,409 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:22:38,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2021-05-03 00:22:38,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=870, Unknown=0, NotChecked=0, Total=992 [2021-05-03 00:22:38,409 INFO L87 Difference]: Start difference. First operand 404 states and 486 transitions. Second operand has 30 states, 30 states have (on average 2.2333333333333334) internal successors, (67), 29 states have internal predecessors, (67), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:22:40,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:22:40,773 INFO L93 Difference]: Finished difference Result 870 states and 1021 transitions. [2021-05-03 00:22:40,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2021-05-03 00:22:40,774 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 2.2333333333333334) internal successors, (67), 29 states have internal predecessors, (67), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 73 [2021-05-03 00:22:40,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:22:40,775 INFO L225 Difference]: With dead ends: 870 [2021-05-03 00:22:40,775 INFO L226 Difference]: Without dead ends: 528 [2021-05-03 00:22:40,776 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 13 SyntacticMatches, 27 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 649 ImplicationChecksByTransitivity, 1089.7ms TimeCoverageRelationStatistics Valid=141, Invalid=981, Unknown=0, NotChecked=0, Total=1122 [2021-05-03 00:22:40,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 528 states. [2021-05-03 00:22:41,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 404. [2021-05-03 00:22:41,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 404 states, 394 states have (on average 1.2055837563451777) internal successors, (475), 394 states have internal predecessors, (475), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:22:41,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 404 states to 404 states and 486 transitions. [2021-05-03 00:22:41,512 INFO L78 Accepts]: Start accepts. Automaton has 404 states and 486 transitions. Word has length 73 [2021-05-03 00:22:41,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:22:41,513 INFO L480 AbstractCegarLoop]: Abstraction has 404 states and 486 transitions. [2021-05-03 00:22:41,513 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 30 states, 30 states have (on average 2.2333333333333334) internal successors, (67), 29 states have internal predecessors, (67), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:22:41,513 INFO L276 IsEmpty]: Start isEmpty. Operand 404 states and 486 transitions. [2021-05-03 00:22:41,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2021-05-03 00:22:41,513 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:22:41,513 INFO L523 BasicCegarLoop]: trace histogram [17, 17, 11, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:22:41,513 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable716 [2021-05-03 00:22:41,513 INFO L428 AbstractCegarLoop]: === Iteration 165 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:22:41,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:22:41,513 INFO L82 PathProgramCache]: Analyzing trace with hash 1890953693, now seen corresponding path program 126 times [2021-05-03 00:22:41,514 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:22:41,514 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [171481221] [2021-05-03 00:22:41,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:22:41,521 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (+ v_main_~c~0_3147 1) v_~SIZE~0_565) (<= v_~last~0_570 v_main_~c~0_3147)) InVars {~SIZE~0=v_~SIZE~0_565, main_~c~0=v_main_~c~0_3147, ~last~0=v_~last~0_570} OutVars{~SIZE~0=v_~SIZE~0_565, main_~c~0=v_main_~c~0_3147, ~last~0=v_~last~0_570} AuxVars[] AssignedVars[] [2021-05-03 00:22:41,522 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size [2021-05-03 00:22:41,523 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:22:41,524 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:22:41,534 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:22:41,537 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:22:41,565 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size 78 [2021-05-03 00:22:41,591 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (+ v_main_~c~0_3149 1) v_~SIZE~0_566) (< v_main_~c~0_3149 v_~last~0_571)) InVars {~SIZE~0=v_~SIZE~0_566, main_~c~0=v_main_~c~0_3149, ~last~0=v_~last~0_571} OutVars{~SIZE~0=v_~SIZE~0_566, main_~c~0=v_main_~c~0_3149, ~last~0=v_~last~0_571} AuxVars[] AssignedVars[] [2021-05-03 00:22:41,592 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:22:41,593 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:22:41,594 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:22:41,607 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:22:41,612 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:22:41,637 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:22:41,657 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:22:41,659 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_~last~0_572 v_main_~c~0_3151) (< v_main_~c~0_3151 v_~SIZE~0_567)) InVars {~SIZE~0=v_~SIZE~0_567, main_~c~0=v_main_~c~0_3151, ~last~0=v_~last~0_572} OutVars{~SIZE~0=v_~SIZE~0_567, main_~c~0=v_main_~c~0_3151, ~last~0=v_~last~0_572} AuxVars[] AssignedVars[] [2021-05-03 00:22:41,660 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:22:41,676 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:22:41,677 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:22:41,686 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:22:41,689 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:22:41,704 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:22:41,726 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_3153 v_~last~0_573) (< v_main_~c~0_3153 v_~SIZE~0_568)) InVars {~SIZE~0=v_~SIZE~0_568, main_~c~0=v_main_~c~0_3153, ~last~0=v_~last~0_573} OutVars{~SIZE~0=v_~SIZE~0_568, main_~c~0=v_main_~c~0_3153, ~last~0=v_~last~0_573} AuxVars[] AssignedVars[] [2021-05-03 00:22:41,727 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size [2021-05-03 00:22:41,728 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:22:41,729 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:22:41,742 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:22:41,746 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:22:41,771 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size 66 [2021-05-03 00:22:41,793 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:22:41,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:22:41,848 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:22:41,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:22:41,852 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:22:41,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:22:41,853 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:22:41,856 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:22:43,029 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:22:43,030 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [171481221] [2021-05-03 00:22:43,030 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [171481221] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:22:43,030 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:22:43,030 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [31] imperfect sequences [] total 31 [2021-05-03 00:22:43,030 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208306849] [2021-05-03 00:22:43,030 INFO L460 AbstractCegarLoop]: Interpolant automaton has 31 states [2021-05-03 00:22:43,030 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:22:43,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2021-05-03 00:22:43,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=869, Unknown=0, NotChecked=0, Total=992 [2021-05-03 00:22:43,031 INFO L87 Difference]: Start difference. First operand 404 states and 486 transitions. Second operand has 31 states, 31 states have (on average 2.161290322580645) internal successors, (67), 30 states have internal predecessors, (67), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:22:45,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:22:45,418 INFO L93 Difference]: Finished difference Result 857 states and 1012 transitions. [2021-05-03 00:22:45,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2021-05-03 00:22:45,419 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 2.161290322580645) internal successors, (67), 30 states have internal predecessors, (67), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 73 [2021-05-03 00:22:45,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:22:45,419 INFO L225 Difference]: With dead ends: 857 [2021-05-03 00:22:45,419 INFO L226 Difference]: Without dead ends: 515 [2021-05-03 00:22:45,420 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 12 SyntacticMatches, 27 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 667 ImplicationChecksByTransitivity, 1197.1ms TimeCoverageRelationStatistics Valid=145, Invalid=977, Unknown=0, NotChecked=0, Total=1122 [2021-05-03 00:22:45,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 515 states. [2021-05-03 00:22:46,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 515 to 404. [2021-05-03 00:22:46,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 404 states, 394 states have (on average 1.2055837563451777) internal successors, (475), 394 states have internal predecessors, (475), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:22:46,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 404 states to 404 states and 486 transitions. [2021-05-03 00:22:46,232 INFO L78 Accepts]: Start accepts. Automaton has 404 states and 486 transitions. Word has length 73 [2021-05-03 00:22:46,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:22:46,232 INFO L480 AbstractCegarLoop]: Abstraction has 404 states and 486 transitions. [2021-05-03 00:22:46,232 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 31 states, 31 states have (on average 2.161290322580645) internal successors, (67), 30 states have internal predecessors, (67), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:22:46,233 INFO L276 IsEmpty]: Start isEmpty. Operand 404 states and 486 transitions. [2021-05-03 00:22:46,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2021-05-03 00:22:46,233 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:22:46,233 INFO L523 BasicCegarLoop]: trace histogram [17, 17, 10, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:22:46,233 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable721 [2021-05-03 00:22:46,233 INFO L428 AbstractCegarLoop]: === Iteration 166 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:22:46,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:22:46,234 INFO L82 PathProgramCache]: Analyzing trace with hash -1980366881, now seen corresponding path program 127 times [2021-05-03 00:22:46,234 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:22:46,234 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [669967329] [2021-05-03 00:22:46,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:22:46,241 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_~last~0_574 v_main_~c~0_3174) (< (+ v_main_~c~0_3174 1) v_~SIZE~0_569)) InVars {~SIZE~0=v_~SIZE~0_569, main_~c~0=v_main_~c~0_3174, ~last~0=v_~last~0_574} OutVars{~SIZE~0=v_~SIZE~0_569, main_~c~0=v_main_~c~0_3174, ~last~0=v_~last~0_574} AuxVars[] AssignedVars[] [2021-05-03 00:22:46,242 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size [2021-05-03 00:22:46,243 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:22:46,244 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:22:46,257 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:22:46,260 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:22:46,294 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size 78 [2021-05-03 00:22:46,320 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (+ v_main_~c~0_3176 1) v_~SIZE~0_570) (< v_main_~c~0_3176 v_~last~0_575)) InVars {~SIZE~0=v_~SIZE~0_570, main_~c~0=v_main_~c~0_3176, ~last~0=v_~last~0_575} OutVars{~SIZE~0=v_~SIZE~0_570, main_~c~0=v_main_~c~0_3176, ~last~0=v_~last~0_575} AuxVars[] AssignedVars[] [2021-05-03 00:22:46,321 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:22:46,322 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:22:46,324 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:22:46,343 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:22:46,350 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:22:46,379 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:22:46,401 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:22:46,403 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_~last~0_576 v_main_~c~0_3178) (< v_main_~c~0_3178 v_~SIZE~0_571)) InVars {~SIZE~0=v_~SIZE~0_571, main_~c~0=v_main_~c~0_3178, ~last~0=v_~last~0_576} OutVars{~SIZE~0=v_~SIZE~0_571, main_~c~0=v_main_~c~0_3178, ~last~0=v_~last~0_576} AuxVars[] AssignedVars[] [2021-05-03 00:22:46,405 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:22:46,406 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:22:46,407 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:22:46,417 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:22:46,420 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:22:46,453 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:22:46,477 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_3180 v_~SIZE~0_572) (< v_main_~c~0_3180 v_~last~0_577)) InVars {~SIZE~0=v_~SIZE~0_572, main_~c~0=v_main_~c~0_3180, ~last~0=v_~last~0_577} OutVars{~SIZE~0=v_~SIZE~0_572, main_~c~0=v_main_~c~0_3180, ~last~0=v_~last~0_577} AuxVars[] AssignedVars[] [2021-05-03 00:22:46,479 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size [2021-05-03 00:22:46,493 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:22:46,495 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:22:46,510 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:22:46,515 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:22:46,531 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size 66 [2021-05-03 00:22:46,556 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:22:46,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:22:46,631 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:22:46,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:22:46,635 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:22:46,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:22:46,637 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:22:46,639 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:22:47,834 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:22:47,834 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [669967329] [2021-05-03 00:22:47,834 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [669967329] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:22:47,834 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:22:47,834 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [32] imperfect sequences [] total 32 [2021-05-03 00:22:47,834 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [377712073] [2021-05-03 00:22:47,834 INFO L460 AbstractCegarLoop]: Interpolant automaton has 32 states [2021-05-03 00:22:47,834 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:22:47,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2021-05-03 00:22:47,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=984, Unknown=0, NotChecked=0, Total=1122 [2021-05-03 00:22:47,835 INFO L87 Difference]: Start difference. First operand 404 states and 486 transitions. Second operand has 32 states, 32 states have (on average 2.09375) internal successors, (67), 31 states have internal predecessors, (67), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:22:51,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:22:51,235 INFO L93 Difference]: Finished difference Result 858 states and 1009 transitions. [2021-05-03 00:22:51,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2021-05-03 00:22:51,237 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 2.09375) internal successors, (67), 31 states have internal predecessors, (67), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 73 [2021-05-03 00:22:51,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:22:51,238 INFO L225 Difference]: With dead ends: 858 [2021-05-03 00:22:51,238 INFO L226 Difference]: Without dead ends: 516 [2021-05-03 00:22:51,238 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 12 SyntacticMatches, 26 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 759 ImplicationChecksByTransitivity, 1254.2ms TimeCoverageRelationStatistics Valid=161, Invalid=1099, Unknown=0, NotChecked=0, Total=1260 [2021-05-03 00:22:51,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 516 states. [2021-05-03 00:22:52,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 516 to 404. [2021-05-03 00:22:52,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 404 states, 394 states have (on average 1.2055837563451777) internal successors, (475), 394 states have internal predecessors, (475), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:22:52,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 404 states to 404 states and 486 transitions. [2021-05-03 00:22:52,223 INFO L78 Accepts]: Start accepts. Automaton has 404 states and 486 transitions. Word has length 73 [2021-05-03 00:22:52,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:22:52,223 INFO L480 AbstractCegarLoop]: Abstraction has 404 states and 486 transitions. [2021-05-03 00:22:52,223 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 32 states, 32 states have (on average 2.09375) internal successors, (67), 31 states have internal predecessors, (67), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:22:52,224 INFO L276 IsEmpty]: Start isEmpty. Operand 404 states and 486 transitions. [2021-05-03 00:22:52,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2021-05-03 00:22:52,224 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:22:52,224 INFO L523 BasicCegarLoop]: trace histogram [17, 17, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:22:52,224 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable726 [2021-05-03 00:22:52,224 INFO L428 AbstractCegarLoop]: === Iteration 167 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:22:52,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:22:52,225 INFO L82 PathProgramCache]: Analyzing trace with hash 1285241117, now seen corresponding path program 128 times [2021-05-03 00:22:52,225 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:22:52,225 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [301289732] [2021-05-03 00:22:52,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:22:52,234 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (+ v_main_~c~0_3201 1) v_~SIZE~0_573) (<= v_~last~0_578 v_main_~c~0_3201)) InVars {~SIZE~0=v_~SIZE~0_573, main_~c~0=v_main_~c~0_3201, ~last~0=v_~last~0_578} OutVars{~SIZE~0=v_~SIZE~0_573, main_~c~0=v_main_~c~0_3201, ~last~0=v_~last~0_578} AuxVars[] AssignedVars[] [2021-05-03 00:22:52,237 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size [2021-05-03 00:22:52,270 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:22:52,272 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:22:52,292 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:22:52,296 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:22:52,325 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size 78 [2021-05-03 00:22:52,370 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_3203 v_~last~0_579) (< (+ v_main_~c~0_3203 1) v_~SIZE~0_574)) InVars {~SIZE~0=v_~SIZE~0_574, main_~c~0=v_main_~c~0_3203, ~last~0=v_~last~0_579} OutVars{~SIZE~0=v_~SIZE~0_574, main_~c~0=v_main_~c~0_3203, ~last~0=v_~last~0_579} AuxVars[] AssignedVars[] [2021-05-03 00:22:52,372 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:22:52,394 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:22:52,396 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:22:52,410 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:22:52,419 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:22:52,448 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:22:52,491 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:22:52,494 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_~last~0_580 v_main_~c~0_3205) (< v_main_~c~0_3205 v_~SIZE~0_575)) InVars {~SIZE~0=v_~SIZE~0_575, main_~c~0=v_main_~c~0_3205, ~last~0=v_~last~0_580} OutVars{~SIZE~0=v_~SIZE~0_575, main_~c~0=v_main_~c~0_3205, ~last~0=v_~last~0_580} AuxVars[] AssignedVars[] [2021-05-03 00:22:52,496 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:22:52,525 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:22:52,527 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:22:52,545 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:22:52,549 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:22:52,578 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:22:52,621 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_3207 v_~SIZE~0_576) (< v_main_~c~0_3207 v_~last~0_581)) InVars {~SIZE~0=v_~SIZE~0_576, main_~c~0=v_main_~c~0_3207, ~last~0=v_~last~0_581} OutVars{~SIZE~0=v_~SIZE~0_576, main_~c~0=v_main_~c~0_3207, ~last~0=v_~last~0_581} AuxVars[] AssignedVars[] [2021-05-03 00:22:52,643 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size [2021-05-03 00:22:52,645 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:22:52,647 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:22:52,696 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:22:52,706 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:22:52,762 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size 66 [2021-05-03 00:22:52,807 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:22:52,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:22:52,872 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:22:52,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:22:52,876 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:22:52,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:22:52,878 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:22:52,881 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:22:54,423 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:22:54,424 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [301289732] [2021-05-03 00:22:54,424 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [301289732] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:22:54,424 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:22:54,424 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [33] imperfect sequences [] total 33 [2021-05-03 00:22:54,424 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800667594] [2021-05-03 00:22:54,424 INFO L460 AbstractCegarLoop]: Interpolant automaton has 33 states [2021-05-03 00:22:54,424 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:22:54,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2021-05-03 00:22:54,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=983, Unknown=0, NotChecked=0, Total=1122 [2021-05-03 00:22:54,425 INFO L87 Difference]: Start difference. First operand 404 states and 486 transitions. Second operand has 33 states, 33 states have (on average 2.0303030303030303) internal successors, (67), 32 states have internal predecessors, (67), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:22:57,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:22:57,196 INFO L93 Difference]: Finished difference Result 839 states and 994 transitions. [2021-05-03 00:22:57,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2021-05-03 00:22:57,198 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 2.0303030303030303) internal successors, (67), 32 states have internal predecessors, (67), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 73 [2021-05-03 00:22:57,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:22:57,199 INFO L225 Difference]: With dead ends: 839 [2021-05-03 00:22:57,199 INFO L226 Difference]: Without dead ends: 497 [2021-05-03 00:22:57,200 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 12 SyntacticMatches, 25 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 746 ImplicationChecksByTransitivity, 1593.4ms TimeCoverageRelationStatistics Valid=165, Invalid=1095, Unknown=0, NotChecked=0, Total=1260 [2021-05-03 00:22:57,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 497 states. [2021-05-03 00:22:58,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 497 to 404. [2021-05-03 00:22:58,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 404 states, 394 states have (on average 1.2055837563451777) internal successors, (475), 394 states have internal predecessors, (475), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:22:58,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 404 states to 404 states and 486 transitions. [2021-05-03 00:22:58,085 INFO L78 Accepts]: Start accepts. Automaton has 404 states and 486 transitions. Word has length 73 [2021-05-03 00:22:58,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:22:58,085 INFO L480 AbstractCegarLoop]: Abstraction has 404 states and 486 transitions. [2021-05-03 00:22:58,085 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 33 states, 33 states have (on average 2.0303030303030303) internal successors, (67), 32 states have internal predecessors, (67), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:22:58,085 INFO L276 IsEmpty]: Start isEmpty. Operand 404 states and 486 transitions. [2021-05-03 00:22:58,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2021-05-03 00:22:58,086 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:22:58,086 INFO L523 BasicCegarLoop]: trace histogram [17, 17, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:22:58,086 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable731 [2021-05-03 00:22:58,086 INFO L428 AbstractCegarLoop]: === Iteration 168 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:22:58,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:22:58,086 INFO L82 PathProgramCache]: Analyzing trace with hash 441235615, now seen corresponding path program 129 times [2021-05-03 00:22:58,086 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:22:58,086 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [697348613] [2021-05-03 00:22:58,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:22:58,095 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (+ v_main_~c~0_3228 1) v_~SIZE~0_577) (<= v_~last~0_582 v_main_~c~0_3228)) InVars {~SIZE~0=v_~SIZE~0_577, main_~c~0=v_main_~c~0_3228, ~last~0=v_~last~0_582} OutVars{~SIZE~0=v_~SIZE~0_577, main_~c~0=v_main_~c~0_3228, ~last~0=v_~last~0_582} AuxVars[] AssignedVars[] [2021-05-03 00:22:58,098 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size [2021-05-03 00:22:58,099 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:22:58,102 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:22:58,153 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:22:58,160 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:22:58,214 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size 78 [2021-05-03 00:22:58,257 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (+ v_main_~c~0_3230 1) v_~SIZE~0_578) (< v_main_~c~0_3230 v_~last~0_583)) InVars {~SIZE~0=v_~SIZE~0_578, main_~c~0=v_main_~c~0_3230, ~last~0=v_~last~0_583} OutVars{~SIZE~0=v_~SIZE~0_578, main_~c~0=v_main_~c~0_3230, ~last~0=v_~last~0_583} AuxVars[] AssignedVars[] [2021-05-03 00:22:58,259 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:22:58,260 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:22:58,264 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:22:58,290 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:22:58,301 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:22:58,355 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:22:58,407 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:22:58,414 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_~last~0_584 v_main_~c~0_3232) (< v_main_~c~0_3232 v_~SIZE~0_579)) InVars {~SIZE~0=v_~SIZE~0_579, main_~c~0=v_main_~c~0_3232, ~last~0=v_~last~0_584} OutVars{~SIZE~0=v_~SIZE~0_579, main_~c~0=v_main_~c~0_3232, ~last~0=v_~last~0_584} AuxVars[] AssignedVars[] [2021-05-03 00:22:58,417 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:22:58,459 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:22:58,462 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:22:58,485 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:22:58,492 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:22:58,528 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:22:58,587 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_3234 v_~SIZE~0_580) (< v_main_~c~0_3234 v_~last~0_585)) InVars {~SIZE~0=v_~SIZE~0_580, main_~c~0=v_main_~c~0_3234, ~last~0=v_~last~0_585} OutVars{~SIZE~0=v_~SIZE~0_580, main_~c~0=v_main_~c~0_3234, ~last~0=v_~last~0_585} AuxVars[] AssignedVars[] [2021-05-03 00:22:58,589 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size [2021-05-03 00:22:58,618 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:22:58,621 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:22:58,655 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:22:58,667 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:22:58,703 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size 66 [2021-05-03 00:22:58,762 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:22:58,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:22:58,921 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:22:58,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:22:58,927 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:22:58,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:22:58,958 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:22:58,963 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:23:00,644 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:23:00,645 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [697348613] [2021-05-03 00:23:00,645 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [697348613] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:23:00,645 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:23:00,645 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [34] imperfect sequences [] total 34 [2021-05-03 00:23:00,645 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399833984] [2021-05-03 00:23:00,645 INFO L460 AbstractCegarLoop]: Interpolant automaton has 34 states [2021-05-03 00:23:00,645 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:23:00,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2021-05-03 00:23:00,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=1106, Unknown=0, NotChecked=0, Total=1260 [2021-05-03 00:23:00,646 INFO L87 Difference]: Start difference. First operand 404 states and 486 transitions. Second operand has 34 states, 34 states have (on average 1.9705882352941178) internal successors, (67), 33 states have internal predecessors, (67), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:23:03,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:23:03,073 INFO L93 Difference]: Finished difference Result 846 states and 997 transitions. [2021-05-03 00:23:03,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2021-05-03 00:23:03,075 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 1.9705882352941178) internal successors, (67), 33 states have internal predecessors, (67), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 73 [2021-05-03 00:23:03,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:23:03,075 INFO L225 Difference]: With dead ends: 846 [2021-05-03 00:23:03,075 INFO L226 Difference]: Without dead ends: 504 [2021-05-03 00:23:03,076 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 12 SyntacticMatches, 24 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 818 ImplicationChecksByTransitivity, 1770.1ms TimeCoverageRelationStatistics Valid=181, Invalid=1225, Unknown=0, NotChecked=0, Total=1406 [2021-05-03 00:23:03,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 504 states. [2021-05-03 00:23:03,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 504 to 404. [2021-05-03 00:23:03,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 404 states, 394 states have (on average 1.2055837563451777) internal successors, (475), 394 states have internal predecessors, (475), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:23:03,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 404 states to 404 states and 486 transitions. [2021-05-03 00:23:03,824 INFO L78 Accepts]: Start accepts. Automaton has 404 states and 486 transitions. Word has length 73 [2021-05-03 00:23:03,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:23:03,824 INFO L480 AbstractCegarLoop]: Abstraction has 404 states and 486 transitions. [2021-05-03 00:23:03,824 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 34 states, 34 states have (on average 1.9705882352941178) internal successors, (67), 33 states have internal predecessors, (67), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:23:03,824 INFO L276 IsEmpty]: Start isEmpty. Operand 404 states and 486 transitions. [2021-05-03 00:23:03,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2021-05-03 00:23:03,824 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:23:03,824 INFO L523 BasicCegarLoop]: trace histogram [17, 17, 10, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:23:03,824 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable736 [2021-05-03 00:23:03,825 INFO L428 AbstractCegarLoop]: === Iteration 169 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:23:03,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:23:03,825 INFO L82 PathProgramCache]: Analyzing trace with hash 715995229, now seen corresponding path program 130 times [2021-05-03 00:23:03,825 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:23:03,825 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1619627230] [2021-05-03 00:23:03,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:23:03,831 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_~last~0_586 v_main_~c~0_3255) (< (+ v_main_~c~0_3255 1) v_~SIZE~0_581)) InVars {~SIZE~0=v_~SIZE~0_581, main_~c~0=v_main_~c~0_3255, ~last~0=v_~last~0_586} OutVars{~SIZE~0=v_~SIZE~0_581, main_~c~0=v_main_~c~0_3255, ~last~0=v_~last~0_586} AuxVars[] AssignedVars[] [2021-05-03 00:23:03,833 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size [2021-05-03 00:23:03,834 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:23:03,835 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:23:03,844 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:23:03,847 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:23:03,878 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size 78 [2021-05-03 00:23:03,902 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (+ v_main_~c~0_3257 1) v_~SIZE~0_582) (< v_main_~c~0_3257 v_~last~0_587)) InVars {~SIZE~0=v_~SIZE~0_582, main_~c~0=v_main_~c~0_3257, ~last~0=v_~last~0_587} OutVars{~SIZE~0=v_~SIZE~0_582, main_~c~0=v_main_~c~0_3257, ~last~0=v_~last~0_587} AuxVars[] AssignedVars[] [2021-05-03 00:23:03,903 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:23:03,916 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:23:03,918 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:23:03,931 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:23:03,936 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:23:03,950 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:23:03,971 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:23:03,974 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_3259 v_~SIZE~0_583) (<= v_~last~0_588 v_main_~c~0_3259)) InVars {~SIZE~0=v_~SIZE~0_583, main_~c~0=v_main_~c~0_3259, ~last~0=v_~last~0_588} OutVars{~SIZE~0=v_~SIZE~0_583, main_~c~0=v_main_~c~0_3259, ~last~0=v_~last~0_588} AuxVars[] AssignedVars[] [2021-05-03 00:23:03,975 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:23:03,992 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:23:03,993 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:23:04,003 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:23:04,006 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:23:04,023 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:23:04,046 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_3261 v_~SIZE~0_584) (< v_main_~c~0_3261 v_~last~0_589)) InVars {~SIZE~0=v_~SIZE~0_584, main_~c~0=v_main_~c~0_3261, ~last~0=v_~last~0_589} OutVars{~SIZE~0=v_~SIZE~0_584, main_~c~0=v_main_~c~0_3261, ~last~0=v_~last~0_589} AuxVars[] AssignedVars[] [2021-05-03 00:23:04,047 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size [2021-05-03 00:23:04,048 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:23:04,049 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:23:04,063 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:23:04,068 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:23:04,094 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size 66 [2021-05-03 00:23:04,116 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:23:04,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:23:04,179 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:23:04,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:23:04,183 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:23:04,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:23:04,184 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:23:04,187 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:23:05,364 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:23:05,364 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1619627230] [2021-05-03 00:23:05,365 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1619627230] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:23:05,365 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:23:05,365 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [35] imperfect sequences [] total 35 [2021-05-03 00:23:05,365 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624951209] [2021-05-03 00:23:05,365 INFO L460 AbstractCegarLoop]: Interpolant automaton has 35 states [2021-05-03 00:23:05,365 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:23:05,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2021-05-03 00:23:05,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=1105, Unknown=0, NotChecked=0, Total=1260 [2021-05-03 00:23:05,366 INFO L87 Difference]: Start difference. First operand 404 states and 486 transitions. Second operand has 35 states, 35 states have (on average 1.9142857142857144) internal successors, (67), 34 states have internal predecessors, (67), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:23:08,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:23:08,443 INFO L93 Difference]: Finished difference Result 821 states and 976 transitions. [2021-05-03 00:23:08,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2021-05-03 00:23:08,444 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 1.9142857142857144) internal successors, (67), 34 states have internal predecessors, (67), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 73 [2021-05-03 00:23:08,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:23:08,445 INFO L225 Difference]: With dead ends: 821 [2021-05-03 00:23:08,445 INFO L226 Difference]: Without dead ends: 479 [2021-05-03 00:23:08,446 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 15 SyntacticMatches, 20 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 717 ImplicationChecksByTransitivity, 1247.9ms TimeCoverageRelationStatistics Valid=185, Invalid=1221, Unknown=0, NotChecked=0, Total=1406 [2021-05-03 00:23:08,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 479 states. [2021-05-03 00:23:09,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 479 to 404. [2021-05-03 00:23:09,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 404 states, 394 states have (on average 1.2055837563451777) internal successors, (475), 394 states have internal predecessors, (475), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:23:09,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 404 states to 404 states and 486 transitions. [2021-05-03 00:23:09,219 INFO L78 Accepts]: Start accepts. Automaton has 404 states and 486 transitions. Word has length 73 [2021-05-03 00:23:09,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:23:09,220 INFO L480 AbstractCegarLoop]: Abstraction has 404 states and 486 transitions. [2021-05-03 00:23:09,220 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 35 states, 35 states have (on average 1.9142857142857144) internal successors, (67), 34 states have internal predecessors, (67), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:23:09,220 INFO L276 IsEmpty]: Start isEmpty. Operand 404 states and 486 transitions. [2021-05-03 00:23:09,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2021-05-03 00:23:09,220 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:23:09,220 INFO L523 BasicCegarLoop]: trace histogram [17, 17, 11, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:23:09,220 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable741 [2021-05-03 00:23:09,220 INFO L428 AbstractCegarLoop]: === Iteration 170 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:23:09,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:23:09,221 INFO L82 PathProgramCache]: Analyzing trace with hash 2102198623, now seen corresponding path program 131 times [2021-05-03 00:23:09,221 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:23:09,221 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1676659199] [2021-05-03 00:23:09,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:23:09,228 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (+ v_main_~c~0_3282 1) v_~SIZE~0_585) (<= v_~last~0_590 v_main_~c~0_3282)) InVars {~SIZE~0=v_~SIZE~0_585, main_~c~0=v_main_~c~0_3282, ~last~0=v_~last~0_590} OutVars{~SIZE~0=v_~SIZE~0_585, main_~c~0=v_main_~c~0_3282, ~last~0=v_~last~0_590} AuxVars[] AssignedVars[] [2021-05-03 00:23:09,230 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size [2021-05-03 00:23:09,231 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:23:09,232 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:23:09,243 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:23:09,246 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:23:09,278 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size 78 [2021-05-03 00:23:09,302 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (+ v_main_~c~0_3284 1) v_~SIZE~0_586) (< v_main_~c~0_3284 v_~last~0_591)) InVars {~SIZE~0=v_~SIZE~0_586, main_~c~0=v_main_~c~0_3284, ~last~0=v_~last~0_591} OutVars{~SIZE~0=v_~SIZE~0_586, main_~c~0=v_main_~c~0_3284, ~last~0=v_~last~0_591} AuxVars[] AssignedVars[] [2021-05-03 00:23:09,303 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:23:09,304 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:23:09,321 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:23:09,335 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:23:09,340 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:23:09,366 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:23:09,388 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:23:09,390 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_3286 v_~SIZE~0_587) (<= v_~last~0_592 v_main_~c~0_3286)) InVars {~SIZE~0=v_~SIZE~0_587, main_~c~0=v_main_~c~0_3286, ~last~0=v_~last~0_592} OutVars{~SIZE~0=v_~SIZE~0_587, main_~c~0=v_main_~c~0_3286, ~last~0=v_~last~0_592} AuxVars[] AssignedVars[] [2021-05-03 00:23:09,391 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:23:09,408 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:23:09,410 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:23:09,421 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:23:09,424 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:23:09,442 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:23:09,466 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_3288 v_~SIZE~0_588) (< v_main_~c~0_3288 v_~last~0_593)) InVars {~SIZE~0=v_~SIZE~0_588, main_~c~0=v_main_~c~0_3288, ~last~0=v_~last~0_593} OutVars{~SIZE~0=v_~SIZE~0_588, main_~c~0=v_main_~c~0_3288, ~last~0=v_~last~0_593} AuxVars[] AssignedVars[] [2021-05-03 00:23:09,467 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size [2021-05-03 00:23:09,468 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:23:09,469 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:23:09,483 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:23:09,488 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:23:09,514 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size 66 [2021-05-03 00:23:09,536 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:23:09,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:23:09,603 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:23:09,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:23:09,608 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:23:09,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:23:09,610 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:23:09,613 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:23:10,915 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:23:10,915 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1676659199] [2021-05-03 00:23:10,916 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1676659199] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:23:10,916 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:23:10,916 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [36] imperfect sequences [] total 36 [2021-05-03 00:23:10,916 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127901584] [2021-05-03 00:23:10,916 INFO L460 AbstractCegarLoop]: Interpolant automaton has 36 states [2021-05-03 00:23:10,916 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:23:10,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2021-05-03 00:23:10,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=1169, Unknown=0, NotChecked=0, Total=1332 [2021-05-03 00:23:10,917 INFO L87 Difference]: Start difference. First operand 404 states and 486 transitions. Second operand has 36 states, 36 states have (on average 1.8611111111111112) internal successors, (67), 35 states have internal predecessors, (67), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:23:13,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:23:13,604 INFO L93 Difference]: Finished difference Result 812 states and 967 transitions. [2021-05-03 00:23:13,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2021-05-03 00:23:13,605 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 1.8611111111111112) internal successors, (67), 35 states have internal predecessors, (67), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 73 [2021-05-03 00:23:13,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:23:13,605 INFO L225 Difference]: With dead ends: 812 [2021-05-03 00:23:13,605 INFO L226 Difference]: Without dead ends: 470 [2021-05-03 00:23:13,606 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 12 SyntacticMatches, 22 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 797 ImplicationChecksByTransitivity, 1325.6ms TimeCoverageRelationStatistics Valid=195, Invalid=1287, Unknown=0, NotChecked=0, Total=1482 [2021-05-03 00:23:13,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 470 states. [2021-05-03 00:23:14,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 470 to 404. [2021-05-03 00:23:14,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 404 states, 394 states have (on average 1.2055837563451777) internal successors, (475), 394 states have internal predecessors, (475), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:23:14,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 404 states to 404 states and 486 transitions. [2021-05-03 00:23:14,341 INFO L78 Accepts]: Start accepts. Automaton has 404 states and 486 transitions. Word has length 73 [2021-05-03 00:23:14,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:23:14,341 INFO L480 AbstractCegarLoop]: Abstraction has 404 states and 486 transitions. [2021-05-03 00:23:14,341 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 36 states, 36 states have (on average 1.8611111111111112) internal successors, (67), 35 states have internal predecessors, (67), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:23:14,341 INFO L276 IsEmpty]: Start isEmpty. Operand 404 states and 486 transitions. [2021-05-03 00:23:14,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2021-05-03 00:23:14,341 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:23:14,342 INFO L523 BasicCegarLoop]: trace histogram [17, 17, 12, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:23:14,342 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable746 [2021-05-03 00:23:14,342 INFO L428 AbstractCegarLoop]: === Iteration 171 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:23:14,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:23:14,342 INFO L82 PathProgramCache]: Analyzing trace with hash -2130729059, now seen corresponding path program 132 times [2021-05-03 00:23:14,342 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:23:14,342 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [172360838] [2021-05-03 00:23:14,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:23:14,349 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (+ v_main_~c~0_3309 1) v_~SIZE~0_589) (<= v_~last~0_594 v_main_~c~0_3309)) InVars {~SIZE~0=v_~SIZE~0_589, main_~c~0=v_main_~c~0_3309, ~last~0=v_~last~0_594} OutVars{~SIZE~0=v_~SIZE~0_589, main_~c~0=v_main_~c~0_3309, ~last~0=v_~last~0_594} AuxVars[] AssignedVars[] [2021-05-03 00:23:14,351 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size [2021-05-03 00:23:14,366 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:23:14,368 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:23:14,379 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:23:14,381 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:23:14,400 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size 78 [2021-05-03 00:23:14,423 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_3311 v_~last~0_595) (< (+ v_main_~c~0_3311 1) v_~SIZE~0_590)) InVars {~SIZE~0=v_~SIZE~0_590, main_~c~0=v_main_~c~0_3311, ~last~0=v_~last~0_595} OutVars{~SIZE~0=v_~SIZE~0_590, main_~c~0=v_main_~c~0_3311, ~last~0=v_~last~0_595} AuxVars[] AssignedVars[] [2021-05-03 00:23:14,425 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:23:14,438 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:23:14,439 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:23:14,453 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:23:14,458 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:23:14,473 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:23:14,495 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:23:14,498 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_3313 v_~SIZE~0_591) (<= v_~last~0_596 v_main_~c~0_3313)) InVars {~SIZE~0=v_~SIZE~0_591, main_~c~0=v_main_~c~0_3313, ~last~0=v_~last~0_596} OutVars{~SIZE~0=v_~SIZE~0_591, main_~c~0=v_main_~c~0_3313, ~last~0=v_~last~0_596} AuxVars[] AssignedVars[] [2021-05-03 00:23:14,499 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:23:14,518 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:23:14,520 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:23:14,530 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:23:14,533 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:23:14,550 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:23:14,573 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_3315 v_~SIZE~0_592) (< v_main_~c~0_3315 v_~last~0_597)) InVars {~SIZE~0=v_~SIZE~0_592, main_~c~0=v_main_~c~0_3315, ~last~0=v_~last~0_597} OutVars{~SIZE~0=v_~SIZE~0_592, main_~c~0=v_main_~c~0_3315, ~last~0=v_~last~0_597} AuxVars[] AssignedVars[] [2021-05-03 00:23:14,574 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size [2021-05-03 00:23:14,587 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:23:14,588 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:23:14,602 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:23:14,607 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:23:14,622 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size 66 [2021-05-03 00:23:14,645 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:23:14,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:23:14,702 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:23:14,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:23:14,706 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:23:14,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:23:14,707 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:23:14,710 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:23:16,028 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:23:16,028 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [172360838] [2021-05-03 00:23:16,028 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [172360838] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:23:16,028 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:23:16,028 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [37] imperfect sequences [] total 37 [2021-05-03 00:23:16,028 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2073270695] [2021-05-03 00:23:16,029 INFO L460 AbstractCegarLoop]: Interpolant automaton has 37 states [2021-05-03 00:23:16,029 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:23:16,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2021-05-03 00:23:16,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=1235, Unknown=0, NotChecked=0, Total=1406 [2021-05-03 00:23:16,029 INFO L87 Difference]: Start difference. First operand 404 states and 486 transitions. Second operand has 37 states, 37 states have (on average 1.8108108108108107) internal successors, (67), 36 states have internal predecessors, (67), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:23:18,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:23:18,615 INFO L93 Difference]: Finished difference Result 803 states and 958 transitions. [2021-05-03 00:23:18,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2021-05-03 00:23:18,617 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 1.8108108108108107) internal successors, (67), 36 states have internal predecessors, (67), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 73 [2021-05-03 00:23:18,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:23:18,617 INFO L225 Difference]: With dead ends: 803 [2021-05-03 00:23:18,617 INFO L226 Difference]: Without dead ends: 461 [2021-05-03 00:23:18,618 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 13 SyntacticMatches, 20 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 768 ImplicationChecksByTransitivity, 1343.8ms TimeCoverageRelationStatistics Valid=205, Invalid=1355, Unknown=0, NotChecked=0, Total=1560 [2021-05-03 00:23:18,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 461 states. [2021-05-03 00:23:19,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 461 to 404. [2021-05-03 00:23:19,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 404 states, 394 states have (on average 1.2055837563451777) internal successors, (475), 394 states have internal predecessors, (475), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:23:19,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 404 states to 404 states and 486 transitions. [2021-05-03 00:23:19,530 INFO L78 Accepts]: Start accepts. Automaton has 404 states and 486 transitions. Word has length 73 [2021-05-03 00:23:19,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:23:19,530 INFO L480 AbstractCegarLoop]: Abstraction has 404 states and 486 transitions. [2021-05-03 00:23:19,530 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 37 states, 37 states have (on average 1.8108108108108107) internal successors, (67), 36 states have internal predecessors, (67), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:23:19,530 INFO L276 IsEmpty]: Start isEmpty. Operand 404 states and 486 transitions. [2021-05-03 00:23:19,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2021-05-03 00:23:19,530 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:23:19,530 INFO L523 BasicCegarLoop]: trace histogram [17, 17, 13, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:23:19,530 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable751 [2021-05-03 00:23:19,530 INFO L428 AbstractCegarLoop]: === Iteration 172 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:23:19,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:23:19,531 INFO L82 PathProgramCache]: Analyzing trace with hash 358799903, now seen corresponding path program 133 times [2021-05-03 00:23:19,531 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:23:19,531 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1409334173] [2021-05-03 00:23:19,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:23:19,543 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_~last~0_598 v_main_~c~0_3336) (< (+ v_main_~c~0_3336 1) v_~SIZE~0_593)) InVars {~SIZE~0=v_~SIZE~0_593, main_~c~0=v_main_~c~0_3336, ~last~0=v_~last~0_598} OutVars{~SIZE~0=v_~SIZE~0_593, main_~c~0=v_main_~c~0_3336, ~last~0=v_~last~0_598} AuxVars[] AssignedVars[] [2021-05-03 00:23:19,545 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size [2021-05-03 00:23:19,546 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:23:19,549 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:23:19,576 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:23:19,583 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:23:19,643 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size 78 [2021-05-03 00:23:19,704 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_3338 v_~last~0_599) (< (+ v_main_~c~0_3338 1) v_~SIZE~0_594)) InVars {~SIZE~0=v_~SIZE~0_594, main_~c~0=v_main_~c~0_3338, ~last~0=v_~last~0_599} OutVars{~SIZE~0=v_~SIZE~0_594, main_~c~0=v_main_~c~0_3338, ~last~0=v_~last~0_599} AuxVars[] AssignedVars[] [2021-05-03 00:23:19,707 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:23:19,708 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:23:19,711 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:23:19,741 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:23:19,753 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:23:19,815 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:23:19,870 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:23:19,873 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_3340 v_~SIZE~0_595) (<= v_~last~0_600 v_main_~c~0_3340)) InVars {~SIZE~0=v_~SIZE~0_595, main_~c~0=v_main_~c~0_3340, ~last~0=v_~last~0_600} OutVars{~SIZE~0=v_~SIZE~0_595, main_~c~0=v_main_~c~0_3340, ~last~0=v_~last~0_600} AuxVars[] AssignedVars[] [2021-05-03 00:23:19,875 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:23:19,876 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:23:19,878 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:23:19,900 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:23:19,908 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:23:19,956 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:23:20,020 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_3342 v_~SIZE~0_596) (< v_main_~c~0_3342 v_~last~0_601)) InVars {~SIZE~0=v_~SIZE~0_596, main_~c~0=v_main_~c~0_3342, ~last~0=v_~last~0_601} OutVars{~SIZE~0=v_~SIZE~0_596, main_~c~0=v_main_~c~0_3342, ~last~0=v_~last~0_601} AuxVars[] AssignedVars[] [2021-05-03 00:23:20,022 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size [2021-05-03 00:23:20,023 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:23:20,025 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:23:20,048 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:23:20,061 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:23:20,129 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size 66 [2021-05-03 00:23:20,191 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:23:20,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:23:20,372 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:23:20,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:23:20,376 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:23:20,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:23:20,379 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:23:20,382 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:23:22,261 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:23:22,261 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1409334173] [2021-05-03 00:23:22,262 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1409334173] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:23:22,262 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:23:22,262 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [38] imperfect sequences [] total 38 [2021-05-03 00:23:22,262 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [642508626] [2021-05-03 00:23:22,262 INFO L460 AbstractCegarLoop]: Interpolant automaton has 38 states [2021-05-03 00:23:22,262 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:23:22,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2021-05-03 00:23:22,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=186, Invalid=1374, Unknown=0, NotChecked=0, Total=1560 [2021-05-03 00:23:22,263 INFO L87 Difference]: Start difference. First operand 404 states and 486 transitions. Second operand has 38 states, 38 states have (on average 1.763157894736842) internal successors, (67), 37 states have internal predecessors, (67), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:23:26,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:23:26,113 INFO L93 Difference]: Finished difference Result 822 states and 973 transitions. [2021-05-03 00:23:26,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2021-05-03 00:23:26,116 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 1.763157894736842) internal successors, (67), 37 states have internal predecessors, (67), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 73 [2021-05-03 00:23:26,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:23:26,118 INFO L225 Difference]: With dead ends: 822 [2021-05-03 00:23:26,118 INFO L226 Difference]: Without dead ends: 480 [2021-05-03 00:23:26,118 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 12 SyntacticMatches, 20 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 828 ImplicationChecksByTransitivity, 1982.6ms TimeCoverageRelationStatistics Valid=221, Invalid=1501, Unknown=0, NotChecked=0, Total=1722 [2021-05-03 00:23:26,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 480 states. [2021-05-03 00:23:27,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 480 to 404. [2021-05-03 00:23:27,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 404 states, 394 states have (on average 1.2055837563451777) internal successors, (475), 394 states have internal predecessors, (475), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:23:27,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 404 states to 404 states and 486 transitions. [2021-05-03 00:23:27,104 INFO L78 Accepts]: Start accepts. Automaton has 404 states and 486 transitions. Word has length 73 [2021-05-03 00:23:27,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:23:27,104 INFO L480 AbstractCegarLoop]: Abstraction has 404 states and 486 transitions. [2021-05-03 00:23:27,104 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 38 states, 38 states have (on average 1.763157894736842) internal successors, (67), 37 states have internal predecessors, (67), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:23:27,104 INFO L276 IsEmpty]: Start isEmpty. Operand 404 states and 486 transitions. [2021-05-03 00:23:27,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2021-05-03 00:23:27,104 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:23:27,104 INFO L523 BasicCegarLoop]: trace histogram [17, 17, 14, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:23:27,104 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable756 [2021-05-03 00:23:27,104 INFO L428 AbstractCegarLoop]: === Iteration 173 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:23:27,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:23:27,105 INFO L82 PathProgramCache]: Analyzing trace with hash -458848547, now seen corresponding path program 134 times [2021-05-03 00:23:27,105 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:23:27,105 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [101148572] [2021-05-03 00:23:27,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:23:27,116 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_~last~0_602 v_main_~c~0_3363) (< (+ v_main_~c~0_3363 1) v_~SIZE~0_597)) InVars {~SIZE~0=v_~SIZE~0_597, main_~c~0=v_main_~c~0_3363, ~last~0=v_~last~0_602} OutVars{~SIZE~0=v_~SIZE~0_597, main_~c~0=v_main_~c~0_3363, ~last~0=v_~last~0_602} AuxVars[] AssignedVars[] [2021-05-03 00:23:27,118 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size [2021-05-03 00:23:27,119 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:23:27,121 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:23:27,132 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:23:27,135 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:23:27,191 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size 78 [2021-05-03 00:23:27,234 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (+ v_main_~c~0_3365 1) v_~SIZE~0_598) (< v_main_~c~0_3365 v_~last~0_603)) InVars {~SIZE~0=v_~SIZE~0_598, main_~c~0=v_main_~c~0_3365, ~last~0=v_~last~0_603} OutVars{~SIZE~0=v_~SIZE~0_598, main_~c~0=v_main_~c~0_3365, ~last~0=v_~last~0_603} AuxVars[] AssignedVars[] [2021-05-03 00:23:27,236 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:23:27,237 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:23:27,241 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:23:27,259 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:23:27,265 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:23:27,315 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:23:27,360 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:23:27,365 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_3367 v_~SIZE~0_599) (<= v_~last~0_604 v_main_~c~0_3367)) InVars {~SIZE~0=v_~SIZE~0_599, main_~c~0=v_main_~c~0_3367, ~last~0=v_~last~0_604} OutVars{~SIZE~0=v_~SIZE~0_599, main_~c~0=v_main_~c~0_3367, ~last~0=v_~last~0_604} AuxVars[] AssignedVars[] [2021-05-03 00:23:27,368 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:23:27,369 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:23:27,371 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:23:27,383 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:23:27,389 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:23:27,446 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:23:27,493 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_3369 v_~last~0_605) (< v_main_~c~0_3369 v_~SIZE~0_600)) InVars {~SIZE~0=v_~SIZE~0_600, main_~c~0=v_main_~c~0_3369, ~last~0=v_~last~0_605} OutVars{~SIZE~0=v_~SIZE~0_600, main_~c~0=v_main_~c~0_3369, ~last~0=v_~last~0_605} AuxVars[] AssignedVars[] [2021-05-03 00:23:27,495 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size [2021-05-03 00:23:27,528 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:23:27,530 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:23:27,552 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:23:27,565 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:23:27,595 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size 66 [2021-05-03 00:23:27,643 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:23:27,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:23:27,758 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:23:27,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:23:27,763 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:23:27,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:23:27,766 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:23:27,771 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:23:29,740 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:23:29,741 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [101148572] [2021-05-03 00:23:29,741 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [101148572] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:23:29,741 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:23:29,741 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [39] imperfect sequences [] total 39 [2021-05-03 00:23:29,741 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [769205237] [2021-05-03 00:23:29,741 INFO L460 AbstractCegarLoop]: Interpolant automaton has 39 states [2021-05-03 00:23:29,741 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:23:29,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2021-05-03 00:23:29,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=187, Invalid=1373, Unknown=0, NotChecked=0, Total=1560 [2021-05-03 00:23:29,742 INFO L87 Difference]: Start difference. First operand 404 states and 486 transitions. Second operand has 39 states, 39 states have (on average 1.7179487179487178) internal successors, (67), 38 states have internal predecessors, (67), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:23:32,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:23:32,386 INFO L93 Difference]: Finished difference Result 785 states and 940 transitions. [2021-05-03 00:23:32,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2021-05-03 00:23:32,388 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 1.7179487179487178) internal successors, (67), 38 states have internal predecessors, (67), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 73 [2021-05-03 00:23:32,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:23:32,388 INFO L225 Difference]: With dead ends: 785 [2021-05-03 00:23:32,388 INFO L226 Difference]: Without dead ends: 443 [2021-05-03 00:23:32,389 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 13 SyntacticMatches, 18 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 735 ImplicationChecksByTransitivity, 2021.1ms TimeCoverageRelationStatistics Valid=225, Invalid=1497, Unknown=0, NotChecked=0, Total=1722 [2021-05-03 00:23:32,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 443 states. [2021-05-03 00:23:33,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 443 to 404. [2021-05-03 00:23:33,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 404 states, 394 states have (on average 1.2055837563451777) internal successors, (475), 394 states have internal predecessors, (475), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:23:33,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 404 states to 404 states and 486 transitions. [2021-05-03 00:23:33,141 INFO L78 Accepts]: Start accepts. Automaton has 404 states and 486 transitions. Word has length 73 [2021-05-03 00:23:33,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:23:33,141 INFO L480 AbstractCegarLoop]: Abstraction has 404 states and 486 transitions. [2021-05-03 00:23:33,141 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 39 states, 39 states have (on average 1.7179487179487178) internal successors, (67), 38 states have internal predecessors, (67), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:23:33,141 INFO L276 IsEmpty]: Start isEmpty. Operand 404 states and 486 transitions. [2021-05-03 00:23:33,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2021-05-03 00:23:33,142 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:23:33,142 INFO L523 BasicCegarLoop]: trace histogram [17, 17, 15, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:23:33,142 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable761 [2021-05-03 00:23:33,142 INFO L428 AbstractCegarLoop]: === Iteration 174 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:23:33,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:23:33,142 INFO L82 PathProgramCache]: Analyzing trace with hash -2047196449, now seen corresponding path program 135 times [2021-05-03 00:23:33,142 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:23:33,142 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1908387343] [2021-05-03 00:23:33,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:23:33,149 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (+ v_main_~c~0_3390 1) v_~SIZE~0_601) (<= v_~last~0_606 v_main_~c~0_3390)) InVars {~SIZE~0=v_~SIZE~0_601, main_~c~0=v_main_~c~0_3390, ~last~0=v_~last~0_606} OutVars{~SIZE~0=v_~SIZE~0_601, main_~c~0=v_main_~c~0_3390, ~last~0=v_~last~0_606} AuxVars[] AssignedVars[] [2021-05-03 00:23:33,151 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size [2021-05-03 00:23:33,167 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:23:33,169 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:23:33,179 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:23:33,182 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:23:33,200 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size 78 [2021-05-03 00:23:33,225 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_3392 v_~last~0_607) (< (+ v_main_~c~0_3392 1) v_~SIZE~0_602)) InVars {~SIZE~0=v_~SIZE~0_602, main_~c~0=v_main_~c~0_3392, ~last~0=v_~last~0_607} OutVars{~SIZE~0=v_~SIZE~0_602, main_~c~0=v_main_~c~0_3392, ~last~0=v_~last~0_607} AuxVars[] AssignedVars[] [2021-05-03 00:23:33,227 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:23:33,228 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:23:33,229 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:23:33,243 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:23:33,249 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:23:33,279 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:23:33,303 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:23:33,305 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_3394 v_~SIZE~0_603) (<= v_~last~0_608 v_main_~c~0_3394)) InVars {~SIZE~0=v_~SIZE~0_603, main_~c~0=v_main_~c~0_3394, ~last~0=v_~last~0_608} OutVars{~SIZE~0=v_~SIZE~0_603, main_~c~0=v_main_~c~0_3394, ~last~0=v_~last~0_608} AuxVars[] AssignedVars[] [2021-05-03 00:23:33,307 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:23:33,324 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:23:33,325 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:23:33,337 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:23:33,340 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:23:33,357 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:23:33,382 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_3396 v_~last~0_609) (< v_main_~c~0_3396 v_~SIZE~0_604)) InVars {~SIZE~0=v_~SIZE~0_604, main_~c~0=v_main_~c~0_3396, ~last~0=v_~last~0_609} OutVars{~SIZE~0=v_~SIZE~0_604, main_~c~0=v_main_~c~0_3396, ~last~0=v_~last~0_609} AuxVars[] AssignedVars[] [2021-05-03 00:23:33,384 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size [2021-05-03 00:23:33,398 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:23:33,399 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:23:33,414 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:23:33,419 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:23:33,434 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size 66 [2021-05-03 00:23:33,458 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:23:33,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:23:33,519 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:23:33,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:23:33,523 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:23:33,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:23:33,524 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:23:33,527 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:23:34,962 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:23:34,962 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1908387343] [2021-05-03 00:23:34,963 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1908387343] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:23:34,963 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:23:34,963 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [40] imperfect sequences [] total 40 [2021-05-03 00:23:34,963 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077405538] [2021-05-03 00:23:34,963 INFO L460 AbstractCegarLoop]: Interpolant automaton has 40 states [2021-05-03 00:23:34,963 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:23:34,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2021-05-03 00:23:34,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=1445, Unknown=0, NotChecked=0, Total=1640 [2021-05-03 00:23:34,964 INFO L87 Difference]: Start difference. First operand 404 states and 486 transitions. Second operand has 40 states, 40 states have (on average 1.675) internal successors, (67), 39 states have internal predecessors, (67), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:23:37,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:23:37,144 INFO L93 Difference]: Finished difference Result 779 states and 934 transitions. [2021-05-03 00:23:37,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2021-05-03 00:23:37,146 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 1.675) internal successors, (67), 39 states have internal predecessors, (67), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 73 [2021-05-03 00:23:37,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:23:37,147 INFO L225 Difference]: With dead ends: 779 [2021-05-03 00:23:37,147 INFO L226 Difference]: Without dead ends: 437 [2021-05-03 00:23:37,148 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 12 SyntacticMatches, 18 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 739 ImplicationChecksByTransitivity, 1448.3ms TimeCoverageRelationStatistics Valid=235, Invalid=1571, Unknown=0, NotChecked=0, Total=1806 [2021-05-03 00:23:37,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 437 states. [2021-05-03 00:23:37,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 437 to 404. [2021-05-03 00:23:37,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 404 states, 394 states have (on average 1.2055837563451777) internal successors, (475), 394 states have internal predecessors, (475), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:23:37,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 404 states to 404 states and 486 transitions. [2021-05-03 00:23:37,985 INFO L78 Accepts]: Start accepts. Automaton has 404 states and 486 transitions. Word has length 73 [2021-05-03 00:23:37,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:23:37,986 INFO L480 AbstractCegarLoop]: Abstraction has 404 states and 486 transitions. [2021-05-03 00:23:37,986 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 40 states, 40 states have (on average 1.675) internal successors, (67), 39 states have internal predecessors, (67), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:23:37,986 INFO L276 IsEmpty]: Start isEmpty. Operand 404 states and 486 transitions. [2021-05-03 00:23:37,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2021-05-03 00:23:37,986 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:23:37,986 INFO L523 BasicCegarLoop]: trace histogram [17, 17, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:23:37,987 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable766 [2021-05-03 00:23:37,987 INFO L428 AbstractCegarLoop]: === Iteration 175 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:23:37,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:23:37,987 INFO L82 PathProgramCache]: Analyzing trace with hash 1236653597, now seen corresponding path program 136 times [2021-05-03 00:23:37,987 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:23:37,987 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [520792085] [2021-05-03 00:23:37,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:23:37,996 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (+ v_main_~c~0_3417 1) v_~SIZE~0_605) (< v_main_~c~0_3417 v_~last~0_610)) InVars {~SIZE~0=v_~SIZE~0_605, main_~c~0=v_main_~c~0_3417, ~last~0=v_~last~0_610} OutVars{~SIZE~0=v_~SIZE~0_605, main_~c~0=v_main_~c~0_3417, ~last~0=v_~last~0_610} AuxVars[] AssignedVars[] [2021-05-03 00:23:37,998 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:23:38,000 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:23:38,002 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:23:38,022 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:23:38,028 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:23:38,061 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:23:38,087 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:23:38,089 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_~last~0_611 v_main_~c~0_3419) (< v_main_~c~0_3419 v_~SIZE~0_606)) InVars {~SIZE~0=v_~SIZE~0_606, main_~c~0=v_main_~c~0_3419, ~last~0=v_~last~0_611} OutVars{~SIZE~0=v_~SIZE~0_606, main_~c~0=v_main_~c~0_3419, ~last~0=v_~last~0_611} AuxVars[] AssignedVars[] [2021-05-03 00:23:38,091 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:23:38,092 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:23:38,093 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:23:38,109 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:23:38,112 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:23:38,152 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:23:38,184 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_3421 v_~SIZE~0_607) (< v_main_~c~0_3421 v_~last~0_612)) InVars {~SIZE~0=v_~SIZE~0_607, main_~c~0=v_main_~c~0_3421, ~last~0=v_~last~0_612} OutVars{~SIZE~0=v_~SIZE~0_607, main_~c~0=v_main_~c~0_3421, ~last~0=v_~last~0_612} AuxVars[] AssignedVars[] [2021-05-03 00:23:38,186 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size [2021-05-03 00:23:38,187 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:23:38,189 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:23:38,208 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:23:38,216 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:23:38,254 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size 66 [2021-05-03 00:23:38,285 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:23:38,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:23:38,451 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:23:38,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:23:38,466 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:23:38,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:23:38,469 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:23:38,471 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:23:40,016 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:23:40,016 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [520792085] [2021-05-03 00:23:40,016 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [520792085] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:23:40,016 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:23:40,016 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [41] imperfect sequences [] total 41 [2021-05-03 00:23:40,016 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1706036738] [2021-05-03 00:23:40,016 INFO L460 AbstractCegarLoop]: Interpolant automaton has 41 states [2021-05-03 00:23:40,016 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:23:40,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2021-05-03 00:23:40,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=203, Invalid=1519, Unknown=0, NotChecked=0, Total=1722 [2021-05-03 00:23:40,017 INFO L87 Difference]: Start difference. First operand 404 states and 486 transitions. Second operand has 41 states, 41 states have (on average 1.6341463414634145) internal successors, (67), 40 states have internal predecessors, (67), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:23:41,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:23:41,976 INFO L93 Difference]: Finished difference Result 779 states and 940 transitions. [2021-05-03 00:23:41,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2021-05-03 00:23:41,977 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 41 states have (on average 1.6341463414634145) internal successors, (67), 40 states have internal predecessors, (67), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 73 [2021-05-03 00:23:41,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:23:41,978 INFO L225 Difference]: With dead ends: 779 [2021-05-03 00:23:41,978 INFO L226 Difference]: Without dead ends: 437 [2021-05-03 00:23:41,979 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 12 SyntacticMatches, 17 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 702 ImplicationChecksByTransitivity, 1655.2ms TimeCoverageRelationStatistics Valid=245, Invalid=1647, Unknown=0, NotChecked=0, Total=1892 [2021-05-03 00:23:41,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 437 states. [2021-05-03 00:23:42,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 437 to 369. [2021-05-03 00:23:42,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 369 states, 359 states have (on average 1.1949860724233983) internal successors, (429), 359 states have internal predecessors, (429), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:23:42,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 369 states and 440 transitions. [2021-05-03 00:23:42,891 INFO L78 Accepts]: Start accepts. Automaton has 369 states and 440 transitions. Word has length 73 [2021-05-03 00:23:42,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:23:42,891 INFO L480 AbstractCegarLoop]: Abstraction has 369 states and 440 transitions. [2021-05-03 00:23:42,892 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 41 states, 41 states have (on average 1.6341463414634145) internal successors, (67), 40 states have internal predecessors, (67), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:23:42,892 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 440 transitions. [2021-05-03 00:23:42,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2021-05-03 00:23:42,892 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:23:42,892 INFO L523 BasicCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:23:42,892 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable770 [2021-05-03 00:23:42,892 INFO L428 AbstractCegarLoop]: === Iteration 176 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:23:42,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:23:42,892 INFO L82 PathProgramCache]: Analyzing trace with hash 1071113247, now seen corresponding path program 17 times [2021-05-03 00:23:42,893 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:23:42,893 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [933932820] [2021-05-03 00:23:42,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:23:42,897 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (+ v_main_~c~0_3442 1) v_~SIZE~0_608) (< v_main_~c~0_3442 v_~last~0_613)) InVars {~SIZE~0=v_~SIZE~0_608, main_~c~0=v_main_~c~0_3442, ~last~0=v_~last~0_613} OutVars{~SIZE~0=v_~SIZE~0_608, main_~c~0=v_main_~c~0_3442, ~last~0=v_~last~0_613} AuxVars[] AssignedVars[] [2021-05-03 00:23:42,899 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:23:42,899 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:23:42,901 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:23:42,917 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:23:42,923 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:23:42,955 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:23:42,982 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:23:42,984 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_3444 v_~SIZE~0_609) (< v_main_~c~0_3444 v_~last~0_614)) InVars {~SIZE~0=v_~SIZE~0_609, main_~c~0=v_main_~c~0_3444, ~last~0=v_~last~0_614} OutVars{~SIZE~0=v_~SIZE~0_609, main_~c~0=v_main_~c~0_3444, ~last~0=v_~last~0_614} AuxVars[] AssignedVars[] [2021-05-03 00:23:42,986 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size [2021-05-03 00:23:43,001 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:23:43,003 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:23:43,019 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:23:43,025 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:23:43,042 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size 66 [2021-05-03 00:23:43,068 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:23:43,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:23:43,357 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:23:43,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:23:43,364 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:23:43,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:23:43,369 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:23:43,513 WARN L205 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 23 [2021-05-03 00:23:46,855 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:23:46,855 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [933932820] [2021-05-03 00:23:46,855 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [933932820] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:23:46,855 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:23:46,855 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [45] imperfect sequences [] total 45 [2021-05-03 00:23:46,855 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276253543] [2021-05-03 00:23:46,855 INFO L460 AbstractCegarLoop]: Interpolant automaton has 45 states [2021-05-03 00:23:46,855 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:23:46,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2021-05-03 00:23:46,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=227, Invalid=1935, Unknown=0, NotChecked=0, Total=2162 [2021-05-03 00:23:46,856 INFO L87 Difference]: Start difference. First operand 369 states and 440 transitions. Second operand has 45 states, 45 states have (on average 1.488888888888889) internal successors, (67), 43 states have internal predecessors, (67), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:23:51,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:23:51,637 INFO L93 Difference]: Finished difference Result 844 states and 1005 transitions. [2021-05-03 00:23:51,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2021-05-03 00:23:51,639 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 45 states have (on average 1.488888888888889) internal successors, (67), 43 states have internal predecessors, (67), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 73 [2021-05-03 00:23:51,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:23:51,640 INFO L225 Difference]: With dead ends: 844 [2021-05-03 00:23:51,640 INFO L226 Difference]: Without dead ends: 493 [2021-05-03 00:23:51,641 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 6 SyntacticMatches, 16 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1222 ImplicationChecksByTransitivity, 4606.0ms TimeCoverageRelationStatistics Valid=373, Invalid=3917, Unknown=0, NotChecked=0, Total=4290 [2021-05-03 00:23:51,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 493 states. [2021-05-03 00:23:52,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 493 to 416. [2021-05-03 00:23:52,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 416 states, 406 states have (on average 1.20935960591133) internal successors, (491), 406 states have internal predecessors, (491), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:23:52,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 502 transitions. [2021-05-03 00:23:52,685 INFO L78 Accepts]: Start accepts. Automaton has 416 states and 502 transitions. Word has length 73 [2021-05-03 00:23:52,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:23:52,685 INFO L480 AbstractCegarLoop]: Abstraction has 416 states and 502 transitions. [2021-05-03 00:23:52,685 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 45 states, 45 states have (on average 1.488888888888889) internal successors, (67), 43 states have internal predecessors, (67), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:23:52,685 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 502 transitions. [2021-05-03 00:23:52,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2021-05-03 00:23:52,686 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:23:52,686 INFO L523 BasicCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:23:52,686 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable773 [2021-05-03 00:23:52,686 INFO L428 AbstractCegarLoop]: === Iteration 177 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:23:52,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:23:52,686 INFO L82 PathProgramCache]: Analyzing trace with hash 503209918, now seen corresponding path program 18 times [2021-05-03 00:23:52,686 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:23:52,686 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [713555705] [2021-05-03 00:23:52,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:23:52,693 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (+ v_main_~c~0_3464 1) v_~SIZE~0_610) (<= v_~last~0_615 v_main_~c~0_3464)) InVars {~SIZE~0=v_~SIZE~0_610, main_~c~0=v_main_~c~0_3464, ~last~0=v_~last~0_615} OutVars{~SIZE~0=v_~SIZE~0_610, main_~c~0=v_main_~c~0_3464, ~last~0=v_~last~0_615} AuxVars[] AssignedVars[] [2021-05-03 00:23:52,695 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size [2021-05-03 00:23:52,696 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:23:52,697 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:23:52,709 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:23:52,717 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:23:52,751 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size 78 [2021-05-03 00:23:52,776 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:23:52,779 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_3466 v_~SIZE~0_611) (<= v_~last~0_616 v_main_~c~0_3466)) InVars {~SIZE~0=v_~SIZE~0_611, main_~c~0=v_main_~c~0_3466, ~last~0=v_~last~0_616} OutVars{~SIZE~0=v_~SIZE~0_611, main_~c~0=v_main_~c~0_3466, ~last~0=v_~last~0_616} AuxVars[] AssignedVars[] [2021-05-03 00:23:52,780 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:23:52,781 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:23:52,782 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:23:52,794 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:23:52,797 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:23:52,830 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:23:52,855 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:23:52,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:23:52,924 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:23:52,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:23:52,929 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:23:52,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:23:52,931 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:23:54,314 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:23:54,314 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [713555705] [2021-05-03 00:23:54,314 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [713555705] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:23:54,314 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:23:54,314 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2021-05-03 00:23:54,314 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1259914456] [2021-05-03 00:23:54,314 INFO L460 AbstractCegarLoop]: Interpolant automaton has 26 states [2021-05-03 00:23:54,314 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:23:54,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2021-05-03 00:23:54,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=606, Unknown=0, NotChecked=0, Total=702 [2021-05-03 00:23:54,315 INFO L87 Difference]: Start difference. First operand 416 states and 502 transitions. Second operand has 26 states, 26 states have (on average 2.6923076923076925) internal successors, (70), 25 states have internal predecessors, (70), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:23:57,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:23:57,804 INFO L93 Difference]: Finished difference Result 917 states and 1075 transitions. [2021-05-03 00:23:57,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2021-05-03 00:23:57,806 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 2.6923076923076925) internal successors, (70), 25 states have internal predecessors, (70), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 76 [2021-05-03 00:23:57,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:23:57,807 INFO L225 Difference]: With dead ends: 917 [2021-05-03 00:23:57,807 INFO L226 Difference]: Without dead ends: 566 [2021-05-03 00:23:57,807 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 15 SyntacticMatches, 33 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 181 ImplicationChecksByTransitivity, 1375.5ms TimeCoverageRelationStatistics Valid=100, Invalid=656, Unknown=0, NotChecked=0, Total=756 [2021-05-03 00:23:57,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 566 states. [2021-05-03 00:23:58,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 566 to 425. [2021-05-03 00:23:58,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 425 states, 415 states have (on average 1.2048192771084338) internal successors, (500), 415 states have internal predecessors, (500), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:23:58,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 511 transitions. [2021-05-03 00:23:58,675 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 511 transitions. Word has length 76 [2021-05-03 00:23:58,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:23:58,675 INFO L480 AbstractCegarLoop]: Abstraction has 425 states and 511 transitions. [2021-05-03 00:23:58,675 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 26 states, 26 states have (on average 2.6923076923076925) internal successors, (70), 25 states have internal predecessors, (70), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:23:58,675 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 511 transitions. [2021-05-03 00:23:58,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2021-05-03 00:23:58,676 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:23:58,676 INFO L523 BasicCegarLoop]: trace histogram [18, 18, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:23:58,676 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable776 [2021-05-03 00:23:58,676 INFO L428 AbstractCegarLoop]: === Iteration 178 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:23:58,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:23:58,676 INFO L82 PathProgramCache]: Analyzing trace with hash 1182482172, now seen corresponding path program 137 times [2021-05-03 00:23:58,676 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:23:58,676 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [398384315] [2021-05-03 00:23:58,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:23:58,683 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (+ v_main_~c~0_3487 1) v_~SIZE~0_612) (<= v_~last~0_617 v_main_~c~0_3487)) InVars {~SIZE~0=v_~SIZE~0_612, main_~c~0=v_main_~c~0_3487, ~last~0=v_~last~0_617} OutVars{~SIZE~0=v_~SIZE~0_612, main_~c~0=v_main_~c~0_3487, ~last~0=v_~last~0_617} AuxVars[] AssignedVars[] [2021-05-03 00:23:58,685 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size [2021-05-03 00:23:58,686 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:23:58,687 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:23:58,698 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:23:58,701 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:23:58,735 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size 78 [2021-05-03 00:23:58,765 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_3489 v_~last~0_618) (< (+ v_main_~c~0_3489 1) v_~SIZE~0_613)) InVars {~SIZE~0=v_~SIZE~0_613, main_~c~0=v_main_~c~0_3489, ~last~0=v_~last~0_618} OutVars{~SIZE~0=v_~SIZE~0_613, main_~c~0=v_main_~c~0_3489, ~last~0=v_~last~0_618} AuxVars[] AssignedVars[] [2021-05-03 00:23:58,768 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:23:58,769 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:23:58,771 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:23:58,786 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:23:58,791 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:23:58,819 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:23:58,845 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:23:58,847 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_~last~0_619 v_main_~c~0_3491) (< v_main_~c~0_3491 v_~SIZE~0_614)) InVars {~SIZE~0=v_~SIZE~0_614, main_~c~0=v_main_~c~0_3491, ~last~0=v_~last~0_619} OutVars{~SIZE~0=v_~SIZE~0_614, main_~c~0=v_main_~c~0_3491, ~last~0=v_~last~0_619} AuxVars[] AssignedVars[] [2021-05-03 00:23:58,849 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:23:58,849 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:23:58,851 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:23:58,862 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:23:58,865 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:23:58,896 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:23:58,925 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_3493 v_~last~0_620) (< v_main_~c~0_3493 v_~SIZE~0_615)) InVars {~SIZE~0=v_~SIZE~0_615, main_~c~0=v_main_~c~0_3493, ~last~0=v_~last~0_620} OutVars{~SIZE~0=v_~SIZE~0_615, main_~c~0=v_main_~c~0_3493, ~last~0=v_~last~0_620} AuxVars[] AssignedVars[] [2021-05-03 00:23:58,927 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size [2021-05-03 00:23:58,928 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:23:58,929 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:23:58,945 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:23:58,950 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:23:58,978 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size 66 [2021-05-03 00:23:59,002 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:23:59,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:23:59,065 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:23:59,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:23:59,069 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:23:59,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:23:59,071 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:23:59,074 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:24:00,512 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:24:00,512 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [398384315] [2021-05-03 00:24:00,512 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [398384315] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:24:00,512 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:24:00,512 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2021-05-03 00:24:00,512 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393285139] [2021-05-03 00:24:00,513 INFO L460 AbstractCegarLoop]: Interpolant automaton has 27 states [2021-05-03 00:24:00,513 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:24:00,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2021-05-03 00:24:00,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=670, Unknown=0, NotChecked=0, Total=756 [2021-05-03 00:24:00,513 INFO L87 Difference]: Start difference. First operand 425 states and 511 transitions. Second operand has 27 states, 27 states have (on average 2.5925925925925926) internal successors, (70), 26 states have internal predecessors, (70), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:24:04,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:24:04,218 INFO L93 Difference]: Finished difference Result 997 states and 1162 transitions. [2021-05-03 00:24:04,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2021-05-03 00:24:04,220 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 2.5925925925925926) internal successors, (70), 26 states have internal predecessors, (70), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 76 [2021-05-03 00:24:04,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:24:04,221 INFO L225 Difference]: With dead ends: 997 [2021-05-03 00:24:04,221 INFO L226 Difference]: Without dead ends: 637 [2021-05-03 00:24:04,223 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 13 SyntacticMatches, 33 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 324 ImplicationChecksByTransitivity, 1462.4ms TimeCoverageRelationStatistics Valid=98, Invalid=772, Unknown=0, NotChecked=0, Total=870 [2021-05-03 00:24:04,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 637 states. [2021-05-03 00:24:05,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 637 to 425. [2021-05-03 00:24:05,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 425 states, 415 states have (on average 1.2048192771084338) internal successors, (500), 415 states have internal predecessors, (500), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:24:05,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 511 transitions. [2021-05-03 00:24:05,284 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 511 transitions. Word has length 76 [2021-05-03 00:24:05,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:24:05,284 INFO L480 AbstractCegarLoop]: Abstraction has 425 states and 511 transitions. [2021-05-03 00:24:05,284 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 27 states, 27 states have (on average 2.5925925925925926) internal successors, (70), 26 states have internal predecessors, (70), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:24:05,284 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 511 transitions. [2021-05-03 00:24:05,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2021-05-03 00:24:05,285 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:24:05,285 INFO L523 BasicCegarLoop]: trace histogram [18, 18, 16, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:24:05,285 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable781 [2021-05-03 00:24:05,285 INFO L428 AbstractCegarLoop]: === Iteration 179 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:24:05,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:24:05,285 INFO L82 PathProgramCache]: Analyzing trace with hash 1743181950, now seen corresponding path program 138 times [2021-05-03 00:24:05,285 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:24:05,286 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1839690737] [2021-05-03 00:24:05,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:24:05,295 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_~last~0_621 v_main_~c~0_3515) (< (+ v_main_~c~0_3515 1) v_~SIZE~0_616)) InVars {~SIZE~0=v_~SIZE~0_616, main_~c~0=v_main_~c~0_3515, ~last~0=v_~last~0_621} OutVars{~SIZE~0=v_~SIZE~0_616, main_~c~0=v_main_~c~0_3515, ~last~0=v_~last~0_621} AuxVars[] AssignedVars[] [2021-05-03 00:24:05,298 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size [2021-05-03 00:24:05,321 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:24:05,323 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:24:05,341 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:24:05,345 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:24:05,368 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size 78 [2021-05-03 00:24:05,402 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (+ v_main_~c~0_3517 1) v_~SIZE~0_617) (< v_main_~c~0_3517 v_~last~0_622)) InVars {~SIZE~0=v_~SIZE~0_617, main_~c~0=v_main_~c~0_3517, ~last~0=v_~last~0_622} OutVars{~SIZE~0=v_~SIZE~0_617, main_~c~0=v_main_~c~0_3517, ~last~0=v_~last~0_622} AuxVars[] AssignedVars[] [2021-05-03 00:24:05,404 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:24:05,424 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:24:05,427 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:24:05,453 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:24:05,463 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:24:05,485 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:24:05,518 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:24:05,520 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_~last~0_623 v_main_~c~0_3519) (< v_main_~c~0_3519 v_~SIZE~0_618)) InVars {~SIZE~0=v_~SIZE~0_618, main_~c~0=v_main_~c~0_3519, ~last~0=v_~last~0_623} OutVars{~SIZE~0=v_~SIZE~0_618, main_~c~0=v_main_~c~0_3519, ~last~0=v_~last~0_623} AuxVars[] AssignedVars[] [2021-05-03 00:24:05,522 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:24:05,553 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:24:05,555 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:24:05,571 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:24:05,576 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:24:05,597 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:24:05,632 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_3521 v_~SIZE~0_619) (< v_main_~c~0_3521 v_~last~0_624)) InVars {~SIZE~0=v_~SIZE~0_619, main_~c~0=v_main_~c~0_3521, ~last~0=v_~last~0_624} OutVars{~SIZE~0=v_~SIZE~0_619, main_~c~0=v_main_~c~0_3521, ~last~0=v_~last~0_624} AuxVars[] AssignedVars[] [2021-05-03 00:24:05,635 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size [2021-05-03 00:24:05,636 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:24:05,638 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:24:05,657 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:24:05,664 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:24:05,699 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size 66 [2021-05-03 00:24:05,725 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:24:05,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:24:05,813 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:24:05,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:24:05,818 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:24:05,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:24:05,819 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:24:05,822 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:24:07,370 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:24:07,370 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1839690737] [2021-05-03 00:24:07,370 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1839690737] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:24:07,370 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:24:07,371 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2021-05-03 00:24:07,371 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440726985] [2021-05-03 00:24:07,371 INFO L460 AbstractCegarLoop]: Interpolant automaton has 28 states [2021-05-03 00:24:07,371 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:24:07,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2021-05-03 00:24:07,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=769, Unknown=0, NotChecked=0, Total=870 [2021-05-03 00:24:07,372 INFO L87 Difference]: Start difference. First operand 425 states and 511 transitions. Second operand has 28 states, 28 states have (on average 2.5) internal successors, (70), 27 states have internal predecessors, (70), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:24:10,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:24:10,653 INFO L93 Difference]: Finished difference Result 935 states and 1093 transitions. [2021-05-03 00:24:10,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2021-05-03 00:24:10,655 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 2.5) internal successors, (70), 27 states have internal predecessors, (70), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 76 [2021-05-03 00:24:10,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:24:10,655 INFO L225 Difference]: With dead ends: 935 [2021-05-03 00:24:10,656 INFO L226 Difference]: Without dead ends: 575 [2021-05-03 00:24:10,656 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 12 SyntacticMatches, 33 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 481 ImplicationChecksByTransitivity, 1605.9ms TimeCoverageRelationStatistics Valid=114, Invalid=878, Unknown=0, NotChecked=0, Total=992 [2021-05-03 00:24:10,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 575 states. [2021-05-03 00:24:11,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 575 to 425. [2021-05-03 00:24:11,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 425 states, 415 states have (on average 1.2048192771084338) internal successors, (500), 415 states have internal predecessors, (500), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:24:11,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 511 transitions. [2021-05-03 00:24:11,647 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 511 transitions. Word has length 76 [2021-05-03 00:24:11,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:24:11,647 INFO L480 AbstractCegarLoop]: Abstraction has 425 states and 511 transitions. [2021-05-03 00:24:11,647 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 28 states, 28 states have (on average 2.5) internal successors, (70), 27 states have internal predecessors, (70), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:24:11,648 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 511 transitions. [2021-05-03 00:24:11,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2021-05-03 00:24:11,648 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:24:11,648 INFO L523 BasicCegarLoop]: trace histogram [18, 18, 15, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:24:11,648 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable786 [2021-05-03 00:24:11,648 INFO L428 AbstractCegarLoop]: === Iteration 180 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:24:11,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:24:11,648 INFO L82 PathProgramCache]: Analyzing trace with hash 1783856700, now seen corresponding path program 139 times [2021-05-03 00:24:11,649 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:24:11,649 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1351839] [2021-05-03 00:24:11,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:24:11,657 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (+ v_main_~c~0_3543 1) v_~SIZE~0_620) (<= v_~last~0_625 v_main_~c~0_3543)) InVars {~SIZE~0=v_~SIZE~0_620, main_~c~0=v_main_~c~0_3543, ~last~0=v_~last~0_625} OutVars{~SIZE~0=v_~SIZE~0_620, main_~c~0=v_main_~c~0_3543, ~last~0=v_~last~0_625} AuxVars[] AssignedVars[] [2021-05-03 00:24:11,659 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size [2021-05-03 00:24:11,678 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:24:11,680 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:24:11,693 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:24:11,696 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:24:11,717 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size 78 [2021-05-03 00:24:11,742 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_3545 v_~last~0_626) (< (+ v_main_~c~0_3545 1) v_~SIZE~0_621)) InVars {~SIZE~0=v_~SIZE~0_621, main_~c~0=v_main_~c~0_3545, ~last~0=v_~last~0_626} OutVars{~SIZE~0=v_~SIZE~0_621, main_~c~0=v_main_~c~0_3545, ~last~0=v_~last~0_626} AuxVars[] AssignedVars[] [2021-05-03 00:24:11,743 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:24:11,757 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:24:11,759 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:24:11,773 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:24:11,778 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:24:11,794 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:24:11,820 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:24:11,823 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_3547 v_~SIZE~0_622) (<= v_~last~0_627 v_main_~c~0_3547)) InVars {~SIZE~0=v_~SIZE~0_622, main_~c~0=v_main_~c~0_3547, ~last~0=v_~last~0_627} OutVars{~SIZE~0=v_~SIZE~0_622, main_~c~0=v_main_~c~0_3547, ~last~0=v_~last~0_627} AuxVars[] AssignedVars[] [2021-05-03 00:24:11,824 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:24:11,825 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:24:11,826 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:24:11,838 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:24:11,841 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:24:11,873 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:24:11,899 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_3549 v_~last~0_628) (< v_main_~c~0_3549 v_~SIZE~0_623)) InVars {~SIZE~0=v_~SIZE~0_623, main_~c~0=v_main_~c~0_3549, ~last~0=v_~last~0_628} OutVars{~SIZE~0=v_~SIZE~0_623, main_~c~0=v_main_~c~0_3549, ~last~0=v_~last~0_628} AuxVars[] AssignedVars[] [2021-05-03 00:24:11,901 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size [2021-05-03 00:24:11,915 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:24:11,916 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:24:11,930 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:24:11,935 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:24:11,952 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size 66 [2021-05-03 00:24:11,974 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:24:11,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:24:12,059 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:24:12,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:24:12,063 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:24:12,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:24:12,065 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:24:12,068 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:24:13,406 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:24:13,407 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1351839] [2021-05-03 00:24:13,407 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1351839] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:24:13,407 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:24:13,407 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2021-05-03 00:24:13,407 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356895276] [2021-05-03 00:24:13,407 INFO L460 AbstractCegarLoop]: Interpolant automaton has 29 states [2021-05-03 00:24:13,407 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:24:13,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2021-05-03 00:24:13,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=768, Unknown=0, NotChecked=0, Total=870 [2021-05-03 00:24:13,408 INFO L87 Difference]: Start difference. First operand 425 states and 511 transitions. Second operand has 29 states, 29 states have (on average 2.413793103448276) internal successors, (70), 28 states have internal predecessors, (70), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:24:16,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:24:16,978 INFO L93 Difference]: Finished difference Result 932 states and 1094 transitions. [2021-05-03 00:24:16,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2021-05-03 00:24:16,979 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 2.413793103448276) internal successors, (70), 28 states have internal predecessors, (70), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 76 [2021-05-03 00:24:16,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:24:16,980 INFO L225 Difference]: With dead ends: 932 [2021-05-03 00:24:16,980 INFO L226 Difference]: Without dead ends: 572 [2021-05-03 00:24:16,980 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 12 SyntacticMatches, 32 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 511 ImplicationChecksByTransitivity, 1386.1ms TimeCoverageRelationStatistics Valid=118, Invalid=874, Unknown=0, NotChecked=0, Total=992 [2021-05-03 00:24:16,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 572 states. [2021-05-03 00:24:17,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 572 to 425. [2021-05-03 00:24:17,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 425 states, 415 states have (on average 1.2048192771084338) internal successors, (500), 415 states have internal predecessors, (500), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:24:17,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 511 transitions. [2021-05-03 00:24:17,989 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 511 transitions. Word has length 76 [2021-05-03 00:24:17,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:24:17,989 INFO L480 AbstractCegarLoop]: Abstraction has 425 states and 511 transitions. [2021-05-03 00:24:17,989 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 29 states, 29 states have (on average 2.413793103448276) internal successors, (70), 28 states have internal predecessors, (70), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:24:17,989 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 511 transitions. [2021-05-03 00:24:17,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2021-05-03 00:24:17,990 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:24:17,990 INFO L523 BasicCegarLoop]: trace histogram [18, 18, 14, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:24:17,990 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable791 [2021-05-03 00:24:17,990 INFO L428 AbstractCegarLoop]: === Iteration 181 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:24:17,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:24:17,990 INFO L82 PathProgramCache]: Analyzing trace with hash -2067209922, now seen corresponding path program 140 times [2021-05-03 00:24:17,990 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:24:17,990 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1979641381] [2021-05-03 00:24:17,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:24:17,998 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (+ v_main_~c~0_3571 1) v_~SIZE~0_624) (<= v_~last~0_629 v_main_~c~0_3571)) InVars {~SIZE~0=v_~SIZE~0_624, main_~c~0=v_main_~c~0_3571, ~last~0=v_~last~0_629} OutVars{~SIZE~0=v_~SIZE~0_624, main_~c~0=v_main_~c~0_3571, ~last~0=v_~last~0_629} AuxVars[] AssignedVars[] [2021-05-03 00:24:17,999 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size [2021-05-03 00:24:18,000 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:24:18,002 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:24:18,014 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:24:18,018 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:24:18,056 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size 78 [2021-05-03 00:24:18,083 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (+ v_main_~c~0_3573 1) v_~SIZE~0_625) (< v_main_~c~0_3573 v_~last~0_630)) InVars {~SIZE~0=v_~SIZE~0_625, main_~c~0=v_main_~c~0_3573, ~last~0=v_~last~0_630} OutVars{~SIZE~0=v_~SIZE~0_625, main_~c~0=v_main_~c~0_3573, ~last~0=v_~last~0_630} AuxVars[] AssignedVars[] [2021-05-03 00:24:18,084 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:24:18,100 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:24:18,101 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:24:18,129 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:24:18,136 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:24:18,154 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:24:18,181 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:24:18,184 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_3575 v_~SIZE~0_626) (<= v_~last~0_631 v_main_~c~0_3575)) InVars {~SIZE~0=v_~SIZE~0_626, main_~c~0=v_main_~c~0_3575, ~last~0=v_~last~0_631} OutVars{~SIZE~0=v_~SIZE~0_626, main_~c~0=v_main_~c~0_3575, ~last~0=v_~last~0_631} AuxVars[] AssignedVars[] [2021-05-03 00:24:18,185 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:24:18,186 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:24:18,188 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:24:18,200 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:24:18,203 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:24:18,238 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:24:18,266 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_3577 v_~SIZE~0_627) (< v_main_~c~0_3577 v_~last~0_632)) InVars {~SIZE~0=v_~SIZE~0_627, main_~c~0=v_main_~c~0_3577, ~last~0=v_~last~0_632} OutVars{~SIZE~0=v_~SIZE~0_627, main_~c~0=v_main_~c~0_3577, ~last~0=v_~last~0_632} AuxVars[] AssignedVars[] [2021-05-03 00:24:18,267 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size [2021-05-03 00:24:18,283 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:24:18,285 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:24:18,302 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:24:18,310 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:24:18,328 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size 66 [2021-05-03 00:24:18,353 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:24:18,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:24:18,458 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:24:18,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:24:18,463 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:24:18,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:24:18,466 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:24:18,470 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:24:20,361 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:24:20,361 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1979641381] [2021-05-03 00:24:20,361 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1979641381] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:24:20,361 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:24:20,361 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [30] imperfect sequences [] total 30 [2021-05-03 00:24:20,362 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1030447307] [2021-05-03 00:24:20,362 INFO L460 AbstractCegarLoop]: Interpolant automaton has 30 states [2021-05-03 00:24:20,362 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:24:20,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2021-05-03 00:24:20,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=820, Unknown=0, NotChecked=0, Total=930 [2021-05-03 00:24:20,362 INFO L87 Difference]: Start difference. First operand 425 states and 511 transitions. Second operand has 30 states, 30 states have (on average 2.3333333333333335) internal successors, (70), 29 states have internal predecessors, (70), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:24:23,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:24:23,683 INFO L93 Difference]: Finished difference Result 923 states and 1085 transitions. [2021-05-03 00:24:23,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2021-05-03 00:24:23,685 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 2.3333333333333335) internal successors, (70), 29 states have internal predecessors, (70), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 76 [2021-05-03 00:24:23,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:24:23,685 INFO L225 Difference]: With dead ends: 923 [2021-05-03 00:24:23,685 INFO L226 Difference]: Without dead ends: 563 [2021-05-03 00:24:23,686 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 12 SyntacticMatches, 31 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 588 ImplicationChecksByTransitivity, 1905.4ms TimeCoverageRelationStatistics Valid=128, Invalid=928, Unknown=0, NotChecked=0, Total=1056 [2021-05-03 00:24:23,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 563 states. [2021-05-03 00:24:24,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 563 to 425. [2021-05-03 00:24:24,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 425 states, 415 states have (on average 1.2048192771084338) internal successors, (500), 415 states have internal predecessors, (500), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:24:24,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 511 transitions. [2021-05-03 00:24:24,807 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 511 transitions. Word has length 76 [2021-05-03 00:24:24,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:24:24,807 INFO L480 AbstractCegarLoop]: Abstraction has 425 states and 511 transitions. [2021-05-03 00:24:24,807 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 30 states, 30 states have (on average 2.3333333333333335) internal successors, (70), 29 states have internal predecessors, (70), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:24:24,807 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 511 transitions. [2021-05-03 00:24:24,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2021-05-03 00:24:24,807 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:24:24,807 INFO L523 BasicCegarLoop]: trace histogram [18, 18, 13, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:24:24,807 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable796 [2021-05-03 00:24:24,808 INFO L428 AbstractCegarLoop]: === Iteration 182 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:24:24,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:24:24,808 INFO L82 PathProgramCache]: Analyzing trace with hash 1746677116, now seen corresponding path program 141 times [2021-05-03 00:24:24,808 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:24:24,808 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1832145351] [2021-05-03 00:24:24,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:24:24,818 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (+ v_main_~c~0_3599 1) v_~SIZE~0_628) (<= v_~last~0_633 v_main_~c~0_3599)) InVars {~SIZE~0=v_~SIZE~0_628, main_~c~0=v_main_~c~0_3599, ~last~0=v_~last~0_633} OutVars{~SIZE~0=v_~SIZE~0_628, main_~c~0=v_main_~c~0_3599, ~last~0=v_~last~0_633} AuxVars[] AssignedVars[] [2021-05-03 00:24:24,820 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size [2021-05-03 00:24:24,840 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:24:24,842 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:24:24,857 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:24:24,861 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:24:24,881 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size 78 [2021-05-03 00:24:24,909 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_3601 v_~last~0_634) (< (+ v_main_~c~0_3601 1) v_~SIZE~0_629)) InVars {~SIZE~0=v_~SIZE~0_629, main_~c~0=v_main_~c~0_3601, ~last~0=v_~last~0_634} OutVars{~SIZE~0=v_~SIZE~0_629, main_~c~0=v_main_~c~0_3601, ~last~0=v_~last~0_634} AuxVars[] AssignedVars[] [2021-05-03 00:24:24,911 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:24:24,912 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:24:24,913 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:24:24,930 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:24:24,936 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:24:24,967 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:24:24,993 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:24:24,996 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_3603 v_~SIZE~0_630) (<= v_~last~0_635 v_main_~c~0_3603)) InVars {~SIZE~0=v_~SIZE~0_630, main_~c~0=v_main_~c~0_3603, ~last~0=v_~last~0_635} OutVars{~SIZE~0=v_~SIZE~0_630, main_~c~0=v_main_~c~0_3603, ~last~0=v_~last~0_635} AuxVars[] AssignedVars[] [2021-05-03 00:24:24,997 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:24:24,998 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:24:24,999 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:24:25,012 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:24:25,016 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:24:25,051 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:24:25,082 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_3605 v_~SIZE~0_631) (< v_main_~c~0_3605 v_~last~0_636)) InVars {~SIZE~0=v_~SIZE~0_631, main_~c~0=v_main_~c~0_3605, ~last~0=v_~last~0_636} OutVars{~SIZE~0=v_~SIZE~0_631, main_~c~0=v_main_~c~0_3605, ~last~0=v_~last~0_636} AuxVars[] AssignedVars[] [2021-05-03 00:24:25,083 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size [2021-05-03 00:24:25,084 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:24:25,086 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:24:25,104 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:24:25,110 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:24:25,144 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size 66 [2021-05-03 00:24:25,172 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:24:25,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:24:25,244 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:24:25,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:24:25,248 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:24:25,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:24:25,250 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:24:25,253 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:24:26,662 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:24:26,662 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1832145351] [2021-05-03 00:24:26,662 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1832145351] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:24:26,662 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:24:26,662 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [31] imperfect sequences [] total 31 [2021-05-03 00:24:26,662 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119615909] [2021-05-03 00:24:26,662 INFO L460 AbstractCegarLoop]: Interpolant automaton has 31 states [2021-05-03 00:24:26,663 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:24:26,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2021-05-03 00:24:26,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=874, Unknown=0, NotChecked=0, Total=992 [2021-05-03 00:24:26,663 INFO L87 Difference]: Start difference. First operand 425 states and 511 transitions. Second operand has 31 states, 31 states have (on average 2.2580645161290325) internal successors, (70), 30 states have internal predecessors, (70), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:24:29,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:24:29,876 INFO L93 Difference]: Finished difference Result 914 states and 1076 transitions. [2021-05-03 00:24:29,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2021-05-03 00:24:29,877 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 2.2580645161290325) internal successors, (70), 30 states have internal predecessors, (70), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 76 [2021-05-03 00:24:29,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:24:29,878 INFO L225 Difference]: With dead ends: 914 [2021-05-03 00:24:29,878 INFO L226 Difference]: Without dead ends: 554 [2021-05-03 00:24:29,879 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 12 SyntacticMatches, 30 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 656 ImplicationChecksByTransitivity, 1440.9ms TimeCoverageRelationStatistics Valid=138, Invalid=984, Unknown=0, NotChecked=0, Total=1122 [2021-05-03 00:24:29,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554 states. [2021-05-03 00:24:30,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554 to 425. [2021-05-03 00:24:30,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 425 states, 415 states have (on average 1.2048192771084338) internal successors, (500), 415 states have internal predecessors, (500), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:24:30,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 511 transitions. [2021-05-03 00:24:30,802 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 511 transitions. Word has length 76 [2021-05-03 00:24:30,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:24:30,802 INFO L480 AbstractCegarLoop]: Abstraction has 425 states and 511 transitions. [2021-05-03 00:24:30,802 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 31 states, 31 states have (on average 2.2580645161290325) internal successors, (70), 30 states have internal predecessors, (70), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:24:30,802 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 511 transitions. [2021-05-03 00:24:30,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2021-05-03 00:24:30,802 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:24:30,802 INFO L523 BasicCegarLoop]: trace histogram [18, 18, 12, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:24:30,802 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable801 [2021-05-03 00:24:30,802 INFO L428 AbstractCegarLoop]: === Iteration 183 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:24:30,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:24:30,803 INFO L82 PathProgramCache]: Analyzing trace with hash 1393588734, now seen corresponding path program 142 times [2021-05-03 00:24:30,803 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:24:30,803 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1883293859] [2021-05-03 00:24:30,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:24:30,810 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (+ v_main_~c~0_3627 1) v_~SIZE~0_632) (<= v_~last~0_637 v_main_~c~0_3627)) InVars {~SIZE~0=v_~SIZE~0_632, main_~c~0=v_main_~c~0_3627, ~last~0=v_~last~0_637} OutVars{~SIZE~0=v_~SIZE~0_632, main_~c~0=v_main_~c~0_3627, ~last~0=v_~last~0_637} AuxVars[] AssignedVars[] [2021-05-03 00:24:30,811 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size [2021-05-03 00:24:30,812 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:24:30,813 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:24:30,824 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:24:30,827 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:24:30,867 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size 78 [2021-05-03 00:24:30,891 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (+ v_main_~c~0_3629 1) v_~SIZE~0_633) (< v_main_~c~0_3629 v_~last~0_638)) InVars {~SIZE~0=v_~SIZE~0_633, main_~c~0=v_main_~c~0_3629, ~last~0=v_~last~0_638} OutVars{~SIZE~0=v_~SIZE~0_633, main_~c~0=v_main_~c~0_3629, ~last~0=v_~last~0_638} AuxVars[] AssignedVars[] [2021-05-03 00:24:30,892 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:24:30,893 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:24:30,894 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:24:30,908 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:24:30,913 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:24:30,940 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:24:30,965 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:24:30,967 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_3631 v_~SIZE~0_634) (<= v_~last~0_639 v_main_~c~0_3631)) InVars {~SIZE~0=v_~SIZE~0_634, main_~c~0=v_main_~c~0_3631, ~last~0=v_~last~0_639} OutVars{~SIZE~0=v_~SIZE~0_634, main_~c~0=v_main_~c~0_3631, ~last~0=v_~last~0_639} AuxVars[] AssignedVars[] [2021-05-03 00:24:30,969 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:24:30,986 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:24:30,987 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:24:30,998 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:24:31,001 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:24:31,018 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:24:31,043 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_3633 v_~SIZE~0_635) (< v_main_~c~0_3633 v_~last~0_640)) InVars {~SIZE~0=v_~SIZE~0_635, main_~c~0=v_main_~c~0_3633, ~last~0=v_~last~0_640} OutVars{~SIZE~0=v_~SIZE~0_635, main_~c~0=v_main_~c~0_3633, ~last~0=v_~last~0_640} AuxVars[] AssignedVars[] [2021-05-03 00:24:31,045 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size [2021-05-03 00:24:31,058 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:24:31,060 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:24:31,074 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:24:31,079 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:24:31,095 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size 66 [2021-05-03 00:24:31,119 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:24:31,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:24:31,180 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:24:31,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:24:31,183 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:24:31,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:24:31,185 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:24:31,187 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:24:32,356 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:24:32,356 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1883293859] [2021-05-03 00:24:32,356 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1883293859] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:24:32,357 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:24:32,357 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [32] imperfect sequences [] total 32 [2021-05-03 00:24:32,357 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1828114664] [2021-05-03 00:24:32,357 INFO L460 AbstractCegarLoop]: Interpolant automaton has 32 states [2021-05-03 00:24:32,357 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:24:32,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2021-05-03 00:24:32,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=930, Unknown=0, NotChecked=0, Total=1056 [2021-05-03 00:24:32,357 INFO L87 Difference]: Start difference. First operand 425 states and 511 transitions. Second operand has 32 states, 32 states have (on average 2.1875) internal successors, (70), 31 states have internal predecessors, (70), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:24:35,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:24:35,407 INFO L93 Difference]: Finished difference Result 905 states and 1067 transitions. [2021-05-03 00:24:35,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2021-05-03 00:24:35,409 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 2.1875) internal successors, (70), 31 states have internal predecessors, (70), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 76 [2021-05-03 00:24:35,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:24:35,410 INFO L225 Difference]: With dead ends: 905 [2021-05-03 00:24:35,410 INFO L226 Difference]: Without dead ends: 545 [2021-05-03 00:24:35,414 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 18 SyntacticMatches, 23 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 619 ImplicationChecksByTransitivity, 1196.7ms TimeCoverageRelationStatistics Valid=148, Invalid=1042, Unknown=0, NotChecked=0, Total=1190 [2021-05-03 00:24:35,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 545 states. [2021-05-03 00:24:36,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 545 to 425. [2021-05-03 00:24:36,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 425 states, 415 states have (on average 1.2048192771084338) internal successors, (500), 415 states have internal predecessors, (500), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:24:36,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 511 transitions. [2021-05-03 00:24:36,527 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 511 transitions. Word has length 76 [2021-05-03 00:24:36,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:24:36,527 INFO L480 AbstractCegarLoop]: Abstraction has 425 states and 511 transitions. [2021-05-03 00:24:36,527 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 32 states, 32 states have (on average 2.1875) internal successors, (70), 31 states have internal predecessors, (70), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:24:36,527 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 511 transitions. [2021-05-03 00:24:36,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2021-05-03 00:24:36,528 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:24:36,528 INFO L523 BasicCegarLoop]: trace histogram [18, 18, 11, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:24:36,528 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable806 [2021-05-03 00:24:36,528 INFO L428 AbstractCegarLoop]: === Iteration 184 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:24:36,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:24:36,528 INFO L82 PathProgramCache]: Analyzing trace with hash -655799108, now seen corresponding path program 143 times [2021-05-03 00:24:36,528 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:24:36,528 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [778422030] [2021-05-03 00:24:36,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:24:36,535 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (+ v_main_~c~0_3655 1) v_~SIZE~0_636) (<= v_~last~0_641 v_main_~c~0_3655)) InVars {~SIZE~0=v_~SIZE~0_636, main_~c~0=v_main_~c~0_3655, ~last~0=v_~last~0_641} OutVars{~SIZE~0=v_~SIZE~0_636, main_~c~0=v_main_~c~0_3655, ~last~0=v_~last~0_641} AuxVars[] AssignedVars[] [2021-05-03 00:24:36,537 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size [2021-05-03 00:24:36,556 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:24:36,558 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:24:36,570 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:24:36,574 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:24:36,594 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size 78 [2021-05-03 00:24:36,620 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (+ v_main_~c~0_3657 1) v_~SIZE~0_637) (< v_main_~c~0_3657 v_~last~0_642)) InVars {~SIZE~0=v_~SIZE~0_637, main_~c~0=v_main_~c~0_3657, ~last~0=v_~last~0_642} OutVars{~SIZE~0=v_~SIZE~0_637, main_~c~0=v_main_~c~0_3657, ~last~0=v_~last~0_642} AuxVars[] AssignedVars[] [2021-05-03 00:24:36,622 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:24:36,636 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:24:36,638 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:24:36,654 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:24:36,660 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:24:36,678 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:24:36,704 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:24:36,707 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_3659 v_~SIZE~0_638) (<= v_~last~0_643 v_main_~c~0_3659)) InVars {~SIZE~0=v_~SIZE~0_638, main_~c~0=v_main_~c~0_3659, ~last~0=v_~last~0_643} OutVars{~SIZE~0=v_~SIZE~0_638, main_~c~0=v_main_~c~0_3659, ~last~0=v_~last~0_643} AuxVars[] AssignedVars[] [2021-05-03 00:24:36,709 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:24:36,729 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:24:36,730 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:24:36,745 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:24:36,749 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:24:36,774 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:24:36,809 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_3661 v_~last~0_644) (< v_main_~c~0_3661 v_~SIZE~0_639)) InVars {~SIZE~0=v_~SIZE~0_639, main_~c~0=v_main_~c~0_3661, ~last~0=v_~last~0_644} OutVars{~SIZE~0=v_~SIZE~0_639, main_~c~0=v_main_~c~0_3661, ~last~0=v_~last~0_644} AuxVars[] AssignedVars[] [2021-05-03 00:24:36,811 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size [2021-05-03 00:24:36,829 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:24:36,831 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:24:36,851 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:24:36,859 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:24:36,882 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size 66 [2021-05-03 00:24:36,926 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:24:36,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:24:37,002 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:24:37,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:24:37,007 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:24:37,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:24:37,009 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:24:37,012 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:24:38,459 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:24:38,459 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [778422030] [2021-05-03 00:24:38,460 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [778422030] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:24:38,460 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:24:38,460 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [33] imperfect sequences [] total 33 [2021-05-03 00:24:38,460 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [23780033] [2021-05-03 00:24:38,460 INFO L460 AbstractCegarLoop]: Interpolant automaton has 33 states [2021-05-03 00:24:38,460 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:24:38,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2021-05-03 00:24:38,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=988, Unknown=0, NotChecked=0, Total=1122 [2021-05-03 00:24:38,461 INFO L87 Difference]: Start difference. First operand 425 states and 511 transitions. Second operand has 33 states, 33 states have (on average 2.121212121212121) internal successors, (70), 32 states have internal predecessors, (70), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:24:41,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:24:41,573 INFO L93 Difference]: Finished difference Result 896 states and 1058 transitions. [2021-05-03 00:24:41,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2021-05-03 00:24:41,574 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 2.121212121212121) internal successors, (70), 32 states have internal predecessors, (70), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 76 [2021-05-03 00:24:41,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:24:41,575 INFO L225 Difference]: With dead ends: 896 [2021-05-03 00:24:41,575 INFO L226 Difference]: Without dead ends: 536 [2021-05-03 00:24:41,576 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 13 SyntacticMatches, 27 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 747 ImplicationChecksByTransitivity, 1477.2ms TimeCoverageRelationStatistics Valid=158, Invalid=1102, Unknown=0, NotChecked=0, Total=1260 [2021-05-03 00:24:41,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states. [2021-05-03 00:24:43,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 425. [2021-05-03 00:24:43,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 425 states, 415 states have (on average 1.2048192771084338) internal successors, (500), 415 states have internal predecessors, (500), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:24:43,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 511 transitions. [2021-05-03 00:24:43,216 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 511 transitions. Word has length 76 [2021-05-03 00:24:43,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:24:43,217 INFO L480 AbstractCegarLoop]: Abstraction has 425 states and 511 transitions. [2021-05-03 00:24:43,217 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 33 states, 33 states have (on average 2.121212121212121) internal successors, (70), 32 states have internal predecessors, (70), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:24:43,217 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 511 transitions. [2021-05-03 00:24:43,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2021-05-03 00:24:43,217 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:24:43,217 INFO L523 BasicCegarLoop]: trace histogram [18, 18, 10, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:24:43,217 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable811 [2021-05-03 00:24:43,217 INFO L428 AbstractCegarLoop]: === Iteration 185 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:24:43,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:24:43,218 INFO L82 PathProgramCache]: Analyzing trace with hash -232152386, now seen corresponding path program 144 times [2021-05-03 00:24:43,218 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:24:43,218 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [926042994] [2021-05-03 00:24:43,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:24:43,225 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_~last~0_645 v_main_~c~0_3683) (< (+ v_main_~c~0_3683 1) v_~SIZE~0_640)) InVars {~SIZE~0=v_~SIZE~0_640, main_~c~0=v_main_~c~0_3683, ~last~0=v_~last~0_645} OutVars{~SIZE~0=v_~SIZE~0_640, main_~c~0=v_main_~c~0_3683, ~last~0=v_~last~0_645} AuxVars[] AssignedVars[] [2021-05-03 00:24:43,227 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size [2021-05-03 00:24:43,228 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:24:43,229 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:24:43,241 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:24:43,244 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:24:43,274 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size 78 [2021-05-03 00:24:43,299 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_3685 v_~last~0_646) (< (+ v_main_~c~0_3685 1) v_~SIZE~0_641)) InVars {~SIZE~0=v_~SIZE~0_641, main_~c~0=v_main_~c~0_3685, ~last~0=v_~last~0_646} OutVars{~SIZE~0=v_~SIZE~0_641, main_~c~0=v_main_~c~0_3685, ~last~0=v_~last~0_646} AuxVars[] AssignedVars[] [2021-05-03 00:24:43,301 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:24:43,316 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:24:43,317 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:24:43,332 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:24:43,337 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:24:43,356 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:24:43,381 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:24:43,384 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_3687 v_~SIZE~0_642) (<= v_~last~0_647 v_main_~c~0_3687)) InVars {~SIZE~0=v_~SIZE~0_642, main_~c~0=v_main_~c~0_3687, ~last~0=v_~last~0_647} OutVars{~SIZE~0=v_~SIZE~0_642, main_~c~0=v_main_~c~0_3687, ~last~0=v_~last~0_647} AuxVars[] AssignedVars[] [2021-05-03 00:24:43,386 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:24:43,406 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:24:43,409 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:24:43,423 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:24:43,427 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:24:43,448 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:24:43,475 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_3689 v_~SIZE~0_643) (< v_main_~c~0_3689 v_~last~0_648)) InVars {~SIZE~0=v_~SIZE~0_643, main_~c~0=v_main_~c~0_3689, ~last~0=v_~last~0_648} OutVars{~SIZE~0=v_~SIZE~0_643, main_~c~0=v_main_~c~0_3689, ~last~0=v_~last~0_648} AuxVars[] AssignedVars[] [2021-05-03 00:24:43,476 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size [2021-05-03 00:24:43,477 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:24:43,479 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:24:43,493 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:24:43,499 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:24:43,532 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size 66 [2021-05-03 00:24:43,561 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:24:43,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:24:43,636 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:24:43,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:24:43,640 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:24:43,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:24:43,643 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:24:43,646 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:24:45,201 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:24:45,202 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [926042994] [2021-05-03 00:24:45,202 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [926042994] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:24:45,202 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:24:45,202 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [34] imperfect sequences [] total 34 [2021-05-03 00:24:45,202 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1163648709] [2021-05-03 00:24:45,202 INFO L460 AbstractCegarLoop]: Interpolant automaton has 34 states [2021-05-03 00:24:45,202 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:24:45,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2021-05-03 00:24:45,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=1048, Unknown=0, NotChecked=0, Total=1190 [2021-05-03 00:24:45,203 INFO L87 Difference]: Start difference. First operand 425 states and 511 transitions. Second operand has 34 states, 34 states have (on average 2.0588235294117645) internal successors, (70), 33 states have internal predecessors, (70), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:24:48,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:24:48,972 INFO L93 Difference]: Finished difference Result 887 states and 1049 transitions. [2021-05-03 00:24:48,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2021-05-03 00:24:48,973 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 2.0588235294117645) internal successors, (70), 33 states have internal predecessors, (70), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 76 [2021-05-03 00:24:48,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:24:48,974 INFO L225 Difference]: With dead ends: 887 [2021-05-03 00:24:48,974 INFO L226 Difference]: Without dead ends: 527 [2021-05-03 00:24:48,975 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 14 SyntacticMatches, 25 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 766 ImplicationChecksByTransitivity, 1608.6ms TimeCoverageRelationStatistics Valid=168, Invalid=1164, Unknown=0, NotChecked=0, Total=1332 [2021-05-03 00:24:48,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 527 states. [2021-05-03 00:24:50,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 527 to 425. [2021-05-03 00:24:50,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 425 states, 415 states have (on average 1.2048192771084338) internal successors, (500), 415 states have internal predecessors, (500), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:24:50,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 511 transitions. [2021-05-03 00:24:50,027 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 511 transitions. Word has length 76 [2021-05-03 00:24:50,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:24:50,027 INFO L480 AbstractCegarLoop]: Abstraction has 425 states and 511 transitions. [2021-05-03 00:24:50,027 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 34 states, 34 states have (on average 2.0588235294117645) internal successors, (70), 33 states have internal predecessors, (70), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:24:50,027 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 511 transitions. [2021-05-03 00:24:50,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2021-05-03 00:24:50,027 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:24:50,027 INFO L523 BasicCegarLoop]: trace histogram [18, 18, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:24:50,028 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable816 [2021-05-03 00:24:50,028 INFO L428 AbstractCegarLoop]: === Iteration 186 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:24:50,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:24:50,028 INFO L82 PathProgramCache]: Analyzing trace with hash -1261511684, now seen corresponding path program 145 times [2021-05-03 00:24:50,028 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:24:50,028 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1310267347] [2021-05-03 00:24:50,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:24:50,036 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_~last~0_649 v_main_~c~0_3711) (< (+ v_main_~c~0_3711 1) v_~SIZE~0_644)) InVars {~SIZE~0=v_~SIZE~0_644, main_~c~0=v_main_~c~0_3711, ~last~0=v_~last~0_649} OutVars{~SIZE~0=v_~SIZE~0_644, main_~c~0=v_main_~c~0_3711, ~last~0=v_~last~0_649} AuxVars[] AssignedVars[] [2021-05-03 00:24:50,037 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size [2021-05-03 00:24:50,056 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:24:50,057 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:24:50,070 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:24:50,073 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:24:50,093 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size 78 [2021-05-03 00:24:50,119 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (+ v_main_~c~0_3713 1) v_~SIZE~0_645) (< v_main_~c~0_3713 v_~last~0_650)) InVars {~SIZE~0=v_~SIZE~0_645, main_~c~0=v_main_~c~0_3713, ~last~0=v_~last~0_650} OutVars{~SIZE~0=v_~SIZE~0_645, main_~c~0=v_main_~c~0_3713, ~last~0=v_~last~0_650} AuxVars[] AssignedVars[] [2021-05-03 00:24:50,121 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:24:50,136 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:24:50,137 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:24:50,152 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:24:50,158 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:24:50,175 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:24:50,199 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:24:50,202 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_~last~0_651 v_main_~c~0_3715) (< v_main_~c~0_3715 v_~SIZE~0_646)) InVars {~SIZE~0=v_~SIZE~0_646, main_~c~0=v_main_~c~0_3715, ~last~0=v_~last~0_651} OutVars{~SIZE~0=v_~SIZE~0_646, main_~c~0=v_main_~c~0_3715, ~last~0=v_~last~0_651} AuxVars[] AssignedVars[] [2021-05-03 00:24:50,203 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:24:50,204 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:24:50,205 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:24:50,216 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:24:50,219 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:24:50,251 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:24:50,279 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_3717 v_~SIZE~0_647) (< v_main_~c~0_3717 v_~last~0_652)) InVars {~SIZE~0=v_~SIZE~0_647, main_~c~0=v_main_~c~0_3717, ~last~0=v_~last~0_652} OutVars{~SIZE~0=v_~SIZE~0_647, main_~c~0=v_main_~c~0_3717, ~last~0=v_~last~0_652} AuxVars[] AssignedVars[] [2021-05-03 00:24:50,280 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size [2021-05-03 00:24:50,281 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:24:50,283 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:24:50,301 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:24:50,307 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:24:50,339 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size 66 [2021-05-03 00:24:50,366 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:24:50,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:24:50,519 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:24:50,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:24:50,525 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:24:50,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:24:50,529 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:24:50,535 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:24:50,658 WARN L205 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 17 [2021-05-03 00:24:53,410 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:24:53,411 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1310267347] [2021-05-03 00:24:53,411 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1310267347] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:24:53,411 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:24:53,411 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [35] imperfect sequences [] total 35 [2021-05-03 00:24:53,411 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [292200339] [2021-05-03 00:24:53,411 INFO L460 AbstractCegarLoop]: Interpolant automaton has 35 states [2021-05-03 00:24:53,411 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:24:53,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2021-05-03 00:24:53,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=1176, Unknown=0, NotChecked=0, Total=1332 [2021-05-03 00:24:53,412 INFO L87 Difference]: Start difference. First operand 425 states and 511 transitions. Second operand has 35 states, 35 states have (on average 2.0) internal successors, (70), 34 states have internal predecessors, (70), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:24:56,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:24:56,727 INFO L93 Difference]: Finished difference Result 893 states and 1051 transitions. [2021-05-03 00:24:56,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2021-05-03 00:24:56,729 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 2.0) internal successors, (70), 34 states have internal predecessors, (70), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 76 [2021-05-03 00:24:56,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:24:56,730 INFO L225 Difference]: With dead ends: 893 [2021-05-03 00:24:56,730 INFO L226 Difference]: Without dead ends: 533 [2021-05-03 00:24:56,730 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 13 SyntacticMatches, 26 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 857 ImplicationChecksByTransitivity, 2813.4ms TimeCoverageRelationStatistics Valid=160, Invalid=1246, Unknown=0, NotChecked=0, Total=1406 [2021-05-03 00:24:56,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 533 states. [2021-05-03 00:24:57,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 533 to 425. [2021-05-03 00:24:57,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 425 states, 415 states have (on average 1.2048192771084338) internal successors, (500), 415 states have internal predecessors, (500), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:24:57,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 511 transitions. [2021-05-03 00:24:57,774 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 511 transitions. Word has length 76 [2021-05-03 00:24:57,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:24:57,774 INFO L480 AbstractCegarLoop]: Abstraction has 425 states and 511 transitions. [2021-05-03 00:24:57,774 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 35 states, 35 states have (on average 2.0) internal successors, (70), 34 states have internal predecessors, (70), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:24:57,774 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 511 transitions. [2021-05-03 00:24:57,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2021-05-03 00:24:57,775 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:24:57,775 INFO L523 BasicCegarLoop]: trace histogram [18, 18, 10, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:24:57,775 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable821 [2021-05-03 00:24:57,775 INFO L428 AbstractCegarLoop]: === Iteration 187 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:24:57,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:24:57,775 INFO L82 PathProgramCache]: Analyzing trace with hash -2105517186, now seen corresponding path program 146 times [2021-05-03 00:24:57,775 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:24:57,775 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1588958050] [2021-05-03 00:24:57,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:24:57,784 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_~last~0_653 v_main_~c~0_3739) (< (+ v_main_~c~0_3739 1) v_~SIZE~0_648)) InVars {~SIZE~0=v_~SIZE~0_648, main_~c~0=v_main_~c~0_3739, ~last~0=v_~last~0_653} OutVars{~SIZE~0=v_~SIZE~0_648, main_~c~0=v_main_~c~0_3739, ~last~0=v_~last~0_653} AuxVars[] AssignedVars[] [2021-05-03 00:24:57,786 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size [2021-05-03 00:24:57,787 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:24:57,789 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:24:57,801 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:24:57,805 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:24:57,847 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size 78 [2021-05-03 00:24:57,880 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_3741 v_~last~0_654) (< (+ v_main_~c~0_3741 1) v_~SIZE~0_649)) InVars {~SIZE~0=v_~SIZE~0_649, main_~c~0=v_main_~c~0_3741, ~last~0=v_~last~0_654} OutVars{~SIZE~0=v_~SIZE~0_649, main_~c~0=v_main_~c~0_3741, ~last~0=v_~last~0_654} AuxVars[] AssignedVars[] [2021-05-03 00:24:57,882 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:24:57,883 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:24:57,885 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:24:57,905 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:24:57,912 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:24:57,948 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:24:57,977 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:24:57,980 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_3743 v_~SIZE~0_650) (<= v_~last~0_655 v_main_~c~0_3743)) InVars {~SIZE~0=v_~SIZE~0_650, main_~c~0=v_main_~c~0_3743, ~last~0=v_~last~0_655} OutVars{~SIZE~0=v_~SIZE~0_650, main_~c~0=v_main_~c~0_3743, ~last~0=v_~last~0_655} AuxVars[] AssignedVars[] [2021-05-03 00:24:57,981 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:24:58,004 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:24:58,006 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:24:58,021 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:24:58,025 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:24:58,047 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:24:58,078 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_3745 v_~SIZE~0_651) (< v_main_~c~0_3745 v_~last~0_656)) InVars {~SIZE~0=v_~SIZE~0_651, main_~c~0=v_main_~c~0_3745, ~last~0=v_~last~0_656} OutVars{~SIZE~0=v_~SIZE~0_651, main_~c~0=v_main_~c~0_3745, ~last~0=v_~last~0_656} AuxVars[] AssignedVars[] [2021-05-03 00:24:58,080 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size [2021-05-03 00:24:58,081 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:24:58,082 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:24:58,100 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:24:58,107 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:24:58,143 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size 66 [2021-05-03 00:24:58,172 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:24:58,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:24:58,298 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:24:58,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:24:58,303 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:24:58,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:24:58,305 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:24:58,310 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:25:00,935 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:25:00,935 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1588958050] [2021-05-03 00:25:00,935 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1588958050] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:25:00,935 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:25:00,936 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [36] imperfect sequences [] total 36 [2021-05-03 00:25:00,936 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571455947] [2021-05-03 00:25:00,936 INFO L460 AbstractCegarLoop]: Interpolant automaton has 36 states [2021-05-03 00:25:00,936 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:25:00,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2021-05-03 00:25:00,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=1174, Unknown=0, NotChecked=0, Total=1332 [2021-05-03 00:25:00,937 INFO L87 Difference]: Start difference. First operand 425 states and 511 transitions. Second operand has 36 states, 36 states have (on average 1.9444444444444444) internal successors, (70), 35 states have internal predecessors, (70), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:25:05,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:25:05,809 INFO L93 Difference]: Finished difference Result 869 states and 1031 transitions. [2021-05-03 00:25:05,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2021-05-03 00:25:05,811 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 1.9444444444444444) internal successors, (70), 35 states have internal predecessors, (70), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 76 [2021-05-03 00:25:05,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:25:05,812 INFO L225 Difference]: With dead ends: 869 [2021-05-03 00:25:05,812 INFO L226 Difference]: Without dead ends: 509 [2021-05-03 00:25:05,813 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 14 SyntacticMatches, 23 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 813 ImplicationChecksByTransitivity, 2654.2ms TimeCoverageRelationStatistics Valid=188, Invalid=1294, Unknown=0, NotChecked=0, Total=1482 [2021-05-03 00:25:05,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 509 states. [2021-05-03 00:25:07,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 509 to 425. [2021-05-03 00:25:07,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 425 states, 415 states have (on average 1.2048192771084338) internal successors, (500), 415 states have internal predecessors, (500), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:25:07,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 511 transitions. [2021-05-03 00:25:07,262 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 511 transitions. Word has length 76 [2021-05-03 00:25:07,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:25:07,262 INFO L480 AbstractCegarLoop]: Abstraction has 425 states and 511 transitions. [2021-05-03 00:25:07,262 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 36 states, 36 states have (on average 1.9444444444444444) internal successors, (70), 35 states have internal predecessors, (70), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:25:07,262 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 511 transitions. [2021-05-03 00:25:07,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2021-05-03 00:25:07,262 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:25:07,262 INFO L523 BasicCegarLoop]: trace histogram [18, 18, 11, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:25:07,263 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable826 [2021-05-03 00:25:07,263 INFO L428 AbstractCegarLoop]: === Iteration 188 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:25:07,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:25:07,263 INFO L82 PathProgramCache]: Analyzing trace with hash -1830757572, now seen corresponding path program 147 times [2021-05-03 00:25:07,263 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:25:07,263 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1251948541] [2021-05-03 00:25:07,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:25:07,274 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_~last~0_657 v_main_~c~0_3767) (< (+ v_main_~c~0_3767 1) v_~SIZE~0_652)) InVars {~SIZE~0=v_~SIZE~0_652, main_~c~0=v_main_~c~0_3767, ~last~0=v_~last~0_657} OutVars{~SIZE~0=v_~SIZE~0_652, main_~c~0=v_main_~c~0_3767, ~last~0=v_~last~0_657} AuxVars[] AssignedVars[] [2021-05-03 00:25:07,277 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size [2021-05-03 00:25:07,278 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:25:07,281 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:25:07,299 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:25:07,304 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:25:07,355 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size 78 [2021-05-03 00:25:07,398 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_3769 v_~last~0_658) (< (+ v_main_~c~0_3769 1) v_~SIZE~0_653)) InVars {~SIZE~0=v_~SIZE~0_653, main_~c~0=v_main_~c~0_3769, ~last~0=v_~last~0_658} OutVars{~SIZE~0=v_~SIZE~0_653, main_~c~0=v_main_~c~0_3769, ~last~0=v_~last~0_658} AuxVars[] AssignedVars[] [2021-05-03 00:25:07,400 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:25:07,424 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:25:07,427 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:25:07,450 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:25:07,459 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:25:07,488 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:25:07,522 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:25:07,526 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_~last~0_659 v_main_~c~0_3771) (< v_main_~c~0_3771 v_~SIZE~0_654)) InVars {~SIZE~0=v_~SIZE~0_654, main_~c~0=v_main_~c~0_3771, ~last~0=v_~last~0_659} OutVars{~SIZE~0=v_~SIZE~0_654, main_~c~0=v_main_~c~0_3771, ~last~0=v_~last~0_659} AuxVars[] AssignedVars[] [2021-05-03 00:25:07,529 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:25:07,530 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:25:07,532 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:25:07,548 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:25:07,555 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:25:07,637 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:25:07,689 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_3773 v_~SIZE~0_655) (< v_main_~c~0_3773 v_~last~0_660)) InVars {~SIZE~0=v_~SIZE~0_655, main_~c~0=v_main_~c~0_3773, ~last~0=v_~last~0_660} OutVars{~SIZE~0=v_~SIZE~0_655, main_~c~0=v_main_~c~0_3773, ~last~0=v_~last~0_660} AuxVars[] AssignedVars[] [2021-05-03 00:25:07,692 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size [2021-05-03 00:25:07,693 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:25:07,696 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:25:07,727 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:25:07,739 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:25:07,787 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size 66 [2021-05-03 00:25:07,816 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:25:07,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:25:07,894 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:25:07,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:25:07,898 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:25:07,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:25:07,900 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:25:07,904 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:25:10,041 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:25:10,042 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1251948541] [2021-05-03 00:25:10,042 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1251948541] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:25:10,042 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:25:10,042 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [37] imperfect sequences [] total 37 [2021-05-03 00:25:10,042 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049444690] [2021-05-03 00:25:10,043 INFO L460 AbstractCegarLoop]: Interpolant automaton has 37 states [2021-05-03 00:25:10,043 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:25:10,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2021-05-03 00:25:10,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=1240, Unknown=0, NotChecked=0, Total=1406 [2021-05-03 00:25:10,044 INFO L87 Difference]: Start difference. First operand 425 states and 511 transitions. Second operand has 37 states, 37 states have (on average 1.8918918918918919) internal successors, (70), 36 states have internal predecessors, (70), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:25:15,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:25:15,399 INFO L93 Difference]: Finished difference Result 860 states and 1022 transitions. [2021-05-03 00:25:15,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2021-05-03 00:25:15,401 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 1.8918918918918919) internal successors, (70), 36 states have internal predecessors, (70), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 76 [2021-05-03 00:25:15,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:25:15,402 INFO L225 Difference]: With dead ends: 860 [2021-05-03 00:25:15,402 INFO L226 Difference]: Without dead ends: 500 [2021-05-03 00:25:15,404 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 15 SyntacticMatches, 21 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 797 ImplicationChecksByTransitivity, 2200.8ms TimeCoverageRelationStatistics Valid=198, Invalid=1362, Unknown=0, NotChecked=0, Total=1560 [2021-05-03 00:25:15,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 500 states. [2021-05-03 00:25:16,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 500 to 425. [2021-05-03 00:25:16,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 425 states, 415 states have (on average 1.2048192771084338) internal successors, (500), 415 states have internal predecessors, (500), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:25:16,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 511 transitions. [2021-05-03 00:25:16,608 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 511 transitions. Word has length 76 [2021-05-03 00:25:16,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:25:16,608 INFO L480 AbstractCegarLoop]: Abstraction has 425 states and 511 transitions. [2021-05-03 00:25:16,609 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 37 states, 37 states have (on average 1.8918918918918919) internal successors, (70), 36 states have internal predecessors, (70), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:25:16,609 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 511 transitions. [2021-05-03 00:25:16,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2021-05-03 00:25:16,609 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:25:16,609 INFO L523 BasicCegarLoop]: trace histogram [18, 18, 12, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:25:16,609 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable831 [2021-05-03 00:25:16,609 INFO L428 AbstractCegarLoop]: === Iteration 189 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:25:16,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:25:16,609 INFO L82 PathProgramCache]: Analyzing trace with hash -444554178, now seen corresponding path program 148 times [2021-05-03 00:25:16,610 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:25:16,610 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [35107080] [2021-05-03 00:25:16,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:25:16,619 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_~last~0_661 v_main_~c~0_3795) (< (+ v_main_~c~0_3795 1) v_~SIZE~0_656)) InVars {~SIZE~0=v_~SIZE~0_656, main_~c~0=v_main_~c~0_3795, ~last~0=v_~last~0_661} OutVars{~SIZE~0=v_~SIZE~0_656, main_~c~0=v_main_~c~0_3795, ~last~0=v_~last~0_661} AuxVars[] AssignedVars[] [2021-05-03 00:25:16,621 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size [2021-05-03 00:25:16,622 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:25:16,624 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:25:16,640 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:25:16,645 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:25:16,693 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size 78 [2021-05-03 00:25:16,726 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (+ v_main_~c~0_3797 1) v_~SIZE~0_657) (< v_main_~c~0_3797 v_~last~0_662)) InVars {~SIZE~0=v_~SIZE~0_657, main_~c~0=v_main_~c~0_3797, ~last~0=v_~last~0_662} OutVars{~SIZE~0=v_~SIZE~0_657, main_~c~0=v_main_~c~0_3797, ~last~0=v_~last~0_662} AuxVars[] AssignedVars[] [2021-05-03 00:25:16,728 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:25:16,748 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:25:16,750 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:25:16,770 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:25:16,778 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:25:16,800 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:25:16,832 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:25:16,836 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_~last~0_663 v_main_~c~0_3799) (< v_main_~c~0_3799 v_~SIZE~0_658)) InVars {~SIZE~0=v_~SIZE~0_658, main_~c~0=v_main_~c~0_3799, ~last~0=v_~last~0_663} OutVars{~SIZE~0=v_~SIZE~0_658, main_~c~0=v_main_~c~0_3799, ~last~0=v_~last~0_663} AuxVars[] AssignedVars[] [2021-05-03 00:25:16,838 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:25:16,840 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:25:16,842 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:25:16,860 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:25:16,864 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:25:16,911 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:25:16,943 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_3801 v_~SIZE~0_659) (< v_main_~c~0_3801 v_~last~0_664)) InVars {~SIZE~0=v_~SIZE~0_659, main_~c~0=v_main_~c~0_3801, ~last~0=v_~last~0_664} OutVars{~SIZE~0=v_~SIZE~0_659, main_~c~0=v_main_~c~0_3801, ~last~0=v_~last~0_664} AuxVars[] AssignedVars[] [2021-05-03 00:25:16,945 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size [2021-05-03 00:25:16,945 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:25:16,947 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:25:16,964 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:25:16,971 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:25:17,010 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size 66 [2021-05-03 00:25:17,042 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:25:17,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:25:17,183 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:25:17,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:25:17,189 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:25:17,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:25:17,194 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:25:17,197 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:25:19,003 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:25:19,003 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [35107080] [2021-05-03 00:25:19,003 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [35107080] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:25:19,003 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:25:19,003 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [38] imperfect sequences [] total 38 [2021-05-03 00:25:19,003 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048440068] [2021-05-03 00:25:19,004 INFO L460 AbstractCegarLoop]: Interpolant automaton has 38 states [2021-05-03 00:25:19,004 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:25:19,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2021-05-03 00:25:19,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=181, Invalid=1379, Unknown=0, NotChecked=0, Total=1560 [2021-05-03 00:25:19,005 INFO L87 Difference]: Start difference. First operand 425 states and 511 transitions. Second operand has 38 states, 38 states have (on average 1.8421052631578947) internal successors, (70), 37 states have internal predecessors, (70), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:25:23,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:25:23,629 INFO L93 Difference]: Finished difference Result 875 states and 1033 transitions. [2021-05-03 00:25:23,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2021-05-03 00:25:23,631 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 1.8421052631578947) internal successors, (70), 37 states have internal predecessors, (70), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 76 [2021-05-03 00:25:23,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:25:23,632 INFO L225 Difference]: With dead ends: 875 [2021-05-03 00:25:23,632 INFO L226 Difference]: Without dead ends: 515 [2021-05-03 00:25:23,633 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 12 SyntacticMatches, 23 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 926 ImplicationChecksByTransitivity, 1950.3ms TimeCoverageRelationStatistics Valid=214, Invalid=1508, Unknown=0, NotChecked=0, Total=1722 [2021-05-03 00:25:23,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 515 states. [2021-05-03 00:25:25,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 515 to 425. [2021-05-03 00:25:25,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 425 states, 415 states have (on average 1.2048192771084338) internal successors, (500), 415 states have internal predecessors, (500), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:25:25,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 511 transitions. [2021-05-03 00:25:25,050 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 511 transitions. Word has length 76 [2021-05-03 00:25:25,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:25:25,050 INFO L480 AbstractCegarLoop]: Abstraction has 425 states and 511 transitions. [2021-05-03 00:25:25,050 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 38 states, 38 states have (on average 1.8421052631578947) internal successors, (70), 37 states have internal predecessors, (70), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:25:25,050 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 511 transitions. [2021-05-03 00:25:25,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2021-05-03 00:25:25,050 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:25:25,050 INFO L523 BasicCegarLoop]: trace histogram [18, 18, 13, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:25:25,050 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable836 [2021-05-03 00:25:25,050 INFO L428 AbstractCegarLoop]: === Iteration 190 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:25:25,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:25:25,051 INFO L82 PathProgramCache]: Analyzing trace with hash -382514564, now seen corresponding path program 149 times [2021-05-03 00:25:25,051 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:25:25,051 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [510512044] [2021-05-03 00:25:25,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:25:25,076 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (+ v_main_~c~0_3823 1) v_~SIZE~0_660) (<= v_~last~0_665 v_main_~c~0_3823)) InVars {~SIZE~0=v_~SIZE~0_660, main_~c~0=v_main_~c~0_3823, ~last~0=v_~last~0_665} OutVars{~SIZE~0=v_~SIZE~0_660, main_~c~0=v_main_~c~0_3823, ~last~0=v_~last~0_665} AuxVars[] AssignedVars[] [2021-05-03 00:25:25,078 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size [2021-05-03 00:25:25,113 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:25:25,115 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:25:25,140 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:25:25,144 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:25:25,181 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size 78 [2021-05-03 00:25:25,253 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_3825 v_~last~0_666) (< (+ v_main_~c~0_3825 1) v_~SIZE~0_661)) InVars {~SIZE~0=v_~SIZE~0_661, main_~c~0=v_main_~c~0_3825, ~last~0=v_~last~0_666} OutVars{~SIZE~0=v_~SIZE~0_661, main_~c~0=v_main_~c~0_3825, ~last~0=v_~last~0_666} AuxVars[] AssignedVars[] [2021-05-03 00:25:25,254 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:25:25,256 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:25:25,257 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:25:25,279 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:25:25,288 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:25:25,330 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:25:25,360 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:25:25,363 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_3827 v_~SIZE~0_662) (<= v_~last~0_667 v_main_~c~0_3827)) InVars {~SIZE~0=v_~SIZE~0_662, main_~c~0=v_main_~c~0_3827, ~last~0=v_~last~0_667} OutVars{~SIZE~0=v_~SIZE~0_662, main_~c~0=v_main_~c~0_3827, ~last~0=v_~last~0_667} AuxVars[] AssignedVars[] [2021-05-03 00:25:25,365 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:25:25,366 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:25:25,368 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:25:25,385 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:25:25,389 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:25:25,432 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:25:25,463 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_3829 v_~SIZE~0_663) (< v_main_~c~0_3829 v_~last~0_668)) InVars {~SIZE~0=v_~SIZE~0_663, main_~c~0=v_main_~c~0_3829, ~last~0=v_~last~0_668} OutVars{~SIZE~0=v_~SIZE~0_663, main_~c~0=v_main_~c~0_3829, ~last~0=v_~last~0_668} AuxVars[] AssignedVars[] [2021-05-03 00:25:25,465 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size [2021-05-03 00:25:25,466 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:25:25,467 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:25:25,490 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:25:25,497 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:25:25,535 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size 66 [2021-05-03 00:25:25,569 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:25:25,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:25:25,647 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:25:25,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:25:25,652 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:25:25,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:25:25,654 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:25:25,658 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:25:27,706 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:25:27,707 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [510512044] [2021-05-03 00:25:27,707 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [510512044] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:25:27,707 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:25:27,707 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [39] imperfect sequences [] total 39 [2021-05-03 00:25:27,707 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937424138] [2021-05-03 00:25:27,707 INFO L460 AbstractCegarLoop]: Interpolant automaton has 39 states [2021-05-03 00:25:27,707 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:25:27,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2021-05-03 00:25:27,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=182, Invalid=1378, Unknown=0, NotChecked=0, Total=1560 [2021-05-03 00:25:27,708 INFO L87 Difference]: Start difference. First operand 425 states and 511 transitions. Second operand has 39 states, 39 states have (on average 1.794871794871795) internal successors, (70), 38 states have internal predecessors, (70), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:25:32,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:25:32,072 INFO L93 Difference]: Finished difference Result 842 states and 1004 transitions. [2021-05-03 00:25:32,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2021-05-03 00:25:32,075 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 1.794871794871795) internal successors, (70), 38 states have internal predecessors, (70), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 76 [2021-05-03 00:25:32,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:25:32,075 INFO L225 Difference]: With dead ends: 842 [2021-05-03 00:25:32,075 INFO L226 Difference]: Without dead ends: 482 [2021-05-03 00:25:32,076 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 13 SyntacticMatches, 21 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 846 ImplicationChecksByTransitivity, 2073.4ms TimeCoverageRelationStatistics Valid=218, Invalid=1504, Unknown=0, NotChecked=0, Total=1722 [2021-05-03 00:25:32,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482 states. [2021-05-03 00:25:33,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 425. [2021-05-03 00:25:33,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 425 states, 415 states have (on average 1.2048192771084338) internal successors, (500), 415 states have internal predecessors, (500), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:25:33,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 511 transitions. [2021-05-03 00:25:33,155 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 511 transitions. Word has length 76 [2021-05-03 00:25:33,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:25:33,155 INFO L480 AbstractCegarLoop]: Abstraction has 425 states and 511 transitions. [2021-05-03 00:25:33,155 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 39 states, 39 states have (on average 1.794871794871795) internal successors, (70), 38 states have internal predecessors, (70), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:25:33,156 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 511 transitions. [2021-05-03 00:25:33,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2021-05-03 00:25:33,156 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:25:33,156 INFO L523 BasicCegarLoop]: trace histogram [18, 18, 14, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:25:33,156 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable841 [2021-05-03 00:25:33,156 INFO L428 AbstractCegarLoop]: === Iteration 191 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:25:33,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:25:33,156 INFO L82 PathProgramCache]: Analyzing trace with hash 2107014398, now seen corresponding path program 150 times [2021-05-03 00:25:33,156 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:25:33,157 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1602957939] [2021-05-03 00:25:33,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:25:33,167 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (+ v_main_~c~0_3851 1) v_~SIZE~0_664) (<= v_~last~0_669 v_main_~c~0_3851)) InVars {~SIZE~0=v_~SIZE~0_664, main_~c~0=v_main_~c~0_3851, ~last~0=v_~last~0_669} OutVars{~SIZE~0=v_~SIZE~0_664, main_~c~0=v_main_~c~0_3851, ~last~0=v_~last~0_669} AuxVars[] AssignedVars[] [2021-05-03 00:25:33,168 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size [2021-05-03 00:25:33,196 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:25:33,208 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:25:33,226 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:25:33,231 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:25:33,260 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size 78 [2021-05-03 00:25:33,299 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_3853 v_~last~0_670) (< (+ v_main_~c~0_3853 1) v_~SIZE~0_665)) InVars {~SIZE~0=v_~SIZE~0_665, main_~c~0=v_main_~c~0_3853, ~last~0=v_~last~0_670} OutVars{~SIZE~0=v_~SIZE~0_665, main_~c~0=v_main_~c~0_3853, ~last~0=v_~last~0_670} AuxVars[] AssignedVars[] [2021-05-03 00:25:33,302 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:25:33,303 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:25:33,306 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:25:33,336 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:25:33,346 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:25:33,398 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:25:33,442 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:25:33,446 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_~last~0_671 v_main_~c~0_3855) (< v_main_~c~0_3855 v_~SIZE~0_666)) InVars {~SIZE~0=v_~SIZE~0_666, main_~c~0=v_main_~c~0_3855, ~last~0=v_~last~0_671} OutVars{~SIZE~0=v_~SIZE~0_666, main_~c~0=v_main_~c~0_3855, ~last~0=v_~last~0_671} AuxVars[] AssignedVars[] [2021-05-03 00:25:33,449 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:25:33,483 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:25:33,486 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:25:33,506 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:25:33,512 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:25:33,549 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:25:33,650 WARN L205 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2021-05-03 00:25:33,662 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_3857 v_~last~0_672) (< v_main_~c~0_3857 v_~SIZE~0_667)) InVars {~SIZE~0=v_~SIZE~0_667, main_~c~0=v_main_~c~0_3857, ~last~0=v_~last~0_672} OutVars{~SIZE~0=v_~SIZE~0_667, main_~c~0=v_main_~c~0_3857, ~last~0=v_~last~0_672} AuxVars[] AssignedVars[] [2021-05-03 00:25:33,666 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size [2021-05-03 00:25:33,669 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:25:33,673 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:25:33,725 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:25:33,747 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:25:33,839 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size 66 [2021-05-03 00:25:33,937 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:25:33,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:25:34,186 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:25:34,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:25:34,193 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:25:34,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:25:34,196 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:25:34,202 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:25:34,329 WARN L205 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 17 [2021-05-03 00:25:37,591 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:25:37,591 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1602957939] [2021-05-03 00:25:37,591 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1602957939] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:25:37,591 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:25:37,592 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [40] imperfect sequences [] total 40 [2021-05-03 00:25:37,592 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1923770006] [2021-05-03 00:25:37,592 INFO L460 AbstractCegarLoop]: Interpolant automaton has 40 states [2021-05-03 00:25:37,592 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:25:37,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2021-05-03 00:25:37,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=197, Invalid=1525, Unknown=0, NotChecked=0, Total=1722 [2021-05-03 00:25:37,593 INFO L87 Difference]: Start difference. First operand 425 states and 511 transitions. Second operand has 40 states, 40 states have (on average 1.75) internal successors, (70), 39 states have internal predecessors, (70), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:25:41,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:25:41,672 INFO L93 Difference]: Finished difference Result 863 states and 1021 transitions. [2021-05-03 00:25:41,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2021-05-03 00:25:41,674 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 1.75) internal successors, (70), 39 states have internal predecessors, (70), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 76 [2021-05-03 00:25:41,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:25:41,675 INFO L225 Difference]: With dead ends: 863 [2021-05-03 00:25:41,675 INFO L226 Difference]: Without dead ends: 503 [2021-05-03 00:25:41,675 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 12 SyntacticMatches, 21 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 907 ImplicationChecksByTransitivity, 3419.5ms TimeCoverageRelationStatistics Valid=234, Invalid=1658, Unknown=0, NotChecked=0, Total=1892 [2021-05-03 00:25:41,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 503 states. [2021-05-03 00:25:42,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 503 to 425. [2021-05-03 00:25:42,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 425 states, 415 states have (on average 1.2048192771084338) internal successors, (500), 415 states have internal predecessors, (500), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:25:42,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 511 transitions. [2021-05-03 00:25:42,879 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 511 transitions. Word has length 76 [2021-05-03 00:25:42,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:25:42,879 INFO L480 AbstractCegarLoop]: Abstraction has 425 states and 511 transitions. [2021-05-03 00:25:42,880 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 40 states, 40 states have (on average 1.75) internal successors, (70), 39 states have internal predecessors, (70), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:25:42,880 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 511 transitions. [2021-05-03 00:25:42,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2021-05-03 00:25:42,880 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:25:42,880 INFO L523 BasicCegarLoop]: trace histogram [18, 18, 15, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:25:42,882 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable846 [2021-05-03 00:25:42,882 INFO L428 AbstractCegarLoop]: === Iteration 192 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:25:42,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:25:42,882 INFO L82 PathProgramCache]: Analyzing trace with hash 1289365948, now seen corresponding path program 151 times [2021-05-03 00:25:42,882 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:25:42,882 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1832520155] [2021-05-03 00:25:42,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:25:42,892 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (+ v_main_~c~0_3879 1) v_~SIZE~0_668) (<= v_~last~0_673 v_main_~c~0_3879)) InVars {~SIZE~0=v_~SIZE~0_668, main_~c~0=v_main_~c~0_3879, ~last~0=v_~last~0_673} OutVars{~SIZE~0=v_~SIZE~0_668, main_~c~0=v_main_~c~0_3879, ~last~0=v_~last~0_673} AuxVars[] AssignedVars[] [2021-05-03 00:25:42,894 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size [2021-05-03 00:25:42,914 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:25:42,916 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:25:42,931 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:25:42,935 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:25:42,957 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size 78 [2021-05-03 00:25:42,987 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_3881 v_~last~0_674) (< (+ v_main_~c~0_3881 1) v_~SIZE~0_669)) InVars {~SIZE~0=v_~SIZE~0_669, main_~c~0=v_main_~c~0_3881, ~last~0=v_~last~0_674} OutVars{~SIZE~0=v_~SIZE~0_669, main_~c~0=v_main_~c~0_3881, ~last~0=v_~last~0_674} AuxVars[] AssignedVars[] [2021-05-03 00:25:42,989 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:25:42,990 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:25:42,991 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:25:43,010 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:25:43,017 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:25:43,050 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:25:43,079 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:25:43,082 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_3883 v_~SIZE~0_670) (<= v_~last~0_675 v_main_~c~0_3883)) InVars {~SIZE~0=v_~SIZE~0_670, main_~c~0=v_main_~c~0_3883, ~last~0=v_~last~0_675} OutVars{~SIZE~0=v_~SIZE~0_670, main_~c~0=v_main_~c~0_3883, ~last~0=v_~last~0_675} AuxVars[] AssignedVars[] [2021-05-03 00:25:43,084 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:25:43,105 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:25:43,107 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:25:43,123 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:25:43,127 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:25:43,150 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:25:43,180 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_3885 v_~SIZE~0_671) (< v_main_~c~0_3885 v_~last~0_676)) InVars {~SIZE~0=v_~SIZE~0_671, main_~c~0=v_main_~c~0_3885, ~last~0=v_~last~0_676} OutVars{~SIZE~0=v_~SIZE~0_671, main_~c~0=v_main_~c~0_3885, ~last~0=v_~last~0_676} AuxVars[] AssignedVars[] [2021-05-03 00:25:43,182 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size [2021-05-03 00:25:43,183 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:25:43,184 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:25:43,202 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:25:43,208 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:25:43,248 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size 66 [2021-05-03 00:25:43,277 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:25:43,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:25:43,563 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:25:43,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:25:43,568 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:25:43,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:25:43,570 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:25:43,574 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:25:46,245 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:25:46,246 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1832520155] [2021-05-03 00:25:46,246 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1832520155] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:25:46,246 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:25:46,246 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [45] imperfect sequences [] total 45 [2021-05-03 00:25:46,246 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1013398485] [2021-05-03 00:25:46,246 INFO L460 AbstractCegarLoop]: Interpolant automaton has 45 states [2021-05-03 00:25:46,246 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:25:46,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2021-05-03 00:25:46,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=1909, Unknown=0, NotChecked=0, Total=2162 [2021-05-03 00:25:46,247 INFO L87 Difference]: Start difference. First operand 425 states and 511 transitions. Second operand has 45 states, 45 states have (on average 1.5555555555555556) internal successors, (70), 43 states have internal predecessors, (70), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:25:51,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:25:51,920 INFO L93 Difference]: Finished difference Result 870 states and 1030 transitions. [2021-05-03 00:25:51,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2021-05-03 00:25:51,922 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 45 states have (on average 1.5555555555555556) internal successors, (70), 43 states have internal predecessors, (70), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 76 [2021-05-03 00:25:51,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:25:51,923 INFO L225 Difference]: With dead ends: 870 [2021-05-03 00:25:51,923 INFO L226 Difference]: Without dead ends: 510 [2021-05-03 00:25:51,924 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 7 SyntacticMatches, 19 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 963 ImplicationChecksByTransitivity, 2991.1ms TimeCoverageRelationStatistics Valid=335, Invalid=2215, Unknown=0, NotChecked=0, Total=2550 [2021-05-03 00:25:51,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 510 states. [2021-05-03 00:25:53,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 510 to 425. [2021-05-03 00:25:53,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 425 states, 415 states have (on average 1.2048192771084338) internal successors, (500), 415 states have internal predecessors, (500), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:25:53,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 511 transitions. [2021-05-03 00:25:53,092 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 511 transitions. Word has length 76 [2021-05-03 00:25:53,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:25:53,092 INFO L480 AbstractCegarLoop]: Abstraction has 425 states and 511 transitions. [2021-05-03 00:25:53,092 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 45 states, 45 states have (on average 1.5555555555555556) internal successors, (70), 43 states have internal predecessors, (70), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:25:53,093 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 511 transitions. [2021-05-03 00:25:53,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2021-05-03 00:25:53,093 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:25:53,093 INFO L523 BasicCegarLoop]: trace histogram [18, 18, 16, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:25:53,096 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable851 [2021-05-03 00:25:53,096 INFO L428 AbstractCegarLoop]: === Iteration 193 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:25:53,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:25:53,097 INFO L82 PathProgramCache]: Analyzing trace with hash -298981954, now seen corresponding path program 152 times [2021-05-03 00:25:53,097 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:25:53,097 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2042018801] [2021-05-03 00:25:53,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:25:53,106 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_~last~0_677 v_main_~c~0_3907) (< (+ v_main_~c~0_3907 1) v_~SIZE~0_672)) InVars {~SIZE~0=v_~SIZE~0_672, main_~c~0=v_main_~c~0_3907, ~last~0=v_~last~0_677} OutVars{~SIZE~0=v_~SIZE~0_672, main_~c~0=v_main_~c~0_3907, ~last~0=v_~last~0_677} AuxVars[] AssignedVars[] [2021-05-03 00:25:53,109 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size [2021-05-03 00:25:53,110 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:25:53,112 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:25:53,132 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:25:53,136 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:25:53,179 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size 78 [2021-05-03 00:25:53,210 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_3909 v_~last~0_678) (< (+ v_main_~c~0_3909 1) v_~SIZE~0_673)) InVars {~SIZE~0=v_~SIZE~0_673, main_~c~0=v_main_~c~0_3909, ~last~0=v_~last~0_678} OutVars{~SIZE~0=v_~SIZE~0_673, main_~c~0=v_main_~c~0_3909, ~last~0=v_~last~0_678} AuxVars[] AssignedVars[] [2021-05-03 00:25:53,212 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:25:53,214 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:25:53,215 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:25:53,236 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:25:53,244 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:25:53,278 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:25:53,309 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:25:53,312 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_~last~0_679 v_main_~c~0_3911) (< v_main_~c~0_3911 v_~SIZE~0_674)) InVars {~SIZE~0=v_~SIZE~0_674, main_~c~0=v_main_~c~0_3911, ~last~0=v_~last~0_679} OutVars{~SIZE~0=v_~SIZE~0_674, main_~c~0=v_main_~c~0_3911, ~last~0=v_~last~0_679} AuxVars[] AssignedVars[] [2021-05-03 00:25:53,314 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:25:53,338 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:25:53,339 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:25:53,352 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:25:53,355 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:25:53,381 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:25:53,421 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_3913 v_~SIZE~0_675) (< v_main_~c~0_3913 v_~last~0_680)) InVars {~SIZE~0=v_~SIZE~0_675, main_~c~0=v_main_~c~0_3913, ~last~0=v_~last~0_680} OutVars{~SIZE~0=v_~SIZE~0_675, main_~c~0=v_main_~c~0_3913, ~last~0=v_~last~0_680} AuxVars[] AssignedVars[] [2021-05-03 00:25:53,423 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size [2021-05-03 00:25:53,424 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:25:53,426 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:25:53,447 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:25:53,454 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:25:53,487 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size 66 [2021-05-03 00:25:53,514 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:25:53,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:25:53,595 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:25:53,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:25:53,599 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:25:53,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:25:53,600 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:25:53,602 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:25:55,606 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:25:55,606 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2042018801] [2021-05-03 00:25:55,606 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [2042018801] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:25:55,606 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:25:55,607 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [42] imperfect sequences [] total 42 [2021-05-03 00:25:55,607 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117004077] [2021-05-03 00:25:55,607 INFO L460 AbstractCegarLoop]: Interpolant automaton has 42 states [2021-05-03 00:25:55,607 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:25:55,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2021-05-03 00:25:55,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=213, Invalid=1679, Unknown=0, NotChecked=0, Total=1892 [2021-05-03 00:25:55,608 INFO L87 Difference]: Start difference. First operand 425 states and 511 transitions. Second operand has 42 states, 42 states have (on average 1.6666666666666667) internal successors, (70), 41 states have internal predecessors, (70), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:26:00,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:26:00,866 INFO L93 Difference]: Finished difference Result 855 states and 1013 transitions. [2021-05-03 00:26:00,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2021-05-03 00:26:00,869 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 42 states have (on average 1.6666666666666667) internal successors, (70), 41 states have internal predecessors, (70), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 76 [2021-05-03 00:26:00,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:26:00,869 INFO L225 Difference]: With dead ends: 855 [2021-05-03 00:26:00,869 INFO L226 Difference]: Without dead ends: 495 [2021-05-03 00:26:00,870 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 12 SyntacticMatches, 19 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 852 ImplicationChecksByTransitivity, 2043.4ms TimeCoverageRelationStatistics Valid=254, Invalid=1816, Unknown=0, NotChecked=0, Total=2070 [2021-05-03 00:26:00,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 495 states. [2021-05-03 00:26:01,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 495 to 425. [2021-05-03 00:26:01,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 425 states, 415 states have (on average 1.2048192771084338) internal successors, (500), 415 states have internal predecessors, (500), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:26:01,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 511 transitions. [2021-05-03 00:26:01,908 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 511 transitions. Word has length 76 [2021-05-03 00:26:01,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:26:01,908 INFO L480 AbstractCegarLoop]: Abstraction has 425 states and 511 transitions. [2021-05-03 00:26:01,908 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 42 states, 42 states have (on average 1.6666666666666667) internal successors, (70), 41 states have internal predecessors, (70), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:26:01,908 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 511 transitions. [2021-05-03 00:26:01,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2021-05-03 00:26:01,909 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:26:01,909 INFO L523 BasicCegarLoop]: trace histogram [18, 18, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:26:01,909 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable856 [2021-05-03 00:26:01,909 INFO L428 AbstractCegarLoop]: === Iteration 194 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:26:01,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:26:01,909 INFO L82 PathProgramCache]: Analyzing trace with hash -1310099204, now seen corresponding path program 153 times [2021-05-03 00:26:01,909 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:26:01,909 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [806864737] [2021-05-03 00:26:01,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:26:01,916 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_3935 v_~last~0_681) (< (+ v_main_~c~0_3935 1) v_~SIZE~0_676)) InVars {~SIZE~0=v_~SIZE~0_676, main_~c~0=v_main_~c~0_3935, ~last~0=v_~last~0_681} OutVars{~SIZE~0=v_~SIZE~0_676, main_~c~0=v_main_~c~0_3935, ~last~0=v_~last~0_681} AuxVars[] AssignedVars[] [2021-05-03 00:26:01,917 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:26:01,933 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:26:01,935 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:26:01,951 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:26:01,957 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:26:01,974 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:26:02,007 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:26:02,009 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_~last~0_682 v_main_~c~0_3937) (< v_main_~c~0_3937 v_~SIZE~0_677)) InVars {~SIZE~0=v_~SIZE~0_677, main_~c~0=v_main_~c~0_3937, ~last~0=v_~last~0_682} OutVars{~SIZE~0=v_~SIZE~0_677, main_~c~0=v_main_~c~0_3937, ~last~0=v_~last~0_682} AuxVars[] AssignedVars[] [2021-05-03 00:26:02,011 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:26:02,034 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:26:02,036 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:26:02,048 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:26:02,052 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:26:02,072 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:26:02,104 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_3939 v_~last~0_683) (< v_main_~c~0_3939 v_~SIZE~0_678)) InVars {~SIZE~0=v_~SIZE~0_678, main_~c~0=v_main_~c~0_3939, ~last~0=v_~last~0_683} OutVars{~SIZE~0=v_~SIZE~0_678, main_~c~0=v_main_~c~0_3939, ~last~0=v_~last~0_683} AuxVars[] AssignedVars[] [2021-05-03 00:26:02,106 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size [2021-05-03 00:26:02,107 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:26:02,108 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:26:02,125 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:26:02,132 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:26:02,164 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size 66 [2021-05-03 00:26:02,194 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:26:02,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:26:02,288 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:26:02,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:26:02,292 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:26:02,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:26:02,294 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:26:02,297 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:26:03,887 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:26:03,887 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [806864737] [2021-05-03 00:26:03,887 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [806864737] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:26:03,888 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:26:03,888 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [43] imperfect sequences [] total 43 [2021-05-03 00:26:03,888 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1927832876] [2021-05-03 00:26:03,888 INFO L460 AbstractCegarLoop]: Interpolant automaton has 43 states [2021-05-03 00:26:03,888 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:26:03,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2021-05-03 00:26:03,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=221, Invalid=1759, Unknown=0, NotChecked=0, Total=1980 [2021-05-03 00:26:03,889 INFO L87 Difference]: Start difference. First operand 425 states and 511 transitions. Second operand has 43 states, 43 states have (on average 1.627906976744186) internal successors, (70), 42 states have internal predecessors, (70), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:26:07,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:26:07,832 INFO L93 Difference]: Finished difference Result 858 states and 1022 transitions. [2021-05-03 00:26:07,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2021-05-03 00:26:07,834 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 43 states have (on average 1.627906976744186) internal successors, (70), 42 states have internal predecessors, (70), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 76 [2021-05-03 00:26:07,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:26:07,835 INFO L225 Difference]: With dead ends: 858 [2021-05-03 00:26:07,835 INFO L226 Difference]: Without dead ends: 498 [2021-05-03 00:26:07,836 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 12 SyntacticMatches, 18 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 811 ImplicationChecksByTransitivity, 1643.0ms TimeCoverageRelationStatistics Valid=264, Invalid=1898, Unknown=0, NotChecked=0, Total=2162 [2021-05-03 00:26:07,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 498 states. [2021-05-03 00:26:09,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 498 to 429. [2021-05-03 00:26:09,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 429 states, 419 states have (on average 1.20763723150358) internal successors, (506), 419 states have internal predecessors, (506), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:26:09,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 429 states to 429 states and 517 transitions. [2021-05-03 00:26:09,163 INFO L78 Accepts]: Start accepts. Automaton has 429 states and 517 transitions. Word has length 76 [2021-05-03 00:26:09,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:26:09,163 INFO L480 AbstractCegarLoop]: Abstraction has 429 states and 517 transitions. [2021-05-03 00:26:09,164 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 43 states, 43 states have (on average 1.627906976744186) internal successors, (70), 42 states have internal predecessors, (70), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:26:09,164 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 517 transitions. [2021-05-03 00:26:09,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2021-05-03 00:26:09,164 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:26:09,164 INFO L523 BasicCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:26:09,164 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable860 [2021-05-03 00:26:09,164 INFO L428 AbstractCegarLoop]: === Iteration 195 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:26:09,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:26:09,164 INFO L82 PathProgramCache]: Analyzing trace with hash -1475639554, now seen corresponding path program 18 times [2021-05-03 00:26:09,164 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:26:09,164 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1288293165] [2021-05-03 00:26:09,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:26:09,168 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_3961 v_~last~0_684) (< (+ v_main_~c~0_3961 1) v_~SIZE~0_679)) InVars {~SIZE~0=v_~SIZE~0_679, main_~c~0=v_main_~c~0_3961, ~last~0=v_~last~0_684} OutVars{~SIZE~0=v_~SIZE~0_679, main_~c~0=v_main_~c~0_3961, ~last~0=v_~last~0_684} AuxVars[] AssignedVars[] [2021-05-03 00:26:09,170 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:26:09,184 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:26:09,186 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:26:09,201 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:26:09,208 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:26:09,225 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:26:09,251 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:26:09,253 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_3963 v_~last~0_685) (< v_main_~c~0_3963 v_~SIZE~0_680)) InVars {~SIZE~0=v_~SIZE~0_680, main_~c~0=v_main_~c~0_3963, ~last~0=v_~last~0_685} OutVars{~SIZE~0=v_~SIZE~0_680, main_~c~0=v_main_~c~0_3963, ~last~0=v_~last~0_685} AuxVars[] AssignedVars[] [2021-05-03 00:26:09,255 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size [2021-05-03 00:26:09,270 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:26:09,271 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:26:09,286 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:26:09,292 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:26:09,308 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size 66 [2021-05-03 00:26:09,333 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:26:09,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:26:09,451 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:26:09,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:26:09,454 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:26:09,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:26:09,457 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:26:11,888 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:26:11,889 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1288293165] [2021-05-03 00:26:11,889 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1288293165] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:26:11,889 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:26:11,889 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [47] imperfect sequences [] total 47 [2021-05-03 00:26:11,889 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1935378583] [2021-05-03 00:26:11,889 INFO L460 AbstractCegarLoop]: Interpolant automaton has 47 states [2021-05-03 00:26:11,889 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:26:11,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2021-05-03 00:26:11,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=238, Invalid=2114, Unknown=0, NotChecked=0, Total=2352 [2021-05-03 00:26:11,890 INFO L87 Difference]: Start difference. First operand 429 states and 517 transitions. Second operand has 47 states, 47 states have (on average 1.4893617021276595) internal successors, (70), 45 states have internal predecessors, (70), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:26:17,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:26:17,117 INFO L93 Difference]: Finished difference Result 887 states and 1055 transitions. [2021-05-03 00:26:17,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2021-05-03 00:26:17,119 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 47 states have (on average 1.4893617021276595) internal successors, (70), 45 states have internal predecessors, (70), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 76 [2021-05-03 00:26:17,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:26:17,120 INFO L225 Difference]: With dead ends: 887 [2021-05-03 00:26:17,120 INFO L226 Difference]: Without dead ends: 518 [2021-05-03 00:26:17,121 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 6 SyntacticMatches, 17 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1346 ImplicationChecksByTransitivity, 3549.4ms TimeCoverageRelationStatistics Valid=392, Invalid=4300, Unknown=0, NotChecked=0, Total=4692 [2021-05-03 00:26:17,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 518 states. [2021-05-03 00:26:18,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 518 to 437. [2021-05-03 00:26:18,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 437 states, 427 states have (on average 1.2084309133489461) internal successors, (516), 427 states have internal predecessors, (516), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:26:18,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 437 states to 437 states and 527 transitions. [2021-05-03 00:26:18,317 INFO L78 Accepts]: Start accepts. Automaton has 437 states and 527 transitions. Word has length 76 [2021-05-03 00:26:18,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:26:18,317 INFO L480 AbstractCegarLoop]: Abstraction has 437 states and 527 transitions. [2021-05-03 00:26:18,317 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 47 states, 47 states have (on average 1.4893617021276595) internal successors, (70), 45 states have internal predecessors, (70), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:26:18,318 INFO L276 IsEmpty]: Start isEmpty. Operand 437 states and 527 transitions. [2021-05-03 00:26:18,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2021-05-03 00:26:18,318 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:26:18,318 INFO L523 BasicCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:26:18,318 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable863 [2021-05-03 00:26:18,318 INFO L428 AbstractCegarLoop]: === Iteration 196 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:26:18,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:26:18,318 INFO L82 PathProgramCache]: Analyzing trace with hash -1820988291, now seen corresponding path program 19 times [2021-05-03 00:26:18,318 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:26:18,318 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [372460591] [2021-05-03 00:26:18,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:26:18,326 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_~last~0_686 v_main_~c~0_3984) (< (+ v_main_~c~0_3984 1) v_~SIZE~0_681)) InVars {~SIZE~0=v_~SIZE~0_681, main_~c~0=v_main_~c~0_3984, ~last~0=v_~last~0_686} OutVars{~SIZE~0=v_~SIZE~0_681, main_~c~0=v_main_~c~0_3984, ~last~0=v_~last~0_686} AuxVars[] AssignedVars[] [2021-05-03 00:26:18,329 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size [2021-05-03 00:26:18,361 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:26:18,363 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:26:18,385 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:26:18,390 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:26:18,424 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size 78 [2021-05-03 00:26:18,459 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:26:18,463 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_3986 v_~SIZE~0_682) (<= v_~last~0_687 v_main_~c~0_3986)) InVars {~SIZE~0=v_~SIZE~0_682, main_~c~0=v_main_~c~0_3986, ~last~0=v_~last~0_687} OutVars{~SIZE~0=v_~SIZE~0_682, main_~c~0=v_main_~c~0_3986, ~last~0=v_~last~0_687} AuxVars[] AssignedVars[] [2021-05-03 00:26:18,464 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:26:18,489 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:26:18,491 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:26:18,506 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:26:18,511 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:26:18,534 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:26:18,566 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:26:18,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:26:18,640 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:26:18,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:26:18,644 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:26:18,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:26:18,646 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:26:20,291 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:26:20,291 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [372460591] [2021-05-03 00:26:20,291 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [372460591] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:26:20,291 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:26:20,291 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2021-05-03 00:26:20,291 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1833364442] [2021-05-03 00:26:20,291 INFO L460 AbstractCegarLoop]: Interpolant automaton has 27 states [2021-05-03 00:26:20,292 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:26:20,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2021-05-03 00:26:20,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=656, Unknown=0, NotChecked=0, Total=756 [2021-05-03 00:26:20,292 INFO L87 Difference]: Start difference. First operand 437 states and 527 transitions. Second operand has 27 states, 27 states have (on average 2.7037037037037037) internal successors, (73), 26 states have internal predecessors, (73), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:26:23,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:26:23,933 INFO L93 Difference]: Finished difference Result 971 states and 1136 transitions. [2021-05-03 00:26:23,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2021-05-03 00:26:23,935 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 2.7037037037037037) internal successors, (73), 26 states have internal predecessors, (73), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 79 [2021-05-03 00:26:23,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:26:23,936 INFO L225 Difference]: With dead ends: 971 [2021-05-03 00:26:23,936 INFO L226 Difference]: Without dead ends: 602 [2021-05-03 00:26:23,936 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 13 SyntacticMatches, 36 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 194 ImplicationChecksByTransitivity, 1635.3ms TimeCoverageRelationStatistics Valid=104, Invalid=708, Unknown=0, NotChecked=0, Total=812 [2021-05-03 00:26:23,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 602 states. [2021-05-03 00:26:25,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 602 to 446. [2021-05-03 00:26:25,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 446 states, 436 states have (on average 1.2041284403669725) internal successors, (525), 436 states have internal predecessors, (525), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:26:25,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 446 states to 446 states and 536 transitions. [2021-05-03 00:26:25,191 INFO L78 Accepts]: Start accepts. Automaton has 446 states and 536 transitions. Word has length 79 [2021-05-03 00:26:25,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:26:25,191 INFO L480 AbstractCegarLoop]: Abstraction has 446 states and 536 transitions. [2021-05-03 00:26:25,191 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 27 states, 27 states have (on average 2.7037037037037037) internal successors, (73), 26 states have internal predecessors, (73), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:26:25,191 INFO L276 IsEmpty]: Start isEmpty. Operand 446 states and 536 transitions. [2021-05-03 00:26:25,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2021-05-03 00:26:25,191 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:26:25,191 INFO L523 BasicCegarLoop]: trace histogram [19, 19, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:26:25,191 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable866 [2021-05-03 00:26:25,191 INFO L428 AbstractCegarLoop]: === Iteration 197 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:26:25,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:26:25,192 INFO L82 PathProgramCache]: Analyzing trace with hash 787799167, now seen corresponding path program 154 times [2021-05-03 00:26:25,192 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:26:25,192 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [508424477] [2021-05-03 00:26:25,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:26:25,200 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_~last~0_688 v_main_~c~0_4008) (< (+ v_main_~c~0_4008 1) v_~SIZE~0_683)) InVars {~SIZE~0=v_~SIZE~0_683, main_~c~0=v_main_~c~0_4008, ~last~0=v_~last~0_688} OutVars{~SIZE~0=v_~SIZE~0_683, main_~c~0=v_main_~c~0_4008, ~last~0=v_~last~0_688} AuxVars[] AssignedVars[] [2021-05-03 00:26:25,203 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size [2021-05-03 00:26:25,225 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:26:25,227 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:26:25,242 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:26:25,247 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:26:25,272 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size 78 [2021-05-03 00:26:25,302 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_4010 v_~last~0_689) (< (+ v_main_~c~0_4010 1) v_~SIZE~0_684)) InVars {~SIZE~0=v_~SIZE~0_684, main_~c~0=v_main_~c~0_4010, ~last~0=v_~last~0_689} OutVars{~SIZE~0=v_~SIZE~0_684, main_~c~0=v_main_~c~0_4010, ~last~0=v_~last~0_689} AuxVars[] AssignedVars[] [2021-05-03 00:26:25,304 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:26:25,322 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:26:25,324 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:26:25,345 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:26:25,354 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:26:25,379 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:26:25,416 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:26:25,419 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_~last~0_690 v_main_~c~0_4012) (< v_main_~c~0_4012 v_~SIZE~0_685)) InVars {~SIZE~0=v_~SIZE~0_685, main_~c~0=v_main_~c~0_4012, ~last~0=v_~last~0_690} OutVars{~SIZE~0=v_~SIZE~0_685, main_~c~0=v_main_~c~0_4012, ~last~0=v_~last~0_690} AuxVars[] AssignedVars[] [2021-05-03 00:26:25,421 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:26:25,422 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:26:25,423 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:26:25,438 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:26:25,442 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:26:25,479 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:26:25,512 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_4014 v_~last~0_691) (< v_main_~c~0_4014 v_~SIZE~0_686)) InVars {~SIZE~0=v_~SIZE~0_686, main_~c~0=v_main_~c~0_4014, ~last~0=v_~last~0_691} OutVars{~SIZE~0=v_~SIZE~0_686, main_~c~0=v_main_~c~0_4014, ~last~0=v_~last~0_691} AuxVars[] AssignedVars[] [2021-05-03 00:26:25,514 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size [2021-05-03 00:26:25,516 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:26:25,517 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:26:25,536 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:26:25,543 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:26:25,577 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size 66 [2021-05-03 00:26:25,606 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:26:25,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:26:25,684 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:26:25,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:26:25,689 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:26:25,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:26:25,691 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:26:25,694 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:26:27,419 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:26:27,419 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [508424477] [2021-05-03 00:26:27,419 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [508424477] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:26:27,420 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:26:27,420 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2021-05-03 00:26:27,420 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141738157] [2021-05-03 00:26:27,420 INFO L460 AbstractCegarLoop]: Interpolant automaton has 28 states [2021-05-03 00:26:27,420 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:26:27,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2021-05-03 00:26:27,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=723, Unknown=0, NotChecked=0, Total=812 [2021-05-03 00:26:27,421 INFO L87 Difference]: Start difference. First operand 446 states and 536 transitions. Second operand has 28 states, 28 states have (on average 2.607142857142857) internal successors, (73), 27 states have internal predecessors, (73), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:26:31,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:26:31,522 INFO L93 Difference]: Finished difference Result 998 states and 1167 transitions. [2021-05-03 00:26:31,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2021-05-03 00:26:31,523 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 2.607142857142857) internal successors, (73), 27 states have internal predecessors, (73), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 79 [2021-05-03 00:26:31,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:26:31,524 INFO L225 Difference]: With dead ends: 998 [2021-05-03 00:26:31,524 INFO L226 Difference]: Without dead ends: 620 [2021-05-03 00:26:31,525 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 12 SyntacticMatches, 36 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 348 ImplicationChecksByTransitivity, 1759.4ms TimeCoverageRelationStatistics Valid=101, Invalid=829, Unknown=0, NotChecked=0, Total=930 [2021-05-03 00:26:31,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 620 states. [2021-05-03 00:26:32,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 620 to 446. [2021-05-03 00:26:32,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 446 states, 436 states have (on average 1.2041284403669725) internal successors, (525), 436 states have internal predecessors, (525), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:26:32,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 446 states to 446 states and 536 transitions. [2021-05-03 00:26:32,739 INFO L78 Accepts]: Start accepts. Automaton has 446 states and 536 transitions. Word has length 79 [2021-05-03 00:26:32,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:26:32,739 INFO L480 AbstractCegarLoop]: Abstraction has 446 states and 536 transitions. [2021-05-03 00:26:32,739 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 28 states, 28 states have (on average 2.607142857142857) internal successors, (73), 27 states have internal predecessors, (73), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:26:32,739 INFO L276 IsEmpty]: Start isEmpty. Operand 446 states and 536 transitions. [2021-05-03 00:26:32,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2021-05-03 00:26:32,740 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:26:32,740 INFO L523 BasicCegarLoop]: trace histogram [19, 19, 17, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:26:32,740 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable871 [2021-05-03 00:26:32,740 INFO L428 AbstractCegarLoop]: === Iteration 198 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:26:32,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:26:32,740 INFO L82 PathProgramCache]: Analyzing trace with hash 1467071421, now seen corresponding path program 155 times [2021-05-03 00:26:32,740 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:26:32,740 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1727069472] [2021-05-03 00:26:32,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:26:32,747 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (+ v_main_~c~0_4037 1) v_~SIZE~0_687) (<= v_~last~0_692 v_main_~c~0_4037)) InVars {~SIZE~0=v_~SIZE~0_687, main_~c~0=v_main_~c~0_4037, ~last~0=v_~last~0_692} OutVars{~SIZE~0=v_~SIZE~0_687, main_~c~0=v_main_~c~0_4037, ~last~0=v_~last~0_692} AuxVars[] AssignedVars[] [2021-05-03 00:26:32,749 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size [2021-05-03 00:26:32,750 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:26:32,751 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:26:32,764 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:26:32,768 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:26:32,817 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size 78 [2021-05-03 00:26:32,847 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (+ v_main_~c~0_4039 1) v_~SIZE~0_688) (< v_main_~c~0_4039 v_~last~0_693)) InVars {~SIZE~0=v_~SIZE~0_688, main_~c~0=v_main_~c~0_4039, ~last~0=v_~last~0_693} OutVars{~SIZE~0=v_~SIZE~0_688, main_~c~0=v_main_~c~0_4039, ~last~0=v_~last~0_693} AuxVars[] AssignedVars[] [2021-05-03 00:26:32,849 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:26:32,866 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:26:32,868 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:26:32,886 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:26:32,892 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:26:32,911 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:26:32,939 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:26:32,941 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_~last~0_694 v_main_~c~0_4041) (< v_main_~c~0_4041 v_~SIZE~0_689)) InVars {~SIZE~0=v_~SIZE~0_689, main_~c~0=v_main_~c~0_4041, ~last~0=v_~last~0_694} OutVars{~SIZE~0=v_~SIZE~0_689, main_~c~0=v_main_~c~0_4041, ~last~0=v_~last~0_694} AuxVars[] AssignedVars[] [2021-05-03 00:26:32,942 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:26:32,943 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:26:32,945 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:26:32,975 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:26:32,979 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:26:33,016 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:26:33,047 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_4043 v_~SIZE~0_690) (< v_main_~c~0_4043 v_~last~0_695)) InVars {~SIZE~0=v_~SIZE~0_690, main_~c~0=v_main_~c~0_4043, ~last~0=v_~last~0_695} OutVars{~SIZE~0=v_~SIZE~0_690, main_~c~0=v_main_~c~0_4043, ~last~0=v_~last~0_695} AuxVars[] AssignedVars[] [2021-05-03 00:26:33,049 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size [2021-05-03 00:26:33,049 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:26:33,051 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:26:33,068 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:26:33,075 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:26:33,107 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size 66 [2021-05-03 00:26:33,136 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:26:33,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:26:33,308 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:26:33,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:26:33,313 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:26:33,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:26:33,316 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:26:33,321 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:26:33,471 WARN L205 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 19 [2021-05-03 00:26:35,336 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:26:35,336 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1727069472] [2021-05-03 00:26:35,336 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1727069472] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:26:35,336 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:26:35,336 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2021-05-03 00:26:35,336 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1356159973] [2021-05-03 00:26:35,336 INFO L460 AbstractCegarLoop]: Interpolant automaton has 29 states [2021-05-03 00:26:35,337 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:26:35,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2021-05-03 00:26:35,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=773, Unknown=0, NotChecked=0, Total=870 [2021-05-03 00:26:35,337 INFO L87 Difference]: Start difference. First operand 446 states and 536 transitions. Second operand has 29 states, 29 states have (on average 2.5172413793103448) internal successors, (73), 28 states have internal predecessors, (73), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:26:40,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:26:40,799 INFO L93 Difference]: Finished difference Result 989 states and 1158 transitions. [2021-05-03 00:26:40,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2021-05-03 00:26:40,801 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 2.5172413793103448) internal successors, (73), 28 states have internal predecessors, (73), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 79 [2021-05-03 00:26:40,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:26:40,801 INFO L225 Difference]: With dead ends: 989 [2021-05-03 00:26:40,801 INFO L226 Difference]: Without dead ends: 611 [2021-05-03 00:26:40,802 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 12 SyntacticMatches, 35 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 449 ImplicationChecksByTransitivity, 2034.9ms TimeCoverageRelationStatistics Valid=111, Invalid=881, Unknown=0, NotChecked=0, Total=992 [2021-05-03 00:26:40,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 611 states. [2021-05-03 00:26:41,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 611 to 446. [2021-05-03 00:26:41,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 446 states, 436 states have (on average 1.2041284403669725) internal successors, (525), 436 states have internal predecessors, (525), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:26:41,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 446 states to 446 states and 536 transitions. [2021-05-03 00:26:41,927 INFO L78 Accepts]: Start accepts. Automaton has 446 states and 536 transitions. Word has length 79 [2021-05-03 00:26:41,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:26:41,927 INFO L480 AbstractCegarLoop]: Abstraction has 446 states and 536 transitions. [2021-05-03 00:26:41,927 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 29 states, 29 states have (on average 2.5172413793103448) internal successors, (73), 28 states have internal predecessors, (73), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:26:41,927 INFO L276 IsEmpty]: Start isEmpty. Operand 446 states and 536 transitions. [2021-05-03 00:26:41,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2021-05-03 00:26:41,928 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:26:41,928 INFO L523 BasicCegarLoop]: trace histogram [19, 19, 16, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:26:41,928 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable876 [2021-05-03 00:26:41,928 INFO L428 AbstractCegarLoop]: === Iteration 199 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:26:41,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:26:41,928 INFO L82 PathProgramCache]: Analyzing trace with hash 2027771199, now seen corresponding path program 156 times [2021-05-03 00:26:41,928 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:26:41,928 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2057060821] [2021-05-03 00:26:41,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:26:41,938 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_~last~0_696 v_main_~c~0_4066) (< (+ v_main_~c~0_4066 1) v_~SIZE~0_691)) InVars {~SIZE~0=v_~SIZE~0_691, main_~c~0=v_main_~c~0_4066, ~last~0=v_~last~0_696} OutVars{~SIZE~0=v_~SIZE~0_691, main_~c~0=v_main_~c~0_4066, ~last~0=v_~last~0_696} AuxVars[] AssignedVars[] [2021-05-03 00:26:41,940 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size [2021-05-03 00:26:41,974 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:26:41,976 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:26:41,998 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:26:42,004 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:26:42,040 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size 78 [2021-05-03 00:26:42,098 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_4068 v_~last~0_697) (< (+ v_main_~c~0_4068 1) v_~SIZE~0_692)) InVars {~SIZE~0=v_~SIZE~0_692, main_~c~0=v_main_~c~0_4068, ~last~0=v_~last~0_697} OutVars{~SIZE~0=v_~SIZE~0_692, main_~c~0=v_main_~c~0_4068, ~last~0=v_~last~0_697} AuxVars[] AssignedVars[] [2021-05-03 00:26:42,099 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:26:42,101 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:26:42,103 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:26:42,134 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:26:42,145 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:26:42,204 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:26:42,263 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:26:42,267 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_4070 v_~SIZE~0_693) (<= v_~last~0_698 v_main_~c~0_4070)) InVars {~SIZE~0=v_~SIZE~0_693, main_~c~0=v_main_~c~0_4070, ~last~0=v_~last~0_698} OutVars{~SIZE~0=v_~SIZE~0_693, main_~c~0=v_main_~c~0_4070, ~last~0=v_~last~0_698} AuxVars[] AssignedVars[] [2021-05-03 00:26:42,269 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:26:42,304 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:26:42,306 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:26:42,330 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:26:42,338 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:26:42,380 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:26:42,454 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_4072 v_~SIZE~0_694) (< v_main_~c~0_4072 v_~last~0_699)) InVars {~SIZE~0=v_~SIZE~0_694, main_~c~0=v_main_~c~0_4072, ~last~0=v_~last~0_699} OutVars{~SIZE~0=v_~SIZE~0_694, main_~c~0=v_main_~c~0_4072, ~last~0=v_~last~0_699} AuxVars[] AssignedVars[] [2021-05-03 00:26:42,457 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size [2021-05-03 00:26:42,494 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:26:42,498 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:26:42,537 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:26:42,553 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:26:42,601 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size 66 [2021-05-03 00:26:42,675 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:26:42,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:26:42,834 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:26:42,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:26:42,839 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:26:42,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:26:42,843 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:26:42,848 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:26:42,962 WARN L205 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 19 [2021-05-03 00:26:46,505 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:26:46,505 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2057060821] [2021-05-03 00:26:46,505 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [2057060821] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:26:46,505 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:26:46,505 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [30] imperfect sequences [] total 30 [2021-05-03 00:26:46,506 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621857807] [2021-05-03 00:26:46,506 INFO L460 AbstractCegarLoop]: Interpolant automaton has 30 states [2021-05-03 00:26:46,506 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:26:46,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2021-05-03 00:26:46,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=825, Unknown=0, NotChecked=0, Total=930 [2021-05-03 00:26:46,506 INFO L87 Difference]: Start difference. First operand 446 states and 536 transitions. Second operand has 30 states, 30 states have (on average 2.433333333333333) internal successors, (73), 29 states have internal predecessors, (73), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:26:52,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:26:52,813 INFO L93 Difference]: Finished difference Result 980 states and 1149 transitions. [2021-05-03 00:26:52,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2021-05-03 00:26:52,815 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 2.433333333333333) internal successors, (73), 29 states have internal predecessors, (73), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 79 [2021-05-03 00:26:52,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:26:52,815 INFO L225 Difference]: With dead ends: 980 [2021-05-03 00:26:52,815 INFO L226 Difference]: Without dead ends: 602 [2021-05-03 00:26:52,816 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 12 SyntacticMatches, 34 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 541 ImplicationChecksByTransitivity, 3737.5ms TimeCoverageRelationStatistics Valid=121, Invalid=935, Unknown=0, NotChecked=0, Total=1056 [2021-05-03 00:26:52,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 602 states. [2021-05-03 00:26:54,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 602 to 446. [2021-05-03 00:26:54,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 446 states, 436 states have (on average 1.2041284403669725) internal successors, (525), 436 states have internal predecessors, (525), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:26:54,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 446 states to 446 states and 536 transitions. [2021-05-03 00:26:54,232 INFO L78 Accepts]: Start accepts. Automaton has 446 states and 536 transitions. Word has length 79 [2021-05-03 00:26:54,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:26:54,232 INFO L480 AbstractCegarLoop]: Abstraction has 446 states and 536 transitions. [2021-05-03 00:26:54,232 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 30 states, 30 states have (on average 2.433333333333333) internal successors, (73), 29 states have internal predecessors, (73), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:26:54,232 INFO L276 IsEmpty]: Start isEmpty. Operand 446 states and 536 transitions. [2021-05-03 00:26:54,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2021-05-03 00:26:54,233 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:26:54,233 INFO L523 BasicCegarLoop]: trace histogram [19, 19, 15, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:26:54,233 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable881 [2021-05-03 00:26:54,233 INFO L428 AbstractCegarLoop]: === Iteration 200 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:26:54,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:26:54,233 INFO L82 PathProgramCache]: Analyzing trace with hash 2068445949, now seen corresponding path program 157 times [2021-05-03 00:26:54,233 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:26:54,233 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [994732934] [2021-05-03 00:26:54,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:26:54,247 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (+ v_main_~c~0_4095 1) v_~SIZE~0_695) (<= v_~last~0_700 v_main_~c~0_4095)) InVars {~SIZE~0=v_~SIZE~0_695, main_~c~0=v_main_~c~0_4095, ~last~0=v_~last~0_700} OutVars{~SIZE~0=v_~SIZE~0_695, main_~c~0=v_main_~c~0_4095, ~last~0=v_~last~0_700} AuxVars[] AssignedVars[] [2021-05-03 00:26:54,250 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size [2021-05-03 00:26:54,252 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:26:54,255 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:26:54,284 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:26:54,292 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:26:54,376 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size 78 [2021-05-03 00:26:54,454 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_4097 v_~last~0_701) (< (+ v_main_~c~0_4097 1) v_~SIZE~0_696)) InVars {~SIZE~0=v_~SIZE~0_696, main_~c~0=v_main_~c~0_4097, ~last~0=v_~last~0_701} OutVars{~SIZE~0=v_~SIZE~0_696, main_~c~0=v_main_~c~0_4097, ~last~0=v_~last~0_701} AuxVars[] AssignedVars[] [2021-05-03 00:26:54,457 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:26:54,492 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:26:54,495 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:26:54,533 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:26:54,547 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:26:54,589 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:26:54,661 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:26:54,667 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_4099 v_~SIZE~0_697) (<= v_~last~0_702 v_main_~c~0_4099)) InVars {~SIZE~0=v_~SIZE~0_697, main_~c~0=v_main_~c~0_4099, ~last~0=v_~last~0_702} OutVars{~SIZE~0=v_~SIZE~0_697, main_~c~0=v_main_~c~0_4099, ~last~0=v_~last~0_702} AuxVars[] AssignedVars[] [2021-05-03 00:26:54,669 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:26:54,671 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:26:54,675 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:26:54,706 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:26:54,714 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:26:54,812 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:26:54,885 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_4101 v_~last~0_703) (< v_main_~c~0_4101 v_~SIZE~0_698)) InVars {~SIZE~0=v_~SIZE~0_698, main_~c~0=v_main_~c~0_4101, ~last~0=v_~last~0_703} OutVars{~SIZE~0=v_~SIZE~0_698, main_~c~0=v_main_~c~0_4101, ~last~0=v_~last~0_703} AuxVars[] AssignedVars[] [2021-05-03 00:26:54,887 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size [2021-05-03 00:26:54,924 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:26:54,928 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:26:54,967 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:26:54,984 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:26:55,041 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size 66 [2021-05-03 00:26:55,135 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:26:55,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:26:55,366 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:26:55,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:26:55,371 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:26:55,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:26:55,375 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:26:55,381 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:26:55,492 WARN L205 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 17 [2021-05-03 00:26:59,342 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:26:59,342 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [994732934] [2021-05-03 00:26:59,342 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [994732934] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:26:59,342 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:26:59,342 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [31] imperfect sequences [] total 31 [2021-05-03 00:26:59,342 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553582315] [2021-05-03 00:26:59,343 INFO L460 AbstractCegarLoop]: Interpolant automaton has 31 states [2021-05-03 00:26:59,343 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:26:59,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2021-05-03 00:26:59,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=936, Unknown=0, NotChecked=0, Total=1056 [2021-05-03 00:26:59,343 INFO L87 Difference]: Start difference. First operand 446 states and 536 transitions. Second operand has 31 states, 31 states have (on average 2.3548387096774195) internal successors, (73), 30 states have internal predecessors, (73), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:27:04,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:27:04,782 INFO L93 Difference]: Finished difference Result 971 states and 1136 transitions. [2021-05-03 00:27:04,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2021-05-03 00:27:04,786 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 2.3548387096774195) internal successors, (73), 30 states have internal predecessors, (73), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 79 [2021-05-03 00:27:04,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:27:04,786 INFO L225 Difference]: With dead ends: 971 [2021-05-03 00:27:04,787 INFO L226 Difference]: Without dead ends: 593 [2021-05-03 00:27:04,787 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 13 SyntacticMatches, 32 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 668 ImplicationChecksByTransitivity, 4088.5ms TimeCoverageRelationStatistics Valid=137, Invalid=1053, Unknown=0, NotChecked=0, Total=1190 [2021-05-03 00:27:04,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 593 states. [2021-05-03 00:27:06,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 593 to 446. [2021-05-03 00:27:06,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 446 states, 436 states have (on average 1.2041284403669725) internal successors, (525), 436 states have internal predecessors, (525), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:27:06,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 446 states to 446 states and 536 transitions. [2021-05-03 00:27:06,173 INFO L78 Accepts]: Start accepts. Automaton has 446 states and 536 transitions. Word has length 79 [2021-05-03 00:27:06,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:27:06,173 INFO L480 AbstractCegarLoop]: Abstraction has 446 states and 536 transitions. [2021-05-03 00:27:06,173 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 31 states, 31 states have (on average 2.3548387096774195) internal successors, (73), 30 states have internal predecessors, (73), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:27:06,173 INFO L276 IsEmpty]: Start isEmpty. Operand 446 states and 536 transitions. [2021-05-03 00:27:06,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2021-05-03 00:27:06,173 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:27:06,174 INFO L523 BasicCegarLoop]: trace histogram [19, 19, 14, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:27:06,174 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable886 [2021-05-03 00:27:06,174 INFO L428 AbstractCegarLoop]: === Iteration 201 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:27:06,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:27:06,174 INFO L82 PathProgramCache]: Analyzing trace with hash -1782620673, now seen corresponding path program 158 times [2021-05-03 00:27:06,174 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:27:06,174 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [904175497] [2021-05-03 00:27:06,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:27:06,182 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_~last~0_704 v_main_~c~0_4124) (< (+ v_main_~c~0_4124 1) v_~SIZE~0_699)) InVars {~SIZE~0=v_~SIZE~0_699, main_~c~0=v_main_~c~0_4124, ~last~0=v_~last~0_704} OutVars{~SIZE~0=v_~SIZE~0_699, main_~c~0=v_main_~c~0_4124, ~last~0=v_~last~0_704} AuxVars[] AssignedVars[] [2021-05-03 00:27:06,183 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size [2021-05-03 00:27:06,184 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:27:06,185 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:27:06,198 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:27:06,214 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:27:06,277 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size 78 [2021-05-03 00:27:06,330 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_4126 v_~last~0_705) (< (+ v_main_~c~0_4126 1) v_~SIZE~0_700)) InVars {~SIZE~0=v_~SIZE~0_700, main_~c~0=v_main_~c~0_4126, ~last~0=v_~last~0_705} OutVars{~SIZE~0=v_~SIZE~0_700, main_~c~0=v_main_~c~0_4126, ~last~0=v_~last~0_705} AuxVars[] AssignedVars[] [2021-05-03 00:27:06,331 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:27:06,361 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:27:06,362 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:27:06,392 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:27:06,398 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:27:06,444 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:27:06,495 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:27:06,498 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_4128 v_~SIZE~0_701) (<= v_~last~0_706 v_main_~c~0_4128)) InVars {~SIZE~0=v_~SIZE~0_701, main_~c~0=v_main_~c~0_4128, ~last~0=v_~last~0_706} OutVars{~SIZE~0=v_~SIZE~0_701, main_~c~0=v_main_~c~0_4128, ~last~0=v_~last~0_706} AuxVars[] AssignedVars[] [2021-05-03 00:27:06,499 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:27:06,501 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:27:06,502 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:27:06,524 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:27:06,528 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:27:06,595 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:27:06,650 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_4130 v_~SIZE~0_702) (< v_main_~c~0_4130 v_~last~0_707)) InVars {~SIZE~0=v_~SIZE~0_702, main_~c~0=v_main_~c~0_4130, ~last~0=v_~last~0_707} OutVars{~SIZE~0=v_~SIZE~0_702, main_~c~0=v_main_~c~0_4130, ~last~0=v_~last~0_707} AuxVars[] AssignedVars[] [2021-05-03 00:27:06,651 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size [2021-05-03 00:27:06,653 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:27:06,654 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:27:06,673 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:27:06,691 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:27:06,745 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size 66 [2021-05-03 00:27:06,798 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:27:06,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:27:06,950 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:27:06,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:27:06,954 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:27:06,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:27:06,957 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:27:06,960 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:27:09,454 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:27:09,454 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [904175497] [2021-05-03 00:27:09,454 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [904175497] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:27:09,454 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:27:09,454 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [32] imperfect sequences [] total 32 [2021-05-03 00:27:09,454 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470524295] [2021-05-03 00:27:09,454 INFO L460 AbstractCegarLoop]: Interpolant automaton has 32 states [2021-05-03 00:27:09,454 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:27:09,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2021-05-03 00:27:09,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=994, Unknown=0, NotChecked=0, Total=1122 [2021-05-03 00:27:09,455 INFO L87 Difference]: Start difference. First operand 446 states and 536 transitions. Second operand has 32 states, 32 states have (on average 2.28125) internal successors, (73), 31 states have internal predecessors, (73), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:27:12,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:27:12,999 INFO L93 Difference]: Finished difference Result 965 states and 1130 transitions. [2021-05-03 00:27:13,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2021-05-03 00:27:13,001 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 2.28125) internal successors, (73), 31 states have internal predecessors, (73), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 79 [2021-05-03 00:27:13,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:27:13,001 INFO L225 Difference]: With dead ends: 965 [2021-05-03 00:27:13,002 INFO L226 Difference]: Without dead ends: 587 [2021-05-03 00:27:13,002 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 12 SyntacticMatches, 32 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 754 ImplicationChecksByTransitivity, 2552.5ms TimeCoverageRelationStatistics Valid=147, Invalid=1113, Unknown=0, NotChecked=0, Total=1260 [2021-05-03 00:27:13,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 587 states. [2021-05-03 00:27:14,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 587 to 446. [2021-05-03 00:27:14,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 446 states, 436 states have (on average 1.2041284403669725) internal successors, (525), 436 states have internal predecessors, (525), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:27:14,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 446 states to 446 states and 536 transitions. [2021-05-03 00:27:14,318 INFO L78 Accepts]: Start accepts. Automaton has 446 states and 536 transitions. Word has length 79 [2021-05-03 00:27:14,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:27:14,318 INFO L480 AbstractCegarLoop]: Abstraction has 446 states and 536 transitions. [2021-05-03 00:27:14,318 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 32 states, 32 states have (on average 2.28125) internal successors, (73), 31 states have internal predecessors, (73), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:27:14,318 INFO L276 IsEmpty]: Start isEmpty. Operand 446 states and 536 transitions. [2021-05-03 00:27:14,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2021-05-03 00:27:14,318 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:27:14,318 INFO L523 BasicCegarLoop]: trace histogram [19, 19, 13, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:27:14,318 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable891 [2021-05-03 00:27:14,318 INFO L428 AbstractCegarLoop]: === Iteration 202 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:27:14,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:27:14,319 INFO L82 PathProgramCache]: Analyzing trace with hash 2031266365, now seen corresponding path program 159 times [2021-05-03 00:27:14,319 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:27:14,319 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1038773247] [2021-05-03 00:27:14,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:27:14,327 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (+ v_main_~c~0_4153 1) v_~SIZE~0_703) (<= v_~last~0_708 v_main_~c~0_4153)) InVars {~SIZE~0=v_~SIZE~0_703, main_~c~0=v_main_~c~0_4153, ~last~0=v_~last~0_708} OutVars{~SIZE~0=v_~SIZE~0_703, main_~c~0=v_main_~c~0_4153, ~last~0=v_~last~0_708} AuxVars[] AssignedVars[] [2021-05-03 00:27:14,329 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size [2021-05-03 00:27:14,330 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:27:14,332 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:27:14,347 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:27:14,351 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:27:14,396 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size 78 [2021-05-03 00:27:14,432 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (+ v_main_~c~0_4155 1) v_~SIZE~0_704) (< v_main_~c~0_4155 v_~last~0_709)) InVars {~SIZE~0=v_~SIZE~0_704, main_~c~0=v_main_~c~0_4155, ~last~0=v_~last~0_709} OutVars{~SIZE~0=v_~SIZE~0_704, main_~c~0=v_main_~c~0_4155, ~last~0=v_~last~0_709} AuxVars[] AssignedVars[] [2021-05-03 00:27:14,434 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:27:14,455 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:27:14,457 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:27:14,478 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:27:14,486 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:27:14,513 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:27:14,551 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:27:14,554 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_4157 v_~SIZE~0_705) (<= v_~last~0_710 v_main_~c~0_4157)) InVars {~SIZE~0=v_~SIZE~0_705, main_~c~0=v_main_~c~0_4157, ~last~0=v_~last~0_710} OutVars{~SIZE~0=v_~SIZE~0_705, main_~c~0=v_main_~c~0_4157, ~last~0=v_~last~0_710} AuxVars[] AssignedVars[] [2021-05-03 00:27:14,557 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:27:14,558 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:27:14,560 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:27:14,579 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:27:14,583 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:27:14,630 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:27:14,669 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_4159 v_~SIZE~0_706) (< v_main_~c~0_4159 v_~last~0_711)) InVars {~SIZE~0=v_~SIZE~0_706, main_~c~0=v_main_~c~0_4159, ~last~0=v_~last~0_711} OutVars{~SIZE~0=v_~SIZE~0_706, main_~c~0=v_main_~c~0_4159, ~last~0=v_~last~0_711} AuxVars[] AssignedVars[] [2021-05-03 00:27:14,671 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size [2021-05-03 00:27:14,672 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:27:14,674 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:27:14,696 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:27:14,705 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:27:14,747 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size 66 [2021-05-03 00:27:14,781 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:27:14,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:27:14,867 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:27:14,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:27:14,872 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:27:14,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:27:14,875 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:27:14,878 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:27:16,745 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:27:16,745 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1038773247] [2021-05-03 00:27:16,745 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1038773247] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:27:16,745 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:27:16,745 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [33] imperfect sequences [] total 33 [2021-05-03 00:27:16,745 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [811056695] [2021-05-03 00:27:16,745 INFO L460 AbstractCegarLoop]: Interpolant automaton has 33 states [2021-05-03 00:27:16,745 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:27:16,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2021-05-03 00:27:16,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=993, Unknown=0, NotChecked=0, Total=1122 [2021-05-03 00:27:16,746 INFO L87 Difference]: Start difference. First operand 446 states and 536 transitions. Second operand has 33 states, 33 states have (on average 2.212121212121212) internal successors, (73), 32 states have internal predecessors, (73), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:27:20,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:27:20,927 INFO L93 Difference]: Finished difference Result 953 states and 1122 transitions. [2021-05-03 00:27:20,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2021-05-03 00:27:20,929 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 2.212121212121212) internal successors, (73), 32 states have internal predecessors, (73), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 79 [2021-05-03 00:27:20,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:27:20,929 INFO L225 Difference]: With dead ends: 953 [2021-05-03 00:27:20,929 INFO L226 Difference]: Without dead ends: 575 [2021-05-03 00:27:20,930 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 12 SyntacticMatches, 31 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 763 ImplicationChecksByTransitivity, 1891.8ms TimeCoverageRelationStatistics Valid=151, Invalid=1109, Unknown=0, NotChecked=0, Total=1260 [2021-05-03 00:27:20,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 575 states. [2021-05-03 00:27:22,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 575 to 446. [2021-05-03 00:27:22,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 446 states, 436 states have (on average 1.2041284403669725) internal successors, (525), 436 states have internal predecessors, (525), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:27:22,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 446 states to 446 states and 536 transitions. [2021-05-03 00:27:22,285 INFO L78 Accepts]: Start accepts. Automaton has 446 states and 536 transitions. Word has length 79 [2021-05-03 00:27:22,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:27:22,286 INFO L480 AbstractCegarLoop]: Abstraction has 446 states and 536 transitions. [2021-05-03 00:27:22,286 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 33 states, 33 states have (on average 2.212121212121212) internal successors, (73), 32 states have internal predecessors, (73), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:27:22,286 INFO L276 IsEmpty]: Start isEmpty. Operand 446 states and 536 transitions. [2021-05-03 00:27:22,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2021-05-03 00:27:22,286 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:27:22,286 INFO L523 BasicCegarLoop]: trace histogram [19, 19, 12, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:27:22,286 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable896 [2021-05-03 00:27:22,286 INFO L428 AbstractCegarLoop]: === Iteration 203 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:27:22,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:27:22,287 INFO L82 PathProgramCache]: Analyzing trace with hash 1678177983, now seen corresponding path program 160 times [2021-05-03 00:27:22,287 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:27:22,287 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1758471889] [2021-05-03 00:27:22,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:27:22,296 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (+ v_main_~c~0_4182 1) v_~SIZE~0_707) (<= v_~last~0_712 v_main_~c~0_4182)) InVars {~SIZE~0=v_~SIZE~0_707, main_~c~0=v_main_~c~0_4182, ~last~0=v_~last~0_712} OutVars{~SIZE~0=v_~SIZE~0_707, main_~c~0=v_main_~c~0_4182, ~last~0=v_~last~0_712} AuxVars[] AssignedVars[] [2021-05-03 00:27:22,298 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size [2021-05-03 00:27:22,300 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:27:22,302 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:27:22,321 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:27:22,325 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:27:22,375 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size 78 [2021-05-03 00:27:22,413 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_4184 v_~last~0_713) (< (+ v_main_~c~0_4184 1) v_~SIZE~0_708)) InVars {~SIZE~0=v_~SIZE~0_708, main_~c~0=v_main_~c~0_4184, ~last~0=v_~last~0_713} OutVars{~SIZE~0=v_~SIZE~0_708, main_~c~0=v_main_~c~0_4184, ~last~0=v_~last~0_713} AuxVars[] AssignedVars[] [2021-05-03 00:27:22,415 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:27:22,436 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:27:22,438 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:27:22,457 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:27:22,463 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:27:22,482 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:27:22,514 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:27:22,517 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_4186 v_~SIZE~0_709) (<= v_~last~0_714 v_main_~c~0_4186)) InVars {~SIZE~0=v_~SIZE~0_709, main_~c~0=v_main_~c~0_4186, ~last~0=v_~last~0_714} OutVars{~SIZE~0=v_~SIZE~0_709, main_~c~0=v_main_~c~0_4186, ~last~0=v_~last~0_714} AuxVars[] AssignedVars[] [2021-05-03 00:27:22,518 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:27:22,519 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:27:22,521 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:27:22,536 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:27:22,539 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:27:22,576 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:27:22,607 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_4188 v_~SIZE~0_710) (< v_main_~c~0_4188 v_~last~0_715)) InVars {~SIZE~0=v_~SIZE~0_710, main_~c~0=v_main_~c~0_4188, ~last~0=v_~last~0_715} OutVars{~SIZE~0=v_~SIZE~0_710, main_~c~0=v_main_~c~0_4188, ~last~0=v_~last~0_715} AuxVars[] AssignedVars[] [2021-05-03 00:27:22,608 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size [2021-05-03 00:27:22,609 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:27:22,611 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:27:22,628 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:27:22,635 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:27:22,667 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size 66 [2021-05-03 00:27:22,695 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:27:22,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:27:22,889 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:27:22,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:27:22,895 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:27:22,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:27:22,897 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:27:22,900 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:27:25,527 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:27:25,527 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1758471889] [2021-05-03 00:27:25,527 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1758471889] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:27:25,527 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:27:25,527 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [38] imperfect sequences [] total 38 [2021-05-03 00:27:25,527 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [526146077] [2021-05-03 00:27:25,528 INFO L460 AbstractCegarLoop]: Interpolant automaton has 38 states [2021-05-03 00:27:25,528 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:27:25,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2021-05-03 00:27:25,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=220, Invalid=1340, Unknown=0, NotChecked=0, Total=1560 [2021-05-03 00:27:25,528 INFO L87 Difference]: Start difference. First operand 446 states and 536 transitions. Second operand has 38 states, 38 states have (on average 1.9210526315789473) internal successors, (73), 36 states have internal predecessors, (73), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:27:30,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:27:30,416 INFO L93 Difference]: Finished difference Result 931 states and 1098 transitions. [2021-05-03 00:27:30,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2021-05-03 00:27:30,420 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 1.9210526315789473) internal successors, (73), 36 states have internal predecessors, (73), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 79 [2021-05-03 00:27:30,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:27:30,421 INFO L225 Difference]: With dead ends: 931 [2021-05-03 00:27:30,421 INFO L226 Difference]: Without dead ends: 553 [2021-05-03 00:27:30,421 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 6 SyntacticMatches, 30 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 983 ImplicationChecksByTransitivity, 2884.8ms TimeCoverageRelationStatistics Valid=270, Invalid=1622, Unknown=0, NotChecked=0, Total=1892 [2021-05-03 00:27:30,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 553 states. [2021-05-03 00:27:31,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 553 to 446. [2021-05-03 00:27:31,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 446 states, 436 states have (on average 1.2041284403669725) internal successors, (525), 436 states have internal predecessors, (525), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:27:31,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 446 states to 446 states and 536 transitions. [2021-05-03 00:27:31,719 INFO L78 Accepts]: Start accepts. Automaton has 446 states and 536 transitions. Word has length 79 [2021-05-03 00:27:31,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:27:31,719 INFO L480 AbstractCegarLoop]: Abstraction has 446 states and 536 transitions. [2021-05-03 00:27:31,719 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 38 states, 38 states have (on average 1.9210526315789473) internal successors, (73), 36 states have internal predecessors, (73), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:27:31,719 INFO L276 IsEmpty]: Start isEmpty. Operand 446 states and 536 transitions. [2021-05-03 00:27:31,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2021-05-03 00:27:31,719 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:27:31,719 INFO L523 BasicCegarLoop]: trace histogram [19, 19, 11, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:27:31,719 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable901 [2021-05-03 00:27:31,719 INFO L428 AbstractCegarLoop]: === Iteration 204 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:27:31,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:27:31,720 INFO L82 PathProgramCache]: Analyzing trace with hash -371209859, now seen corresponding path program 161 times [2021-05-03 00:27:31,720 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:27:31,720 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1755977024] [2021-05-03 00:27:31,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:27:31,728 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_~last~0_716 v_main_~c~0_4211) (< (+ v_main_~c~0_4211 1) v_~SIZE~0_711)) InVars {~SIZE~0=v_~SIZE~0_711, main_~c~0=v_main_~c~0_4211, ~last~0=v_~last~0_716} OutVars{~SIZE~0=v_~SIZE~0_711, main_~c~0=v_main_~c~0_4211, ~last~0=v_~last~0_716} AuxVars[] AssignedVars[] [2021-05-03 00:27:31,730 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size [2021-05-03 00:27:31,752 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:27:31,754 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:27:31,769 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:27:31,773 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:27:31,796 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size 78 [2021-05-03 00:27:31,827 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_4213 v_~last~0_717) (< (+ v_main_~c~0_4213 1) v_~SIZE~0_712)) InVars {~SIZE~0=v_~SIZE~0_712, main_~c~0=v_main_~c~0_4213, ~last~0=v_~last~0_717} OutVars{~SIZE~0=v_~SIZE~0_712, main_~c~0=v_main_~c~0_4213, ~last~0=v_~last~0_717} AuxVars[] AssignedVars[] [2021-05-03 00:27:31,829 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:27:31,830 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:27:31,832 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:27:31,850 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:27:31,856 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:27:31,894 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:27:31,928 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:27:31,931 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_~last~0_718 v_main_~c~0_4215) (< v_main_~c~0_4215 v_~SIZE~0_713)) InVars {~SIZE~0=v_~SIZE~0_713, main_~c~0=v_main_~c~0_4215, ~last~0=v_~last~0_718} OutVars{~SIZE~0=v_~SIZE~0_713, main_~c~0=v_main_~c~0_4215, ~last~0=v_~last~0_718} AuxVars[] AssignedVars[] [2021-05-03 00:27:31,933 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:27:31,956 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:27:31,958 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:27:31,972 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:27:31,976 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:27:31,999 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:27:32,032 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_4217 v_~last~0_719) (< v_main_~c~0_4217 v_~SIZE~0_714)) InVars {~SIZE~0=v_~SIZE~0_714, main_~c~0=v_main_~c~0_4217, ~last~0=v_~last~0_719} OutVars{~SIZE~0=v_~SIZE~0_714, main_~c~0=v_main_~c~0_4217, ~last~0=v_~last~0_719} AuxVars[] AssignedVars[] [2021-05-03 00:27:32,034 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size [2021-05-03 00:27:32,051 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:27:32,053 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:27:32,078 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:27:32,092 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:27:32,132 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size 66 [2021-05-03 00:27:32,204 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:27:32,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:27:32,429 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:27:32,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:27:32,434 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:27:32,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:27:32,438 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:27:32,444 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:27:32,560 WARN L205 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 17 [2021-05-03 00:27:36,675 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:27:36,676 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1755977024] [2021-05-03 00:27:36,676 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1755977024] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:27:36,676 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:27:36,676 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [35] imperfect sequences [] total 35 [2021-05-03 00:27:36,676 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1232702851] [2021-05-03 00:27:36,676 INFO L460 AbstractCegarLoop]: Interpolant automaton has 35 states [2021-05-03 00:27:36,676 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:27:36,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2021-05-03 00:27:36,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=152, Invalid=1180, Unknown=0, NotChecked=0, Total=1332 [2021-05-03 00:27:36,677 INFO L87 Difference]: Start difference. First operand 446 states and 536 transitions. Second operand has 35 states, 35 states have (on average 2.085714285714286) internal successors, (73), 34 states have internal predecessors, (73), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:27:42,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:27:42,691 INFO L93 Difference]: Finished difference Result 948 states and 1113 transitions. [2021-05-03 00:27:42,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2021-05-03 00:27:42,694 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 2.085714285714286) internal successors, (73), 34 states have internal predecessors, (73), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 79 [2021-05-03 00:27:42,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:27:42,694 INFO L225 Difference]: With dead ends: 948 [2021-05-03 00:27:42,695 INFO L226 Difference]: Without dead ends: 570 [2021-05-03 00:27:42,695 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 12 SyntacticMatches, 29 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 919 ImplicationChecksByTransitivity, 4364.4ms TimeCoverageRelationStatistics Valid=177, Invalid=1305, Unknown=0, NotChecked=0, Total=1482 [2021-05-03 00:27:42,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 570 states. [2021-05-03 00:27:43,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 570 to 446. [2021-05-03 00:27:43,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 446 states, 436 states have (on average 1.2041284403669725) internal successors, (525), 436 states have internal predecessors, (525), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:27:43,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 446 states to 446 states and 536 transitions. [2021-05-03 00:27:43,969 INFO L78 Accepts]: Start accepts. Automaton has 446 states and 536 transitions. Word has length 79 [2021-05-03 00:27:43,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:27:43,969 INFO L480 AbstractCegarLoop]: Abstraction has 446 states and 536 transitions. [2021-05-03 00:27:43,969 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 35 states, 35 states have (on average 2.085714285714286) internal successors, (73), 34 states have internal predecessors, (73), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:27:43,969 INFO L276 IsEmpty]: Start isEmpty. Operand 446 states and 536 transitions. [2021-05-03 00:27:43,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2021-05-03 00:27:43,969 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:27:43,969 INFO L523 BasicCegarLoop]: trace histogram [19, 19, 10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:27:43,969 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable906 [2021-05-03 00:27:43,969 INFO L428 AbstractCegarLoop]: === Iteration 205 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:27:43,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:27:43,970 INFO L82 PathProgramCache]: Analyzing trace with hash 52436863, now seen corresponding path program 162 times [2021-05-03 00:27:43,970 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:27:43,970 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [458329643] [2021-05-03 00:27:43,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:27:43,985 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (+ v_main_~c~0_4240 1) v_~SIZE~0_715) (<= v_~last~0_720 v_main_~c~0_4240)) InVars {~SIZE~0=v_~SIZE~0_715, main_~c~0=v_main_~c~0_4240, ~last~0=v_~last~0_720} OutVars{~SIZE~0=v_~SIZE~0_715, main_~c~0=v_main_~c~0_4240, ~last~0=v_~last~0_720} AuxVars[] AssignedVars[] [2021-05-03 00:27:43,988 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size [2021-05-03 00:27:44,039 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:27:44,043 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:27:44,072 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:27:44,081 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:27:44,133 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size 78 [2021-05-03 00:27:44,219 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (+ v_main_~c~0_4242 1) v_~SIZE~0_716) (< v_main_~c~0_4242 v_~last~0_721)) InVars {~SIZE~0=v_~SIZE~0_716, main_~c~0=v_main_~c~0_4242, ~last~0=v_~last~0_721} OutVars{~SIZE~0=v_~SIZE~0_716, main_~c~0=v_main_~c~0_4242, ~last~0=v_~last~0_721} AuxVars[] AssignedVars[] [2021-05-03 00:27:44,222 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:27:44,262 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:27:44,265 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:27:44,300 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:27:44,316 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:27:44,365 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:27:44,451 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:27:44,458 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_~last~0_722 v_main_~c~0_4244) (< v_main_~c~0_4244 v_~SIZE~0_717)) InVars {~SIZE~0=v_~SIZE~0_717, main_~c~0=v_main_~c~0_4244, ~last~0=v_~last~0_722} OutVars{~SIZE~0=v_~SIZE~0_717, main_~c~0=v_main_~c~0_4244, ~last~0=v_~last~0_722} AuxVars[] AssignedVars[] [2021-05-03 00:27:44,460 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:27:44,509 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:27:44,513 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:27:44,549 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:27:44,558 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:27:44,612 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:27:44,702 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_4246 v_~SIZE~0_718) (< v_main_~c~0_4246 v_~last~0_723)) InVars {~SIZE~0=v_~SIZE~0_718, main_~c~0=v_main_~c~0_4246, ~last~0=v_~last~0_723} OutVars{~SIZE~0=v_~SIZE~0_718, main_~c~0=v_main_~c~0_4246, ~last~0=v_~last~0_723} AuxVars[] AssignedVars[] [2021-05-03 00:27:44,705 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size [2021-05-03 00:27:44,740 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:27:44,744 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:27:44,783 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:27:44,802 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:27:44,851 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size 66 [2021-05-03 00:27:44,946 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:27:44,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:27:45,136 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:27:45,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:27:45,141 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:27:45,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:27:45,145 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:27:45,150 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:27:45,292 WARN L205 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 19 [2021-05-03 00:27:49,545 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:27:49,545 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [458329643] [2021-05-03 00:27:49,545 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [458329643] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:27:49,545 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:27:49,545 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [36] imperfect sequences [] total 36 [2021-05-03 00:27:49,545 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137275609] [2021-05-03 00:27:49,546 INFO L460 AbstractCegarLoop]: Interpolant automaton has 36 states [2021-05-03 00:27:49,546 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:27:49,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2021-05-03 00:27:49,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=1179, Unknown=0, NotChecked=0, Total=1332 [2021-05-03 00:27:49,546 INFO L87 Difference]: Start difference. First operand 446 states and 536 transitions. Second operand has 36 states, 36 states have (on average 2.0277777777777777) internal successors, (73), 35 states have internal predecessors, (73), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:27:54,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:27:54,887 INFO L93 Difference]: Finished difference Result 926 states and 1095 transitions. [2021-05-03 00:27:54,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2021-05-03 00:27:54,889 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 2.0277777777777777) internal successors, (73), 35 states have internal predecessors, (73), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 79 [2021-05-03 00:27:54,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:27:54,890 INFO L225 Difference]: With dead ends: 926 [2021-05-03 00:27:54,890 INFO L226 Difference]: Without dead ends: 548 [2021-05-03 00:27:54,891 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 12 SyntacticMatches, 28 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 904 ImplicationChecksByTransitivity, 4405.1ms TimeCoverageRelationStatistics Valid=181, Invalid=1301, Unknown=0, NotChecked=0, Total=1482 [2021-05-03 00:27:54,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 548 states. [2021-05-03 00:27:56,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 548 to 446. [2021-05-03 00:27:56,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 446 states, 436 states have (on average 1.2041284403669725) internal successors, (525), 436 states have internal predecessors, (525), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:27:56,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 446 states to 446 states and 536 transitions. [2021-05-03 00:27:56,152 INFO L78 Accepts]: Start accepts. Automaton has 446 states and 536 transitions. Word has length 79 [2021-05-03 00:27:56,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:27:56,152 INFO L480 AbstractCegarLoop]: Abstraction has 446 states and 536 transitions. [2021-05-03 00:27:56,152 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 36 states, 36 states have (on average 2.0277777777777777) internal successors, (73), 35 states have internal predecessors, (73), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:27:56,153 INFO L276 IsEmpty]: Start isEmpty. Operand 446 states and 536 transitions. [2021-05-03 00:27:56,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2021-05-03 00:27:56,153 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:27:56,153 INFO L523 BasicCegarLoop]: trace histogram [19, 19, 10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:27:56,153 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable911 [2021-05-03 00:27:56,153 INFO L428 AbstractCegarLoop]: === Iteration 206 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:27:56,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:27:56,153 INFO L82 PathProgramCache]: Analyzing trace with hash -976922435, now seen corresponding path program 163 times [2021-05-03 00:27:56,153 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:27:56,154 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [124827871] [2021-05-03 00:27:56,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:27:56,162 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (+ v_main_~c~0_4269 1) v_~SIZE~0_719) (<= v_~last~0_724 v_main_~c~0_4269)) InVars {~SIZE~0=v_~SIZE~0_719, main_~c~0=v_main_~c~0_4269, ~last~0=v_~last~0_724} OutVars{~SIZE~0=v_~SIZE~0_719, main_~c~0=v_main_~c~0_4269, ~last~0=v_~last~0_724} AuxVars[] AssignedVars[] [2021-05-03 00:27:56,164 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size [2021-05-03 00:27:56,165 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:27:56,167 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:27:56,182 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:27:56,186 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:27:56,237 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size 78 [2021-05-03 00:27:56,276 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (+ v_main_~c~0_4271 1) v_~SIZE~0_720) (< v_main_~c~0_4271 v_~last~0_725)) InVars {~SIZE~0=v_~SIZE~0_720, main_~c~0=v_main_~c~0_4271, ~last~0=v_~last~0_725} OutVars{~SIZE~0=v_~SIZE~0_720, main_~c~0=v_main_~c~0_4271, ~last~0=v_~last~0_725} AuxVars[] AssignedVars[] [2021-05-03 00:27:56,278 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:27:56,299 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:27:56,302 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:27:56,327 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:27:56,335 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:27:56,362 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:27:56,407 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:27:56,411 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_4273 v_~SIZE~0_721) (<= v_~last~0_726 v_main_~c~0_4273)) InVars {~SIZE~0=v_~SIZE~0_721, main_~c~0=v_main_~c~0_4273, ~last~0=v_~last~0_726} OutVars{~SIZE~0=v_~SIZE~0_721, main_~c~0=v_main_~c~0_4273, ~last~0=v_~last~0_726} AuxVars[] AssignedVars[] [2021-05-03 00:27:56,414 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:27:56,416 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:27:56,418 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:27:56,438 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:27:56,444 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:27:56,490 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:27:56,528 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_4275 v_~SIZE~0_722) (< v_main_~c~0_4275 v_~last~0_727)) InVars {~SIZE~0=v_~SIZE~0_722, main_~c~0=v_main_~c~0_4275, ~last~0=v_~last~0_727} OutVars{~SIZE~0=v_~SIZE~0_722, main_~c~0=v_main_~c~0_4275, ~last~0=v_~last~0_727} AuxVars[] AssignedVars[] [2021-05-03 00:27:56,529 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size [2021-05-03 00:27:56,549 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:27:56,551 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:27:56,571 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:27:56,579 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:27:56,603 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size 66 [2021-05-03 00:27:56,637 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:27:56,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:27:56,742 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:27:56,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:27:56,747 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:27:56,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:27:56,749 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:27:56,752 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:27:58,984 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:27:58,984 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [124827871] [2021-05-03 00:27:58,984 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [124827871] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:27:58,984 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:27:58,984 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [37] imperfect sequences [] total 37 [2021-05-03 00:27:58,984 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925885531] [2021-05-03 00:27:58,985 INFO L460 AbstractCegarLoop]: Interpolant automaton has 37 states [2021-05-03 00:27:58,985 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:27:58,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2021-05-03 00:27:58,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=168, Invalid=1314, Unknown=0, NotChecked=0, Total=1482 [2021-05-03 00:27:58,985 INFO L87 Difference]: Start difference. First operand 446 states and 536 transitions. Second operand has 37 states, 37 states have (on average 1.972972972972973) internal successors, (73), 36 states have internal predecessors, (73), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:28:02,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:28:02,833 INFO L93 Difference]: Finished difference Result 936 states and 1101 transitions. [2021-05-03 00:28:02,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2021-05-03 00:28:02,835 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 1.972972972972973) internal successors, (73), 36 states have internal predecessors, (73), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 79 [2021-05-03 00:28:02,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:28:02,836 INFO L225 Difference]: With dead ends: 936 [2021-05-03 00:28:02,836 INFO L226 Difference]: Without dead ends: 558 [2021-05-03 00:28:02,837 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 12 SyntacticMatches, 27 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 984 ImplicationChecksByTransitivity, 2276.3ms TimeCoverageRelationStatistics Valid=197, Invalid=1443, Unknown=0, NotChecked=0, Total=1640 [2021-05-03 00:28:02,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 558 states. [2021-05-03 00:28:04,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 558 to 446. [2021-05-03 00:28:04,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 446 states, 436 states have (on average 1.2041284403669725) internal successors, (525), 436 states have internal predecessors, (525), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:28:04,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 446 states to 446 states and 536 transitions. [2021-05-03 00:28:04,225 INFO L78 Accepts]: Start accepts. Automaton has 446 states and 536 transitions. Word has length 79 [2021-05-03 00:28:04,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:28:04,225 INFO L480 AbstractCegarLoop]: Abstraction has 446 states and 536 transitions. [2021-05-03 00:28:04,225 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 37 states, 37 states have (on average 1.972972972972973) internal successors, (73), 36 states have internal predecessors, (73), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:28:04,225 INFO L276 IsEmpty]: Start isEmpty. Operand 446 states and 536 transitions. [2021-05-03 00:28:04,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2021-05-03 00:28:04,226 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:28:04,226 INFO L523 BasicCegarLoop]: trace histogram [19, 19, 11, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:28:04,226 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable916 [2021-05-03 00:28:04,226 INFO L428 AbstractCegarLoop]: === Iteration 207 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:28:04,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:28:04,226 INFO L82 PathProgramCache]: Analyzing trace with hash -1820927937, now seen corresponding path program 164 times [2021-05-03 00:28:04,226 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:28:04,226 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2136209057] [2021-05-03 00:28:04,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:28:04,236 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (+ v_main_~c~0_4298 1) v_~SIZE~0_723) (<= v_~last~0_728 v_main_~c~0_4298)) InVars {~SIZE~0=v_~SIZE~0_723, main_~c~0=v_main_~c~0_4298, ~last~0=v_~last~0_728} OutVars{~SIZE~0=v_~SIZE~0_723, main_~c~0=v_main_~c~0_4298, ~last~0=v_~last~0_728} AuxVars[] AssignedVars[] [2021-05-03 00:28:04,238 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size [2021-05-03 00:28:04,240 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:28:04,243 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:28:04,263 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:28:04,268 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:28:04,326 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size 78 [2021-05-03 00:28:04,373 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_4300 v_~last~0_729) (< (+ v_main_~c~0_4300 1) v_~SIZE~0_724)) InVars {~SIZE~0=v_~SIZE~0_724, main_~c~0=v_main_~c~0_4300, ~last~0=v_~last~0_729} OutVars{~SIZE~0=v_~SIZE~0_724, main_~c~0=v_main_~c~0_4300, ~last~0=v_~last~0_729} AuxVars[] AssignedVars[] [2021-05-03 00:28:04,376 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:28:04,404 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:28:04,406 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:28:04,432 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:28:04,441 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:28:04,471 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:28:04,525 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:28:04,529 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_~last~0_730 v_main_~c~0_4302) (< v_main_~c~0_4302 v_~SIZE~0_725)) InVars {~SIZE~0=v_~SIZE~0_725, main_~c~0=v_main_~c~0_4302, ~last~0=v_~last~0_730} OutVars{~SIZE~0=v_~SIZE~0_725, main_~c~0=v_main_~c~0_4302, ~last~0=v_~last~0_730} AuxVars[] AssignedVars[] [2021-05-03 00:28:04,531 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:28:04,565 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:28:04,568 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:28:04,588 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:28:04,594 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:28:04,624 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:28:04,669 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_4304 v_~SIZE~0_726) (< v_main_~c~0_4304 v_~last~0_731)) InVars {~SIZE~0=v_~SIZE~0_726, main_~c~0=v_main_~c~0_4304, ~last~0=v_~last~0_731} OutVars{~SIZE~0=v_~SIZE~0_726, main_~c~0=v_main_~c~0_4304, ~last~0=v_~last~0_731} AuxVars[] AssignedVars[] [2021-05-03 00:28:04,671 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size [2021-05-03 00:28:04,695 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:28:04,697 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:28:04,721 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:28:04,730 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:28:04,759 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size 66 [2021-05-03 00:28:04,799 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:28:04,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:28:04,927 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:28:04,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:28:04,932 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:28:04,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:28:04,935 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:28:04,939 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:28:07,371 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:28:07,372 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2136209057] [2021-05-03 00:28:07,372 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [2136209057] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:28:07,372 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:28:07,372 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [38] imperfect sequences [] total 38 [2021-05-03 00:28:07,372 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1557081721] [2021-05-03 00:28:07,372 INFO L460 AbstractCegarLoop]: Interpolant automaton has 38 states [2021-05-03 00:28:07,372 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:28:07,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2021-05-03 00:28:07,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=176, Invalid=1384, Unknown=0, NotChecked=0, Total=1560 [2021-05-03 00:28:07,373 INFO L87 Difference]: Start difference. First operand 446 states and 536 transitions. Second operand has 38 states, 38 states have (on average 1.9210526315789473) internal successors, (73), 37 states have internal predecessors, (73), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:28:11,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:28:11,799 INFO L93 Difference]: Finished difference Result 930 states and 1095 transitions. [2021-05-03 00:28:11,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2021-05-03 00:28:11,801 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 1.9210526315789473) internal successors, (73), 37 states have internal predecessors, (73), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 79 [2021-05-03 00:28:11,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:28:11,801 INFO L225 Difference]: With dead ends: 930 [2021-05-03 00:28:11,802 INFO L226 Difference]: Without dead ends: 552 [2021-05-03 00:28:11,802 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 12 SyntacticMatches, 26 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1003 ImplicationChecksByTransitivity, 2489.2ms TimeCoverageRelationStatistics Valid=207, Invalid=1515, Unknown=0, NotChecked=0, Total=1722 [2021-05-03 00:28:11,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 552 states. [2021-05-03 00:28:13,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 552 to 446. [2021-05-03 00:28:13,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 446 states, 436 states have (on average 1.2041284403669725) internal successors, (525), 436 states have internal predecessors, (525), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:28:13,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 446 states to 446 states and 536 transitions. [2021-05-03 00:28:13,006 INFO L78 Accepts]: Start accepts. Automaton has 446 states and 536 transitions. Word has length 79 [2021-05-03 00:28:13,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:28:13,006 INFO L480 AbstractCegarLoop]: Abstraction has 446 states and 536 transitions. [2021-05-03 00:28:13,006 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 38 states, 38 states have (on average 1.9210526315789473) internal successors, (73), 37 states have internal predecessors, (73), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:28:13,006 INFO L276 IsEmpty]: Start isEmpty. Operand 446 states and 536 transitions. [2021-05-03 00:28:13,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2021-05-03 00:28:13,007 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:28:13,007 INFO L523 BasicCegarLoop]: trace histogram [19, 19, 12, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:28:13,007 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable921 [2021-05-03 00:28:13,007 INFO L428 AbstractCegarLoop]: === Iteration 208 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:28:13,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:28:13,007 INFO L82 PathProgramCache]: Analyzing trace with hash -1546168323, now seen corresponding path program 165 times [2021-05-03 00:28:13,007 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:28:13,007 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1750481600] [2021-05-03 00:28:13,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:28:13,015 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (+ v_main_~c~0_4327 1) v_~SIZE~0_727) (<= v_~last~0_732 v_main_~c~0_4327)) InVars {~SIZE~0=v_~SIZE~0_727, main_~c~0=v_main_~c~0_4327, ~last~0=v_~last~0_732} OutVars{~SIZE~0=v_~SIZE~0_727, main_~c~0=v_main_~c~0_4327, ~last~0=v_~last~0_732} AuxVars[] AssignedVars[] [2021-05-03 00:28:13,016 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size [2021-05-03 00:28:13,018 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:28:13,019 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:28:13,032 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:28:13,036 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:28:13,074 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size 78 [2021-05-03 00:28:13,105 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (+ v_main_~c~0_4329 1) v_~SIZE~0_728) (< v_main_~c~0_4329 v_~last~0_733)) InVars {~SIZE~0=v_~SIZE~0_728, main_~c~0=v_main_~c~0_4329, ~last~0=v_~last~0_733} OutVars{~SIZE~0=v_~SIZE~0_728, main_~c~0=v_main_~c~0_4329, ~last~0=v_~last~0_733} AuxVars[] AssignedVars[] [2021-05-03 00:28:13,107 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:28:13,108 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:28:13,109 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:28:13,127 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:28:13,134 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:28:13,168 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:28:13,198 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:28:13,200 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_~last~0_734 v_main_~c~0_4331) (< v_main_~c~0_4331 v_~SIZE~0_729)) InVars {~SIZE~0=v_~SIZE~0_729, main_~c~0=v_main_~c~0_4331, ~last~0=v_~last~0_734} OutVars{~SIZE~0=v_~SIZE~0_729, main_~c~0=v_main_~c~0_4331, ~last~0=v_~last~0_734} AuxVars[] AssignedVars[] [2021-05-03 00:28:13,202 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:28:13,222 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:28:13,223 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:28:13,236 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:28:13,240 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:28:13,262 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:28:13,293 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_4333 v_~last~0_735) (< v_main_~c~0_4333 v_~SIZE~0_730)) InVars {~SIZE~0=v_~SIZE~0_730, main_~c~0=v_main_~c~0_4333, ~last~0=v_~last~0_735} OutVars{~SIZE~0=v_~SIZE~0_730, main_~c~0=v_main_~c~0_4333, ~last~0=v_~last~0_735} AuxVars[] AssignedVars[] [2021-05-03 00:28:13,295 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size [2021-05-03 00:28:13,311 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:28:13,313 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:28:13,330 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:28:13,336 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:28:13,360 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size 66 [2021-05-03 00:28:13,391 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:28:13,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:28:13,507 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:28:13,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:28:13,511 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:28:13,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:28:13,513 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:28:13,516 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:28:15,507 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:28:15,507 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1750481600] [2021-05-03 00:28:15,507 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1750481600] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:28:15,507 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:28:15,507 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [39] imperfect sequences [] total 39 [2021-05-03 00:28:15,507 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093559085] [2021-05-03 00:28:15,507 INFO L460 AbstractCegarLoop]: Interpolant automaton has 39 states [2021-05-03 00:28:15,507 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:28:15,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2021-05-03 00:28:15,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=184, Invalid=1456, Unknown=0, NotChecked=0, Total=1640 [2021-05-03 00:28:15,508 INFO L87 Difference]: Start difference. First operand 446 states and 536 transitions. Second operand has 39 states, 39 states have (on average 1.8717948717948718) internal successors, (73), 38 states have internal predecessors, (73), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:28:19,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:28:19,865 INFO L93 Difference]: Finished difference Result 924 states and 1089 transitions. [2021-05-03 00:28:19,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2021-05-03 00:28:19,867 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 1.8717948717948718) internal successors, (73), 38 states have internal predecessors, (73), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 79 [2021-05-03 00:28:19,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:28:19,868 INFO L225 Difference]: With dead ends: 924 [2021-05-03 00:28:19,868 INFO L226 Difference]: Without dead ends: 546 [2021-05-03 00:28:19,869 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 13 SyntacticMatches, 24 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 984 ImplicationChecksByTransitivity, 2065.4ms TimeCoverageRelationStatistics Valid=217, Invalid=1589, Unknown=0, NotChecked=0, Total=1806 [2021-05-03 00:28:19,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 546 states. [2021-05-03 00:28:21,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 546 to 446. [2021-05-03 00:28:21,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 446 states, 436 states have (on average 1.2041284403669725) internal successors, (525), 436 states have internal predecessors, (525), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:28:21,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 446 states to 446 states and 536 transitions. [2021-05-03 00:28:21,106 INFO L78 Accepts]: Start accepts. Automaton has 446 states and 536 transitions. Word has length 79 [2021-05-03 00:28:21,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:28:21,106 INFO L480 AbstractCegarLoop]: Abstraction has 446 states and 536 transitions. [2021-05-03 00:28:21,106 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 39 states, 39 states have (on average 1.8717948717948718) internal successors, (73), 38 states have internal predecessors, (73), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:28:21,106 INFO L276 IsEmpty]: Start isEmpty. Operand 446 states and 536 transitions. [2021-05-03 00:28:21,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2021-05-03 00:28:21,107 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:28:21,107 INFO L523 BasicCegarLoop]: trace histogram [19, 19, 13, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:28:21,107 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable926 [2021-05-03 00:28:21,107 INFO L428 AbstractCegarLoop]: === Iteration 209 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:28:21,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:28:21,107 INFO L82 PathProgramCache]: Analyzing trace with hash -159964929, now seen corresponding path program 166 times [2021-05-03 00:28:21,107 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:28:21,107 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [707473568] [2021-05-03 00:28:21,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:28:21,116 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (+ v_main_~c~0_4356 1) v_~SIZE~0_731) (<= v_~last~0_736 v_main_~c~0_4356)) InVars {~SIZE~0=v_~SIZE~0_731, main_~c~0=v_main_~c~0_4356, ~last~0=v_~last~0_736} OutVars{~SIZE~0=v_~SIZE~0_731, main_~c~0=v_main_~c~0_4356, ~last~0=v_~last~0_736} AuxVars[] AssignedVars[] [2021-05-03 00:28:21,117 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size [2021-05-03 00:28:21,139 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:28:21,141 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:28:21,158 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:28:21,163 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:28:21,186 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size 78 [2021-05-03 00:28:21,223 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (+ v_main_~c~0_4358 1) v_~SIZE~0_732) (< v_main_~c~0_4358 v_~last~0_737)) InVars {~SIZE~0=v_~SIZE~0_732, main_~c~0=v_main_~c~0_4358, ~last~0=v_~last~0_737} OutVars{~SIZE~0=v_~SIZE~0_732, main_~c~0=v_main_~c~0_4358, ~last~0=v_~last~0_737} AuxVars[] AssignedVars[] [2021-05-03 00:28:21,225 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:28:21,226 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:28:21,227 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:28:21,246 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:28:21,253 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:28:21,289 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:28:21,321 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:28:21,324 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_4360 v_~SIZE~0_733) (<= v_~last~0_738 v_main_~c~0_4360)) InVars {~SIZE~0=v_~SIZE~0_733, main_~c~0=v_main_~c~0_4360, ~last~0=v_~last~0_738} OutVars{~SIZE~0=v_~SIZE~0_733, main_~c~0=v_main_~c~0_4360, ~last~0=v_~last~0_738} AuxVars[] AssignedVars[] [2021-05-03 00:28:21,325 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:28:21,326 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:28:21,327 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:28:21,341 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:28:21,347 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:28:21,388 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:28:21,419 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_4362 v_~SIZE~0_734) (< v_main_~c~0_4362 v_~last~0_739)) InVars {~SIZE~0=v_~SIZE~0_734, main_~c~0=v_main_~c~0_4362, ~last~0=v_~last~0_739} OutVars{~SIZE~0=v_~SIZE~0_734, main_~c~0=v_main_~c~0_4362, ~last~0=v_~last~0_739} AuxVars[] AssignedVars[] [2021-05-03 00:28:21,421 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size [2021-05-03 00:28:21,423 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:28:21,425 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:28:21,449 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:28:21,456 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:28:21,493 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size 66 [2021-05-03 00:28:21,522 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:28:21,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:28:21,609 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:28:21,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:28:21,613 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:28:21,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:28:21,615 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:28:21,619 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:28:23,938 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:28:23,938 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [707473568] [2021-05-03 00:28:23,938 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [707473568] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:28:23,938 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:28:23,938 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [40] imperfect sequences [] total 40 [2021-05-03 00:28:23,938 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1806581070] [2021-05-03 00:28:23,938 INFO L460 AbstractCegarLoop]: Interpolant automaton has 40 states [2021-05-03 00:28:23,939 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:28:23,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2021-05-03 00:28:23,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=185, Invalid=1455, Unknown=0, NotChecked=0, Total=1640 [2021-05-03 00:28:23,939 INFO L87 Difference]: Start difference. First operand 446 states and 536 transitions. Second operand has 40 states, 40 states have (on average 1.825) internal successors, (73), 39 states have internal predecessors, (73), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:28:27,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:28:27,521 INFO L93 Difference]: Finished difference Result 890 states and 1059 transitions. [2021-05-03 00:28:27,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2021-05-03 00:28:27,523 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 1.825) internal successors, (73), 39 states have internal predecessors, (73), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 79 [2021-05-03 00:28:27,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:28:27,524 INFO L225 Difference]: With dead ends: 890 [2021-05-03 00:28:27,524 INFO L226 Difference]: Without dead ends: 512 [2021-05-03 00:28:27,524 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 12 SyntacticMatches, 24 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 966 ImplicationChecksByTransitivity, 2347.8ms TimeCoverageRelationStatistics Valid=221, Invalid=1585, Unknown=0, NotChecked=0, Total=1806 [2021-05-03 00:28:27,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 512 states. [2021-05-03 00:28:28,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 512 to 446. [2021-05-03 00:28:28,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 446 states, 436 states have (on average 1.2041284403669725) internal successors, (525), 436 states have internal predecessors, (525), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:28:28,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 446 states to 446 states and 536 transitions. [2021-05-03 00:28:28,749 INFO L78 Accepts]: Start accepts. Automaton has 446 states and 536 transitions. Word has length 79 [2021-05-03 00:28:28,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:28:28,749 INFO L480 AbstractCegarLoop]: Abstraction has 446 states and 536 transitions. [2021-05-03 00:28:28,749 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 40 states, 40 states have (on average 1.825) internal successors, (73), 39 states have internal predecessors, (73), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:28:28,749 INFO L276 IsEmpty]: Start isEmpty. Operand 446 states and 536 transitions. [2021-05-03 00:28:28,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2021-05-03 00:28:28,750 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:28:28,750 INFO L523 BasicCegarLoop]: trace histogram [19, 19, 14, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:28:28,750 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable931 [2021-05-03 00:28:28,750 INFO L428 AbstractCegarLoop]: === Iteration 210 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:28:28,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:28:28,750 INFO L82 PathProgramCache]: Analyzing trace with hash -97925315, now seen corresponding path program 167 times [2021-05-03 00:28:28,750 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:28:28,751 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [518017878] [2021-05-03 00:28:28,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:28:28,758 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (+ v_main_~c~0_4385 1) v_~SIZE~0_735) (<= v_~last~0_740 v_main_~c~0_4385)) InVars {~SIZE~0=v_~SIZE~0_735, main_~c~0=v_main_~c~0_4385, ~last~0=v_~last~0_740} OutVars{~SIZE~0=v_~SIZE~0_735, main_~c~0=v_main_~c~0_4385, ~last~0=v_~last~0_740} AuxVars[] AssignedVars[] [2021-05-03 00:28:28,760 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size [2021-05-03 00:28:28,782 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:28:28,784 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:28:28,799 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:28:28,803 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:28:28,826 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size 78 [2021-05-03 00:28:28,861 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_4387 v_~last~0_741) (< (+ v_main_~c~0_4387 1) v_~SIZE~0_736)) InVars {~SIZE~0=v_~SIZE~0_736, main_~c~0=v_main_~c~0_4387, ~last~0=v_~last~0_741} OutVars{~SIZE~0=v_~SIZE~0_736, main_~c~0=v_main_~c~0_4387, ~last~0=v_~last~0_741} AuxVars[] AssignedVars[] [2021-05-03 00:28:28,862 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:28:28,885 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:28:28,887 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:28:28,906 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:28:28,913 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:28:28,935 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:28:28,966 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:28:28,969 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_4389 v_~SIZE~0_737) (<= v_~last~0_742 v_main_~c~0_4389)) InVars {~SIZE~0=v_~SIZE~0_737, main_~c~0=v_main_~c~0_4389, ~last~0=v_~last~0_742} OutVars{~SIZE~0=v_~SIZE~0_737, main_~c~0=v_main_~c~0_4389, ~last~0=v_~last~0_742} AuxVars[] AssignedVars[] [2021-05-03 00:28:28,971 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:28:28,972 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:28:28,973 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:28:28,988 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:28:28,991 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:28:29,032 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:28:29,065 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_4391 v_~last~0_743) (< v_main_~c~0_4391 v_~SIZE~0_738)) InVars {~SIZE~0=v_~SIZE~0_738, main_~c~0=v_main_~c~0_4391, ~last~0=v_~last~0_743} OutVars{~SIZE~0=v_~SIZE~0_738, main_~c~0=v_main_~c~0_4391, ~last~0=v_~last~0_743} AuxVars[] AssignedVars[] [2021-05-03 00:28:29,066 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size [2021-05-03 00:28:29,067 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:28:29,069 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:28:29,093 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:28:29,102 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:28:29,138 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size 66 [2021-05-03 00:28:29,175 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:28:29,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:28:29,285 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:28:29,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:28:29,289 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:28:29,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:28:29,291 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:28:29,293 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:28:31,216 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:28:31,217 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [518017878] [2021-05-03 00:28:31,217 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [518017878] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:28:31,217 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:28:31,217 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [41] imperfect sequences [] total 41 [2021-05-03 00:28:31,217 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1334192033] [2021-05-03 00:28:31,217 INFO L460 AbstractCegarLoop]: Interpolant automaton has 41 states [2021-05-03 00:28:31,217 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:28:31,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2021-05-03 00:28:31,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=200, Invalid=1606, Unknown=0, NotChecked=0, Total=1806 [2021-05-03 00:28:31,218 INFO L87 Difference]: Start difference. First operand 446 states and 536 transitions. Second operand has 41 states, 41 states have (on average 1.7804878048780488) internal successors, (73), 40 states have internal predecessors, (73), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:28:34,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:28:34,968 INFO L93 Difference]: Finished difference Result 912 states and 1077 transitions. [2021-05-03 00:28:34,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2021-05-03 00:28:34,970 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 41 states have (on average 1.7804878048780488) internal successors, (73), 40 states have internal predecessors, (73), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 79 [2021-05-03 00:28:34,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:28:34,971 INFO L225 Difference]: With dead ends: 912 [2021-05-03 00:28:34,971 INFO L226 Difference]: Without dead ends: 534 [2021-05-03 00:28:34,971 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 13 SyntacticMatches, 22 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 973 ImplicationChecksByTransitivity, 1975.4ms TimeCoverageRelationStatistics Valid=237, Invalid=1743, Unknown=0, NotChecked=0, Total=1980 [2021-05-03 00:28:34,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 534 states. [2021-05-03 00:28:36,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 534 to 446. [2021-05-03 00:28:36,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 446 states, 436 states have (on average 1.2041284403669725) internal successors, (525), 436 states have internal predecessors, (525), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:28:36,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 446 states to 446 states and 536 transitions. [2021-05-03 00:28:36,391 INFO L78 Accepts]: Start accepts. Automaton has 446 states and 536 transitions. Word has length 79 [2021-05-03 00:28:36,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:28:36,391 INFO L480 AbstractCegarLoop]: Abstraction has 446 states and 536 transitions. [2021-05-03 00:28:36,392 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 41 states, 41 states have (on average 1.7804878048780488) internal successors, (73), 40 states have internal predecessors, (73), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:28:36,392 INFO L276 IsEmpty]: Start isEmpty. Operand 446 states and 536 transitions. [2021-05-03 00:28:36,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2021-05-03 00:28:36,392 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:28:36,392 INFO L523 BasicCegarLoop]: trace histogram [19, 19, 15, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:28:36,392 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable936 [2021-05-03 00:28:36,392 INFO L428 AbstractCegarLoop]: === Iteration 211 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:28:36,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:28:36,393 INFO L82 PathProgramCache]: Analyzing trace with hash -1903363649, now seen corresponding path program 168 times [2021-05-03 00:28:36,393 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:28:36,393 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2132106569] [2021-05-03 00:28:36,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:28:36,403 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_~last~0_744 v_main_~c~0_4414) (< (+ v_main_~c~0_4414 1) v_~SIZE~0_739)) InVars {~SIZE~0=v_~SIZE~0_739, main_~c~0=v_main_~c~0_4414, ~last~0=v_~last~0_744} OutVars{~SIZE~0=v_~SIZE~0_739, main_~c~0=v_main_~c~0_4414, ~last~0=v_~last~0_744} AuxVars[] AssignedVars[] [2021-05-03 00:28:36,405 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size [2021-05-03 00:28:36,407 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:28:36,409 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:28:36,426 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:28:36,430 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:28:36,484 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size 78 [2021-05-03 00:28:36,536 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (+ v_main_~c~0_4416 1) v_~SIZE~0_740) (< v_main_~c~0_4416 v_~last~0_745)) InVars {~SIZE~0=v_~SIZE~0_740, main_~c~0=v_main_~c~0_4416, ~last~0=v_~last~0_745} OutVars{~SIZE~0=v_~SIZE~0_740, main_~c~0=v_main_~c~0_4416, ~last~0=v_~last~0_745} AuxVars[] AssignedVars[] [2021-05-03 00:28:36,538 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:28:36,566 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:28:36,569 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:28:36,600 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:28:36,610 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:28:36,644 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:28:36,693 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:28:36,697 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_~last~0_746 v_main_~c~0_4418) (< v_main_~c~0_4418 v_~SIZE~0_741)) InVars {~SIZE~0=v_~SIZE~0_741, main_~c~0=v_main_~c~0_4418, ~last~0=v_~last~0_746} OutVars{~SIZE~0=v_~SIZE~0_741, main_~c~0=v_main_~c~0_4418, ~last~0=v_~last~0_746} AuxVars[] AssignedVars[] [2021-05-03 00:28:36,700 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:28:36,701 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:28:36,704 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:28:36,723 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:28:36,728 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:28:36,789 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:28:36,839 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_4420 v_~SIZE~0_742) (< v_main_~c~0_4420 v_~last~0_747)) InVars {~SIZE~0=v_~SIZE~0_742, main_~c~0=v_main_~c~0_4420, ~last~0=v_~last~0_747} OutVars{~SIZE~0=v_~SIZE~0_742, main_~c~0=v_main_~c~0_4420, ~last~0=v_~last~0_747} AuxVars[] AssignedVars[] [2021-05-03 00:28:36,841 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size [2021-05-03 00:28:36,842 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:28:36,845 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:28:36,870 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:28:36,880 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:28:36,928 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size 66 [2021-05-03 00:28:36,972 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:28:36,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:28:37,084 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:28:37,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:28:37,090 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:28:37,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:28:37,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-03 00:28:37,099 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:28:39,619 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:28:39,620 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2132106569] [2021-05-03 00:28:39,620 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [2132106569] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:28:39,620 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:28:39,620 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [42] imperfect sequences [] total 42 [2021-05-03 00:28:39,620 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2005660519] [2021-05-03 00:28:39,620 INFO L460 AbstractCegarLoop]: Interpolant automaton has 42 states [2021-05-03 00:28:39,620 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:28:39,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2021-05-03 00:28:39,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=201, Invalid=1605, Unknown=0, NotChecked=0, Total=1806 [2021-05-03 00:28:39,621 INFO L87 Difference]: Start difference. First operand 446 states and 536 transitions. Second operand has 42 states, 42 states have (on average 1.7380952380952381) internal successors, (73), 41 states have internal predecessors, (73), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:28:44,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:28:44,479 INFO L93 Difference]: Finished difference Result 880 states and 1052 transitions. [2021-05-03 00:28:44,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2021-05-03 00:28:44,481 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 42 states have (on average 1.7380952380952381) internal successors, (73), 41 states have internal predecessors, (73), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 79 [2021-05-03 00:28:44,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:28:44,482 INFO L225 Difference]: With dead ends: 880 [2021-05-03 00:28:44,482 INFO L226 Difference]: Without dead ends: 502 [2021-05-03 00:28:44,483 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 12 SyntacticMatches, 22 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 943 ImplicationChecksByTransitivity, 2533.1ms TimeCoverageRelationStatistics Valid=241, Invalid=1739, Unknown=0, NotChecked=0, Total=1980 [2021-05-03 00:28:44,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 502 states. [2021-05-03 00:28:45,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 502 to 446. [2021-05-03 00:28:45,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 446 states, 436 states have (on average 1.2041284403669725) internal successors, (525), 436 states have internal predecessors, (525), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:28:45,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 446 states to 446 states and 536 transitions. [2021-05-03 00:28:45,799 INFO L78 Accepts]: Start accepts. Automaton has 446 states and 536 transitions. Word has length 79 [2021-05-03 00:28:45,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:28:45,799 INFO L480 AbstractCegarLoop]: Abstraction has 446 states and 536 transitions. [2021-05-03 00:28:45,799 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 42 states, 42 states have (on average 1.7380952380952381) internal successors, (73), 41 states have internal predecessors, (73), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:28:45,799 INFO L276 IsEmpty]: Start isEmpty. Operand 446 states and 536 transitions. [2021-05-03 00:28:45,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2021-05-03 00:28:45,800 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:28:45,800 INFO L523 BasicCegarLoop]: trace histogram [19, 19, 16, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:28:45,800 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable941 [2021-05-03 00:28:45,800 INFO L428 AbstractCegarLoop]: === Iteration 212 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:28:45,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:28:45,800 INFO L82 PathProgramCache]: Analyzing trace with hash 1573955197, now seen corresponding path program 169 times [2021-05-03 00:28:45,800 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:28:45,800 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1083493737] [2021-05-03 00:28:45,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:28:45,809 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (+ v_main_~c~0_4443 1) v_~SIZE~0_743) (<= v_~last~0_748 v_main_~c~0_4443)) InVars {~SIZE~0=v_~SIZE~0_743, main_~c~0=v_main_~c~0_4443, ~last~0=v_~last~0_748} OutVars{~SIZE~0=v_~SIZE~0_743, main_~c~0=v_main_~c~0_4443, ~last~0=v_~last~0_748} AuxVars[] AssignedVars[] [2021-05-03 00:28:45,811 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size [2021-05-03 00:28:45,812 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:28:45,814 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:28:45,829 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:28:45,833 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:28:45,876 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size 78 [2021-05-03 00:28:45,911 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_4445 v_~last~0_749) (< (+ v_main_~c~0_4445 1) v_~SIZE~0_744)) InVars {~SIZE~0=v_~SIZE~0_744, main_~c~0=v_main_~c~0_4445, ~last~0=v_~last~0_749} OutVars{~SIZE~0=v_~SIZE~0_744, main_~c~0=v_main_~c~0_4445, ~last~0=v_~last~0_749} AuxVars[] AssignedVars[] [2021-05-03 00:28:45,913 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:28:45,914 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:28:45,915 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:28:45,937 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:28:45,944 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:28:45,987 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:28:46,025 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:28:46,028 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_~last~0_750 v_main_~c~0_4447) (< v_main_~c~0_4447 v_~SIZE~0_745)) InVars {~SIZE~0=v_~SIZE~0_745, main_~c~0=v_main_~c~0_4447, ~last~0=v_~last~0_750} OutVars{~SIZE~0=v_~SIZE~0_745, main_~c~0=v_main_~c~0_4447, ~last~0=v_~last~0_750} AuxVars[] AssignedVars[] [2021-05-03 00:28:46,029 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:28:46,052 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:28:46,054 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:28:46,069 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:28:46,073 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:28:46,095 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:28:46,131 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_4449 v_~last~0_751) (< v_main_~c~0_4449 v_~SIZE~0_746)) InVars {~SIZE~0=v_~SIZE~0_746, main_~c~0=v_main_~c~0_4449, ~last~0=v_~last~0_751} OutVars{~SIZE~0=v_~SIZE~0_746, main_~c~0=v_main_~c~0_4449, ~last~0=v_~last~0_751} AuxVars[] AssignedVars[] [2021-05-03 00:28:46,132 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size [2021-05-03 00:28:46,150 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:28:46,152 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:28:46,172 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:28:46,179 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:28:46,201 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size 66 [2021-05-03 00:28:46,237 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:28:46,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:28:46,319 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:28:46,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:28:46,323 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:28:46,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:28:46,325 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:28:46,328 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:28:49,133 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:28:49,134 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1083493737] [2021-05-03 00:28:49,134 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1083493737] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:28:49,134 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:28:49,134 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [43] imperfect sequences [] total 43 [2021-05-03 00:28:49,134 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197769888] [2021-05-03 00:28:49,134 INFO L460 AbstractCegarLoop]: Interpolant automaton has 43 states [2021-05-03 00:28:49,134 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:28:49,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2021-05-03 00:28:49,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=209, Invalid=1683, Unknown=0, NotChecked=0, Total=1892 [2021-05-03 00:28:49,135 INFO L87 Difference]: Start difference. First operand 446 states and 536 transitions. Second operand has 43 states, 43 states have (on average 1.697674418604651) internal successors, (73), 42 states have internal predecessors, (73), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:28:53,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:28:53,610 INFO L93 Difference]: Finished difference Result 863 states and 1032 transitions. [2021-05-03 00:28:53,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2021-05-03 00:28:53,611 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 43 states have (on average 1.697674418604651) internal successors, (73), 42 states have internal predecessors, (73), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 79 [2021-05-03 00:28:53,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:28:53,612 INFO L225 Difference]: With dead ends: 863 [2021-05-03 00:28:53,612 INFO L226 Difference]: Without dead ends: 485 [2021-05-03 00:28:53,613 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 12 SyntacticMatches, 21 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 918 ImplicationChecksByTransitivity, 2819.7ms TimeCoverageRelationStatistics Valid=251, Invalid=1819, Unknown=0, NotChecked=0, Total=2070 [2021-05-03 00:28:53,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 485 states. [2021-05-03 00:28:54,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 485 to 446. [2021-05-03 00:28:54,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 446 states, 436 states have (on average 1.2041284403669725) internal successors, (525), 436 states have internal predecessors, (525), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:28:54,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 446 states to 446 states and 536 transitions. [2021-05-03 00:28:54,935 INFO L78 Accepts]: Start accepts. Automaton has 446 states and 536 transitions. Word has length 79 [2021-05-03 00:28:54,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:28:54,935 INFO L480 AbstractCegarLoop]: Abstraction has 446 states and 536 transitions. [2021-05-03 00:28:54,935 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 43 states, 43 states have (on average 1.697674418604651) internal successors, (73), 42 states have internal predecessors, (73), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:28:54,935 INFO L276 IsEmpty]: Start isEmpty. Operand 446 states and 536 transitions. [2021-05-03 00:28:54,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2021-05-03 00:28:54,935 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:28:54,935 INFO L523 BasicCegarLoop]: trace histogram [19, 19, 17, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:28:54,936 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable946 [2021-05-03 00:28:54,936 INFO L428 AbstractCegarLoop]: === Iteration 213 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:28:54,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:28:54,936 INFO L82 PathProgramCache]: Analyzing trace with hash -14392705, now seen corresponding path program 170 times [2021-05-03 00:28:54,936 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:28:54,936 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1477594543] [2021-05-03 00:28:54,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:28:54,946 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_~last~0_752 v_main_~c~0_4472) (< (+ v_main_~c~0_4472 1) v_~SIZE~0_747)) InVars {~SIZE~0=v_~SIZE~0_747, main_~c~0=v_main_~c~0_4472, ~last~0=v_~last~0_752} OutVars{~SIZE~0=v_~SIZE~0_747, main_~c~0=v_main_~c~0_4472, ~last~0=v_~last~0_752} AuxVars[] AssignedVars[] [2021-05-03 00:28:54,948 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size [2021-05-03 00:28:54,978 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:28:54,980 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:28:54,999 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:28:55,006 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:28:55,038 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size 78 [2021-05-03 00:28:55,084 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (+ v_main_~c~0_4474 1) v_~SIZE~0_748) (< v_main_~c~0_4474 v_~last~0_753)) InVars {~SIZE~0=v_~SIZE~0_748, main_~c~0=v_main_~c~0_4474, ~last~0=v_~last~0_753} OutVars{~SIZE~0=v_~SIZE~0_748, main_~c~0=v_main_~c~0_4474, ~last~0=v_~last~0_753} AuxVars[] AssignedVars[] [2021-05-03 00:28:55,086 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:28:55,088 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:28:55,090 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:28:55,118 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:28:55,129 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:28:55,189 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:28:55,246 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:28:55,251 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_~last~0_754 v_main_~c~0_4476) (< v_main_~c~0_4476 v_~SIZE~0_749)) InVars {~SIZE~0=v_~SIZE~0_749, main_~c~0=v_main_~c~0_4476, ~last~0=v_~last~0_754} OutVars{~SIZE~0=v_~SIZE~0_749, main_~c~0=v_main_~c~0_4476, ~last~0=v_~last~0_754} AuxVars[] AssignedVars[] [2021-05-03 00:28:55,254 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:28:55,295 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:28:55,298 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:28:55,317 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:28:55,323 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:28:55,354 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:28:55,403 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_4478 v_~SIZE~0_750) (< v_main_~c~0_4478 v_~last~0_755)) InVars {~SIZE~0=v_~SIZE~0_750, main_~c~0=v_main_~c~0_4478, ~last~0=v_~last~0_755} OutVars{~SIZE~0=v_~SIZE~0_750, main_~c~0=v_main_~c~0_4478, ~last~0=v_~last~0_755} AuxVars[] AssignedVars[] [2021-05-03 00:28:55,406 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size [2021-05-03 00:28:55,431 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:28:55,433 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:28:55,457 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:28:55,467 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:28:55,496 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size 66 [2021-05-03 00:28:55,540 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:28:55,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:28:55,819 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:28:55,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:28:55,824 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:28:55,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:28:55,826 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:28:55,830 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:28:59,679 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:28:59,679 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1477594543] [2021-05-03 00:28:59,679 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1477594543] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:28:59,679 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:28:59,679 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [44] imperfect sequences [] total 44 [2021-05-03 00:28:59,679 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1877771271] [2021-05-03 00:28:59,679 INFO L460 AbstractCegarLoop]: Interpolant automaton has 44 states [2021-05-03 00:28:59,680 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:28:59,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2021-05-03 00:28:59,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=224, Invalid=1846, Unknown=0, NotChecked=0, Total=2070 [2021-05-03 00:28:59,680 INFO L87 Difference]: Start difference. First operand 446 states and 536 transitions. Second operand has 44 states, 44 states have (on average 1.6590909090909092) internal successors, (73), 43 states have internal predecessors, (73), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:29:06,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:29:06,112 INFO L93 Difference]: Finished difference Result 897 states and 1062 transitions. [2021-05-03 00:29:06,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2021-05-03 00:29:06,115 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 44 states have (on average 1.6590909090909092) internal successors, (73), 43 states have internal predecessors, (73), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 79 [2021-05-03 00:29:06,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:29:06,116 INFO L225 Difference]: With dead ends: 897 [2021-05-03 00:29:06,116 INFO L226 Difference]: Without dead ends: 519 [2021-05-03 00:29:06,117 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 13 SyntacticMatches, 19 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 889 ImplicationChecksByTransitivity, 4053.2ms TimeCoverageRelationStatistics Valid=267, Invalid=1989, Unknown=0, NotChecked=0, Total=2256 [2021-05-03 00:29:06,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 519 states. [2021-05-03 00:29:07,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 519 to 446. [2021-05-03 00:29:07,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 446 states, 436 states have (on average 1.2041284403669725) internal successors, (525), 436 states have internal predecessors, (525), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:29:07,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 446 states to 446 states and 536 transitions. [2021-05-03 00:29:07,558 INFO L78 Accepts]: Start accepts. Automaton has 446 states and 536 transitions. Word has length 79 [2021-05-03 00:29:07,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:29:07,558 INFO L480 AbstractCegarLoop]: Abstraction has 446 states and 536 transitions. [2021-05-03 00:29:07,559 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 44 states, 44 states have (on average 1.6590909090909092) internal successors, (73), 43 states have internal predecessors, (73), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:29:07,559 INFO L276 IsEmpty]: Start isEmpty. Operand 446 states and 536 transitions. [2021-05-03 00:29:07,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2021-05-03 00:29:07,559 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:29:07,559 INFO L523 BasicCegarLoop]: trace histogram [19, 19, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:29:07,559 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable951 [2021-05-03 00:29:07,559 INFO L428 AbstractCegarLoop]: === Iteration 214 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:29:07,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:29:07,560 INFO L82 PathProgramCache]: Analyzing trace with hash -1025509955, now seen corresponding path program 171 times [2021-05-03 00:29:07,560 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:29:07,560 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1042847596] [2021-05-03 00:29:07,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:29:07,567 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (+ v_main_~c~0_4501 1) v_~SIZE~0_751) (< v_main_~c~0_4501 v_~last~0_756)) InVars {~SIZE~0=v_~SIZE~0_751, main_~c~0=v_main_~c~0_4501, ~last~0=v_~last~0_756} OutVars{~SIZE~0=v_~SIZE~0_751, main_~c~0=v_main_~c~0_4501, ~last~0=v_~last~0_756} AuxVars[] AssignedVars[] [2021-05-03 00:29:07,569 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:29:07,591 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:29:07,594 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:29:07,616 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:29:07,624 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:29:07,647 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:29:07,683 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:29:07,686 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_~last~0_757 v_main_~c~0_4503) (< v_main_~c~0_4503 v_~SIZE~0_752)) InVars {~SIZE~0=v_~SIZE~0_752, main_~c~0=v_main_~c~0_4503, ~last~0=v_~last~0_757} OutVars{~SIZE~0=v_~SIZE~0_752, main_~c~0=v_main_~c~0_4503, ~last~0=v_~last~0_757} AuxVars[] AssignedVars[] [2021-05-03 00:29:07,687 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:29:07,713 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:29:07,714 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:29:07,730 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:29:07,734 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:29:07,759 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:29:07,797 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_4505 v_~last~0_758) (< v_main_~c~0_4505 v_~SIZE~0_753)) InVars {~SIZE~0=v_~SIZE~0_753, main_~c~0=v_main_~c~0_4505, ~last~0=v_~last~0_758} OutVars{~SIZE~0=v_~SIZE~0_753, main_~c~0=v_main_~c~0_4505, ~last~0=v_~last~0_758} AuxVars[] AssignedVars[] [2021-05-03 00:29:07,799 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size [2021-05-03 00:29:07,800 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:29:07,801 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:29:07,824 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:29:07,831 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:29:07,875 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size 66 [2021-05-03 00:29:07,913 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:29:07,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:29:08,041 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:29:08,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:29:08,045 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:29:08,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:29:08,048 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:29:08,050 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:29:11,972 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:29:11,972 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1042847596] [2021-05-03 00:29:11,972 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1042847596] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:29:11,972 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:29:11,973 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [45] imperfect sequences [] total 45 [2021-05-03 00:29:11,973 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [370190536] [2021-05-03 00:29:11,973 INFO L460 AbstractCegarLoop]: Interpolant automaton has 45 states [2021-05-03 00:29:11,973 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:29:11,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2021-05-03 00:29:11,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=232, Invalid=1930, Unknown=0, NotChecked=0, Total=2162 [2021-05-03 00:29:11,974 INFO L87 Difference]: Start difference. First operand 446 states and 536 transitions. Second operand has 45 states, 45 states have (on average 1.6222222222222222) internal successors, (73), 44 states have internal predecessors, (73), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:29:17,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:29:17,475 INFO L93 Difference]: Finished difference Result 900 states and 1071 transitions. [2021-05-03 00:29:17,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2021-05-03 00:29:17,478 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 45 states have (on average 1.6222222222222222) internal successors, (73), 44 states have internal predecessors, (73), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 79 [2021-05-03 00:29:17,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:29:17,478 INFO L225 Difference]: With dead ends: 900 [2021-05-03 00:29:17,478 INFO L226 Difference]: Without dead ends: 522 [2021-05-03 00:29:17,479 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 12 SyntacticMatches, 19 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 884 ImplicationChecksByTransitivity, 3955.4ms TimeCoverageRelationStatistics Valid=277, Invalid=2075, Unknown=0, NotChecked=0, Total=2352 [2021-05-03 00:29:17,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 522 states. [2021-05-03 00:29:18,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 522 to 423. [2021-05-03 00:29:18,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 423 states, 413 states have (on average 1.1985472154963681) internal successors, (495), 413 states have internal predecessors, (495), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:29:18,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 423 states and 506 transitions. [2021-05-03 00:29:18,778 INFO L78 Accepts]: Start accepts. Automaton has 423 states and 506 transitions. Word has length 79 [2021-05-03 00:29:18,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:29:18,778 INFO L480 AbstractCegarLoop]: Abstraction has 423 states and 506 transitions. [2021-05-03 00:29:18,778 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 45 states, 45 states have (on average 1.6222222222222222) internal successors, (73), 44 states have internal predecessors, (73), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:29:18,778 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 506 transitions. [2021-05-03 00:29:18,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2021-05-03 00:29:18,779 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:29:18,779 INFO L523 BasicCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:29:18,779 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable955 [2021-05-03 00:29:18,779 INFO L428 AbstractCegarLoop]: === Iteration 215 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:29:18,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:29:18,779 INFO L82 PathProgramCache]: Analyzing trace with hash -1191050305, now seen corresponding path program 19 times [2021-05-03 00:29:18,779 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:29:18,779 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [198628893] [2021-05-03 00:29:18,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:29:18,784 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_4528 v_~last~0_759) (< (+ v_main_~c~0_4528 1) v_~SIZE~0_754)) InVars {~SIZE~0=v_~SIZE~0_754, main_~c~0=v_main_~c~0_4528, ~last~0=v_~last~0_759} OutVars{~SIZE~0=v_~SIZE~0_754, main_~c~0=v_main_~c~0_4528, ~last~0=v_~last~0_759} AuxVars[] AssignedVars[] [2021-05-03 00:29:18,786 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:29:18,805 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:29:18,807 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:29:18,826 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:29:18,832 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:29:18,853 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:29:18,890 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:29:18,892 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_4530 v_~SIZE~0_755) (< v_main_~c~0_4530 v_~last~0_760)) InVars {~SIZE~0=v_~SIZE~0_755, main_~c~0=v_main_~c~0_4530, ~last~0=v_~last~0_760} OutVars{~SIZE~0=v_~SIZE~0_755, main_~c~0=v_main_~c~0_4530, ~last~0=v_~last~0_760} AuxVars[] AssignedVars[] [2021-05-03 00:29:18,893 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size [2021-05-03 00:29:18,894 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:29:18,896 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:29:18,915 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:29:18,922 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:29:18,958 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size 66 [2021-05-03 00:29:18,990 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:29:19,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:29:19,153 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:29:19,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:29:19,157 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:29:19,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:29:19,159 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:29:22,464 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:29:22,465 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [198628893] [2021-05-03 00:29:22,465 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [198628893] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:29:22,465 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:29:22,465 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [49] imperfect sequences [] total 49 [2021-05-03 00:29:22,465 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [706442920] [2021-05-03 00:29:22,465 INFO L460 AbstractCegarLoop]: Interpolant automaton has 49 states [2021-05-03 00:29:22,465 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:29:22,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2021-05-03 00:29:22,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=249, Invalid=2301, Unknown=0, NotChecked=0, Total=2550 [2021-05-03 00:29:22,466 INFO L87 Difference]: Start difference. First operand 423 states and 506 transitions. Second operand has 49 states, 49 states have (on average 1.489795918367347) internal successors, (73), 47 states have internal predecessors, (73), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:29:31,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:29:31,945 INFO L93 Difference]: Finished difference Result 930 states and 1105 transitions. [2021-05-03 00:29:31,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2021-05-03 00:29:31,947 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 49 states have (on average 1.489795918367347) internal successors, (73), 47 states have internal predecessors, (73), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 79 [2021-05-03 00:29:31,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:29:31,948 INFO L225 Difference]: With dead ends: 930 [2021-05-03 00:29:31,948 INFO L226 Difference]: Without dead ends: 543 [2021-05-03 00:29:31,949 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 6 SyntacticMatches, 18 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1476 ImplicationChecksByTransitivity, 5117.4ms TimeCoverageRelationStatistics Valid=411, Invalid=4701, Unknown=0, NotChecked=0, Total=5112 [2021-05-03 00:29:31,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 543 states. [2021-05-03 00:29:33,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 543 to 458. [2021-05-03 00:29:33,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 458 states, 448 states have (on average 1.2075892857142858) internal successors, (541), 448 states have internal predecessors, (541), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:29:33,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 458 states to 458 states and 552 transitions. [2021-05-03 00:29:33,941 INFO L78 Accepts]: Start accepts. Automaton has 458 states and 552 transitions. Word has length 79 [2021-05-03 00:29:33,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:29:33,941 INFO L480 AbstractCegarLoop]: Abstraction has 458 states and 552 transitions. [2021-05-03 00:29:33,941 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 49 states, 49 states have (on average 1.489795918367347) internal successors, (73), 47 states have internal predecessors, (73), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:29:33,941 INFO L276 IsEmpty]: Start isEmpty. Operand 458 states and 552 transitions. [2021-05-03 00:29:33,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2021-05-03 00:29:33,942 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:29:33,942 INFO L523 BasicCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:29:33,942 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable958 [2021-05-03 00:29:33,942 INFO L428 AbstractCegarLoop]: === Iteration 216 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:29:33,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:29:33,942 INFO L82 PathProgramCache]: Analyzing trace with hash 1452913502, now seen corresponding path program 20 times [2021-05-03 00:29:33,942 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:29:33,942 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [903173156] [2021-05-03 00:29:33,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:29:33,949 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (+ v_main_~c~0_4552 1) v_~SIZE~0_756) (<= v_~last~0_761 v_main_~c~0_4552)) InVars {~SIZE~0=v_~SIZE~0_756, main_~c~0=v_main_~c~0_4552, ~last~0=v_~last~0_761} OutVars{~SIZE~0=v_~SIZE~0_756, main_~c~0=v_main_~c~0_4552, ~last~0=v_~last~0_761} AuxVars[] AssignedVars[] [2021-05-03 00:29:33,951 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size [2021-05-03 00:29:33,978 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:29:33,980 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:29:33,996 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:29:34,001 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:29:34,030 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size 78 [2021-05-03 00:29:34,068 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:29:34,072 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_~last~0_762 v_main_~c~0_4554) (< v_main_~c~0_4554 v_~SIZE~0_757)) InVars {~SIZE~0=v_~SIZE~0_757, main_~c~0=v_main_~c~0_4554, ~last~0=v_~last~0_762} OutVars{~SIZE~0=v_~SIZE~0_757, main_~c~0=v_main_~c~0_4554, ~last~0=v_~last~0_762} AuxVars[] AssignedVars[] [2021-05-03 00:29:34,074 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:29:34,075 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:29:34,077 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:29:34,093 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:29:34,098 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:29:34,148 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:29:34,187 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:29:34,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:29:34,324 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:29:34,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:29:34,329 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:29:34,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:29:34,332 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:29:36,593 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:29:36,594 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [903173156] [2021-05-03 00:29:36,594 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [903173156] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:29:36,594 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:29:36,594 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2021-05-03 00:29:36,594 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1583976473] [2021-05-03 00:29:36,594 INFO L460 AbstractCegarLoop]: Interpolant automaton has 28 states [2021-05-03 00:29:36,594 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:29:36,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2021-05-03 00:29:36,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=708, Unknown=0, NotChecked=0, Total=812 [2021-05-03 00:29:36,595 INFO L87 Difference]: Start difference. First operand 458 states and 552 transitions. Second operand has 28 states, 28 states have (on average 2.7142857142857144) internal successors, (76), 27 states have internal predecessors, (76), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:29:42,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:29:42,329 INFO L93 Difference]: Finished difference Result 1028 states and 1204 transitions. [2021-05-03 00:29:42,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2021-05-03 00:29:42,330 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 2.7142857142857144) internal successors, (76), 27 states have internal predecessors, (76), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 82 [2021-05-03 00:29:42,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:29:42,331 INFO L225 Difference]: With dead ends: 1028 [2021-05-03 00:29:42,331 INFO L226 Difference]: Without dead ends: 641 [2021-05-03 00:29:42,332 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 12 SyntacticMatches, 39 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 289 ImplicationChecksByTransitivity, 2248.2ms TimeCoverageRelationStatistics Valid=114, Invalid=816, Unknown=0, NotChecked=0, Total=930 [2021-05-03 00:29:42,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 641 states. [2021-05-03 00:29:43,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 641 to 467. [2021-05-03 00:29:43,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 467 states, 457 states have (on average 1.2035010940919038) internal successors, (550), 457 states have internal predecessors, (550), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:29:43,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 467 states to 467 states and 561 transitions. [2021-05-03 00:29:43,715 INFO L78 Accepts]: Start accepts. Automaton has 467 states and 561 transitions. Word has length 82 [2021-05-03 00:29:43,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:29:43,715 INFO L480 AbstractCegarLoop]: Abstraction has 467 states and 561 transitions. [2021-05-03 00:29:43,715 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 28 states, 28 states have (on average 2.7142857142857144) internal successors, (76), 27 states have internal predecessors, (76), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:29:43,715 INFO L276 IsEmpty]: Start isEmpty. Operand 467 states and 561 transitions. [2021-05-03 00:29:43,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2021-05-03 00:29:43,715 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:29:43,715 INFO L523 BasicCegarLoop]: trace histogram [20, 20, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:29:43,715 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable961 [2021-05-03 00:29:43,715 INFO L428 AbstractCegarLoop]: === Iteration 217 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:29:43,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:29:43,716 INFO L82 PathProgramCache]: Analyzing trace with hash -1888113636, now seen corresponding path program 172 times [2021-05-03 00:29:43,716 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:29:43,716 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [851057170] [2021-05-03 00:29:43,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:29:43,725 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_~last~0_763 v_main_~c~0_4577) (< (+ v_main_~c~0_4577 1) v_~SIZE~0_758)) InVars {~SIZE~0=v_~SIZE~0_758, main_~c~0=v_main_~c~0_4577, ~last~0=v_~last~0_763} OutVars{~SIZE~0=v_~SIZE~0_758, main_~c~0=v_main_~c~0_4577, ~last~0=v_~last~0_763} AuxVars[] AssignedVars[] [2021-05-03 00:29:43,727 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size [2021-05-03 00:29:43,728 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:29:43,730 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:29:43,751 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:29:43,757 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:29:43,810 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size 78 [2021-05-03 00:29:43,855 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_4579 v_~last~0_764) (< (+ v_main_~c~0_4579 1) v_~SIZE~0_759)) InVars {~SIZE~0=v_~SIZE~0_759, main_~c~0=v_main_~c~0_4579, ~last~0=v_~last~0_764} OutVars{~SIZE~0=v_~SIZE~0_759, main_~c~0=v_main_~c~0_4579, ~last~0=v_~last~0_764} AuxVars[] AssignedVars[] [2021-05-03 00:29:43,857 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:29:43,881 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:29:43,883 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:29:43,908 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:29:43,919 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:29:43,948 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:29:43,995 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:29:43,999 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_~last~0_765 v_main_~c~0_4581) (< v_main_~c~0_4581 v_~SIZE~0_760)) InVars {~SIZE~0=v_~SIZE~0_760, main_~c~0=v_main_~c~0_4581, ~last~0=v_~last~0_765} OutVars{~SIZE~0=v_~SIZE~0_760, main_~c~0=v_main_~c~0_4581, ~last~0=v_~last~0_765} AuxVars[] AssignedVars[] [2021-05-03 00:29:44,001 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:29:44,030 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:29:44,032 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:29:44,051 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:29:44,056 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:29:44,086 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:29:44,133 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_4583 v_~last~0_766) (< v_main_~c~0_4583 v_~SIZE~0_761)) InVars {~SIZE~0=v_~SIZE~0_761, main_~c~0=v_main_~c~0_4583, ~last~0=v_~last~0_766} OutVars{~SIZE~0=v_~SIZE~0_761, main_~c~0=v_main_~c~0_4583, ~last~0=v_~last~0_766} AuxVars[] AssignedVars[] [2021-05-03 00:29:44,135 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size [2021-05-03 00:29:44,137 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:29:44,139 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:29:44,165 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:29:44,175 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:29:44,225 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size 66 [2021-05-03 00:29:44,269 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:29:44,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:29:44,370 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:29:44,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:29:44,375 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:29:44,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:29:44,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-03 00:29:44,381 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:29:46,769 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:29:46,769 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [851057170] [2021-05-03 00:29:46,769 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [851057170] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:29:46,769 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:29:46,769 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2021-05-03 00:29:46,769 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021470903] [2021-05-03 00:29:46,769 INFO L460 AbstractCegarLoop]: Interpolant automaton has 29 states [2021-05-03 00:29:46,769 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:29:46,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2021-05-03 00:29:46,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=778, Unknown=0, NotChecked=0, Total=870 [2021-05-03 00:29:46,770 INFO L87 Difference]: Start difference. First operand 467 states and 561 transitions. Second operand has 29 states, 29 states have (on average 2.6206896551724137) internal successors, (76), 28 states have internal predecessors, (76), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2)