/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-b7b32d2 [2021-02-22 01:51:31,004 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-02-22 01:51:31,007 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-02-22 01:51:31,063 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-02-22 01:51:31,064 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-02-22 01:51:31,069 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-02-22 01:51:31,073 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-02-22 01:51:31,082 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-02-22 01:51:31,086 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-02-22 01:51:31,092 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-02-22 01:51:31,094 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-02-22 01:51:31,096 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-02-22 01:51:31,097 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-02-22 01:51:31,099 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-02-22 01:51:31,102 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-02-22 01:51:31,104 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-02-22 01:51:31,107 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-02-22 01:51:31,121 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-02-22 01:51:31,125 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-02-22 01:51:31,127 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-02-22 01:51:31,128 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-02-22 01:51:31,130 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-02-22 01:51:31,131 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-02-22 01:51:31,132 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-02-22 01:51:31,135 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-02-22 01:51:31,135 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-02-22 01:51:31,135 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-02-22 01:51:31,136 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-02-22 01:51:31,137 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-02-22 01:51:31,138 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-02-22 01:51:31,138 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-02-22 01:51:31,139 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-02-22 01:51:31,140 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-02-22 01:51:31,141 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-02-22 01:51:31,142 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-02-22 01:51:31,143 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-02-22 01:51:31,144 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-02-22 01:51:31,144 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-02-22 01:51:31,144 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-02-22 01:51:31,148 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-02-22 01:51:31,149 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-02-22 01:51:31,150 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationWernerOverapprox_32.epf [2021-02-22 01:51:31,178 INFO L113 SettingsManager]: Loading preferences was successful [2021-02-22 01:51:31,179 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-02-22 01:51:31,181 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-02-22 01:51:31,183 INFO L138 SettingsManager]: * sizeof long=4 [2021-02-22 01:51:31,183 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-02-22 01:51:31,183 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-02-22 01:51:31,183 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-02-22 01:51:31,183 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-02-22 01:51:31,184 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-02-22 01:51:31,184 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-02-22 01:51:31,185 INFO L138 SettingsManager]: * sizeof long double=12 [2021-02-22 01:51:31,185 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-02-22 01:51:31,186 INFO L138 SettingsManager]: * Use constant arrays=true [2021-02-22 01:51:31,186 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-02-22 01:51:31,187 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-02-22 01:51:31,187 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2021-02-22 01:51:31,187 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-02-22 01:51:31,187 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-02-22 01:51:31,187 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-02-22 01:51:31,188 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-02-22 01:51:31,188 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2021-02-22 01:51:31,188 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-02-22 01:51:31,188 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=WERNER_OVERAPPROX [2021-02-22 01:51:31,188 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-22 01:51:31,621 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-02-22 01:51:31,651 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-02-22 01:51:31,654 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-02-22 01:51:31,655 INFO L271 PluginConnector]: Initializing CDTParser... [2021-02-22 01:51:31,661 INFO L275 PluginConnector]: CDTParser initialized [2021-02-22 01:51:31,662 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-22 01:51:31,754 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/64aae1e93/6c668f4944f947c3ae48ed433206a694/FLAGadd56d88d [2021-02-22 01:51:32,453 INFO L306 CDTParser]: Found 1 translation units. [2021-02-22 01:51:32,454 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/verifythis/elimination_max_rec.c [2021-02-22 01:51:32,462 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/64aae1e93/6c668f4944f947c3ae48ed433206a694/FLAGadd56d88d [2021-02-22 01:51:32,813 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/64aae1e93/6c668f4944f947c3ae48ed433206a694 [2021-02-22 01:51:32,816 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-02-22 01:51:32,830 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2021-02-22 01:51:32,833 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-02-22 01:51:32,834 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-02-22 01:51:32,838 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-02-22 01:51:32,839 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.02 01:51:32" (1/1) ... [2021-02-22 01:51:32,840 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2a3602be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.02 01:51:32, skipping insertion in model container [2021-02-22 01:51:32,840 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.02 01:51:32" (1/1) ... [2021-02-22 01:51:32,848 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-02-22 01:51:32,864 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-02-22 01:51:33,010 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-22 01:51:33,027 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-02-22 01:51:33,043 INFO L203 MainTranslator]: Completed pre-run [2021-02-22 01:51:33,056 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-22 01:51:33,065 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-02-22 01:51:33,084 INFO L208 MainTranslator]: Completed translation [2021-02-22 01:51:33,084 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.02 01:51:33 WrapperNode [2021-02-22 01:51:33,084 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-02-22 01:51:33,086 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-02-22 01:51:33,086 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-02-22 01:51:33,086 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-02-22 01:51:33,099 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.02 01:51:33" (1/1) ... [2021-02-22 01:51:33,100 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.02 01:51:33" (1/1) ... [2021-02-22 01:51:33,108 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.02 01:51:33" (1/1) ... [2021-02-22 01:51:33,109 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.02 01:51:33" (1/1) ... [2021-02-22 01:51:33,118 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.02 01:51:33" (1/1) ... [2021-02-22 01:51:33,120 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.02 01:51:33" (1/1) ... [2021-02-22 01:51:33,122 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.02 01:51:33" (1/1) ... [2021-02-22 01:51:33,125 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-02-22 01:51:33,129 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-02-22 01:51:33,129 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-02-22 01:51:33,129 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-02-22 01:51:33,130 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.02 01:51:33" (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-22 01:51:33,234 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2021-02-22 01:51:33,234 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-02-22 01:51:33,235 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2021-02-22 01:51:33,235 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2021-02-22 01:51:33,235 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2021-02-22 01:51:33,235 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2021-02-22 01:51:33,235 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2021-02-22 01:51:33,235 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2021-02-22 01:51:33,236 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2021-02-22 01:51:33,236 INFO L130 BoogieDeclarations]: Found specification of procedure free [2021-02-22 01:51:33,236 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2021-02-22 01:51:33,236 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2021-02-22 01:51:33,236 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2021-02-22 01:51:33,236 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-02-22 01:51:33,237 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2021-02-22 01:51:33,237 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2021-02-22 01:51:33,237 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2021-02-22 01:51:33,237 INFO L130 BoogieDeclarations]: Found specification of procedure check [2021-02-22 01:51:33,237 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-02-22 01:51:33,238 INFO L130 BoogieDeclarations]: Found specification of procedure main [2021-02-22 01:51:33,238 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-02-22 01:51:33,238 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2021-02-22 01:51:33,238 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-02-22 01:51:33,238 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2021-02-22 01:51:33,238 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-02-22 01:51:33,238 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-02-22 01:51:33,239 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-02-22 01:51:33,678 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-02-22 01:51:33,678 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2021-02-22 01:51:33,680 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.02 01:51:33 BoogieIcfgContainer [2021-02-22 01:51:33,680 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-02-22 01:51:33,682 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-02-22 01:51:33,683 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-02-22 01:51:33,686 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-02-22 01:51:33,687 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.02 01:51:32" (1/3) ... [2021-02-22 01:51:33,687 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@690c6200 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.02 01:51:33, skipping insertion in model container [2021-02-22 01:51:33,688 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.02 01:51:33" (2/3) ... [2021-02-22 01:51:33,688 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@690c6200 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.02 01:51:33, skipping insertion in model container [2021-02-22 01:51:33,688 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.02 01:51:33" (3/3) ... [2021-02-22 01:51:33,690 INFO L111 eAbstractionObserver]: Analyzing ICFG elimination_max_rec.c [2021-02-22 01:51:33,704 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2021-02-22 01:51:33,710 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2021-02-22 01:51:33,731 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-02-22 01:51:33,777 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-02-22 01:51:33,777 INFO L377 AbstractCegarLoop]: Hoare is true [2021-02-22 01:51:33,778 INFO L378 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2021-02-22 01:51:33,778 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-02-22 01:51:33,778 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-02-22 01:51:33,778 INFO L381 AbstractCegarLoop]: Difference is false [2021-02-22 01:51:33,778 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-02-22 01:51:33,779 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-02-22 01:51:33,811 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states. [2021-02-22 01:51:33,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-02-22 01:51:33,826 INFO L414 BasicCegarLoop]: Found error trace [2021-02-22 01:51:33,827 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-22 01:51:33,828 INFO L428 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-02-22 01:51:33,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-02-22 01:51:33,841 INFO L82 PathProgramCache]: Analyzing trace with hash 2141980220, now seen corresponding path program 1 times [2021-02-22 01:51:33,854 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-02-22 01:51:33,854 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1052425156] [2021-02-22 01:51:33,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-02-22 01:51:33,969 INFO L218 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-02-22 01:51:34,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 01:51:34,336 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:34,337 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 01:51:34,349 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:34,351 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-22 01:51:34,387 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:34,391 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-22 01:51:34,412 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:34,414 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-22 01:51:34,433 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:34,434 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-22 01:51:34,446 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:34,447 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-02-22 01:51:34,456 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:34,456 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-02-22 01:51:34,467 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:34,467 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 01:51:34,503 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-22 01:51:34,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 01:51:34,518 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:34,519 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 01:51:34,520 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-02-22 01:51:34,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 01:51:34,526 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:34,527 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 01:51:34,539 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-02-22 01:51:34,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 01:51:34,545 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:34,545 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 01:51:34,556 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-22 01:51:34,558 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1052425156] [2021-02-22 01:51:34,561 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-02-22 01:51:34,561 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-02-22 01:51:34,562 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [463476749] [2021-02-22 01:51:34,567 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-02-22 01:51:34,567 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-02-22 01:51:34,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-02-22 01:51:34,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2021-02-22 01:51:34,587 INFO L87 Difference]: Start difference. First operand 84 states. Second operand 10 states. [2021-02-22 01:51:35,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-02-22 01:51:35,716 INFO L93 Difference]: Finished difference Result 215 states and 247 transitions. [2021-02-22 01:51:35,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-02-22 01:51:35,718 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 36 [2021-02-22 01:51:35,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-02-22 01:51:35,729 INFO L225 Difference]: With dead ends: 215 [2021-02-22 01:51:35,729 INFO L226 Difference]: Without dead ends: 128 [2021-02-22 01:51:35,735 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=78, Invalid=228, Unknown=0, NotChecked=0, Total=306 [2021-02-22 01:51:35,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2021-02-22 01:51:35,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 113. [2021-02-22 01:51:35,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2021-02-22 01:51:35,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 120 transitions. [2021-02-22 01:51:35,812 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 120 transitions. Word has length 36 [2021-02-22 01:51:35,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-02-22 01:51:35,813 INFO L480 AbstractCegarLoop]: Abstraction has 113 states and 120 transitions. [2021-02-22 01:51:35,813 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2021-02-22 01:51:35,813 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 120 transitions. [2021-02-22 01:51:35,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-02-22 01:51:35,816 INFO L414 BasicCegarLoop]: Found error trace [2021-02-22 01:51:35,816 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-22 01:51:35,817 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-02-22 01:51:35,817 INFO L428 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-02-22 01:51:35,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-02-22 01:51:35,818 INFO L82 PathProgramCache]: Analyzing trace with hash 572347764, now seen corresponding path program 1 times [2021-02-22 01:51:35,818 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-02-22 01:51:35,818 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [865780752] [2021-02-22 01:51:35,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-02-22 01:51:35,822 INFO L218 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-02-22 01:51:35,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 01:51:35,914 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:35,916 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 01:51:35,917 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:35,918 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 6 [2021-02-22 01:51:35,922 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:35,922 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 6 [2021-02-22 01:51:35,927 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:35,927 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 6 [2021-02-22 01:51:35,934 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:35,935 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-02-22 01:51:35,947 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:35,949 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-02-22 01:51:35,966 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:35,967 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-02-22 01:51:35,978 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:35,979 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 01:51:36,010 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-22 01:51:36,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 01:51:36,046 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:36,046 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 01:51:36,047 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-02-22 01:51:36,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 01:51:36,059 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:36,060 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 01:51:36,070 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-02-22 01:51:36,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 01:51:36,093 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:36,094 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 6 [2021-02-22 01:51:36,107 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2021-02-22 01:51:36,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 01:51:36,114 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:36,114 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 01:51:36,123 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-22 01:51:36,123 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [865780752] [2021-02-22 01:51:36,124 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-02-22 01:51:36,124 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-02-22 01:51:36,124 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [695558584] [2021-02-22 01:51:36,125 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-02-22 01:51:36,125 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-02-22 01:51:36,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-02-22 01:51:36,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2021-02-22 01:51:36,126 INFO L87 Difference]: Start difference. First operand 113 states and 120 transitions. Second operand 11 states. [2021-02-22 01:51:36,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-02-22 01:51:36,884 INFO L93 Difference]: Finished difference Result 178 states and 190 transitions. [2021-02-22 01:51:36,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-02-22 01:51:36,885 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 57 [2021-02-22 01:51:36,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-02-22 01:51:36,887 INFO L225 Difference]: With dead ends: 178 [2021-02-22 01:51:36,887 INFO L226 Difference]: Without dead ends: 108 [2021-02-22 01:51:36,889 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=67, Invalid=239, Unknown=0, NotChecked=0, Total=306 [2021-02-22 01:51:36,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2021-02-22 01:51:36,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2021-02-22 01:51:36,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2021-02-22 01:51:36,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 114 transitions. [2021-02-22 01:51:36,918 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 114 transitions. Word has length 57 [2021-02-22 01:51:36,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-02-22 01:51:36,918 INFO L480 AbstractCegarLoop]: Abstraction has 108 states and 114 transitions. [2021-02-22 01:51:36,918 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2021-02-22 01:51:36,919 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 114 transitions. [2021-02-22 01:51:36,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-02-22 01:51:36,920 INFO L414 BasicCegarLoop]: Found error trace [2021-02-22 01:51:36,921 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-22 01:51:36,921 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-02-22 01:51:36,921 INFO L428 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-02-22 01:51:36,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-02-22 01:51:36,922 INFO L82 PathProgramCache]: Analyzing trace with hash -2023865644, now seen corresponding path program 1 times [2021-02-22 01:51:36,922 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-02-22 01:51:36,922 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [902452778] [2021-02-22 01:51:36,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-02-22 01:51:36,927 INFO L218 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-02-22 01:51:36,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 01:51:37,013 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:37,014 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 01:51:37,015 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:37,016 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-22 01:51:37,026 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:37,027 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-22 01:51:37,034 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:37,035 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-22 01:51:37,044 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:37,045 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-22 01:51:37,073 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:37,074 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-22 01:51:37,084 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:37,085 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-22 01:51:37,100 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:37,100 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-22 01:51:37,114 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:37,115 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-22 01:51:37,129 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:37,132 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-22 01:51:37,146 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:37,147 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-22 01:51:37,148 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:37,149 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-02-22 01:51:37,160 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:37,161 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-02-22 01:51:37,174 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:37,179 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 01:51:37,208 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-22 01:51:37,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 01:51:37,227 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:37,227 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 01:51:37,228 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-02-22 01:51:37,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 01:51:37,233 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:37,233 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 01:51:37,247 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-02-22 01:51:37,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 01:51:37,255 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:37,256 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 01:51:37,256 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2021-02-22 01:51:37,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 01:51:37,265 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:37,266 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 01:51:37,276 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-02-22 01:51:37,277 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [902452778] [2021-02-22 01:51:37,277 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-02-22 01:51:37,277 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-02-22 01:51:37,277 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583590125] [2021-02-22 01:51:37,278 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-02-22 01:51:37,278 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-02-22 01:51:37,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-02-22 01:51:37,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2021-02-22 01:51:37,279 INFO L87 Difference]: Start difference. First operand 108 states and 114 transitions. Second operand 15 states. [2021-02-22 01:51:38,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-02-22 01:51:38,856 INFO L93 Difference]: Finished difference Result 174 states and 187 transitions. [2021-02-22 01:51:38,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-02-22 01:51:38,856 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 57 [2021-02-22 01:51:38,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-02-22 01:51:38,864 INFO L225 Difference]: With dead ends: 174 [2021-02-22 01:51:38,864 INFO L226 Difference]: Without dead ends: 172 [2021-02-22 01:51:38,865 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=160, Invalid=710, Unknown=0, NotChecked=0, Total=870 [2021-02-22 01:51:38,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2021-02-22 01:51:38,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 152. [2021-02-22 01:51:38,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2021-02-22 01:51:38,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 162 transitions. [2021-02-22 01:51:38,943 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 162 transitions. Word has length 57 [2021-02-22 01:51:38,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-02-22 01:51:38,945 INFO L480 AbstractCegarLoop]: Abstraction has 152 states and 162 transitions. [2021-02-22 01:51:38,945 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2021-02-22 01:51:38,949 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 162 transitions. [2021-02-22 01:51:38,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2021-02-22 01:51:38,958 INFO L414 BasicCegarLoop]: Found error trace [2021-02-22 01:51:38,959 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-22 01:51:38,965 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-02-22 01:51:38,966 INFO L428 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-02-22 01:51:38,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-02-22 01:51:38,966 INFO L82 PathProgramCache]: Analyzing trace with hash 1959749596, now seen corresponding path program 1 times [2021-02-22 01:51:38,966 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-02-22 01:51:38,967 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [168760270] [2021-02-22 01:51:38,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-02-22 01:51:38,971 INFO L218 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-02-22 01:51:39,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 01:51:39,073 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:39,074 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 01:51:39,075 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:39,076 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-22 01:51:39,081 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:39,082 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-22 01:51:39,088 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:39,088 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-22 01:51:39,096 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:39,097 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-22 01:51:39,106 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:39,106 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-22 01:51:39,115 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:39,116 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-22 01:51:39,128 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:39,129 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-22 01:51:39,141 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:39,142 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-22 01:51:39,154 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:39,155 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-22 01:51:39,169 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:39,173 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-22 01:51:39,175 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:39,175 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-22 01:51:39,191 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:39,192 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-22 01:51:39,208 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:39,208 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-22 01:51:39,226 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:39,227 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-22 01:51:39,244 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:39,245 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-22 01:51:39,264 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:39,265 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-22 01:51:39,265 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:39,266 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-02-22 01:51:39,281 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:39,281 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-02-22 01:51:39,297 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:39,298 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 01:51:39,333 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-22 01:51:39,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 01:51:39,345 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:39,346 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 01:51:39,346 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-02-22 01:51:39,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 01:51:39,349 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:39,350 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 01:51:39,366 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-02-22 01:51:39,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 01:51:39,369 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:39,370 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 01:51:39,370 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2021-02-22 01:51:39,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 01:51:39,375 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:39,376 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 01:51:39,376 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2021-02-22 01:51:39,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 01:51:39,381 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:39,381 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 01:51:39,410 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-02-22 01:51:39,410 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [168760270] [2021-02-22 01:51:39,410 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-02-22 01:51:39,410 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2021-02-22 01:51:39,411 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [406434905] [2021-02-22 01:51:39,411 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states [2021-02-22 01:51:39,411 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-02-22 01:51:39,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-02-22 01:51:39,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=339, Unknown=0, NotChecked=0, Total=380 [2021-02-22 01:51:39,412 INFO L87 Difference]: Start difference. First operand 152 states and 162 transitions. Second operand 20 states. [2021-02-22 01:51:41,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-02-22 01:51:41,912 INFO L93 Difference]: Finished difference Result 238 states and 260 transitions. [2021-02-22 01:51:41,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2021-02-22 01:51:41,912 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 78 [2021-02-22 01:51:41,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-02-22 01:51:41,915 INFO L225 Difference]: With dead ends: 238 [2021-02-22 01:51:41,915 INFO L226 Difference]: Without dead ends: 236 [2021-02-22 01:51:41,917 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 289 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=332, Invalid=1648, Unknown=0, NotChecked=0, Total=1980 [2021-02-22 01:51:41,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2021-02-22 01:51:41,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 198. [2021-02-22 01:51:41,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198 states. [2021-02-22 01:51:41,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 214 transitions. [2021-02-22 01:51:41,966 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 214 transitions. Word has length 78 [2021-02-22 01:51:41,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-02-22 01:51:41,967 INFO L480 AbstractCegarLoop]: Abstraction has 198 states and 214 transitions. [2021-02-22 01:51:41,967 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2021-02-22 01:51:41,967 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 214 transitions. [2021-02-22 01:51:41,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2021-02-22 01:51:41,969 INFO L414 BasicCegarLoop]: Found error trace [2021-02-22 01:51:41,969 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-22 01:51:41,969 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-02-22 01:51:41,969 INFO L428 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-02-22 01:51:41,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-02-22 01:51:41,970 INFO L82 PathProgramCache]: Analyzing trace with hash -636463812, now seen corresponding path program 2 times [2021-02-22 01:51:41,970 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-02-22 01:51:41,970 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2107425282] [2021-02-22 01:51:41,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-02-22 01:51:41,973 INFO L218 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-02-22 01:51:41,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 01:51:42,038 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:42,039 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 01:51:42,040 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:42,040 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-22 01:51:42,046 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:42,047 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-22 01:51:42,053 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:42,054 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-22 01:51:42,061 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:42,062 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-22 01:51:42,070 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:42,071 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-22 01:51:42,082 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:42,083 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-22 01:51:42,095 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:42,098 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-22 01:51:42,110 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:42,111 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-22 01:51:42,123 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:42,123 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-22 01:51:42,136 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:42,138 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-22 01:51:42,141 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:42,145 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-22 01:51:42,159 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:42,159 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-22 01:51:42,175 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:42,175 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-22 01:51:42,191 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:42,192 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-22 01:51:42,208 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:42,210 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-22 01:51:42,227 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:42,228 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-22 01:51:42,229 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:42,230 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-02-22 01:51:42,243 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:42,245 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-02-22 01:51:42,259 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:42,260 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 01:51:42,300 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-22 01:51:42,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 01:51:42,306 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:42,307 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 01:51:42,307 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-02-22 01:51:42,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 01:51:42,310 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:42,311 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 01:51:42,328 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-02-22 01:51:42,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 01:51:42,331 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:42,332 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 01:51:42,332 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2021-02-22 01:51:42,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 01:51:42,337 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:42,337 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 01:51:42,337 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2021-02-22 01:51:42,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 01:51:42,341 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:42,342 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 01:51:42,356 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-02-22 01:51:42,357 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2107425282] [2021-02-22 01:51:42,357 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-02-22 01:51:42,357 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2021-02-22 01:51:42,357 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308866937] [2021-02-22 01:51:42,358 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states [2021-02-22 01:51:42,358 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-02-22 01:51:42,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-02-22 01:51:42,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=339, Unknown=0, NotChecked=0, Total=380 [2021-02-22 01:51:42,359 INFO L87 Difference]: Start difference. First operand 198 states and 214 transitions. Second operand 20 states. [2021-02-22 01:51:44,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-02-22 01:51:44,862 INFO L93 Difference]: Finished difference Result 281 states and 307 transitions. [2021-02-22 01:51:44,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2021-02-22 01:51:44,863 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 78 [2021-02-22 01:51:44,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-02-22 01:51:44,866 INFO L225 Difference]: With dead ends: 281 [2021-02-22 01:51:44,866 INFO L226 Difference]: Without dead ends: 279 [2021-02-22 01:51:44,868 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 244 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=305, Invalid=1501, Unknown=0, NotChecked=0, Total=1806 [2021-02-22 01:51:44,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2021-02-22 01:51:44,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 243. [2021-02-22 01:51:44,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243 states. [2021-02-22 01:51:44,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 264 transitions. [2021-02-22 01:51:44,913 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 264 transitions. Word has length 78 [2021-02-22 01:51:44,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-02-22 01:51:44,913 INFO L480 AbstractCegarLoop]: Abstraction has 243 states and 264 transitions. [2021-02-22 01:51:44,913 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2021-02-22 01:51:44,913 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 264 transitions. [2021-02-22 01:51:44,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2021-02-22 01:51:44,915 INFO L414 BasicCegarLoop]: Found error trace [2021-02-22 01:51:44,915 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-22 01:51:44,915 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-02-22 01:51:44,915 INFO L428 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-02-22 01:51:44,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-02-22 01:51:44,916 INFO L82 PathProgramCache]: Analyzing trace with hash 1871950108, now seen corresponding path program 1 times [2021-02-22 01:51:44,916 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-02-22 01:51:44,916 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [402707723] [2021-02-22 01:51:44,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-02-22 01:51:44,919 INFO L218 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-02-22 01:51:44,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 01:51:44,962 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:44,963 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 01:51:44,963 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:44,964 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 6 [2021-02-22 01:51:44,966 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:44,967 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 6 [2021-02-22 01:51:44,970 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:44,971 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 6 [2021-02-22 01:51:44,975 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:44,976 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 6 [2021-02-22 01:51:44,983 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:44,984 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-02-22 01:51:44,990 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:44,991 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-02-22 01:51:45,001 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:45,001 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-02-22 01:51:45,012 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:45,012 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-02-22 01:51:45,024 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:45,025 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-02-22 01:51:45,036 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:45,036 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-02-22 01:51:45,047 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:45,047 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-02-22 01:51:45,056 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:45,057 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-02-22 01:51:45,070 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:45,071 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 01:51:45,105 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-22 01:51:45,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 01:51:45,120 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:45,126 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 01:51:45,127 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-02-22 01:51:45,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 01:51:45,136 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:45,136 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 01:51:45,152 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-02-22 01:51:45,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 01:51:45,158 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:45,159 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 6 [2021-02-22 01:51:45,173 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2021-02-22 01:51:45,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 01:51:45,179 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:45,180 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 01:51:45,180 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-02-22 01:51:45,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 01:51:45,186 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:45,187 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 01:51:45,187 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2021-02-22 01:51:45,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 01:51:45,194 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:45,195 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 01:51:45,207 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-22 01:51:45,207 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [402707723] [2021-02-22 01:51:45,207 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-02-22 01:51:45,208 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2021-02-22 01:51:45,208 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [181567808] [2021-02-22 01:51:45,208 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-02-22 01:51:45,208 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-02-22 01:51:45,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-02-22 01:51:45,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=210, Unknown=0, NotChecked=0, Total=240 [2021-02-22 01:51:45,209 INFO L87 Difference]: Start difference. First operand 243 states and 264 transitions. Second operand 16 states. [2021-02-22 01:51:46,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-02-22 01:51:46,476 INFO L93 Difference]: Finished difference Result 257 states and 281 transitions. [2021-02-22 01:51:46,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-02-22 01:51:46,476 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 77 [2021-02-22 01:51:46,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-02-22 01:51:46,478 INFO L225 Difference]: With dead ends: 257 [2021-02-22 01:51:46,478 INFO L226 Difference]: Without dead ends: 157 [2021-02-22 01:51:46,480 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=156, Invalid=714, Unknown=0, NotChecked=0, Total=870 [2021-02-22 01:51:46,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2021-02-22 01:51:46,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 133. [2021-02-22 01:51:46,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2021-02-22 01:51:46,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 137 transitions. [2021-02-22 01:51:46,503 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 137 transitions. Word has length 77 [2021-02-22 01:51:46,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-02-22 01:51:46,504 INFO L480 AbstractCegarLoop]: Abstraction has 133 states and 137 transitions. [2021-02-22 01:51:46,504 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2021-02-22 01:51:46,504 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 137 transitions. [2021-02-22 01:51:46,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2021-02-22 01:51:46,505 INFO L414 BasicCegarLoop]: Found error trace [2021-02-22 01:51:46,506 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-22 01:51:46,506 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-02-22 01:51:46,506 INFO L428 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-02-22 01:51:46,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-02-22 01:51:46,507 INFO L82 PathProgramCache]: Analyzing trace with hash -177855180, now seen corresponding path program 2 times [2021-02-22 01:51:46,507 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-02-22 01:51:46,507 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [772333367] [2021-02-22 01:51:46,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-02-22 01:51:46,509 INFO L218 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-02-22 01:51:46,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 01:51:46,571 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:46,571 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 01:51:46,572 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:46,572 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-22 01:51:46,577 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:46,578 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-22 01:51:46,584 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:46,584 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-22 01:51:46,591 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:46,592 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-22 01:51:46,600 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:46,600 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-22 01:51:46,610 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:46,610 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-22 01:51:46,621 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:46,621 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-22 01:51:46,632 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:46,633 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-22 01:51:46,645 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:46,646 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-22 01:51:46,660 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:46,661 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-22 01:51:46,662 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:46,662 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-22 01:51:46,676 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:46,677 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-22 01:51:46,694 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:46,695 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-22 01:51:46,712 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:46,713 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-22 01:51:46,730 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:46,731 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-22 01:51:46,749 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:46,750 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-22 01:51:46,750 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:46,751 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-22 01:51:46,769 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:46,770 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-22 01:51:46,790 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:46,790 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-22 01:51:46,811 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:46,812 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-22 01:51:46,833 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:46,834 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-22 01:51:46,855 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:46,855 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-22 01:51:46,856 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:46,857 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-02-22 01:51:46,874 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:46,874 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-02-22 01:51:46,892 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:46,892 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 01:51:46,934 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-22 01:51:46,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 01:51:46,940 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:46,940 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 01:51:46,940 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-02-22 01:51:46,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 01:51:46,943 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:46,944 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 01:51:46,962 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-02-22 01:51:46,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 01:51:46,967 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:46,967 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 01:51:46,967 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2021-02-22 01:51:46,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 01:51:46,976 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:46,977 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 01:51:46,977 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2021-02-22 01:51:46,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 01:51:46,992 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:46,992 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 01:51:46,993 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2021-02-22 01:51:46,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 01:51:47,001 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:47,002 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 01:51:47,026 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-22 01:51:47,027 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [772333367] [2021-02-22 01:51:47,027 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-02-22 01:51:47,027 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2021-02-22 01:51:47,027 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1264847921] [2021-02-22 01:51:47,028 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states [2021-02-22 01:51:47,029 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-02-22 01:51:47,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-02-22 01:51:47,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=541, Unknown=0, NotChecked=0, Total=600 [2021-02-22 01:51:47,034 INFO L87 Difference]: Start difference. First operand 133 states and 137 transitions. Second operand 25 states. [2021-02-22 01:51:49,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-02-22 01:51:49,809 INFO L93 Difference]: Finished difference Result 180 states and 185 transitions. [2021-02-22 01:51:49,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2021-02-22 01:51:49,813 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 99 [2021-02-22 01:51:49,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-02-22 01:51:49,815 INFO L225 Difference]: With dead ends: 180 [2021-02-22 01:51:49,816 INFO L226 Difference]: Without dead ends: 118 [2021-02-22 01:51:49,818 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 641 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=632, Invalid=3028, Unknown=0, NotChecked=0, Total=3660 [2021-02-22 01:51:49,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2021-02-22 01:51:49,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 112. [2021-02-22 01:51:49,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2021-02-22 01:51:49,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 114 transitions. [2021-02-22 01:51:49,836 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 114 transitions. Word has length 99 [2021-02-22 01:51:49,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-02-22 01:51:49,836 INFO L480 AbstractCegarLoop]: Abstraction has 112 states and 114 transitions. [2021-02-22 01:51:49,836 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2021-02-22 01:51:49,836 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 114 transitions. [2021-02-22 01:51:49,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2021-02-22 01:51:49,837 INFO L414 BasicCegarLoop]: Found error trace [2021-02-22 01:51:49,838 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-22 01:51:49,838 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-02-22 01:51:49,838 INFO L428 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-02-22 01:51:49,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-02-22 01:51:49,839 INFO L82 PathProgramCache]: Analyzing trace with hash 852518516, now seen corresponding path program 3 times [2021-02-22 01:51:49,839 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-02-22 01:51:49,839 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2095433564] [2021-02-22 01:51:49,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-02-22 01:51:49,841 INFO L218 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-02-22 01:51:49,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 01:51:49,895 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:49,895 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 01:51:49,896 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:49,896 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-22 01:51:49,901 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:49,902 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-22 01:51:49,907 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:49,908 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-22 01:51:49,915 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:49,915 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-22 01:51:49,923 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:49,924 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-22 01:51:49,932 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:49,933 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-22 01:51:49,943 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:49,944 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-22 01:51:49,954 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:49,956 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-22 01:51:49,967 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:49,968 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-22 01:51:49,981 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:49,982 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-22 01:51:49,983 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:49,983 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-22 01:51:49,997 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:49,998 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-22 01:51:50,014 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:50,014 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-22 01:51:50,030 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:50,031 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-22 01:51:50,047 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:50,052 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-22 01:51:50,070 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:50,071 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-22 01:51:50,071 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:50,072 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-22 01:51:50,091 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:50,092 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-22 01:51:50,110 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:50,113 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-22 01:51:50,136 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:50,137 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-22 01:51:50,162 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:50,165 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-22 01:51:50,193 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:50,193 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-22 01:51:50,194 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:50,195 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-02-22 01:51:50,212 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:50,213 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-02-22 01:51:50,234 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:50,235 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 01:51:50,277 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-22 01:51:50,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 01:51:50,290 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:50,291 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 01:51:50,291 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-02-22 01:51:50,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 01:51:50,299 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:50,301 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 01:51:50,332 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-02-22 01:51:50,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 01:51:50,337 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:50,338 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 01:51:50,339 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2021-02-22 01:51:50,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 01:51:50,343 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:50,344 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 01:51:50,344 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2021-02-22 01:51:50,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 01:51:50,349 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:50,349 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 01:51:50,349 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2021-02-22 01:51:50,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 01:51:50,359 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:50,360 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 01:51:50,383 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-22 01:51:50,384 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2095433564] [2021-02-22 01:51:50,384 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-02-22 01:51:50,384 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2021-02-22 01:51:50,384 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111774524] [2021-02-22 01:51:50,385 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states [2021-02-22 01:51:50,385 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-02-22 01:51:50,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-02-22 01:51:50,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=541, Unknown=0, NotChecked=0, Total=600 [2021-02-22 01:51:50,387 INFO L87 Difference]: Start difference. First operand 112 states and 114 transitions. Second operand 25 states. [2021-02-22 01:51:52,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-02-22 01:51:52,892 INFO L93 Difference]: Finished difference Result 125 states and 127 transitions. [2021-02-22 01:51:52,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2021-02-22 01:51:52,893 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 99 [2021-02-22 01:51:52,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-02-22 01:51:52,894 INFO L225 Difference]: With dead ends: 125 [2021-02-22 01:51:52,895 INFO L226 Difference]: Without dead ends: 0 [2021-02-22 01:51:52,897 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 543 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=569, Invalid=2737, Unknown=0, NotChecked=0, Total=3306 [2021-02-22 01:51:52,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-02-22 01:51:52,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-02-22 01:51:52,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2021-02-22 01:51:52,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-02-22 01:51:52,898 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 99 [2021-02-22 01:51:52,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-02-22 01:51:52,899 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-02-22 01:51:52,899 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2021-02-22 01:51:52,899 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-02-22 01:51:52,899 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-02-22 01:51:52,899 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-02-22 01:51:52,901 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-02-22 01:51:55,661 WARN L202 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 47 [2021-02-22 01:51:55,785 WARN L202 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 29 [2021-02-22 01:51:55,949 WARN L202 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 40 [2021-02-22 01:51:56,109 WARN L202 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 40 [2021-02-22 01:51:56,346 WARN L202 SmtUtils]: Spent 233.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 45 [2021-02-22 01:51:56,532 WARN L202 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 42 [2021-02-22 01:51:56,743 WARN L202 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 44 [2021-02-22 01:51:56,960 WARN L202 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 47 [2021-02-22 01:51:57,232 WARN L202 SmtUtils]: Spent 240.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 50 [2021-02-22 01:51:57,392 WARN L202 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 38 [2021-02-22 01:51:57,581 WARN L202 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 38 [2021-02-22 01:51:57,822 WARN L202 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 46 [2021-02-22 01:51:58,006 WARN L202 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 45 [2021-02-22 01:51:58,213 WARN L202 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 47 [2021-02-22 01:51:58,362 WARN L202 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 38 [2021-02-22 01:51:58,583 WARN L202 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 47 [2021-02-22 01:51:58,770 WARN L202 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 45 [2021-02-22 01:51:58,935 WARN L202 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 38 [2021-02-22 01:51:59,162 WARN L202 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 49 [2021-02-22 01:51:59,300 WARN L202 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 33 [2021-02-22 01:51:59,429 WARN L202 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 29 [2021-02-22 01:51:59,643 WARN L202 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 47 [2021-02-22 01:51:59,876 WARN L202 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 51 [2021-02-22 01:52:00,037 WARN L202 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 38 [2021-02-22 01:52:00,267 WARN L202 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 51 [2021-02-22 01:52:00,485 WARN L202 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 47 [2021-02-22 01:52:00,644 WARN L202 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 38 [2021-02-22 01:52:00,862 WARN L202 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 47 [2021-02-22 01:52:01,099 WARN L202 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 42 [2021-02-22 01:52:01,223 WARN L202 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 39 [2021-02-22 01:52:01,454 WARN L202 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 48 [2021-02-22 01:52:01,629 WARN L202 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 38 [2021-02-22 01:52:01,830 WARN L202 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 38 [2021-02-22 01:52:01,995 WARN L202 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 29 [2021-02-22 01:52:02,204 WARN L202 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 45 [2021-02-22 01:52:02,407 WARN L202 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 43 [2021-02-22 01:52:02,627 WARN L202 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 47 [2021-02-22 01:52:02,807 WARN L202 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 40 [2021-02-22 01:52:03,006 WARN L202 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 42 [2021-02-22 01:52:03,012 INFO L189 CegarLoopUtils]: For program point reach_errorEXIT(line 5) no Hoare annotation was computed. [2021-02-22 01:52:03,012 INFO L189 CegarLoopUtils]: For program point reach_errorENTRY(line 5) no Hoare annotation was computed. [2021-02-22 01:52:03,012 INFO L189 CegarLoopUtils]: For program point reach_errorFINAL(line 5) no Hoare annotation was computed. [2021-02-22 01:52:03,013 INFO L192 CegarLoopUtils]: At program point L5-4(line 5) the Hoare annotation is: true [2021-02-22 01:52:03,013 INFO L192 CegarLoopUtils]: At program point L-1(line -1) the Hoare annotation is: true [2021-02-22 01:52:03,013 INFO L192 CegarLoopUtils]: At program point L-1-1(line -1) the Hoare annotation is: true [2021-02-22 01:52:03,013 INFO L192 CegarLoopUtils]: At program point ULTIMATE.initFINAL(line 5) the Hoare annotation is: true [2021-02-22 01:52:03,013 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-22 01:52:03,013 INFO L192 CegarLoopUtils]: At program point L5(line 5) the Hoare annotation is: true [2021-02-22 01:52:03,013 INFO L192 CegarLoopUtils]: At program point L5-1(line 5) the Hoare annotation is: true [2021-02-22 01:52:03,014 INFO L192 CegarLoopUtils]: At program point L5-2(line 5) the Hoare annotation is: true [2021-02-22 01:52:03,014 INFO L192 CegarLoopUtils]: At program point L5-3(line 5) the Hoare annotation is: true [2021-02-22 01:52:03,014 INFO L192 CegarLoopUtils]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2021-02-22 01:52:03,014 INFO L192 CegarLoopUtils]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2021-02-22 01:52:03,014 INFO L192 CegarLoopUtils]: At program point L-1(line -1) the Hoare annotation is: true [2021-02-22 01:52:03,014 INFO L192 CegarLoopUtils]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2021-02-22 01:52:03,014 INFO L192 CegarLoopUtils]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2021-02-22 01:52:03,014 INFO L192 CegarLoopUtils]: At program point assume_abort_if_notENTRY(lines 7 9) the Hoare annotation is: true [2021-02-22 01:52:03,014 INFO L192 CegarLoopUtils]: At program point L8(line 8) the Hoare annotation is: true [2021-02-22 01:52:03,015 INFO L192 CegarLoopUtils]: At program point L8-1(line 8) the Hoare annotation is: true [2021-02-22 01:52:03,015 INFO L192 CegarLoopUtils]: At program point L8-3(lines 7 9) the Hoare annotation is: true [2021-02-22 01:52:03,015 INFO L192 CegarLoopUtils]: At program point assume_abort_if_notEXIT(lines 7 9) the Hoare annotation is: true [2021-02-22 01:52:03,015 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-22 01:52:03,015 INFO L192 CegarLoopUtils]: At program point mainEXIT(lines 41 50) the Hoare annotation is: true [2021-02-22 01:52:03,015 INFO L192 CegarLoopUtils]: At program point L48(line 48) the Hoare annotation is: true [2021-02-22 01:52:03,015 INFO L192 CegarLoopUtils]: At program point L48-1(line 48) the Hoare annotation is: true [2021-02-22 01:52:03,015 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-22 01:52:03,016 INFO L185 CegarLoopUtils]: At program point L45(line 45) the Hoare annotation is: (= |#memory_int| |old(#memory_int)|) [2021-02-22 01:52:03,016 INFO L192 CegarLoopUtils]: At program point L46-1(line 46) the Hoare annotation is: true [2021-02-22 01:52:03,016 INFO L192 CegarLoopUtils]: At program point mainFINAL(lines 41 50) the Hoare annotation is: true [2021-02-22 01:52:03,016 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-22 01:52:03,016 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-22 01:52:03,016 INFO L192 CegarLoopUtils]: At program point L46-2(line 46) the Hoare annotation is: true [2021-02-22 01:52:03,016 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-22 01:52:03,017 INFO L192 CegarLoopUtils]: At program point L46-3(line 46) the Hoare annotation is: true [2021-02-22 01:52:03,017 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-22 01:52:03,017 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-22 01:52:03,017 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-22 01:52:03,017 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-22 01:52:03,018 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-22 01:52:03,018 INFO L192 CegarLoopUtils]: At program point checkENTRY(lines 16 39) the Hoare annotation is: true [2021-02-22 01:52:03,018 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-22 01:52:03,018 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-22 01:52:03,019 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-22 01:52:03,019 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-22 01:52:03,019 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-22 01:52:03,019 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-22 01:52:03,020 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-22 01:52:03,020 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-22 01:52:03,020 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-22 01:52:03,020 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-22 01:52:03,021 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-22 01:52:03,021 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-22 01:52:03,021 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-22 01:52:03,021 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-22 01:52:03,022 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-22 01:52:03,022 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-22 01:52:03,022 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-22 01:52:03,022 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-22 01:52:03,022 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-22 01:52:03,023 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-22 01:52:03,023 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-22 01:52:03,023 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-22 01:52:03,023 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-22 01:52:03,024 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-22 01:52:03,024 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-22 01:52:03,024 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-22 01:52:03,024 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-22 01:52:03,024 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-22 01:52:03,025 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-22 01:52:03,025 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-22 01:52:03,025 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-22 01:52:03,025 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-22 01:52:03,026 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-22 01:52:03,026 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-22 01:52:03,026 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-22 01:52:03,026 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-22 01:52:03,026 INFO L192 CegarLoopUtils]: At program point __VERIFIER_assertENTRY(lines 10 12) the Hoare annotation is: true [2021-02-22 01:52:03,027 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-22 01:52:03,027 INFO L185 CegarLoopUtils]: At program point L11-1(line 11) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2021-02-22 01:52:03,027 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-22 01:52:03,027 INFO L185 CegarLoopUtils]: At program point L11-2(line 11) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2021-02-22 01:52:03,027 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-22 01:52:03,027 INFO L185 CegarLoopUtils]: At program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 11) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2021-02-22 01:52:03,027 INFO L185 CegarLoopUtils]: At program point #Ultimate.meminitENTRY(line -1) the Hoare annotation is: (= |#memory_int| |old(#memory_int)|) [2021-02-22 01:52:03,028 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-22 01:52:03,028 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-22 01:52:03,045 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-22 01:52:03,048 INFO L168 Benchmark]: Toolchain (without parser) took 30229.95 ms. Allocated memory was 152.0 MB in the beginning and 332.4 MB in the end (delta: 180.4 MB). Free memory was 127.2 MB in the beginning and 139.4 MB in the end (delta: -12.2 MB). Peak memory consumption was 194.4 MB. Max. memory is 8.0 GB. [2021-02-22 01:52:03,048 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 152.0 MB. Free memory is still 125.6 MB. There was no memory consumed. Max. memory is 8.0 GB. [2021-02-22 01:52:03,048 INFO L168 Benchmark]: CACSL2BoogieTranslator took 251.67 ms. Allocated memory is still 152.0 MB. Free memory was 126.1 MB in the beginning and 115.9 MB in the end (delta: 10.2 MB). Peak memory consumption was 10.5 MB. Max. memory is 8.0 GB. [2021-02-22 01:52:03,049 INFO L168 Benchmark]: Boogie Preprocessor took 39.54 ms. Allocated memory is still 152.0 MB. Free memory was 115.9 MB in the beginning and 114.5 MB in the end (delta: 1.5 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. [2021-02-22 01:52:03,049 INFO L168 Benchmark]: RCFGBuilder took 551.70 ms. Allocated memory is still 152.0 MB. Free memory was 114.3 MB in the beginning and 126.8 MB in the end (delta: -12.5 MB). Peak memory consumption was 19.1 MB. Max. memory is 8.0 GB. [2021-02-22 01:52:03,049 INFO L168 Benchmark]: TraceAbstraction took 29364.82 ms. Allocated memory was 152.0 MB in the beginning and 332.4 MB in the end (delta: 180.4 MB). Free memory was 126.8 MB in the beginning and 139.4 MB in the end (delta: -12.6 MB). Peak memory consumption was 193.1 MB. Max. memory is 8.0 GB. [2021-02-22 01:52:03,050 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.16 ms. Allocated memory is still 152.0 MB. Free memory is still 125.6 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 251.67 ms. Allocated memory is still 152.0 MB. Free memory was 126.1 MB in the beginning and 115.9 MB in the end (delta: 10.2 MB). Peak memory consumption was 10.5 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 39.54 ms. Allocated memory is still 152.0 MB. Free memory was 115.9 MB in the beginning and 114.5 MB in the end (delta: 1.5 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. * RCFGBuilder took 551.70 ms. Allocated memory is still 152.0 MB. Free memory was 114.3 MB in the beginning and 126.8 MB in the end (delta: -12.5 MB). Peak memory consumption was 19.1 MB. Max. memory is 8.0 GB. * TraceAbstraction took 29364.82 ms. Allocated memory was 152.0 MB in the beginning and 332.4 MB in the end (delta: 180.4 MB). Free memory was 126.8 MB in the beginning and 139.4 MB in the end (delta: -12.6 MB). Peak memory consumption was 193.1 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...