/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationWernerOverapprox_32.epf -i ../../../trunk/examples/svcomp/verifythis/elimination_max_rec.c -------------------------------------------------------------------------------- This is Ultimate 0.2.1-dev-36cd7be [2021-02-24 04:16:15,520 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-02-24 04:16:15,524 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-02-24 04:16:15,579 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-02-24 04:16:15,579 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-02-24 04:16:15,583 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-02-24 04:16:15,587 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-02-24 04:16:15,594 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-02-24 04:16:15,598 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-02-24 04:16:15,604 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-02-24 04:16:15,605 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-02-24 04:16:15,606 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-02-24 04:16:15,607 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-02-24 04:16:15,609 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-02-24 04:16:15,611 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-02-24 04:16:15,613 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-02-24 04:16:15,616 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-02-24 04:16:15,618 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-02-24 04:16:15,624 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-02-24 04:16:15,632 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-02-24 04:16:15,634 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-02-24 04:16:15,636 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-02-24 04:16:15,638 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-02-24 04:16:15,639 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-02-24 04:16:15,658 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-02-24 04:16:15,659 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-02-24 04:16:15,659 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-02-24 04:16:15,662 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-02-24 04:16:15,662 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-02-24 04:16:15,663 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-02-24 04:16:15,664 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-02-24 04:16:15,664 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-02-24 04:16:15,667 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-02-24 04:16:15,668 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-02-24 04:16:15,669 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-02-24 04:16:15,669 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-02-24 04:16:15,670 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-02-24 04:16:15,670 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-02-24 04:16:15,670 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-02-24 04:16:15,671 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-02-24 04:16:15,672 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-02-24 04:16:15,673 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationWernerOverapprox_32.epf [2021-02-24 04:16:15,700 INFO L113 SettingsManager]: Loading preferences was successful [2021-02-24 04:16:15,700 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-02-24 04:16:15,704 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-02-24 04:16:15,704 INFO L138 SettingsManager]: * sizeof long=4 [2021-02-24 04:16:15,704 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-02-24 04:16:15,704 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-02-24 04:16:15,705 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-02-24 04:16:15,705 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-02-24 04:16:15,705 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-02-24 04:16:15,705 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-02-24 04:16:15,706 INFO L138 SettingsManager]: * sizeof long double=12 [2021-02-24 04:16:15,707 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-02-24 04:16:15,707 INFO L138 SettingsManager]: * Use constant arrays=true [2021-02-24 04:16:15,707 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-02-24 04:16:15,707 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-02-24 04:16:15,708 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2021-02-24 04:16:15,708 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-02-24 04:16:15,708 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-02-24 04:16:15,708 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-02-24 04:16:15,708 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-02-24 04:16:15,709 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2021-02-24 04:16:15,709 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-02-24 04:16:15,709 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=WERNER_OVERAPPROX [2021-02-24 04:16:15,709 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 [2021-02-24 04:16:16,117 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-02-24 04:16:16,144 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-02-24 04:16:16,147 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-02-24 04:16:16,148 INFO L271 PluginConnector]: Initializing CDTParser... [2021-02-24 04:16:16,150 INFO L275 PluginConnector]: CDTParser initialized [2021-02-24 04:16:16,151 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/verifythis/elimination_max_rec.c [2021-02-24 04:16:16,230 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6b83763f6/16c1ea26c52c472e8490e40d9c05b0c8/FLAGcb8b860b7 [2021-02-24 04:16:16,857 INFO L306 CDTParser]: Found 1 translation units. [2021-02-24 04:16:16,858 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/verifythis/elimination_max_rec.c [2021-02-24 04:16:16,866 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6b83763f6/16c1ea26c52c472e8490e40d9c05b0c8/FLAGcb8b860b7 [2021-02-24 04:16:17,238 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6b83763f6/16c1ea26c52c472e8490e40d9c05b0c8 [2021-02-24 04:16:17,243 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-02-24 04:16:17,257 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2021-02-24 04:16:17,262 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-02-24 04:16:17,262 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-02-24 04:16:17,267 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-02-24 04:16:17,268 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.02 04:16:17" (1/1) ... [2021-02-24 04:16:17,270 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4658955b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.02 04:16:17, skipping insertion in model container [2021-02-24 04:16:17,270 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.02 04:16:17" (1/1) ... [2021-02-24 04:16:17,280 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-02-24 04:16:17,301 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-02-24 04:16:17,451 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/verifythis/elimination_max_rec.c[493,506] [2021-02-24 04:16:17,470 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-02-24 04:16:17,486 INFO L203 MainTranslator]: Completed pre-run [2021-02-24 04:16:17,502 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/verifythis/elimination_max_rec.c[493,506] [2021-02-24 04:16:17,510 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-02-24 04:16:17,537 INFO L208 MainTranslator]: Completed translation [2021-02-24 04:16:17,537 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.02 04:16:17 WrapperNode [2021-02-24 04:16:17,537 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-02-24 04:16:17,539 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-02-24 04:16:17,539 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-02-24 04:16:17,540 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-02-24 04:16:17,555 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.02 04:16:17" (1/1) ... [2021-02-24 04:16:17,555 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.02 04:16:17" (1/1) ... [2021-02-24 04:16:17,579 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.02 04:16:17" (1/1) ... [2021-02-24 04:16:17,579 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.02 04:16:17" (1/1) ... [2021-02-24 04:16:17,603 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.02 04:16:17" (1/1) ... [2021-02-24 04:16:17,605 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.02 04:16:17" (1/1) ... [2021-02-24 04:16:17,611 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.02 04:16:17" (1/1) ... [2021-02-24 04:16:17,621 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-02-24 04:16:17,623 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-02-24 04:16:17,623 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-02-24 04:16:17,623 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-02-24 04:16:17,626 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.02 04:16:17" (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-02-24 04:16:17,761 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2021-02-24 04:16:17,762 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-02-24 04:16:17,762 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2021-02-24 04:16:17,762 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2021-02-24 04:16:17,762 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2021-02-24 04:16:17,763 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2021-02-24 04:16:17,763 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2021-02-24 04:16:17,763 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2021-02-24 04:16:17,763 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2021-02-24 04:16:17,763 INFO L130 BoogieDeclarations]: Found specification of procedure free [2021-02-24 04:16:17,763 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2021-02-24 04:16:17,764 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2021-02-24 04:16:17,764 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2021-02-24 04:16:17,764 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-02-24 04:16:17,764 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2021-02-24 04:16:17,764 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2021-02-24 04:16:17,764 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2021-02-24 04:16:17,765 INFO L130 BoogieDeclarations]: Found specification of procedure check [2021-02-24 04:16:17,765 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-02-24 04:16:17,765 INFO L130 BoogieDeclarations]: Found specification of procedure main [2021-02-24 04:16:17,765 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-02-24 04:16:17,765 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2021-02-24 04:16:17,766 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-02-24 04:16:17,766 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2021-02-24 04:16:17,766 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-02-24 04:16:17,766 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-02-24 04:16:17,766 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-02-24 04:16:18,466 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-02-24 04:16:18,467 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2021-02-24 04:16:18,469 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.02 04:16:18 BoogieIcfgContainer [2021-02-24 04:16:18,469 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-02-24 04:16:18,472 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-02-24 04:16:18,472 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-02-24 04:16:18,477 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-02-24 04:16:18,478 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.02 04:16:17" (1/3) ... [2021-02-24 04:16:18,479 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1fe6cec6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.02 04:16:18, skipping insertion in model container [2021-02-24 04:16:18,479 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.02 04:16:17" (2/3) ... [2021-02-24 04:16:18,480 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1fe6cec6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.02 04:16:18, skipping insertion in model container [2021-02-24 04:16:18,480 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.02 04:16:18" (3/3) ... [2021-02-24 04:16:18,482 INFO L111 eAbstractionObserver]: Analyzing ICFG elimination_max_rec.c [2021-02-24 04:16:18,492 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2021-02-24 04:16:18,499 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2021-02-24 04:16:18,520 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-02-24 04:16:18,548 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-02-24 04:16:18,548 INFO L377 AbstractCegarLoop]: Hoare is true [2021-02-24 04:16:18,548 INFO L378 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2021-02-24 04:16:18,549 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-02-24 04:16:18,549 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-02-24 04:16:18,549 INFO L381 AbstractCegarLoop]: Difference is false [2021-02-24 04:16:18,549 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-02-24 04:16:18,549 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-02-24 04:16:18,571 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states. [2021-02-24 04:16:18,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-02-24 04:16:18,589 INFO L414 BasicCegarLoop]: Found error trace [2021-02-24 04:16:18,590 INFO L422 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-02-24 04:16:18,591 INFO L428 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-02-24 04:16:18,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-02-24 04:16:18,601 INFO L82 PathProgramCache]: Analyzing trace with hash 2141980220, now seen corresponding path program 1 times [2021-02-24 04:16:18,612 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-02-24 04:16:18,613 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1379316099] [2021-02-24 04:16:18,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-02-24 04:16:18,707 INFO L218 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-02-24 04:16:18,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 04:16:18,902 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:16:18,904 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 04:16:18,915 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:16:18,917 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-24 04:16:18,945 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:16:18,946 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-24 04:16:18,971 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:16:18,973 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-24 04:16:19,002 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:16:19,004 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-24 04:16:19,033 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:16:19,034 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-02-24 04:16:19,060 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:16:19,062 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-02-24 04:16:19,094 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:16:19,096 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 04:16:19,183 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-24 04:16:19,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 04:16:19,205 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:16:19,206 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 04:16:19,212 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-02-24 04:16:19,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 04:16:19,228 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:16:19,230 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 04:16:19,265 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-02-24 04:16:19,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 04:16:19,298 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:16:19,304 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 04:16:19,326 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-02-24 04:16:19,330 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1379316099] [2021-02-24 04:16:19,334 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-02-24 04:16:19,335 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-02-24 04:16:19,335 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256909614] [2021-02-24 04:16:19,342 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-02-24 04:16:19,344 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-02-24 04:16:19,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-02-24 04:16:19,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2021-02-24 04:16:19,369 INFO L87 Difference]: Start difference. First operand 84 states. Second operand 10 states. [2021-02-24 04:16:20,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-02-24 04:16:20,850 INFO L93 Difference]: Finished difference Result 215 states and 247 transitions. [2021-02-24 04:16:20,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-02-24 04:16:20,852 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 36 [2021-02-24 04:16:20,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-02-24 04:16:20,865 INFO L225 Difference]: With dead ends: 215 [2021-02-24 04:16:20,865 INFO L226 Difference]: Without dead ends: 128 [2021-02-24 04:16:20,871 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=78, Invalid=228, Unknown=0, NotChecked=0, Total=306 [2021-02-24 04:16:20,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2021-02-24 04:16:20,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 113. [2021-02-24 04:16:20,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2021-02-24 04:16:20,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 120 transitions. [2021-02-24 04:16:20,956 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 120 transitions. Word has length 36 [2021-02-24 04:16:20,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-02-24 04:16:20,957 INFO L480 AbstractCegarLoop]: Abstraction has 113 states and 120 transitions. [2021-02-24 04:16:20,957 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2021-02-24 04:16:20,957 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 120 transitions. [2021-02-24 04:16:20,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-02-24 04:16:20,960 INFO L414 BasicCegarLoop]: Found error trace [2021-02-24 04:16:20,961 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-02-24 04:16:20,961 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-02-24 04:16:20,962 INFO L428 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-02-24 04:16:20,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-02-24 04:16:20,963 INFO L82 PathProgramCache]: Analyzing trace with hash 572347764, now seen corresponding path program 1 times [2021-02-24 04:16:20,963 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-02-24 04:16:20,964 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [213282318] [2021-02-24 04:16:20,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-02-24 04:16:20,969 INFO L218 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-02-24 04:16:21,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 04:16:21,091 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:16:21,092 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 04:16:21,093 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:16:21,094 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 6 [2021-02-24 04:16:21,098 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:16:21,099 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 6 [2021-02-24 04:16:21,105 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:16:21,106 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 6 [2021-02-24 04:16:21,114 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:16:21,115 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-02-24 04:16:21,130 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:16:21,131 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-02-24 04:16:21,154 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:16:21,155 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-02-24 04:16:21,170 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:16:21,170 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 04:16:21,208 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-24 04:16:21,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 04:16:21,218 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:16:21,219 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 04:16:21,220 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-02-24 04:16:21,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 04:16:21,224 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:16:21,224 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 04:16:21,237 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-02-24 04:16:21,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 04:16:21,245 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:16:21,246 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 6 [2021-02-24 04:16:21,261 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2021-02-24 04:16:21,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 04:16:21,269 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:16:21,270 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 04:16:21,280 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-02-24 04:16:21,280 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [213282318] [2021-02-24 04:16:21,281 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-02-24 04:16:21,281 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-02-24 04:16:21,281 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2090846589] [2021-02-24 04:16:21,282 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-02-24 04:16:21,283 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-02-24 04:16:21,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-02-24 04:16:21,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2021-02-24 04:16:21,284 INFO L87 Difference]: Start difference. First operand 113 states and 120 transitions. Second operand 11 states. [2021-02-24 04:16:22,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-02-24 04:16:22,213 INFO L93 Difference]: Finished difference Result 178 states and 190 transitions. [2021-02-24 04:16:22,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-02-24 04:16:22,213 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 57 [2021-02-24 04:16:22,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-02-24 04:16:22,216 INFO L225 Difference]: With dead ends: 178 [2021-02-24 04:16:22,216 INFO L226 Difference]: Without dead ends: 108 [2021-02-24 04:16:22,219 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=67, Invalid=239, Unknown=0, NotChecked=0, Total=306 [2021-02-24 04:16:22,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2021-02-24 04:16:22,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2021-02-24 04:16:22,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2021-02-24 04:16:22,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 114 transitions. [2021-02-24 04:16:22,253 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 114 transitions. Word has length 57 [2021-02-24 04:16:22,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-02-24 04:16:22,254 INFO L480 AbstractCegarLoop]: Abstraction has 108 states and 114 transitions. [2021-02-24 04:16:22,254 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2021-02-24 04:16:22,255 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 114 transitions. [2021-02-24 04:16:22,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-02-24 04:16:22,256 INFO L414 BasicCegarLoop]: Found error trace [2021-02-24 04:16:22,257 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-02-24 04:16:22,257 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-02-24 04:16:22,257 INFO L428 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-02-24 04:16:22,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-02-24 04:16:22,258 INFO L82 PathProgramCache]: Analyzing trace with hash -2023865644, now seen corresponding path program 1 times [2021-02-24 04:16:22,259 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-02-24 04:16:22,259 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [430248278] [2021-02-24 04:16:22,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-02-24 04:16:22,265 INFO L218 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-02-24 04:16:22,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 04:16:22,355 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:16:22,356 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 04:16:22,357 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:16:22,358 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-24 04:16:22,368 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:16:22,369 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-24 04:16:22,376 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:16:22,378 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-24 04:16:22,387 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:16:22,389 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-24 04:16:22,403 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:16:22,406 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-24 04:16:22,418 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:16:22,419 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-24 04:16:22,437 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:16:22,438 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-24 04:16:22,455 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:16:22,455 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-24 04:16:22,474 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:16:22,475 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-24 04:16:22,493 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:16:22,494 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-24 04:16:22,495 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:16:22,495 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-02-24 04:16:22,533 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:16:22,534 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-02-24 04:16:22,549 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:16:22,550 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 04:16:22,587 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-24 04:16:22,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 04:16:22,600 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:16:22,602 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 04:16:22,603 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-02-24 04:16:22,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 04:16:22,611 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:16:22,611 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 04:16:22,631 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-02-24 04:16:22,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 04:16:22,638 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:16:22,639 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 04:16:22,640 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2021-02-24 04:16:22,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 04:16:22,647 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:16:22,647 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 04:16:22,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-02-24 04:16:22,657 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [430248278] [2021-02-24 04:16:22,657 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-02-24 04:16:22,657 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-02-24 04:16:22,657 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358902801] [2021-02-24 04:16:22,658 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-02-24 04:16:22,658 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-02-24 04:16:22,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-02-24 04:16:22,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2021-02-24 04:16:22,659 INFO L87 Difference]: Start difference. First operand 108 states and 114 transitions. Second operand 15 states. [2021-02-24 04:16:24,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-02-24 04:16:24,568 INFO L93 Difference]: Finished difference Result 174 states and 187 transitions. [2021-02-24 04:16:24,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-02-24 04:16:24,569 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 57 [2021-02-24 04:16:24,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-02-24 04:16:24,573 INFO L225 Difference]: With dead ends: 174 [2021-02-24 04:16:24,574 INFO L226 Difference]: Without dead ends: 172 [2021-02-24 04:16:24,575 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=160, Invalid=710, Unknown=0, NotChecked=0, Total=870 [2021-02-24 04:16:24,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2021-02-24 04:16:24,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 152. [2021-02-24 04:16:24,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2021-02-24 04:16:24,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 162 transitions. [2021-02-24 04:16:24,618 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 162 transitions. Word has length 57 [2021-02-24 04:16:24,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-02-24 04:16:24,618 INFO L480 AbstractCegarLoop]: Abstraction has 152 states and 162 transitions. [2021-02-24 04:16:24,618 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2021-02-24 04:16:24,619 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 162 transitions. [2021-02-24 04:16:24,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2021-02-24 04:16:24,622 INFO L414 BasicCegarLoop]: Found error trace [2021-02-24 04:16:24,622 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-02-24 04:16:24,622 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-02-24 04:16:24,622 INFO L428 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-02-24 04:16:24,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-02-24 04:16:24,623 INFO L82 PathProgramCache]: Analyzing trace with hash 1959749596, now seen corresponding path program 1 times [2021-02-24 04:16:24,623 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-02-24 04:16:24,624 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [584057018] [2021-02-24 04:16:24,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-02-24 04:16:24,626 INFO L218 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-02-24 04:16:24,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 04:16:24,709 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:16:24,709 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 04:16:24,711 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:16:24,711 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-24 04:16:24,718 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:16:24,719 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-24 04:16:24,726 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:16:24,727 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-24 04:16:24,736 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:16:24,737 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-24 04:16:24,748 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:16:24,751 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-24 04:16:24,763 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:16:24,764 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-24 04:16:24,776 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:16:24,777 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-24 04:16:24,791 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:16:24,792 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-24 04:16:24,806 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:16:24,807 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-24 04:16:24,822 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:16:24,823 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-24 04:16:24,824 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:16:24,824 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-24 04:16:24,842 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:16:24,843 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-24 04:16:24,861 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:16:24,862 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-24 04:16:24,881 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:16:24,882 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-24 04:16:24,901 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:16:24,902 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-24 04:16:24,923 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:16:24,923 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-24 04:16:24,924 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:16:24,925 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-02-24 04:16:24,942 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:16:24,942 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-02-24 04:16:24,960 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:16:24,961 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 04:16:24,999 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-24 04:16:25,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 04:16:25,009 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:16:25,010 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 04:16:25,011 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-02-24 04:16:25,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 04:16:25,019 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:16:25,022 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 04:16:25,047 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-02-24 04:16:25,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 04:16:25,051 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:16:25,051 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 04:16:25,051 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2021-02-24 04:16:25,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 04:16:25,056 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:16:25,057 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 04:16:25,057 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2021-02-24 04:16:25,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 04:16:25,062 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:16:25,063 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 04:16:25,078 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-02-24 04:16:25,078 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [584057018] [2021-02-24 04:16:25,079 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-02-24 04:16:25,079 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2021-02-24 04:16:25,079 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10756822] [2021-02-24 04:16:25,080 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states [2021-02-24 04:16:25,080 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-02-24 04:16:25,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-02-24 04:16:25,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=339, Unknown=0, NotChecked=0, Total=380 [2021-02-24 04:16:25,081 INFO L87 Difference]: Start difference. First operand 152 states and 162 transitions. Second operand 20 states. [2021-02-24 04:16:28,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-02-24 04:16:28,139 INFO L93 Difference]: Finished difference Result 238 states and 260 transitions. [2021-02-24 04:16:28,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2021-02-24 04:16:28,140 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 78 [2021-02-24 04:16:28,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-02-24 04:16:28,144 INFO L225 Difference]: With dead ends: 238 [2021-02-24 04:16:28,144 INFO L226 Difference]: Without dead ends: 236 [2021-02-24 04:16:28,145 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 289 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=332, Invalid=1648, Unknown=0, NotChecked=0, Total=1980 [2021-02-24 04:16:28,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2021-02-24 04:16:28,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 198. [2021-02-24 04:16:28,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198 states. [2021-02-24 04:16:28,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 214 transitions. [2021-02-24 04:16:28,194 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 214 transitions. Word has length 78 [2021-02-24 04:16:28,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-02-24 04:16:28,194 INFO L480 AbstractCegarLoop]: Abstraction has 198 states and 214 transitions. [2021-02-24 04:16:28,194 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2021-02-24 04:16:28,194 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 214 transitions. [2021-02-24 04:16:28,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2021-02-24 04:16:28,197 INFO L414 BasicCegarLoop]: Found error trace [2021-02-24 04:16:28,197 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1] [2021-02-24 04:16:28,197 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-02-24 04:16:28,197 INFO L428 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-02-24 04:16:28,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-02-24 04:16:28,198 INFO L82 PathProgramCache]: Analyzing trace with hash -636463812, now seen corresponding path program 2 times [2021-02-24 04:16:28,198 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-02-24 04:16:28,198 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [261030753] [2021-02-24 04:16:28,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-02-24 04:16:28,201 INFO L218 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-02-24 04:16:28,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 04:16:28,285 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:16:28,286 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 04:16:28,287 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:16:28,288 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-24 04:16:28,294 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:16:28,295 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-24 04:16:28,302 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:16:28,304 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-24 04:16:28,314 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:16:28,314 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-24 04:16:28,325 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:16:28,326 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-24 04:16:28,339 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:16:28,339 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-24 04:16:28,352 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:16:28,353 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-24 04:16:28,370 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:16:28,370 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-24 04:16:28,386 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:16:28,387 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-24 04:16:28,413 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:16:28,414 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-24 04:16:28,415 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:16:28,417 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-24 04:16:28,436 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:16:28,437 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-24 04:16:28,455 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:16:28,455 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-24 04:16:28,479 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:16:28,481 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-24 04:16:28,507 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:16:28,508 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-24 04:16:28,536 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:16:28,537 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-24 04:16:28,538 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:16:28,539 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-02-24 04:16:28,561 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:16:28,561 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-02-24 04:16:28,582 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:16:28,583 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 04:16:28,635 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-24 04:16:28,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 04:16:28,657 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:16:28,661 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 04:16:28,661 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-02-24 04:16:28,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 04:16:28,669 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:16:28,670 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 04:16:28,692 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-02-24 04:16:28,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 04:16:28,698 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:16:28,698 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 04:16:28,699 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2021-02-24 04:16:28,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 04:16:28,705 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:16:28,705 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 04:16:28,706 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2021-02-24 04:16:28,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 04:16:28,710 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:16:28,711 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 04:16:28,726 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-02-24 04:16:28,727 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [261030753] [2021-02-24 04:16:28,727 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-02-24 04:16:28,727 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2021-02-24 04:16:28,728 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1290816330] [2021-02-24 04:16:28,728 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states [2021-02-24 04:16:28,728 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-02-24 04:16:28,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-02-24 04:16:28,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=339, Unknown=0, NotChecked=0, Total=380 [2021-02-24 04:16:28,730 INFO L87 Difference]: Start difference. First operand 198 states and 214 transitions. Second operand 20 states. [2021-02-24 04:16:31,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-02-24 04:16:31,940 INFO L93 Difference]: Finished difference Result 281 states and 307 transitions. [2021-02-24 04:16:31,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2021-02-24 04:16:31,941 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 78 [2021-02-24 04:16:31,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-02-24 04:16:31,952 INFO L225 Difference]: With dead ends: 281 [2021-02-24 04:16:31,953 INFO L226 Difference]: Without dead ends: 279 [2021-02-24 04:16:31,954 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 244 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=305, Invalid=1501, Unknown=0, NotChecked=0, Total=1806 [2021-02-24 04:16:31,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2021-02-24 04:16:32,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 243. [2021-02-24 04:16:32,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243 states. [2021-02-24 04:16:32,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 264 transitions. [2021-02-24 04:16:32,052 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 264 transitions. Word has length 78 [2021-02-24 04:16:32,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-02-24 04:16:32,053 INFO L480 AbstractCegarLoop]: Abstraction has 243 states and 264 transitions. [2021-02-24 04:16:32,053 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2021-02-24 04:16:32,054 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 264 transitions. [2021-02-24 04:16:32,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2021-02-24 04:16:32,068 INFO L414 BasicCegarLoop]: Found error trace [2021-02-24 04:16:32,068 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-02-24 04:16:32,068 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-02-24 04:16:32,069 INFO L428 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-02-24 04:16:32,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-02-24 04:16:32,070 INFO L82 PathProgramCache]: Analyzing trace with hash 1871950108, now seen corresponding path program 1 times [2021-02-24 04:16:32,070 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-02-24 04:16:32,072 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [87853897] [2021-02-24 04:16:32,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-02-24 04:16:32,078 INFO L218 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-02-24 04:16:32,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 04:16:32,211 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:16:32,212 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 04:16:32,213 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:16:32,213 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 6 [2021-02-24 04:16:32,217 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:16:32,218 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 6 [2021-02-24 04:16:32,223 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:16:32,224 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 6 [2021-02-24 04:16:32,231 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:16:32,232 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 6 [2021-02-24 04:16:32,245 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:16:32,246 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-02-24 04:16:32,262 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:16:32,263 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-02-24 04:16:32,279 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:16:32,280 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-02-24 04:16:32,300 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:16:32,301 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-02-24 04:16:32,320 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:16:32,321 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-02-24 04:16:32,337 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:16:32,338 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-02-24 04:16:32,358 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:16:32,359 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-02-24 04:16:32,374 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:16:32,375 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-02-24 04:16:32,395 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:16:32,396 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 04:16:32,439 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-24 04:16:32,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 04:16:32,461 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:16:32,462 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 04:16:32,463 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-02-24 04:16:32,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 04:16:32,470 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:16:32,471 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 04:16:32,488 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-02-24 04:16:32,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 04:16:32,502 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:16:32,503 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 6 [2021-02-24 04:16:32,521 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2021-02-24 04:16:32,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 04:16:32,532 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:16:32,533 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 04:16:32,533 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-02-24 04:16:32,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 04:16:32,542 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:16:32,543 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 04:16:32,543 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2021-02-24 04:16:32,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 04:16:32,557 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:16:32,558 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 04:16:32,575 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-02-24 04:16:32,580 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [87853897] [2021-02-24 04:16:32,580 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-02-24 04:16:32,581 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2021-02-24 04:16:32,581 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862790350] [2021-02-24 04:16:32,582 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-02-24 04:16:32,582 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-02-24 04:16:32,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-02-24 04:16:32,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=210, Unknown=0, NotChecked=0, Total=240 [2021-02-24 04:16:32,583 INFO L87 Difference]: Start difference. First operand 243 states and 264 transitions. Second operand 16 states. [2021-02-24 04:16:34,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-02-24 04:16:34,201 INFO L93 Difference]: Finished difference Result 257 states and 281 transitions. [2021-02-24 04:16:34,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-02-24 04:16:34,202 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 77 [2021-02-24 04:16:34,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-02-24 04:16:34,203 INFO L225 Difference]: With dead ends: 257 [2021-02-24 04:16:34,204 INFO L226 Difference]: Without dead ends: 157 [2021-02-24 04:16:34,206 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=156, Invalid=714, Unknown=0, NotChecked=0, Total=870 [2021-02-24 04:16:34,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2021-02-24 04:16:34,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 133. [2021-02-24 04:16:34,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2021-02-24 04:16:34,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 137 transitions. [2021-02-24 04:16:34,231 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 137 transitions. Word has length 77 [2021-02-24 04:16:34,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-02-24 04:16:34,231 INFO L480 AbstractCegarLoop]: Abstraction has 133 states and 137 transitions. [2021-02-24 04:16:34,231 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2021-02-24 04:16:34,231 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 137 transitions. [2021-02-24 04:16:34,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2021-02-24 04:16:34,233 INFO L414 BasicCegarLoop]: Found error trace [2021-02-24 04:16:34,233 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-02-24 04:16:34,234 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-02-24 04:16:34,234 INFO L428 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-02-24 04:16:34,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-02-24 04:16:34,234 INFO L82 PathProgramCache]: Analyzing trace with hash -177855180, now seen corresponding path program 2 times [2021-02-24 04:16:34,235 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-02-24 04:16:34,235 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1955606824] [2021-02-24 04:16:34,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-02-24 04:16:34,238 INFO L218 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-02-24 04:16:34,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 04:16:34,312 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:16:34,313 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 04:16:34,314 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:16:34,314 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-24 04:16:34,321 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:16:34,322 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-24 04:16:34,330 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:16:34,331 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-24 04:16:34,339 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:16:34,340 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-24 04:16:34,350 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:16:34,351 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-24 04:16:34,362 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:16:34,363 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-24 04:16:34,376 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:16:34,377 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-24 04:16:34,396 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:16:34,397 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-24 04:16:34,413 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:16:34,417 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-24 04:16:34,436 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:16:34,439 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-24 04:16:34,440 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:16:34,440 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-24 04:16:34,463 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:16:34,464 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-24 04:16:34,487 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:16:34,488 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-24 04:16:34,513 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:16:34,514 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-24 04:16:34,541 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:16:34,544 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-24 04:16:34,571 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:16:34,574 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-24 04:16:34,576 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:16:34,577 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-24 04:16:34,604 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:16:34,606 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-24 04:16:34,634 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:16:34,635 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-24 04:16:34,660 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:16:34,661 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-24 04:16:34,687 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:16:34,688 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-24 04:16:34,713 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:16:34,714 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-24 04:16:34,716 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:16:34,717 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-02-24 04:16:34,741 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:16:34,742 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-02-24 04:16:34,768 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:16:34,768 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 04:16:34,844 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-24 04:16:34,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 04:16:34,858 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:16:34,859 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 04:16:34,859 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-02-24 04:16:34,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 04:16:34,866 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:16:34,866 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 04:16:34,889 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-02-24 04:16:34,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 04:16:34,893 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:16:34,893 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 04:16:34,893 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2021-02-24 04:16:34,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 04:16:34,899 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:16:34,900 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 04:16:34,900 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2021-02-24 04:16:34,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 04:16:34,904 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:16:34,905 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 04:16:34,905 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2021-02-24 04:16:34,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 04:16:34,909 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:16:34,910 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 04:16:34,934 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-02-24 04:16:34,934 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1955606824] [2021-02-24 04:16:34,935 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-02-24 04:16:34,935 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2021-02-24 04:16:34,935 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1953361142] [2021-02-24 04:16:34,935 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states [2021-02-24 04:16:34,935 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-02-24 04:16:34,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-02-24 04:16:34,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=541, Unknown=0, NotChecked=0, Total=600 [2021-02-24 04:16:34,937 INFO L87 Difference]: Start difference. First operand 133 states and 137 transitions. Second operand 25 states. [2021-02-24 04:16:38,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-02-24 04:16:38,493 INFO L93 Difference]: Finished difference Result 180 states and 185 transitions. [2021-02-24 04:16:38,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2021-02-24 04:16:38,496 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 99 [2021-02-24 04:16:38,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-02-24 04:16:38,498 INFO L225 Difference]: With dead ends: 180 [2021-02-24 04:16:38,498 INFO L226 Difference]: Without dead ends: 118 [2021-02-24 04:16:38,501 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 641 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=632, Invalid=3028, Unknown=0, NotChecked=0, Total=3660 [2021-02-24 04:16:38,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2021-02-24 04:16:38,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 112. [2021-02-24 04:16:38,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2021-02-24 04:16:38,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 114 transitions. [2021-02-24 04:16:38,524 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 114 transitions. Word has length 99 [2021-02-24 04:16:38,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-02-24 04:16:38,525 INFO L480 AbstractCegarLoop]: Abstraction has 112 states and 114 transitions. [2021-02-24 04:16:38,525 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2021-02-24 04:16:38,525 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 114 transitions. [2021-02-24 04:16:38,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2021-02-24 04:16:38,527 INFO L414 BasicCegarLoop]: Found error trace [2021-02-24 04:16:38,527 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-02-24 04:16:38,527 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-02-24 04:16:38,527 INFO L428 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-02-24 04:16:38,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-02-24 04:16:38,528 INFO L82 PathProgramCache]: Analyzing trace with hash 852518516, now seen corresponding path program 3 times [2021-02-24 04:16:38,528 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-02-24 04:16:38,528 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [240065514] [2021-02-24 04:16:38,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-02-24 04:16:38,531 INFO L218 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-02-24 04:16:38,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 04:16:38,607 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:16:38,610 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 04:16:38,611 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:16:38,612 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-24 04:16:38,624 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:16:38,625 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-24 04:16:38,634 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:16:38,635 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-24 04:16:38,645 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:16:38,645 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-24 04:16:38,656 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:16:38,657 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-24 04:16:38,669 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:16:38,670 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-24 04:16:38,683 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:16:38,684 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-24 04:16:38,699 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:16:38,700 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-24 04:16:38,716 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:16:38,717 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-24 04:16:38,735 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:16:38,736 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-24 04:16:38,737 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:16:38,737 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-24 04:16:38,754 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:16:38,755 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-24 04:16:38,780 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:16:38,781 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-24 04:16:38,805 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:16:38,806 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-24 04:16:38,830 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:16:38,831 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-24 04:16:38,857 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:16:38,858 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-24 04:16:38,863 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:16:38,864 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-24 04:16:38,891 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:16:38,891 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-24 04:16:38,921 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:16:38,924 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-24 04:16:38,955 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:16:38,956 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-24 04:16:38,988 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:16:38,989 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-24 04:16:39,021 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:16:39,022 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-24 04:16:39,023 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:16:39,023 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-02-24 04:16:39,049 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:16:39,050 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-02-24 04:16:39,076 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:16:39,077 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 04:16:39,145 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-24 04:16:39,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 04:16:39,160 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:16:39,161 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 04:16:39,162 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-02-24 04:16:39,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 04:16:39,166 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:16:39,166 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 04:16:39,192 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-02-24 04:16:39,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 04:16:39,196 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:16:39,197 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 04:16:39,197 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2021-02-24 04:16:39,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 04:16:39,203 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:16:39,204 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 04:16:39,204 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2021-02-24 04:16:39,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 04:16:39,209 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:16:39,209 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 04:16:39,210 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2021-02-24 04:16:39,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 04:16:39,215 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:16:39,216 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 04:16:39,241 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-02-24 04:16:39,242 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [240065514] [2021-02-24 04:16:39,242 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-02-24 04:16:39,243 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2021-02-24 04:16:39,243 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [354715430] [2021-02-24 04:16:39,243 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states [2021-02-24 04:16:39,244 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-02-24 04:16:39,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-02-24 04:16:39,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=541, Unknown=0, NotChecked=0, Total=600 [2021-02-24 04:16:39,245 INFO L87 Difference]: Start difference. First operand 112 states and 114 transitions. Second operand 25 states. [2021-02-24 04:16:42,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-02-24 04:16:42,482 INFO L93 Difference]: Finished difference Result 125 states and 127 transitions. [2021-02-24 04:16:42,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2021-02-24 04:16:42,483 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 99 [2021-02-24 04:16:42,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-02-24 04:16:42,484 INFO L225 Difference]: With dead ends: 125 [2021-02-24 04:16:42,484 INFO L226 Difference]: Without dead ends: 0 [2021-02-24 04:16:42,486 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 543 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=569, Invalid=2737, Unknown=0, NotChecked=0, Total=3306 [2021-02-24 04:16:42,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-02-24 04:16:42,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-02-24 04:16:42,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2021-02-24 04:16:42,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-02-24 04:16:42,487 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 99 [2021-02-24 04:16:42,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-02-24 04:16:42,488 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-02-24 04:16:42,488 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2021-02-24 04:16:42,488 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-02-24 04:16:42,488 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-02-24 04:16:42,488 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-02-24 04:16:42,491 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-02-24 04:16:45,629 WARN L202 SmtUtils]: Spent 257.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 47 [2021-02-24 04:16:45,795 WARN L202 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 29 [2021-02-24 04:16:46,005 WARN L202 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 40 [2021-02-24 04:16:46,198 WARN L202 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 40 [2021-02-24 04:16:46,519 WARN L202 SmtUtils]: Spent 317.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 45 [2021-02-24 04:16:46,786 WARN L202 SmtUtils]: Spent 261.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 42 [2021-02-24 04:16:47,027 WARN L202 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 44 [2021-02-24 04:16:47,303 WARN L202 SmtUtils]: Spent 272.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 47 [2021-02-24 04:16:47,636 WARN L202 SmtUtils]: Spent 305.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 50 [2021-02-24 04:16:47,858 WARN L202 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 38 [2021-02-24 04:16:48,096 WARN L202 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 38 [2021-02-24 04:16:48,419 WARN L202 SmtUtils]: Spent 267.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 46 [2021-02-24 04:16:48,670 WARN L202 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 45 [2021-02-24 04:16:48,954 WARN L202 SmtUtils]: Spent 278.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 47 [2021-02-24 04:16:49,171 WARN L202 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 38 [2021-02-24 04:16:49,476 WARN L202 SmtUtils]: Spent 302.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 47 [2021-02-24 04:16:49,733 WARN L202 SmtUtils]: Spent 252.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 45 [2021-02-24 04:16:49,949 WARN L202 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 38 [2021-02-24 04:16:50,261 WARN L202 SmtUtils]: Spent 307.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 49 [2021-02-24 04:16:50,432 WARN L202 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 33 [2021-02-24 04:16:50,607 WARN L202 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 29 [2021-02-24 04:16:50,868 WARN L202 SmtUtils]: Spent 257.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 47 [2021-02-24 04:16:51,198 WARN L202 SmtUtils]: Spent 327.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 51 [2021-02-24 04:16:51,418 WARN L202 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 38 [2021-02-24 04:16:51,730 WARN L202 SmtUtils]: Spent 308.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 51 [2021-02-24 04:16:52,027 WARN L202 SmtUtils]: Spent 294.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 47 [2021-02-24 04:16:52,247 WARN L202 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 38 [2021-02-24 04:16:52,553 WARN L202 SmtUtils]: Spent 302.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 47 [2021-02-24 04:16:52,905 WARN L202 SmtUtils]: Spent 247.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 42 [2021-02-24 04:16:53,056 WARN L202 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 39 [2021-02-24 04:16:53,328 WARN L202 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 48 [2021-02-24 04:16:53,563 WARN L202 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 38 [2021-02-24 04:16:53,793 WARN L202 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 38 [2021-02-24 04:16:53,984 WARN L202 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 29 [2021-02-24 04:16:54,263 WARN L202 SmtUtils]: Spent 244.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 45 [2021-02-24 04:16:54,543 WARN L202 SmtUtils]: Spent 268.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 43 [2021-02-24 04:16:54,841 WARN L202 SmtUtils]: Spent 295.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 47 [2021-02-24 04:16:55,082 WARN L202 SmtUtils]: Spent 238.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 40 [2021-02-24 04:16:55,347 WARN L202 SmtUtils]: Spent 252.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 42 [2021-02-24 04:16:55,353 INFO L189 CegarLoopUtils]: For program point reach_errorEXIT(line 5) no Hoare annotation was computed. [2021-02-24 04:16:55,353 INFO L189 CegarLoopUtils]: For program point reach_errorENTRY(line 5) no Hoare annotation was computed. [2021-02-24 04:16:55,353 INFO L189 CegarLoopUtils]: For program point reach_errorFINAL(line 5) no Hoare annotation was computed. [2021-02-24 04:16:55,353 INFO L192 CegarLoopUtils]: At program point L5-4(line 5) the Hoare annotation is: true [2021-02-24 04:16:55,353 INFO L192 CegarLoopUtils]: At program point L-1(line -1) the Hoare annotation is: true [2021-02-24 04:16:55,354 INFO L192 CegarLoopUtils]: At program point L-1-1(line -1) the Hoare annotation is: true [2021-02-24 04:16:55,354 INFO L192 CegarLoopUtils]: At program point ULTIMATE.initFINAL(line 5) the Hoare annotation is: true [2021-02-24 04:16:55,354 INFO L185 CegarLoopUtils]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |old(#NULL.base)| |#NULL.base|) (= |#t~string5.base| |old(#t~string5.base)|) (= |#t~string5.offset| |old(#t~string5.offset)|) (= |old(#t~string6.offset)| |#t~string6.offset|) (= |old(#length)| |#length|) (= |#t~string6.base| |old(#t~string6.base)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |#t~string7.offset| |old(#t~string7.offset)|) (= |old(#t~string7.base)| |#t~string7.base|) (= |old(#valid)| |#valid|)) [2021-02-24 04:16:55,354 INFO L192 CegarLoopUtils]: At program point L5(line 5) the Hoare annotation is: true [2021-02-24 04:16:55,354 INFO L192 CegarLoopUtils]: At program point L5-1(line 5) the Hoare annotation is: true [2021-02-24 04:16:55,354 INFO L192 CegarLoopUtils]: At program point L5-2(line 5) the Hoare annotation is: true [2021-02-24 04:16:55,355 INFO L192 CegarLoopUtils]: At program point L5-3(line 5) the Hoare annotation is: true [2021-02-24 04:16:55,355 INFO L192 CegarLoopUtils]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2021-02-24 04:16:55,355 INFO L192 CegarLoopUtils]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2021-02-24 04:16:55,355 INFO L192 CegarLoopUtils]: At program point L-1(line -1) the Hoare annotation is: true [2021-02-24 04:16:55,355 INFO L192 CegarLoopUtils]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2021-02-24 04:16:55,355 INFO L192 CegarLoopUtils]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2021-02-24 04:16:55,355 INFO L192 CegarLoopUtils]: At program point assume_abort_if_notENTRY(lines 7 9) the Hoare annotation is: true [2021-02-24 04:16:55,355 INFO L192 CegarLoopUtils]: At program point L8(line 8) the Hoare annotation is: true [2021-02-24 04:16:55,356 INFO L192 CegarLoopUtils]: At program point L8-1(line 8) the Hoare annotation is: true [2021-02-24 04:16:55,356 INFO L192 CegarLoopUtils]: At program point L8-3(lines 7 9) the Hoare annotation is: true [2021-02-24 04:16:55,356 INFO L192 CegarLoopUtils]: At program point assume_abort_if_notEXIT(lines 7 9) the Hoare annotation is: true [2021-02-24 04:16:55,356 INFO L185 CegarLoopUtils]: At program point mainENTRY(lines 41 50) the Hoare annotation is: (and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|)) [2021-02-24 04:16:55,356 INFO L192 CegarLoopUtils]: At program point mainEXIT(lines 41 50) the Hoare annotation is: true [2021-02-24 04:16:55,356 INFO L192 CegarLoopUtils]: At program point L48(line 48) the Hoare annotation is: true [2021-02-24 04:16:55,356 INFO L192 CegarLoopUtils]: At program point L48-1(line 48) the Hoare annotation is: true [2021-02-24 04:16:55,357 INFO L185 CegarLoopUtils]: At program point L46(line 46) the Hoare annotation is: (let ((.cse0 ((as const (Array Int Int)) 0))) (and (= (select |#memory_int| main_~a~0.base) .cse0) (= .cse0 (select |#memory_int| |main_#t~malloc17.base|)))) [2021-02-24 04:16:55,357 INFO L185 CegarLoopUtils]: At program point L45(line 45) the Hoare annotation is: (= |#memory_int| |old(#memory_int)|) [2021-02-24 04:16:55,357 INFO L192 CegarLoopUtils]: At program point L46-1(line 46) the Hoare annotation is: true [2021-02-24 04:16:55,357 INFO L192 CegarLoopUtils]: At program point mainFINAL(lines 41 50) the Hoare annotation is: true [2021-02-24 04:16:55,357 INFO L185 CegarLoopUtils]: At program point L44(line 44) the Hoare annotation is: (and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|)) [2021-02-24 04:16:55,357 INFO L185 CegarLoopUtils]: At program point L45-1(line 45) the Hoare annotation is: (= ((as const (Array Int Int)) 0) (select |#memory_int| |main_#t~malloc17.base|)) [2021-02-24 04:16:55,357 INFO L192 CegarLoopUtils]: At program point L46-2(line 46) the Hoare annotation is: true [2021-02-24 04:16:55,358 INFO L185 CegarLoopUtils]: At program point L44-1(line 44) the Hoare annotation is: (and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|)) [2021-02-24 04:16:55,358 INFO L192 CegarLoopUtils]: At program point L46-3(line 46) the Hoare annotation is: true [2021-02-24 04:16:55,358 INFO L185 CegarLoopUtils]: At program point L42(line 42) the Hoare annotation is: (and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|)) [2021-02-24 04:16:55,358 INFO L185 CegarLoopUtils]: At program point L42-1(line 42) the Hoare annotation is: (and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|)) [2021-02-24 04:16:55,358 INFO L185 CegarLoopUtils]: At program point L33(line 33) the Hoare annotation is: (let ((.cse5 ((as const (Array Int Int)) 0))) (let ((.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse3 (= (select |#memory_int| check_~a.base) .cse5)) (.cse4 (<= 1 check_~x)) (.cse1 (not (= (select |#memory_int| |check_#in~a.base|) .cse5)))) (and (or .cse0 .cse1 (not (<= 2 |check_#in~x|)) (<= 2 check_~x)) (or .cse0 (let ((.cse2 (+ check_~y 1))) (and (<= .cse2 |check_#in~n|) (<= .cse2 check_~n) .cse3 .cse4)) (not (= |check_#in~x| 0)) .cse1) (or .cse0 (and .cse3 .cse4) (not (<= 1 |check_#in~x|)) .cse1)))) [2021-02-24 04:16:55,359 INFO L185 CegarLoopUtils]: At program point L35-2(line 35) the Hoare annotation is: (let ((.cse8 ((as const (Array Int Int)) 0))) (let ((.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse1 (not (= (select |#memory_int| |check_#in~a.base|) .cse8))) (.cse2 (= check_~ax~0 0)) (.cse3 (= |check_#t~mem15| 0)) (.cse4 (= check_~ai~0 0)) (.cse5 (= (select |#memory_int| check_~a.base) .cse8)) (.cse6 (<= 1 check_~x))) (and (or .cse0 .cse1 (not (<= 2 |check_#in~x|)) (<= 2 check_~x)) (or .cse0 (and .cse2 .cse3 .cse4 .cse5 .cse6) (not (<= 1 |check_#in~x|)) .cse1) (or .cse0 (not (= |check_#in~x| 0)) .cse1 (let ((.cse7 (+ check_~y 1))) (and .cse2 .cse3 (<= .cse7 |check_#in~n|) .cse4 (<= .cse7 check_~n) .cse5 .cse6)))))) [2021-02-24 04:16:55,359 INFO L185 CegarLoopUtils]: At program point L33-1(line 33) the Hoare annotation is: (let ((.cse5 ((as const (Array Int Int)) 0))) (let ((.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse3 (= (select |#memory_int| check_~a.base) .cse5)) (.cse4 (<= 1 check_~x)) (.cse1 (not (= (select |#memory_int| |check_#in~a.base|) .cse5)))) (and (or .cse0 .cse1 (not (<= 2 |check_#in~x|)) (<= 2 check_~x)) (or .cse0 (let ((.cse2 (+ check_~y 1))) (and (<= .cse2 |check_#in~n|) (<= .cse2 check_~n) .cse3 .cse4)) (not (= |check_#in~x| 0)) .cse1) (or .cse0 (and .cse3 .cse4) (not (<= 1 |check_#in~x|)) .cse1)))) [2021-02-24 04:16:55,359 INFO L192 CegarLoopUtils]: At program point checkENTRY(lines 16 39) the Hoare annotation is: true [2021-02-24 04:16:55,359 INFO L185 CegarLoopUtils]: At program point L25(line 25) the Hoare annotation is: (let ((.cse7 ((as const (Array Int Int)) 0)) (.cse8 (+ check_~y 1))) (let ((.cse5 (not (<= 1 |check_#in~x|))) (.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse2 (<= .cse8 |check_#in~n|)) (.cse3 (<= .cse8 check_~n)) (.cse4 (= (select |#memory_int| check_~a.base) .cse7)) (.cse1 (not (= (select |#memory_int| |check_#in~a.base|) .cse7)))) (and (or .cse0 .cse1 (not (<= 2 |check_#in~x|)) (<= 2 check_~x)) (or .cse0 (and .cse2 .cse3 .cse4 (<= 1 check_~x)) .cse5 .cse1) (or (not (<= (+ |check_#in~y| 2) |check_#in~n|)) .cse5 .cse1 (let ((.cse6 (+ check_~y 2))) (and (<= .cse6 check_~n) (<= .cse6 |check_#in~n|)))) (or .cse0 (and .cse2 .cse3 .cse4 (= check_~x 0)) (not (= |check_#in~x| 0)) .cse1)))) [2021-02-24 04:16:55,360 INFO L185 CegarLoopUtils]: At program point L25-1(line 25) the Hoare annotation is: (let ((.cse7 ((as const (Array Int Int)) 0)) (.cse8 (+ check_~y 1))) (let ((.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse2 (<= .cse8 |check_#in~n|)) (.cse3 (<= .cse8 check_~n)) (.cse4 (= (select |#memory_int| check_~a.base) .cse7)) (.cse5 (not (<= 1 |check_#in~x|))) (.cse1 (not (= (select |#memory_int| |check_#in~a.base|) .cse7)))) (and (or .cse0 .cse1 (not (<= 2 |check_#in~x|)) (<= 2 check_~x)) (or .cse0 (not (= |check_#in~x| 0)) .cse1 (and (= |check_#t~mem8| 0) .cse2 .cse3 .cse4 (= check_~x 0))) (or .cse0 (and .cse2 .cse3 .cse4 (<= 1 check_~x)) .cse5 .cse1) (or (not (<= (+ |check_#in~y| 2) |check_#in~n|)) .cse5 .cse1 (let ((.cse6 (+ check_~y 2))) (and (<= .cse6 check_~n) (<= .cse6 |check_#in~n|))))))) [2021-02-24 04:16:55,360 INFO L185 CegarLoopUtils]: At program point L23(line 23) the Hoare annotation is: (let ((.cse7 ((as const (Array Int Int)) 0)) (.cse8 (+ check_~y 1))) (let ((.cse5 (not (<= 1 |check_#in~x|))) (.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse2 (<= .cse8 |check_#in~n|)) (.cse3 (<= .cse8 check_~n)) (.cse4 (= (select |#memory_int| check_~a.base) .cse7)) (.cse1 (not (= (select |#memory_int| |check_#in~a.base|) .cse7)))) (and (or .cse0 .cse1 (not (<= 2 |check_#in~x|)) (<= 2 check_~x)) (or .cse0 (and .cse2 .cse3 .cse4 (<= 1 check_~x)) .cse5 .cse1) (or (not (<= (+ |check_#in~y| 2) |check_#in~n|)) .cse5 .cse1 (let ((.cse6 (+ check_~y 2))) (and (<= .cse6 check_~n) (<= .cse6 |check_#in~n|)))) (or .cse0 (and .cse2 .cse3 .cse4 (= check_~x 0)) (not (= |check_#in~x| 0)) .cse1)))) [2021-02-24 04:16:55,360 INFO L185 CegarLoopUtils]: At program point L25-2(lines 25 26) the Hoare annotation is: (let ((.cse8 (+ check_~y 1)) (.cse7 ((as const (Array Int Int)) 0))) (let ((.cse5 (not (<= 1 |check_#in~x|))) (.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse1 (not (= (select |#memory_int| |check_#in~a.base|) .cse7))) (.cse2 (<= .cse8 |check_#in~n|)) (.cse3 (<= .cse8 check_~n)) (.cse4 (= (select |#memory_int| check_~a.base) .cse7))) (and (or .cse0 .cse1 (not (<= 2 |check_#in~x|)) (<= 2 check_~x)) (or .cse0 (and .cse2 .cse3 .cse4 (<= 1 check_~x)) .cse5 .cse1) (or (not (<= (+ |check_#in~y| 2) |check_#in~n|)) .cse5 .cse1 (let ((.cse6 (+ check_~y 2))) (and (<= .cse6 check_~n) (<= .cse6 |check_#in~n|)))) (or .cse0 (not (= |check_#in~x| 0)) .cse1 (and (= |check_#t~mem8| 0) .cse2 .cse3 (= |check_#t~mem9| 0) .cse4 (= check_~x 0)))))) [2021-02-24 04:16:55,361 INFO L185 CegarLoopUtils]: At program point L25-3(line 25) the Hoare annotation is: (let ((.cse8 (+ check_~y 1)) (.cse7 ((as const (Array Int Int)) 0))) (let ((.cse5 (not (<= 1 |check_#in~x|))) (.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse1 (not (= (select |#memory_int| |check_#in~a.base|) .cse7))) (.cse2 (<= .cse8 |check_#in~n|)) (.cse3 (<= .cse8 check_~n)) (.cse4 (= (select |#memory_int| check_~a.base) .cse7))) (and (or .cse0 .cse1 (not (<= 2 |check_#in~x|)) (<= 2 check_~x)) (or .cse0 (and .cse2 .cse3 .cse4 (<= 1 check_~x)) .cse5 .cse1) (or (not (<= (+ |check_#in~y| 2) |check_#in~n|)) .cse5 .cse1 (let ((.cse6 (+ check_~y 2))) (and (<= .cse6 check_~n) (<= .cse6 |check_#in~n|)))) (or .cse0 (not (= |check_#in~x| 0)) .cse1 (and (= |check_#t~mem8| 0) .cse2 .cse3 (= |check_#t~mem9| 0) .cse4 (= check_~x 0)))))) [2021-02-24 04:16:55,361 INFO L185 CegarLoopUtils]: At program point L25-4(line 25) the Hoare annotation is: (let ((.cse7 ((as const (Array Int Int)) 0)) (.cse8 (+ check_~y 1))) (let ((.cse5 (not (<= 1 |check_#in~x|))) (.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse2 (<= .cse8 |check_#in~n|)) (.cse3 (<= .cse8 check_~n)) (.cse4 (= (select |#memory_int| check_~a.base) .cse7)) (.cse1 (not (= (select |#memory_int| |check_#in~a.base|) .cse7)))) (and (or .cse0 .cse1 (not (<= 2 |check_#in~x|)) (<= 2 check_~x)) (or .cse0 (and .cse2 .cse3 .cse4 (<= 1 check_~x)) .cse5 .cse1) (or (not (<= (+ |check_#in~y| 2) |check_#in~n|)) .cse5 .cse1 (let ((.cse6 (+ check_~y 2))) (and (<= .cse6 check_~n) (<= .cse6 |check_#in~n|)))) (or .cse0 (and .cse2 .cse3 .cse4 (= check_~x 0)) (not (= |check_#in~x| 0)) .cse1)))) [2021-02-24 04:16:55,361 INFO L185 CegarLoopUtils]: At program point L25-5(line 25) the Hoare annotation is: (let ((.cse7 ((as const (Array Int Int)) 0)) (.cse8 (+ check_~y 1))) (let ((.cse5 (not (<= 1 |check_#in~x|))) (.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse2 (<= .cse8 |check_#in~n|)) (.cse3 (<= .cse8 check_~n)) (.cse4 (= (select |#memory_int| check_~a.base) .cse7)) (.cse1 (not (= (select |#memory_int| |check_#in~a.base|) .cse7)))) (and (or .cse0 .cse1 (not (<= 2 |check_#in~x|)) (<= 2 check_~x)) (or .cse0 (and .cse2 .cse3 .cse4 (<= 1 check_~x)) .cse5 .cse1) (or (not (<= (+ |check_#in~y| 2) |check_#in~n|)) .cse5 .cse1 (let ((.cse6 (+ check_~y 2))) (and (<= .cse6 check_~n) (<= .cse6 |check_#in~n|)))) (or .cse0 (and .cse2 .cse3 .cse4 (= check_~x 0)) (not (= |check_#in~x| 0)) .cse1)))) [2021-02-24 04:16:55,362 INFO L185 CegarLoopUtils]: At program point L25-6(line 25) the Hoare annotation is: (let ((.cse8 (+ check_~y 1)) (.cse7 ((as const (Array Int Int)) 0))) (let ((.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse5 (not (<= 1 |check_#in~x|))) (.cse1 (not (= (select |#memory_int| |check_#in~a.base|) .cse7))) (.cse2 (<= .cse8 |check_#in~n|)) (.cse3 (<= .cse8 check_~n)) (.cse4 (= (select |#memory_int| check_~a.base) .cse7))) (and (or .cse0 .cse1 (not (<= 2 |check_#in~x|)) (<= 2 check_~x)) (or .cse0 (not (= |check_#in~x| 0)) .cse1 (and .cse2 .cse3 (= |check_#t~post10| 0) .cse4 (= check_~x 0))) (or (not (<= (+ |check_#in~y| 2) |check_#in~n|)) .cse5 .cse1 (let ((.cse6 (+ check_~y 2))) (and (<= .cse6 check_~n) (<= .cse6 |check_#in~n|)))) (or .cse0 .cse5 .cse1 (and .cse2 (<= 1 |check_#t~post10|) .cse3 .cse4 (<= 1 check_~x)))))) [2021-02-24 04:16:55,362 INFO L185 CegarLoopUtils]: At program point L25-7(line 25) the Hoare annotation is: (let ((.cse7 ((as const (Array Int Int)) 0)) (.cse8 (+ check_~y 1))) (let ((.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse2 (<= .cse8 |check_#in~n|)) (.cse3 (<= .cse8 check_~n)) (.cse4 (= (select |#memory_int| check_~a.base) .cse7)) (.cse5 (not (<= 1 |check_#in~x|))) (.cse1 (not (= (select |#memory_int| |check_#in~a.base|) .cse7)))) (and (or .cse0 (not (= |check_#in~x| 0)) .cse1 (and .cse2 .cse3 (= |check_#t~post10| 0) .cse4 (<= 1 check_~x))) (or .cse0 (and .cse2 (<= 1 |check_#t~post10|) .cse3 .cse4 (<= 2 check_~x)) .cse5 .cse1) (or (not (<= (+ |check_#in~y| 2) |check_#in~n|)) .cse5 .cse1 (let ((.cse6 (+ check_~y 2))) (and (<= .cse6 check_~n) (<= .cse6 |check_#in~n|))))))) [2021-02-24 04:16:55,362 INFO L185 CegarLoopUtils]: At program point L17(line 17) the Hoare annotation is: (let ((.cse7 ((as const (Array Int Int)) 0)) (.cse8 (+ check_~y 1))) (let ((.cse5 (not (<= 1 |check_#in~x|))) (.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse2 (<= .cse8 |check_#in~n|)) (.cse3 (<= .cse8 check_~n)) (.cse4 (= (select |#memory_int| check_~a.base) .cse7)) (.cse1 (not (= (select |#memory_int| |check_#in~a.base|) .cse7)))) (and (or .cse0 .cse1 (not (<= 2 |check_#in~x|)) (<= 2 check_~x)) (or .cse0 (and .cse2 .cse3 .cse4 (<= 1 check_~x)) .cse5 .cse1) (or (not (<= (+ |check_#in~y| 2) |check_#in~n|)) .cse5 .cse1 (let ((.cse6 (+ check_~y 2))) (and (<= .cse6 check_~n) (<= .cse6 |check_#in~n|)))) (or .cse0 (and .cse2 .cse3 .cse4 (= check_~x 0)) (not (= |check_#in~x| 0)) .cse1)))) [2021-02-24 04:16:55,362 INFO L185 CegarLoopUtils]: At program point L17-1(line 17) the Hoare annotation is: (let ((.cse4 ((as const (Array Int Int)) 0)) (.cse7 (+ check_~y 1))) (let ((.cse2 (<= .cse7 |check_#in~n|)) (.cse3 (<= .cse7 check_~n)) (.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse5 (not (<= 1 |check_#in~x|))) (.cse1 (not (= (select |#memory_int| |check_#in~a.base|) .cse4)))) (and (or .cse0 .cse1 (not (<= 2 |check_#in~x|)) (<= 2 check_~x)) (or .cse0 (and .cse2 .cse3 (= (select |#memory_int| check_~a.base) .cse4) (<= 1 check_~x)) .cse5 .cse1) (or (and .cse2 .cse3 (= check_~x 0)) .cse0 (not (= |check_#in~x| 0)) .cse1) (or (not (<= (+ |check_#in~y| 2) |check_#in~n|)) .cse5 .cse1 (let ((.cse6 (+ check_~y 2))) (and (<= .cse6 check_~n) (<= .cse6 |check_#in~n|))))))) [2021-02-24 04:16:55,363 INFO L185 CegarLoopUtils]: At program point L25-9(line 25) the Hoare annotation is: (let ((.cse3 ((as const (Array Int Int)) 0))) (let ((.cse4 (not (<= 1 |check_#in~x|))) (.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse1 (not (= (select |#memory_int| |check_#in~a.base|) .cse3)))) (and (or .cse0 .cse1 (not (<= 2 |check_#in~x|)) (<= 2 check_~x)) (or .cse0 (let ((.cse2 (+ check_~y 1))) (and (<= .cse2 |check_#in~n|) (<= .cse2 check_~n) (= (select |#memory_int| check_~a.base) .cse3) (<= 1 check_~x))) .cse4 .cse1) (or (not (<= (+ |check_#in~y| 2) |check_#in~n|)) .cse4 .cse1 (let ((.cse5 (+ check_~y 2))) (and (<= .cse5 check_~n) (<= .cse5 |check_#in~n|)))) (or .cse0 (not (= |check_#in~x| 0)) .cse1)))) [2021-02-24 04:16:55,363 INFO L185 CegarLoopUtils]: At program point L25-10(line 25) the Hoare annotation is: (let ((.cse3 ((as const (Array Int Int)) 0))) (let ((.cse4 (not (<= 1 |check_#in~x|))) (.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse1 (not (= (select |#memory_int| |check_#in~a.base|) .cse3)))) (and (or .cse0 .cse1 (not (<= 2 |check_#in~x|)) (<= 2 check_~x)) (or .cse0 (let ((.cse2 (+ check_~y 1))) (and (<= .cse2 |check_#in~n|) (<= .cse2 check_~n) (= (select |#memory_int| check_~a.base) .cse3) (<= 1 check_~x))) .cse4 .cse1) (or (not (<= (+ |check_#in~y| 2) |check_#in~n|)) .cse4 .cse1 (let ((.cse5 (+ check_~y 2))) (and (<= .cse5 check_~n) (<= .cse5 |check_#in~n|)))) (or .cse0 (not (= |check_#in~x| 0)) .cse1)))) [2021-02-24 04:16:55,363 INFO L185 CegarLoopUtils]: At program point L25-11(lines 25 26) the Hoare annotation is: (let ((.cse9 ((as const (Array Int Int)) 0)) (.cse10 (+ check_~y 1))) (let ((.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse3 (<= .cse10 |check_#in~n|)) (.cse4 (<= .cse10 check_~n)) (.cse2 (<= 2 check_~x)) (.cse5 (= (select |#memory_int| check_~a.base) .cse9)) (.cse6 (<= 1 check_~x)) (.cse7 (not (<= 1 |check_#in~x|))) (.cse1 (not (= (select |#memory_int| |check_#in~a.base|) .cse9))) (.cse8 (<= (+ check_~y 2) check_~n))) (and (or .cse0 .cse1 (not (<= 2 |check_#in~x|)) .cse2) (or .cse0 (and .cse3 .cse4 .cse5 .cse6) (not (= |check_#in~x| 0)) .cse1) (or .cse0 (and .cse3 .cse4 .cse5 .cse2) .cse7 .cse1 (and .cse8 .cse5 .cse6)) (or (not (<= (+ |check_#in~y| 2) |check_#in~n|)) .cse7 .cse1 .cse8)))) [2021-02-24 04:16:55,363 INFO L185 CegarLoopUtils]: At program point checkFINAL(lines 16 39) the Hoare annotation is: (let ((.cse2 ((as const (Array Int Int)) 0))) (let ((.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse1 (not (= (select |#memory_int| |check_#in~a.base|) .cse2)))) (and (or .cse0 .cse1 (not (<= 2 |check_#in~x|)) (<= 2 check_~x)) (or .cse0 (and (= (select |#memory_int| check_~a.base) .cse2) (<= 1 check_~x)) (not (<= 1 |check_#in~x|)) .cse1)))) [2021-02-24 04:16:55,364 INFO L185 CegarLoopUtils]: At program point L36(line 36) the Hoare annotation is: (let ((.cse7 ((as const (Array Int Int)) 0))) (let ((.cse2 (= check_~ax~0 0)) (.cse3 (= check_~ai~0 0)) (.cse4 (= (select |#memory_int| check_~a.base) .cse7)) (.cse5 (<= 1 check_~x)) (.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse1 (not (= (select |#memory_int| |check_#in~a.base|) .cse7)))) (and (or .cse0 .cse1 (not (<= 2 |check_#in~x|)) (<= 2 check_~x)) (or .cse0 (not (<= 1 |check_#in~x|)) (and .cse2 .cse3 .cse4 .cse5) .cse1) (or (let ((.cse6 (+ check_~y 1))) (and .cse2 (<= .cse6 |check_#in~n|) .cse3 (<= .cse6 check_~n) .cse4 .cse5)) .cse0 (not (= |check_#in~x| 0)) .cse1)))) [2021-02-24 04:16:55,364 INFO L185 CegarLoopUtils]: At program point L36-1(line 36) the Hoare annotation is: (let ((.cse2 ((as const (Array Int Int)) 0))) (let ((.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse1 (not (= (select |#memory_int| |check_#in~a.base|) .cse2)))) (and (or .cse0 .cse1 (not (<= 2 |check_#in~x|)) (<= 2 check_~x)) (or .cse0 (not (<= 1 |check_#in~x|)) (and (= check_~ax~0 0) (= check_~ai~0 0) (= (select |#memory_int| check_~a.base) .cse2) (<= 1 check_~x)) .cse1)))) [2021-02-24 04:16:55,364 INFO L185 CegarLoopUtils]: At program point L34(line 34) the Hoare annotation is: (let ((.cse6 ((as const (Array Int Int)) 0))) (let ((.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse1 (not (= (select |#memory_int| |check_#in~a.base|) .cse6))) (.cse2 (= |check_#t~mem14| 0)) (.cse4 (= (select |#memory_int| check_~a.base) .cse6)) (.cse5 (<= 1 check_~x))) (and (or .cse0 .cse1 (not (<= 2 |check_#in~x|)) (<= 2 check_~x)) (or (let ((.cse3 (+ check_~y 1))) (and .cse2 (<= .cse3 |check_#in~n|) (<= .cse3 check_~n) .cse4 .cse5)) .cse0 (not (= |check_#in~x| 0)) .cse1) (or .cse0 (not (<= 1 |check_#in~x|)) .cse1 (and .cse2 .cse4 .cse5))))) [2021-02-24 04:16:55,364 INFO L185 CegarLoopUtils]: At program point L34-1(line 34) the Hoare annotation is: (let ((.cse7 ((as const (Array Int Int)) 0))) (let ((.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse1 (not (= (select |#memory_int| |check_#in~a.base|) .cse7))) (.cse2 (= |check_#t~mem14| 0)) (.cse4 (= check_~ai~0 0)) (.cse5 (= (select |#memory_int| check_~a.base) .cse7)) (.cse6 (<= 1 check_~x))) (and (or .cse0 .cse1 (not (<= 2 |check_#in~x|)) (<= 2 check_~x)) (or .cse0 (let ((.cse3 (+ check_~y 1))) (and .cse2 (<= .cse3 |check_#in~n|) .cse4 (<= .cse3 check_~n) .cse5 .cse6)) (not (= |check_#in~x| 0)) .cse1) (or .cse0 (not (<= 1 |check_#in~x|)) .cse1 (and .cse2 .cse4 .cse5 .cse6))))) [2021-02-24 04:16:55,365 INFO L185 CegarLoopUtils]: At program point L32(line 32) the Hoare annotation is: (let ((.cse5 ((as const (Array Int Int)) 0))) (let ((.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse3 (= (select |#memory_int| check_~a.base) .cse5)) (.cse4 (<= 1 check_~x)) (.cse1 (not (= (select |#memory_int| |check_#in~a.base|) .cse5)))) (and (or .cse0 .cse1 (not (<= 2 |check_#in~x|)) (<= 2 check_~x)) (or .cse0 (let ((.cse2 (+ check_~y 1))) (and (<= .cse2 |check_#in~n|) (<= .cse2 check_~n) .cse3 .cse4)) (not (= |check_#in~x| 0)) .cse1) (or .cse0 (and .cse3 .cse4) (not (<= 1 |check_#in~x|)) .cse1)))) [2021-02-24 04:16:55,365 INFO L185 CegarLoopUtils]: At program point L32-1(line 32) the Hoare annotation is: (let ((.cse5 ((as const (Array Int Int)) 0))) (let ((.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse3 (= (select |#memory_int| check_~a.base) .cse5)) (.cse4 (<= 1 check_~x)) (.cse1 (not (= (select |#memory_int| |check_#in~a.base|) .cse5)))) (and (or .cse0 .cse1 (not (<= 2 |check_#in~x|)) (<= 2 check_~x)) (or .cse0 (let ((.cse2 (+ check_~y 1))) (and (<= .cse2 |check_#in~n|) (<= .cse2 check_~n) .cse3 .cse4)) (not (= |check_#in~x| 0)) .cse1) (or .cse0 (and .cse3 .cse4) (not (<= 1 |check_#in~x|)) .cse1)))) [2021-02-24 04:16:55,365 INFO L185 CegarLoopUtils]: At program point L32-2(line 32) the Hoare annotation is: (let ((.cse5 ((as const (Array Int Int)) 0))) (let ((.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse3 (= (select |#memory_int| check_~a.base) .cse5)) (.cse4 (<= 1 check_~x)) (.cse1 (not (= (select |#memory_int| |check_#in~a.base|) .cse5)))) (and (or .cse0 .cse1 (not (<= 2 |check_#in~x|)) (<= 2 check_~x)) (or .cse0 (let ((.cse2 (+ check_~y 1))) (and (<= .cse2 |check_#in~n|) (<= .cse2 check_~n) .cse3 .cse4)) (not (= |check_#in~x| 0)) .cse1) (or .cse0 (and .cse3 .cse4) (not (<= 1 |check_#in~x|)) .cse1)))) [2021-02-24 04:16:55,365 INFO L185 CegarLoopUtils]: At program point L28(line 28) the Hoare annotation is: (let ((.cse5 ((as const (Array Int Int)) 0))) (let ((.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse3 (= (select |#memory_int| check_~a.base) .cse5)) (.cse4 (<= 1 check_~x)) (.cse1 (not (= (select |#memory_int| |check_#in~a.base|) .cse5)))) (and (or .cse0 .cse1 (not (<= 2 |check_#in~x|)) (<= 2 check_~x)) (or .cse0 (let ((.cse2 (+ check_~y 1))) (and (<= .cse2 |check_#in~n|) (<= .cse2 check_~n) .cse3 .cse4)) (not (= |check_#in~x| 0)) .cse1) (or .cse0 (and .cse3 .cse4) (not (<= 1 |check_#in~x|)) .cse1)))) [2021-02-24 04:16:55,365 INFO L185 CegarLoopUtils]: At program point L28-1(line 28) the Hoare annotation is: (let ((.cse5 ((as const (Array Int Int)) 0))) (let ((.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse3 (= (select |#memory_int| check_~a.base) .cse5)) (.cse4 (<= 1 check_~x)) (.cse1 (not (= (select |#memory_int| |check_#in~a.base|) .cse5)))) (and (or .cse0 .cse1 (not (<= 2 |check_#in~x|)) (<= 2 check_~x)) (or .cse0 (let ((.cse2 (+ check_~y 1))) (and (<= .cse2 |check_#in~n|) (<= .cse2 check_~n) .cse3 .cse4)) (not (= |check_#in~x| 0)) .cse1) (or .cse0 (and .cse3 .cse4) (not (<= 1 |check_#in~x|)) .cse1)))) [2021-02-24 04:16:55,366 INFO L185 CegarLoopUtils]: At program point L26(line 26) the Hoare annotation is: (let ((.cse3 ((as const (Array Int Int)) 0))) (let ((.cse4 (not (<= 1 |check_#in~x|))) (.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse1 (not (= (select |#memory_int| |check_#in~a.base|) .cse3)))) (and (or .cse0 .cse1 (not (<= 2 |check_#in~x|)) (<= 2 check_~x)) (or .cse0 (let ((.cse2 (+ check_~y 1))) (and (<= .cse2 |check_#in~n|) (<= .cse2 check_~n) (= (select |#memory_int| check_~a.base) .cse3) (<= 1 check_~x))) .cse4 .cse1) (or (not (<= (+ |check_#in~y| 2) |check_#in~n|)) .cse4 .cse1 (let ((.cse5 (+ check_~y 2))) (and (<= .cse5 check_~n) (<= .cse5 |check_#in~n|)))) (or .cse0 (not (= |check_#in~x| 0)) .cse1)))) [2021-02-24 04:16:55,366 INFO L185 CegarLoopUtils]: At program point L28-2(line 28) the Hoare annotation is: (let ((.cse5 ((as const (Array Int Int)) 0))) (let ((.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse3 (= (select |#memory_int| check_~a.base) .cse5)) (.cse4 (<= 1 check_~x)) (.cse1 (not (= (select |#memory_int| |check_#in~a.base|) .cse5)))) (and (or .cse0 .cse1 (not (<= 2 |check_#in~x|)) (<= 2 check_~x)) (or .cse0 (let ((.cse2 (+ check_~y 1))) (and (<= .cse2 |check_#in~n|) (<= .cse2 check_~n) .cse3 .cse4)) (not (= |check_#in~x| 0)) .cse1) (or .cse0 (and .cse3 .cse4) (not (<= 1 |check_#in~x|)) .cse1)))) [2021-02-24 04:16:55,366 INFO L185 CegarLoopUtils]: At program point L26-1(line 26) the Hoare annotation is: (let ((.cse5 ((as const (Array Int Int)) 0))) (let ((.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse2 (not (<= 1 |check_#in~x|))) (.cse1 (not (= (select |#memory_int| |check_#in~a.base|) .cse5)))) (and (or .cse0 .cse1 (not (<= 2 |check_#in~x|)) (<= 2 check_~x)) (or (not (<= (+ |check_#in~y| 2) |check_#in~n|)) .cse2 .cse1 (let ((.cse3 (+ check_~y 2))) (and (<= .cse3 check_~n) (<= .cse3 |check_#in~n|)))) (or .cse0 (not (= |check_#in~x| 0)) .cse1) (or .cse0 .cse2 .cse1 (let ((.cse4 (+ check_~y 1))) (and (<= (+ |check_#t~post11| 1) check_~n) (<= .cse4 |check_#in~n|) (<= .cse4 check_~n) (= (select |#memory_int| check_~a.base) .cse5) (<= 1 check_~x))))))) [2021-02-24 04:16:55,366 INFO L185 CegarLoopUtils]: At program point L26-2(line 26) the Hoare annotation is: (let ((.cse2 ((as const (Array Int Int)) 0))) (let ((.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse1 (not (= (select |#memory_int| |check_#in~a.base|) .cse2)))) (and (or .cse0 .cse1 (not (<= 2 |check_#in~x|)) (<= 2 check_~x)) (or .cse0 (not (= |check_#in~x| 0)) .cse1) (or .cse0 (not (<= 1 |check_#in~x|)) .cse1 (and (<= (+ |check_#t~post11| 1) check_~n) (<= (+ check_~y 2) check_~n) (= (select |#memory_int| check_~a.base) .cse2) (<= 1 check_~x)))))) [2021-02-24 04:16:55,367 INFO L185 CegarLoopUtils]: At program point L20(line 20) the Hoare annotation is: (let ((.cse7 ((as const (Array Int Int)) 0)) (.cse8 (+ check_~y 1))) (let ((.cse5 (not (<= 1 |check_#in~x|))) (.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse2 (<= .cse8 |check_#in~n|)) (.cse3 (<= .cse8 check_~n)) (.cse4 (= (select |#memory_int| check_~a.base) .cse7)) (.cse1 (not (= (select |#memory_int| |check_#in~a.base|) .cse7)))) (and (or .cse0 .cse1 (not (<= 2 |check_#in~x|)) (<= 2 check_~x)) (or .cse0 (and .cse2 .cse3 .cse4 (<= 1 check_~x)) .cse5 .cse1) (or (not (<= (+ |check_#in~y| 2) |check_#in~n|)) .cse5 .cse1 (let ((.cse6 (+ check_~y 2))) (and (<= .cse6 check_~n) (<= .cse6 |check_#in~n|)))) (or .cse0 (and .cse2 .cse3 .cse4 (= check_~x 0)) (not (= |check_#in~x| 0)) .cse1)))) [2021-02-24 04:16:55,367 INFO L185 CegarLoopUtils]: At program point L20-1(line 20) the Hoare annotation is: (let ((.cse7 ((as const (Array Int Int)) 0)) (.cse8 (+ check_~y 1))) (let ((.cse5 (not (<= 1 |check_#in~x|))) (.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse2 (<= .cse8 |check_#in~n|)) (.cse3 (<= .cse8 check_~n)) (.cse4 (= (select |#memory_int| check_~a.base) .cse7)) (.cse1 (not (= (select |#memory_int| |check_#in~a.base|) .cse7)))) (and (or .cse0 .cse1 (not (<= 2 |check_#in~x|)) (<= 2 check_~x)) (or .cse0 (and .cse2 .cse3 .cse4 (<= 1 check_~x)) .cse5 .cse1) (or (not (<= (+ |check_#in~y| 2) |check_#in~n|)) .cse5 .cse1 (let ((.cse6 (+ check_~y 2))) (and (<= .cse6 check_~n) (<= .cse6 |check_#in~n|)))) (or .cse0 (and .cse2 .cse3 .cse4 (= check_~x 0)) (not (= |check_#in~x| 0)) .cse1)))) [2021-02-24 04:16:55,367 INFO L185 CegarLoopUtils]: At program point checkEXIT(lines 16 39) the Hoare annotation is: (let ((.cse2 ((as const (Array Int Int)) 0))) (let ((.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse1 (not (= (select |#memory_int| |check_#in~a.base|) .cse2)))) (and (or .cse0 .cse1 (not (<= 2 |check_#in~x|)) (<= 2 check_~x)) (or .cse0 (and (= (select |#memory_int| check_~a.base) .cse2) (<= 1 check_~x)) (not (<= 1 |check_#in~x|)) .cse1)))) [2021-02-24 04:16:55,367 INFO L185 CegarLoopUtils]: At program point L16(lines 16 39) the Hoare annotation is: (let ((.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse1 (not (= (select |#memory_int| |check_#in~a.base|) ((as const (Array Int Int)) 0))))) (and (or .cse0 .cse1 (not (<= 2 |check_#in~x|)) (<= 2 check_~x)) (or .cse0 (not (= |check_#in~x| 0)) .cse1 (= check_~x 0)) (or .cse0 (not (<= 1 |check_#in~x|)) .cse1 (<= 1 check_~x)))) [2021-02-24 04:16:55,367 INFO L185 CegarLoopUtils]: At program point L16-1(lines 16 39) the Hoare annotation is: (let ((.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse2 (<= (+ check_~y 1) |check_#in~n|)) (.cse3 (not (<= 1 |check_#in~x|))) (.cse1 (not (= (select |#memory_int| |check_#in~a.base|) ((as const (Array Int Int)) 0))))) (and (or .cse0 .cse1 (not (<= 2 |check_#in~x|)) (<= 2 check_~x)) (or .cse0 (and .cse2 (<= 1 check_~x)) .cse3 .cse1) (or .cse0 (and .cse2 (= check_~x 0)) (not (= |check_#in~x| 0)) .cse1) (or (not (<= (+ |check_#in~y| 2) |check_#in~n|)) .cse3 .cse1 (<= (+ check_~y 2) |check_#in~n|)))) [2021-02-24 04:16:55,368 INFO L185 CegarLoopUtils]: At program point L16-2(lines 16 39) the Hoare annotation is: (let ((.cse5 ((as const (Array Int Int)) 0))) (let ((.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse2 (<= (+ check_~y 1) |check_#in~n|)) (.cse3 (= (select |#memory_int| check_~a.base) .cse5)) (.cse4 (not (<= 1 |check_#in~x|))) (.cse1 (not (= (select |#memory_int| |check_#in~a.base|) .cse5)))) (and (or .cse0 .cse1 (not (<= 2 |check_#in~x|)) (<= 2 check_~x)) (or .cse0 (and .cse2 .cse3 (= check_~x 0)) (not (= |check_#in~x| 0)) .cse1) (or (not (<= (+ |check_#in~y| 2) |check_#in~n|)) .cse4 .cse1 (<= (+ check_~y 2) |check_#in~n|)) (or .cse0 (and .cse2 .cse3 (<= 1 check_~x)) .cse4 .cse1)))) [2021-02-24 04:16:55,368 INFO L185 CegarLoopUtils]: At program point L35(line 35) the Hoare annotation is: (let ((.cse6 ((as const (Array Int Int)) 0))) (let ((.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse1 (not (= (select |#memory_int| |check_#in~a.base|) .cse6))) (.cse2 (= check_~ai~0 0)) (.cse3 (= (select |#memory_int| check_~a.base) .cse6)) (.cse4 (<= 1 check_~x))) (and (or .cse0 .cse1 (not (<= 2 |check_#in~x|)) (<= 2 check_~x)) (or .cse0 (not (<= 1 |check_#in~x|)) .cse1 (and .cse2 .cse3 .cse4)) (or .cse0 (not (= |check_#in~x| 0)) .cse1 (let ((.cse5 (+ check_~y 1))) (and (<= .cse5 |check_#in~n|) .cse2 (<= .cse5 check_~n) .cse3 .cse4)))))) [2021-02-24 04:16:55,368 INFO L185 CegarLoopUtils]: At program point L35-1(line 35) the Hoare annotation is: (let ((.cse7 ((as const (Array Int Int)) 0))) (let ((.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse2 (= |check_#t~mem15| 0)) (.cse3 (= check_~ai~0 0)) (.cse4 (= (select |#memory_int| check_~a.base) .cse7)) (.cse5 (<= 1 check_~x)) (.cse1 (not (= (select |#memory_int| |check_#in~a.base|) .cse7)))) (and (or .cse0 .cse1 (not (<= 2 |check_#in~x|)) (<= 2 check_~x)) (or .cse0 (not (<= 1 |check_#in~x|)) .cse1 (and .cse2 .cse3 .cse4 .cse5)) (or .cse0 (let ((.cse6 (+ check_~y 1))) (and .cse2 (<= .cse6 |check_#in~n|) .cse3 (<= .cse6 check_~n) .cse4 .cse5)) (not (= |check_#in~x| 0)) .cse1)))) [2021-02-24 04:16:55,368 INFO L192 CegarLoopUtils]: At program point __VERIFIER_assertENTRY(lines 10 12) the Hoare annotation is: true [2021-02-24 04:16:55,368 INFO L185 CegarLoopUtils]: At program point L11(line 11) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| 0) (not (= __VERIFIER_assert_~cond 0))) [2021-02-24 04:16:55,368 INFO L185 CegarLoopUtils]: At program point L11-1(line 11) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2021-02-24 04:16:55,369 INFO L185 CegarLoopUtils]: At program point __VERIFIER_assertEXIT(lines 10 12) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| 0) (not (= __VERIFIER_assert_~cond 0))) [2021-02-24 04:16:55,369 INFO L185 CegarLoopUtils]: At program point L11-2(line 11) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2021-02-24 04:16:55,369 INFO L185 CegarLoopUtils]: At program point L11-4(lines 10 12) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| 0) (not (= __VERIFIER_assert_~cond 0))) [2021-02-24 04:16:55,369 INFO L185 CegarLoopUtils]: At program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 11) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2021-02-24 04:16:55,369 INFO L185 CegarLoopUtils]: At program point #Ultimate.meminitENTRY(line -1) the Hoare annotation is: (= |#memory_int| |old(#memory_int)|) [2021-02-24 04:16:55,369 INFO L185 CegarLoopUtils]: At program point #Ultimate.meminitEXIT(line -1) the Hoare annotation is: (= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|)) [2021-02-24 04:16:55,370 INFO L185 CegarLoopUtils]: At program point #Ultimate.meminitFINAL(line -1) the Hoare annotation is: (= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|)) [2021-02-24 04:16:55,398 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.IllegalArgumentException: unknown symbol (const Int (Array Int Int)) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:240) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator.translateExpression(RCFGBacktranslator.java:394) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator.translateExpression(RCFGBacktranslator.java:1) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateExpression(ModelTranslationContainer.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateExpressionToString(ModelTranslationContainer.java:89) at de.uni_freiburg.informatik.ultimate.core.lib.results.ProcedureContractResult.getLongDescription(ProcedureContractResult.java:74) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ResultService.reportResult(ResultService.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.reportResult(TraceAbstractionStarter.java:558) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.createProcedureContractResults(TraceAbstractionStarter.java:281) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:214) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:131) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-02-24 04:16:55,402 INFO L168 Benchmark]: Toolchain (without parser) took 38156.96 ms. Allocated memory was 152.0 MB in the beginning and 338.7 MB in the end (delta: 186.6 MB). Free memory was 127.5 MB in the beginning and 273.9 MB in the end (delta: -146.4 MB). Peak memory consumption was 198.5 MB. Max. memory is 8.0 GB. [2021-02-24 04:16:55,402 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 152.0 MB. Free memory is still 127.3 MB. There was no memory consumed. Max. memory is 8.0 GB. [2021-02-24 04:16:55,402 INFO L168 Benchmark]: CACSL2BoogieTranslator took 276.14 ms. Allocated memory is still 152.0 MB. Free memory was 126.4 MB in the beginning and 115.8 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.5 MB. Max. memory is 8.0 GB. [2021-02-24 04:16:55,403 INFO L168 Benchmark]: Boogie Preprocessor took 83.01 ms. Allocated memory is still 152.0 MB. Free memory was 115.8 MB in the beginning and 114.3 MB in the end (delta: 1.5 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2021-02-24 04:16:55,403 INFO L168 Benchmark]: RCFGBuilder took 846.75 ms. Allocated memory is still 152.0 MB. Free memory was 114.1 MB in the beginning and 126.2 MB in the end (delta: -12.0 MB). Peak memory consumption was 18.0 MB. Max. memory is 8.0 GB. [2021-02-24 04:16:55,403 INFO L168 Benchmark]: TraceAbstraction took 36929.08 ms. Allocated memory was 152.0 MB in the beginning and 338.7 MB in the end (delta: 186.6 MB). Free memory was 125.6 MB in the beginning and 273.9 MB in the end (delta: -148.2 MB). Peak memory consumption was 195.2 MB. Max. memory is 8.0 GB. [2021-02-24 04:16:55,405 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19 ms. Allocated memory is still 152.0 MB. Free memory is still 127.3 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 276.14 ms. Allocated memory is still 152.0 MB. Free memory was 126.4 MB in the beginning and 115.8 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.5 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 83.01 ms. Allocated memory is still 152.0 MB. Free memory was 115.8 MB in the beginning and 114.3 MB in the end (delta: 1.5 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 846.75 ms. Allocated memory is still 152.0 MB. Free memory was 114.1 MB in the beginning and 126.2 MB in the end (delta: -12.0 MB). Peak memory consumption was 18.0 MB. Max. memory is 8.0 GB. * TraceAbstraction took 36929.08 ms. Allocated memory was 152.0 MB in the beginning and 338.7 MB in the end (delta: 186.6 MB). Free memory was 125.6 MB in the beginning and 273.9 MB in the end (delta: -148.2 MB). Peak memory consumption was 195.2 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 11]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - ProcedureContractResult [Line: 7]: Procedure Contract for assume_abort_if_not Derived contract for procedure assume_abort_if_not: 1 - ProcedureContractResult [Line: 41]: Procedure Contract for main Derived contract for procedure main: 1 - ProcedureContractResult [Line: 10]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert: \old(cond) == 0 || !(cond == 0) - ExceptionOrErrorResult: IllegalArgumentException: unknown symbol (const Int (Array Int Int)) de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: IllegalArgumentException: unknown symbol (const Int (Array Int Int)): de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:240) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...