/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_Bitvector.epf -i ../../../trunk/examples/svcomp/list-simple/dll2c_insert_unequal.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-a10ec3b [2022-01-10 06:07:12,943 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-10 06:07:12,945 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-10 06:07:12,986 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-10 06:07:12,986 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-10 06:07:12,987 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-10 06:07:12,997 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-10 06:07:13,006 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-10 06:07:13,008 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-10 06:07:13,012 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-10 06:07:13,012 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-10 06:07:13,013 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-10 06:07:13,014 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-10 06:07:13,014 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-10 06:07:13,016 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-10 06:07:13,019 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-10 06:07:13,019 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-10 06:07:13,020 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-10 06:07:13,023 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-10 06:07:13,028 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-10 06:07:13,029 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-10 06:07:13,030 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-10 06:07:13,031 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-10 06:07:13,032 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-10 06:07:13,036 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-10 06:07:13,036 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-10 06:07:13,036 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-10 06:07:13,037 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-10 06:07:13,037 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-10 06:07:13,037 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-10 06:07:13,037 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-10 06:07:13,038 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-10 06:07:13,038 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-10 06:07:13,039 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-10 06:07:13,039 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-10 06:07:13,039 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-10 06:07:13,039 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-10 06:07:13,040 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-10 06:07:13,040 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-10 06:07:13,040 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-10 06:07:13,040 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-10 06:07:13,041 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_Bitvector.epf [2022-01-10 06:07:13,065 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-10 06:07:13,065 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-10 06:07:13,065 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-10 06:07:13,065 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-10 06:07:13,066 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-01-10 06:07:13,066 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-01-10 06:07:13,067 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-10 06:07:13,067 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-10 06:07:13,067 INFO L138 SettingsManager]: * Use SBE=true [2022-01-10 06:07:13,067 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-10 06:07:13,067 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-10 06:07:13,068 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-10 06:07:13,068 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-10 06:07:13,068 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-10 06:07:13,068 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-10 06:07:13,068 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-01-10 06:07:13,068 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-01-10 06:07:13,068 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-01-10 06:07:13,068 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-10 06:07:13,068 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-10 06:07:13,068 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-10 06:07:13,068 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-10 06:07:13,069 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-10 06:07:13,069 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 06:07:13,069 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-10 06:07:13,069 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-10 06:07:13,069 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-10 06:07:13,069 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-01-10 06:07:13,069 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-01-10 06:07:13,069 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-10 06:07:13,069 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-10 06:07:13,069 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-10 06:07:13,070 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-01-10 06:07:13,070 INFO L138 SettingsManager]: * Logic for external solver=AUFBV WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-01-10 06:07:13,280 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-10 06:07:13,296 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-10 06:07:13,298 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-10 06:07:13,299 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-10 06:07:13,300 INFO L275 PluginConnector]: CDTParser initialized [2022-01-10 06:07:13,301 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-simple/dll2c_insert_unequal.i [2022-01-10 06:07:13,363 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e36f6dd09/9624eb461b9c456d809798f1e7369e64/FLAGb39bdb617 [2022-01-10 06:07:13,728 INFO L306 CDTParser]: Found 1 translation units. [2022-01-10 06:07:13,728 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-simple/dll2c_insert_unequal.i [2022-01-10 06:07:13,742 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e36f6dd09/9624eb461b9c456d809798f1e7369e64/FLAGb39bdb617 [2022-01-10 06:07:14,104 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e36f6dd09/9624eb461b9c456d809798f1e7369e64 [2022-01-10 06:07:14,107 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-10 06:07:14,109 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-01-10 06:07:14,110 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-10 06:07:14,110 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-10 06:07:14,113 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-10 06:07:14,113 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 06:07:14" (1/1) ... [2022-01-10 06:07:14,115 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@673d62cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:07:14, skipping insertion in model container [2022-01-10 06:07:14,115 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 06:07:14" (1/1) ... [2022-01-10 06:07:14,120 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-10 06:07:14,159 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-10 06:07:14,467 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/list-simple/dll2c_insert_unequal.i[25148,25161] [2022-01-10 06:07:14,470 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 06:07:14,479 INFO L203 MainTranslator]: Completed pre-run [2022-01-10 06:07:14,526 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/list-simple/dll2c_insert_unequal.i[25148,25161] [2022-01-10 06:07:14,527 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 06:07:14,554 INFO L208 MainTranslator]: Completed translation [2022-01-10 06:07:14,555 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:07:14 WrapperNode [2022-01-10 06:07:14,555 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-10 06:07:14,556 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-10 06:07:14,556 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-10 06:07:14,556 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-10 06:07:14,561 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:07:14" (1/1) ... [2022-01-10 06:07:14,588 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:07:14" (1/1) ... [2022-01-10 06:07:14,613 INFO L137 Inliner]: procedures = 130, calls = 58, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 186 [2022-01-10 06:07:14,614 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-10 06:07:14,615 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-10 06:07:14,615 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-10 06:07:14,615 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-10 06:07:14,620 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:07:14" (1/1) ... [2022-01-10 06:07:14,621 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:07:14" (1/1) ... [2022-01-10 06:07:14,633 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:07:14" (1/1) ... [2022-01-10 06:07:14,633 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:07:14" (1/1) ... [2022-01-10 06:07:14,648 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:07:14" (1/1) ... [2022-01-10 06:07:14,651 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:07:14" (1/1) ... [2022-01-10 06:07:14,652 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:07:14" (1/1) ... [2022-01-10 06:07:14,654 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-10 06:07:14,655 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-10 06:07:14,655 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-10 06:07:14,655 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-10 06:07:14,667 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:07:14" (1/1) ... [2022-01-10 06:07:14,680 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 06:07:14,689 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 06:07:14,721 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-01-10 06:07:14,741 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-01-10 06:07:14,754 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-01-10 06:07:14,755 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2022-01-10 06:07:14,755 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2022-01-10 06:07:14,755 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-01-10 06:07:14,755 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-10 06:07:14,755 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-01-10 06:07:14,755 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-01-10 06:07:14,755 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-01-10 06:07:14,755 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-01-10 06:07:14,756 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-01-10 06:07:14,756 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-01-10 06:07:14,756 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-01-10 06:07:14,756 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-10 06:07:14,756 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-10 06:07:14,881 INFO L234 CfgBuilder]: Building ICFG [2022-01-10 06:07:14,884 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-10 06:07:15,303 INFO L275 CfgBuilder]: Performing block encoding [2022-01-10 06:07:15,307 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-10 06:07:15,307 INFO L299 CfgBuilder]: Removed 5 assume(true) statements. [2022-01-10 06:07:15,309 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 06:07:15 BoogieIcfgContainer [2022-01-10 06:07:15,309 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-10 06:07:15,310 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-10 06:07:15,310 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-10 06:07:15,312 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-10 06:07:15,312 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 06:07:14" (1/3) ... [2022-01-10 06:07:15,313 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34b57f7e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 06:07:15, skipping insertion in model container [2022-01-10 06:07:15,313 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:07:14" (2/3) ... [2022-01-10 06:07:15,313 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34b57f7e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 06:07:15, skipping insertion in model container [2022-01-10 06:07:15,313 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 06:07:15" (3/3) ... [2022-01-10 06:07:15,314 INFO L111 eAbstractionObserver]: Analyzing ICFG dll2c_insert_unequal.i [2022-01-10 06:07:15,317 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-10 06:07:15,317 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-10 06:07:15,353 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-10 06:07:15,357 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-01-10 06:07:15,358 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-01-10 06:07:15,371 INFO L276 IsEmpty]: Start isEmpty. Operand has 44 states, 38 states have (on average 1.5263157894736843) internal successors, (58), 39 states have internal predecessors, (58), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-01-10 06:07:15,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-01-10 06:07:15,375 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 06:07:15,375 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 06:07:15,376 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 06:07:15,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 06:07:15,381 INFO L85 PathProgramCache]: Analyzing trace with hash 1243287101, now seen corresponding path program 1 times [2022-01-10 06:07:15,391 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 06:07:15,392 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1109117974] [2022-01-10 06:07:15,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 06:07:15,393 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 06:07:15,393 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 06:07:15,395 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 06:07:15,396 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-01-10 06:07:15,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 06:07:15,608 INFO L263 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 1 conjunts are in the unsatisfiable core [2022-01-10 06:07:15,612 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 06:07:15,678 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 06:07:15,678 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 06:07:15,679 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 06:07:15,679 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1109117974] [2022-01-10 06:07:15,679 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1109117974] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 06:07:15,680 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 06:07:15,680 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 06:07:15,681 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389657891] [2022-01-10 06:07:15,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 06:07:15,686 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-01-10 06:07:15,686 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 06:07:15,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-01-10 06:07:15,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-01-10 06:07:15,709 INFO L87 Difference]: Start difference. First operand has 44 states, 38 states have (on average 1.5263157894736843) internal successors, (58), 39 states have internal predecessors, (58), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-10 06:07:15,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 06:07:15,728 INFO L93 Difference]: Finished difference Result 79 states and 114 transitions. [2022-01-10 06:07:15,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-01-10 06:07:15,730 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 25 [2022-01-10 06:07:15,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 06:07:15,734 INFO L225 Difference]: With dead ends: 79 [2022-01-10 06:07:15,734 INFO L226 Difference]: Without dead ends: 36 [2022-01-10 06:07:15,737 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-01-10 06:07:15,739 INFO L933 BasicCegarLoop]: 58 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 06:07:15,740 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 06:07:15,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-01-10 06:07:15,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2022-01-10 06:07:15,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 31 states have (on average 1.3225806451612903) internal successors, (41), 31 states have internal predecessors, (41), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-01-10 06:07:15,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 47 transitions. [2022-01-10 06:07:15,770 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 47 transitions. Word has length 25 [2022-01-10 06:07:15,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 06:07:15,771 INFO L470 AbstractCegarLoop]: Abstraction has 36 states and 47 transitions. [2022-01-10 06:07:15,771 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-10 06:07:15,771 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 47 transitions. [2022-01-10 06:07:15,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-01-10 06:07:15,775 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 06:07:15,775 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 06:07:15,787 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-01-10 06:07:15,984 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 06:07:15,985 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 06:07:15,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 06:07:15,986 INFO L85 PathProgramCache]: Analyzing trace with hash -709703190, now seen corresponding path program 1 times [2022-01-10 06:07:15,986 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 06:07:15,986 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [872147082] [2022-01-10 06:07:15,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 06:07:15,987 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 06:07:15,987 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 06:07:15,988 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 06:07:15,990 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-01-10 06:07:16,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 06:07:16,128 INFO L263 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 4 conjunts are in the unsatisfiable core [2022-01-10 06:07:16,130 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 06:07:16,184 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 06:07:16,184 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 06:07:16,184 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 06:07:16,184 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [872147082] [2022-01-10 06:07:16,184 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [872147082] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 06:07:16,184 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 06:07:16,185 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 06:07:16,185 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289268503] [2022-01-10 06:07:16,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 06:07:16,186 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 06:07:16,186 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 06:07:16,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 06:07:16,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 06:07:16,187 INFO L87 Difference]: Start difference. First operand 36 states and 47 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-10 06:07:16,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 06:07:16,198 INFO L93 Difference]: Finished difference Result 68 states and 89 transitions. [2022-01-10 06:07:16,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 06:07:16,198 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 25 [2022-01-10 06:07:16,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 06:07:16,199 INFO L225 Difference]: With dead ends: 68 [2022-01-10 06:07:16,199 INFO L226 Difference]: Without dead ends: 41 [2022-01-10 06:07:16,199 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 06:07:16,200 INFO L933 BasicCegarLoop]: 46 mSDtfsCounter, 4 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 06:07:16,201 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5 Valid, 87 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 06:07:16,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2022-01-10 06:07:16,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 37. [2022-01-10 06:07:16,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 32 states have (on average 1.3125) internal successors, (42), 32 states have internal predecessors, (42), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-01-10 06:07:16,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 48 transitions. [2022-01-10 06:07:16,205 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 48 transitions. Word has length 25 [2022-01-10 06:07:16,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 06:07:16,205 INFO L470 AbstractCegarLoop]: Abstraction has 37 states and 48 transitions. [2022-01-10 06:07:16,206 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-10 06:07:16,206 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 48 transitions. [2022-01-10 06:07:16,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-01-10 06:07:16,206 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 06:07:16,206 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 06:07:16,218 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-01-10 06:07:16,415 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 06:07:16,416 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 06:07:16,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 06:07:16,416 INFO L85 PathProgramCache]: Analyzing trace with hash -37646058, now seen corresponding path program 1 times [2022-01-10 06:07:16,417 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 06:07:16,417 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [659745333] [2022-01-10 06:07:16,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 06:07:16,417 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 06:07:16,417 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 06:07:16,418 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 06:07:16,420 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-01-10 06:07:16,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 06:07:16,609 INFO L263 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 5 conjunts are in the unsatisfiable core [2022-01-10 06:07:16,612 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 06:07:16,682 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-01-10 06:07:16,683 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 06:07:16,683 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 06:07:16,683 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [659745333] [2022-01-10 06:07:16,683 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [659745333] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 06:07:16,683 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 06:07:16,683 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-10 06:07:16,683 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143690227] [2022-01-10 06:07:16,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 06:07:16,684 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 06:07:16,684 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 06:07:16,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 06:07:16,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-10 06:07:16,685 INFO L87 Difference]: Start difference. First operand 37 states and 48 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-01-10 06:07:16,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 06:07:16,724 INFO L93 Difference]: Finished difference Result 55 states and 73 transitions. [2022-01-10 06:07:16,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-10 06:07:16,725 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 35 [2022-01-10 06:07:16,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 06:07:16,726 INFO L225 Difference]: With dead ends: 55 [2022-01-10 06:07:16,726 INFO L226 Difference]: Without dead ends: 38 [2022-01-10 06:07:16,726 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-01-10 06:07:16,727 INFO L933 BasicCegarLoop]: 44 mSDtfsCounter, 28 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 06:07:16,727 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [28 Valid, 93 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 06:07:16,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-01-10 06:07:16,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2022-01-10 06:07:16,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 33 states have (on average 1.303030303030303) internal successors, (43), 33 states have internal predecessors, (43), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-01-10 06:07:16,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 49 transitions. [2022-01-10 06:07:16,730 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 49 transitions. Word has length 35 [2022-01-10 06:07:16,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 06:07:16,731 INFO L470 AbstractCegarLoop]: Abstraction has 38 states and 49 transitions. [2022-01-10 06:07:16,731 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-01-10 06:07:16,731 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 49 transitions. [2022-01-10 06:07:16,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-01-10 06:07:16,731 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 06:07:16,732 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 06:07:16,741 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Ended with exit code 0 [2022-01-10 06:07:16,932 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 06:07:16,932 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 06:07:16,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 06:07:16,933 INFO L85 PathProgramCache]: Analyzing trace with hash 368663721, now seen corresponding path program 1 times [2022-01-10 06:07:16,933 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 06:07:16,934 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1636322017] [2022-01-10 06:07:16,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 06:07:16,934 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 06:07:16,934 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 06:07:16,935 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 06:07:16,936 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-01-10 06:07:17,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 06:07:17,412 INFO L263 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 123 conjunts are in the unsatisfiable core [2022-01-10 06:07:17,420 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 06:07:17,473 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-01-10 06:07:17,552 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-01-10 06:07:17,693 INFO L353 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-01-10 06:07:17,694 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 26 [2022-01-10 06:07:17,878 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-01-10 06:07:17,954 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-01-10 06:07:18,116 INFO L353 Elim1Store]: treesize reduction 30, result has 45.5 percent of original size [2022-01-10 06:07:18,116 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 25 treesize of output 42 [2022-01-10 06:07:18,260 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-01-10 06:07:18,275 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2022-01-10 06:07:18,447 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-01-10 06:07:18,487 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-01-10 06:07:18,848 INFO L353 Elim1Store]: treesize reduction 48, result has 23.8 percent of original size [2022-01-10 06:07:18,848 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 109 treesize of output 66 [2022-01-10 06:07:18,866 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-01-10 06:07:18,874 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 06:07:18,880 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 23 [2022-01-10 06:07:18,890 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 18 [2022-01-10 06:07:19,283 INFO L353 Elim1Store]: treesize reduction 29, result has 12.1 percent of original size [2022-01-10 06:07:19,283 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 86 treesize of output 44 [2022-01-10 06:07:19,297 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-01-10 06:07:19,312 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2022-01-10 06:07:19,323 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-01-10 06:07:19,692 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 06:07:19,722 INFO L353 Elim1Store]: treesize reduction 52, result has 17.5 percent of original size [2022-01-10 06:07:19,723 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 92 treesize of output 80 [2022-01-10 06:07:19,745 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 06:07:19,747 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-01-10 06:07:19,772 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 06:07:19,814 INFO L353 Elim1Store]: treesize reduction 12, result has 67.6 percent of original size [2022-01-10 06:07:19,815 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 41 treesize of output 45 [2022-01-10 06:07:19,878 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-01-10 06:07:20,938 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 06:07:21,249 INFO L353 Elim1Store]: treesize reduction 354, result has 8.8 percent of original size [2022-01-10 06:07:21,250 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 12 case distinctions, treesize of input 282 treesize of output 147 [2022-01-10 06:07:21,471 INFO L353 Elim1Store]: treesize reduction 90, result has 15.1 percent of original size [2022-01-10 06:07:21,471 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 9 case distinctions, treesize of input 318 treesize of output 208 [2022-01-10 06:07:21,509 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 63 [2022-01-10 06:07:21,531 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 06:07:21,547 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 06:07:21,550 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 06:07:21,551 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 111 treesize of output 69 [2022-01-10 06:07:21,574 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 43 [2022-01-10 06:07:21,595 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 06:07:21,607 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 06:07:21,609 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 64 [2022-01-10 06:07:21,634 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 21 [2022-01-10 06:07:22,358 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 06:07:22,364 INFO L353 Elim1Store]: treesize reduction 28, result has 3.4 percent of original size [2022-01-10 06:07:22,364 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 2 case distinctions, treesize of input 240 treesize of output 146 [2022-01-10 06:07:22,439 INFO L353 Elim1Store]: treesize reduction 67, result has 5.6 percent of original size [2022-01-10 06:07:22,440 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 126 treesize of output 43 [2022-01-10 06:07:22,612 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-01-10 06:07:22,673 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-10 06:07:22,674 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 06:07:23,021 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_475 (Array (_ BitVec 64) (_ BitVec 32))) (v_ArrVal_449 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_456 (Array (_ BitVec 64) (_ BitVec 32))) (v_ArrVal_474 (Array (_ BitVec 64) (_ BitVec 64))) (|ULTIMATE.start_dll_circular_insert_~last~1#1.offset| (_ BitVec 64)) (v_ArrVal_452 (_ BitVec 32)) (|ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| (_ BitVec 64))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse1 (bvadd (_ bv8 64) |ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|))) (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base|) |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.offset| v_ArrVal_452)) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_456) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_475) (select (select (store (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base|) |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.offset| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|)))) (store .cse0 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store (select .cse0 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse1 |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base|) |ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|))) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_474) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (bvadd (select (select (store (let ((.cse2 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base|) |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.offset| |ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|)))) (store .cse2 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store (select .cse2 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse1 |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.offset|) |ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| |ULTIMATE.start_dll_circular_insert_~last~1#1.offset|))) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_449) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) (_ bv16 64)))))) is different from false [2022-01-10 06:07:23,217 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_475 (Array (_ BitVec 64) (_ BitVec 32))) (v_ArrVal_449 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_456 (Array (_ BitVec 64) (_ BitVec 32))) (|v_ULTIMATE.start_dll_circular_insert_~last~1#1.offset_8| (_ BitVec 64)) (v_ArrVal_474 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_452 (_ BitVec 32)) (|ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| (_ BitVec 64))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse3 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|))) (let ((.cse2 (bvadd (_ bv8 64) |ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|)) (.cse0 (select .cse3 |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset|))) (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset| v_ArrVal_452)) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_456) .cse0 v_ArrVal_475) (select (select (store (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| (store .cse3 |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|)))) (store .cse1 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store (select .cse1 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse2 |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|) |ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| .cse0))) .cse0 v_ArrVal_474) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (bvadd (_ bv16 64) (select (select (store (let ((.cse4 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset| |ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|)))) (store .cse4 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store (select .cse4 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse2 |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset|) |ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| |v_ULTIMATE.start_dll_circular_insert_~last~1#1.offset_8|))) .cse0 v_ArrVal_449) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))))) is different from false [2022-01-10 06:07:23,347 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_475 (Array (_ BitVec 64) (_ BitVec 32))) (v_ArrVal_449 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_456 (Array (_ BitVec 64) (_ BitVec 32))) (|v_ULTIMATE.start_dll_circular_insert_~last~1#1.offset_8| (_ BitVec 64)) (v_ArrVal_474 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_452 (_ BitVec 32)) (|ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| (_ BitVec 64))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|))) (let ((.cse5 (select |c_#memory_$Pointer$.base| .cse0)) (.cse1 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|))) (let ((.cse4 (bvadd (_ bv8 64) |ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|)) (.cse2 (select .cse5 .cse1))) (select (select (store (store (store |c_#memory_int| .cse0 (store (select |c_#memory_int| .cse0) .cse1 v_ArrVal_452)) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_456) .cse2 v_ArrVal_475) (select (select (store (let ((.cse3 (store |c_#memory_$Pointer$.base| .cse0 (store .cse5 .cse1 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|)))) (store .cse3 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| (store (store (select .cse3 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) .cse4 .cse0) |ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| .cse2))) .cse2 v_ArrVal_474) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (bvadd (select (select (store (let ((.cse6 (store |c_#memory_$Pointer$.offset| .cse0 (store (select |c_#memory_$Pointer$.offset| .cse0) .cse1 |ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|)))) (store .cse6 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| (store (store (select .cse6 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) .cse4 .cse1) |ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| |v_ULTIMATE.start_dll_circular_insert_~last~1#1.offset_8|))) .cse2 v_ArrVal_449) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) (_ bv16 64)))))))) is different from false [2022-01-10 06:07:27,564 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 06:07:27,564 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1636322017] [2022-01-10 06:07:27,565 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1636322017] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 06:07:27,565 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1115017169] [2022-01-10 06:07:27,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 06:07:27,565 INFO L168 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-01-10 06:07:27,565 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-01-10 06:07:27,567 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-01-10 06:07:27,587 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (6)] Waiting until timeout for monitored process [2022-01-10 06:07:28,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 06:07:28,211 INFO L263 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 89 conjunts are in the unsatisfiable core [2022-01-10 06:07:28,218 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 06:07:28,667 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-01-10 06:07:29,529 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2022-01-10 06:07:29,857 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-01-10 06:07:30,111 INFO L353 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-01-10 06:07:30,112 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 28 [2022-01-10 06:07:30,405 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2022-01-10 06:07:30,443 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-01-10 06:07:30,736 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-01-10 06:07:30,761 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-01-10 06:07:31,565 INFO L353 Elim1Store]: treesize reduction 34, result has 24.4 percent of original size [2022-01-10 06:07:31,566 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 104 treesize of output 93 [2022-01-10 06:07:31,574 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 06:07:31,579 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 21 [2022-01-10 06:07:31,586 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 52 [2022-01-10 06:07:31,596 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2022-01-10 06:07:31,604 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 18 [2022-01-10 06:07:31,621 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 19 [2022-01-10 06:07:31,628 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2022-01-10 06:07:32,328 INFO L353 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-01-10 06:07:32,329 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 70 treesize of output 33 [2022-01-10 06:07:32,340 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-01-10 06:07:32,347 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-01-10 06:07:32,353 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-01-10 06:07:33,324 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 06:07:33,347 INFO L353 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-01-10 06:07:33,348 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 76 treesize of output 64 [2022-01-10 06:07:33,365 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 06:07:33,367 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-01-10 06:07:33,411 INFO L353 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2022-01-10 06:07:33,412 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 34 [2022-01-10 06:07:33,742 INFO L353 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-01-10 06:07:33,742 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2022-01-10 06:07:33,771 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-01-10 06:07:36,430 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 06:07:36,602 INFO L353 Elim1Store]: treesize reduction 82, result has 16.3 percent of original size [2022-01-10 06:07:36,603 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 163 treesize of output 125 [2022-01-10 06:07:36,648 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 45 [2022-01-10 06:07:36,688 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 06:07:36,700 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 06:07:36,788 INFO L353 Elim1Store]: treesize reduction 54, result has 27.0 percent of original size [2022-01-10 06:07:36,788 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 45 treesize of output 50 [2022-01-10 06:07:36,806 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 25 [2022-01-10 06:07:36,825 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2022-01-10 06:07:38,298 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 22 [2022-01-10 06:07:38,357 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-01-10 06:07:39,989 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-01-10 06:07:40,002 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 06:07:40,003 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 06:07:40,041 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_636 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_634 (_ BitVec 32)) (v_ArrVal_638 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_637 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_639 (Array (_ BitVec 64) (_ BitVec 32))) (v_ArrVal_631 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_630 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_635 (Array (_ BitVec 64) (_ BitVec 32))) (v_ArrVal_640 (Array (_ BitVec 64) (_ BitVec 64)))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base|) |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.offset| v_ArrVal_634)) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_639) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_635) (select (select (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_630) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_637) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_640) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (bvadd (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_636) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_631) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_638) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) (_ bv16 64))))) is different from false [2022-01-10 06:07:40,083 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_636 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_634 (_ BitVec 32)) (v_ArrVal_638 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_637 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_639 (Array (_ BitVec 64) (_ BitVec 32))) (v_ArrVal_631 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_630 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_635 (Array (_ BitVec 64) (_ BitVec 32))) (v_ArrVal_640 (Array (_ BitVec 64) (_ BitVec 64)))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset|))) (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset| v_ArrVal_634)) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_639) .cse0 v_ArrVal_635) (select (select (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_630) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_637) .cse0 v_ArrVal_640) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (bvadd (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_636) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_631) .cse0 v_ArrVal_638) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) (_ bv16 64)))))) is different from false [2022-01-10 06:07:40,113 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_636 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_634 (_ BitVec 32)) (v_ArrVal_638 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_637 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_639 (Array (_ BitVec 64) (_ BitVec 32))) (v_ArrVal_631 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_630 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_635 (Array (_ BitVec 64) (_ BitVec 32))) (v_ArrVal_640 (Array (_ BitVec 64) (_ BitVec 64)))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|)) (.cse1 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| .cse0) .cse1))) (select (select (store (store (store |c_#memory_int| .cse0 (store (select |c_#memory_int| .cse0) .cse1 v_ArrVal_634)) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_639) .cse2 v_ArrVal_635) (select (select (store (store (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_630) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_637) .cse2 v_ArrVal_640) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (bvadd (select (select (store (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_636) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_631) .cse2 v_ArrVal_638) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) (_ bv16 64))))))) is different from false [2022-01-10 06:07:41,886 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1115017169] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 06:07:41,886 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-10 06:07:41,886 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 26] total 48 [2022-01-10 06:07:41,886 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413620676] [2022-01-10 06:07:41,886 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-10 06:07:41,887 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2022-01-10 06:07:41,887 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 06:07:41,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2022-01-10 06:07:41,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=194, Invalid=2525, Unknown=61, NotChecked=642, Total=3422 [2022-01-10 06:07:41,888 INFO L87 Difference]: Start difference. First operand 38 states and 49 transitions. Second operand has 48 states, 44 states have (on average 1.2954545454545454) internal successors, (57), 37 states have internal predecessors, (57), 6 states have call successors, (6), 5 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-01-10 06:07:50,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 06:07:50,568 INFO L93 Difference]: Finished difference Result 67 states and 83 transitions. [2022-01-10 06:07:50,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-01-10 06:07:50,571 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 44 states have (on average 1.2954545454545454) internal successors, (57), 37 states have internal predecessors, (57), 6 states have call successors, (6), 5 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 36 [2022-01-10 06:07:50,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 06:07:50,573 INFO L225 Difference]: With dead ends: 67 [2022-01-10 06:07:50,573 INFO L226 Difference]: Without dead ends: 65 [2022-01-10 06:07:50,575 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 964 ImplicationChecksByTransitivity, 22.0s TimeCoverageRelationStatistics Valid=319, Invalid=4329, Unknown=68, NotChecked=834, Total=5550 [2022-01-10 06:07:50,577 INFO L933 BasicCegarLoop]: 32 mSDtfsCounter, 15 mSDsluCounter, 606 mSDsCounter, 0 mSdLazyCounter, 452 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 638 SdHoareTripleChecker+Invalid, 787 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 452 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 316 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-01-10 06:07:50,577 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 638 Invalid, 787 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 452 Invalid, 0 Unknown, 316 Unchecked, 2.5s Time] [2022-01-10 06:07:50,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-01-10 06:07:50,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 64. [2022-01-10 06:07:50,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 54 states have (on average 1.2592592592592593) internal successors, (68), 55 states have internal predecessors, (68), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2022-01-10 06:07:50,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 80 transitions. [2022-01-10 06:07:50,584 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 80 transitions. Word has length 36 [2022-01-10 06:07:50,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 06:07:50,584 INFO L470 AbstractCegarLoop]: Abstraction has 64 states and 80 transitions. [2022-01-10 06:07:50,585 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 44 states have (on average 1.2954545454545454) internal successors, (57), 37 states have internal predecessors, (57), 6 states have call successors, (6), 5 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-01-10 06:07:50,585 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 80 transitions. [2022-01-10 06:07:50,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-01-10 06:07:50,585 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 06:07:50,586 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 06:07:50,598 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-01-10 06:07:50,793 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (6)] Forceful destruction successful, exit code 0 [2022-01-10 06:07:50,987 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2022-01-10 06:07:50,991 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 06:07:50,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 06:07:50,992 INFO L85 PathProgramCache]: Analyzing trace with hash 79364982, now seen corresponding path program 2 times [2022-01-10 06:07:50,992 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 06:07:50,992 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [742064567] [2022-01-10 06:07:50,992 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-10 06:07:50,992 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 06:07:50,993 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 06:07:50,993 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 06:07:50,995 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-01-10 06:07:51,240 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-10 06:07:51,241 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-10 06:07:51,257 INFO L263 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 6 conjunts are in the unsatisfiable core [2022-01-10 06:07:51,259 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 06:07:51,320 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-01-10 06:07:51,320 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 06:07:51,850 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-01-10 06:07:51,850 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 06:07:51,850 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [742064567] [2022-01-10 06:07:51,850 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [742064567] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 06:07:51,850 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-10 06:07:51,850 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2022-01-10 06:07:51,850 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152940452] [2022-01-10 06:07:51,851 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-10 06:07:51,851 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-10 06:07:51,851 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 06:07:51,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-10 06:07:51,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-01-10 06:07:51,852 INFO L87 Difference]: Start difference. First operand 64 states and 80 transitions. Second operand has 8 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 4 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-01-10 06:07:51,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 06:07:51,908 INFO L93 Difference]: Finished difference Result 82 states and 105 transitions. [2022-01-10 06:07:51,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-10 06:07:51,909 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 4 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Word has length 37 [2022-01-10 06:07:51,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 06:07:51,909 INFO L225 Difference]: With dead ends: 82 [2022-01-10 06:07:51,909 INFO L226 Difference]: Without dead ends: 64 [2022-01-10 06:07:51,910 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-01-10 06:07:51,910 INFO L933 BasicCegarLoop]: 43 mSDtfsCounter, 78 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 06:07:51,910 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [78 Valid, 151 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 06:07:51,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2022-01-10 06:07:51,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2022-01-10 06:07:51,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 54 states have (on average 1.2222222222222223) internal successors, (66), 55 states have internal predecessors, (66), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2022-01-10 06:07:51,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 78 transitions. [2022-01-10 06:07:51,918 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 78 transitions. Word has length 37 [2022-01-10 06:07:51,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 06:07:51,918 INFO L470 AbstractCegarLoop]: Abstraction has 64 states and 78 transitions. [2022-01-10 06:07:51,918 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 4 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-01-10 06:07:51,919 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 78 transitions. [2022-01-10 06:07:51,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-01-10 06:07:51,919 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 06:07:51,919 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 06:07:51,932 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2022-01-10 06:07:52,124 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 06:07:52,124 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 06:07:52,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 06:07:52,125 INFO L85 PathProgramCache]: Analyzing trace with hash -599029201, now seen corresponding path program 1 times [2022-01-10 06:07:52,125 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 06:07:52,125 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [838471343] [2022-01-10 06:07:52,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 06:07:52,125 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 06:07:52,125 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 06:07:52,127 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 06:07:52,153 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2022-01-10 06:07:52,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 06:07:52,657 INFO L263 TraceCheckSpWp]: Trace formula consists of 640 conjuncts, 9 conjunts are in the unsatisfiable core [2022-01-10 06:07:52,658 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 06:07:52,738 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-01-10 06:07:52,741 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-01-10 06:07:52,760 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-01-10 06:07:52,760 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 06:07:52,872 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-01-10 06:07:52,872 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 06:07:52,873 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [838471343] [2022-01-10 06:07:52,873 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [838471343] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 06:07:52,873 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-10 06:07:52,873 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2022-01-10 06:07:52,873 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [669499926] [2022-01-10 06:07:52,873 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-10 06:07:52,874 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-10 06:07:52,874 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 06:07:52,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-10 06:07:52,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-01-10 06:07:52,874 INFO L87 Difference]: Start difference. First operand 64 states and 78 transitions. Second operand has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-01-10 06:07:53,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 06:07:53,588 INFO L93 Difference]: Finished difference Result 93 states and 115 transitions. [2022-01-10 06:07:53,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-10 06:07:53,589 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 38 [2022-01-10 06:07:53,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 06:07:53,590 INFO L225 Difference]: With dead ends: 93 [2022-01-10 06:07:53,590 INFO L226 Difference]: Without dead ends: 78 [2022-01-10 06:07:53,590 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-01-10 06:07:53,591 INFO L933 BasicCegarLoop]: 38 mSDtfsCounter, 20 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-01-10 06:07:53,591 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 177 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-01-10 06:07:53,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2022-01-10 06:07:53,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 64. [2022-01-10 06:07:53,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 54 states have (on average 1.2037037037037037) internal successors, (65), 55 states have internal predecessors, (65), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2022-01-10 06:07:53,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 77 transitions. [2022-01-10 06:07:53,597 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 77 transitions. Word has length 38 [2022-01-10 06:07:53,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 06:07:53,597 INFO L470 AbstractCegarLoop]: Abstraction has 64 states and 77 transitions. [2022-01-10 06:07:53,598 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-01-10 06:07:53,598 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 77 transitions. [2022-01-10 06:07:53,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-01-10 06:07:53,598 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 06:07:53,598 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 06:07:53,619 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2022-01-10 06:07:53,815 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 06:07:53,816 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 06:07:53,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 06:07:53,816 INFO L85 PathProgramCache]: Analyzing trace with hash -541770899, now seen corresponding path program 1 times [2022-01-10 06:07:53,816 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 06:07:53,816 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [750364900] [2022-01-10 06:07:53,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 06:07:53,817 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 06:07:53,817 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 06:07:53,818 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 06:07:53,818 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2022-01-10 06:07:54,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 06:07:54,182 INFO L263 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 20 conjunts are in the unsatisfiable core [2022-01-10 06:07:54,185 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 06:07:54,365 INFO L353 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-01-10 06:07:54,365 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 15 [2022-01-10 06:07:54,426 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2022-01-10 06:07:54,562 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 06:07:54,563 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2022-01-10 06:07:54,616 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2022-01-10 06:07:54,662 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 11 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-10 06:07:54,662 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 06:07:54,809 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 06:07:54,809 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [750364900] [2022-01-10 06:07:54,810 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [750364900] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 06:07:54,810 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1492247661] [2022-01-10 06:07:54,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 06:07:54,810 INFO L168 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-01-10 06:07:54,810 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-01-10 06:07:54,811 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-01-10 06:07:54,812 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (10)] Waiting until timeout for monitored process [2022-01-10 06:07:55,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 06:07:55,243 INFO L263 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 25 conjunts are in the unsatisfiable core [2022-01-10 06:07:55,246 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 06:07:55,675 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2022-01-10 06:07:55,838 INFO L353 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-01-10 06:07:55,838 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 21 [2022-01-10 06:07:55,972 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2022-01-10 06:07:55,987 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 11 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-10 06:07:55,987 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 06:07:56,138 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1492247661] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 06:07:56,138 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-10 06:07:56,138 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 25 [2022-01-10 06:07:56,138 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [822380453] [2022-01-10 06:07:56,138 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-10 06:07:56,139 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-01-10 06:07:56,139 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 06:07:56,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-01-10 06:07:56,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=595, Unknown=11, NotChecked=0, Total=702 [2022-01-10 06:07:56,140 INFO L87 Difference]: Start difference. First operand 64 states and 77 transitions. Second operand has 25 states, 23 states have (on average 1.9130434782608696) internal successors, (44), 20 states have internal predecessors, (44), 4 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-01-10 06:07:57,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 06:07:57,319 INFO L93 Difference]: Finished difference Result 78 states and 95 transitions. [2022-01-10 06:07:57,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-01-10 06:07:57,321 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 23 states have (on average 1.9130434782608696) internal successors, (44), 20 states have internal predecessors, (44), 4 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 38 [2022-01-10 06:07:57,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 06:07:57,321 INFO L225 Difference]: With dead ends: 78 [2022-01-10 06:07:57,321 INFO L226 Difference]: Without dead ends: 62 [2022-01-10 06:07:57,322 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 68 SyntacticMatches, 3 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 247 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=147, Invalid=832, Unknown=13, NotChecked=0, Total=992 [2022-01-10 06:07:57,322 INFO L933 BasicCegarLoop]: 31 mSDtfsCounter, 53 mSDsluCounter, 315 mSDsCounter, 0 mSdLazyCounter, 207 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 346 SdHoareTripleChecker+Invalid, 257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 43 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-01-10 06:07:57,322 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [53 Valid, 346 Invalid, 257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 207 Invalid, 0 Unknown, 43 Unchecked, 1.0s Time] [2022-01-10 06:07:57,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2022-01-10 06:07:57,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2022-01-10 06:07:57,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 52 states have (on average 1.1730769230769231) internal successors, (61), 53 states have internal predecessors, (61), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2022-01-10 06:07:57,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 73 transitions. [2022-01-10 06:07:57,328 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 73 transitions. Word has length 38 [2022-01-10 06:07:57,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 06:07:57,328 INFO L470 AbstractCegarLoop]: Abstraction has 62 states and 73 transitions. [2022-01-10 06:07:57,328 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 23 states have (on average 1.9130434782608696) internal successors, (44), 20 states have internal predecessors, (44), 4 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-01-10 06:07:57,329 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 73 transitions. [2022-01-10 06:07:57,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-01-10 06:07:57,329 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 06:07:57,329 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 06:07:57,353 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2022-01-10 06:07:57,534 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (10)] Forceful destruction successful, exit code 0 [2022-01-10 06:07:57,730 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2022-01-10 06:07:57,730 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 06:07:57,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 06:07:57,731 INFO L85 PathProgramCache]: Analyzing trace with hash -1955198847, now seen corresponding path program 1 times [2022-01-10 06:07:57,731 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 06:07:57,731 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [101228968] [2022-01-10 06:07:57,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 06:07:57,731 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 06:07:57,731 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 06:07:57,732 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 06:07:57,733 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2022-01-10 06:07:58,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 06:07:58,444 INFO L263 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 115 conjunts are in the unsatisfiable core [2022-01-10 06:07:58,451 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 06:07:58,461 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-01-10 06:07:58,483 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-01-10 06:07:58,574 INFO L353 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-01-10 06:07:58,574 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 26 [2022-01-10 06:07:58,686 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-01-10 06:07:58,839 INFO L353 Elim1Store]: treesize reduction 30, result has 45.5 percent of original size [2022-01-10 06:07:58,840 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 25 treesize of output 42 [2022-01-10 06:07:58,989 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-01-10 06:07:59,089 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-01-10 06:07:59,389 INFO L353 Elim1Store]: treesize reduction 34, result has 24.4 percent of original size [2022-01-10 06:07:59,389 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 93 treesize of output 84 [2022-01-10 06:07:59,400 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 13 [2022-01-10 06:07:59,407 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 53 [2022-01-10 06:07:59,415 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2022-01-10 06:07:59,429 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 19 [2022-01-10 06:07:59,436 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2022-01-10 06:07:59,727 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-10 06:07:59,727 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 31 [2022-01-10 06:07:59,737 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2022-01-10 06:07:59,744 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-01-10 06:07:59,910 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-01-10 06:08:00,095 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 06:08:00,118 INFO L353 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-01-10 06:08:00,118 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 62 treesize of output 54 [2022-01-10 06:08:00,133 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 06:08:00,159 INFO L353 Elim1Store]: treesize reduction 12, result has 67.6 percent of original size [2022-01-10 06:08:00,159 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 41 treesize of output 45 [2022-01-10 06:08:00,190 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-01-10 06:08:01,135 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 06:08:01,378 INFO L353 Elim1Store]: treesize reduction 75, result has 22.7 percent of original size [2022-01-10 06:08:01,379 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 250 treesize of output 129 [2022-01-10 06:08:01,397 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 06:08:01,576 INFO L353 Elim1Store]: treesize reduction 58, result has 21.6 percent of original size [2022-01-10 06:08:01,576 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 173 treesize of output 157 [2022-01-10 06:08:01,651 INFO L353 Elim1Store]: treesize reduction 96, result has 13.5 percent of original size [2022-01-10 06:08:01,651 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 5 new quantified variables, introduced 2 case distinctions, treesize of input 356 treesize of output 230 [2022-01-10 06:08:01,723 INFO L353 Elim1Store]: treesize reduction 66, result has 19.5 percent of original size [2022-01-10 06:08:01,723 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 298 treesize of output 270 [2022-01-10 06:08:01,738 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 06:08:01,746 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 59 [2022-01-10 06:08:01,779 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 49 [2022-01-10 06:08:03,239 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 06:08:03,303 INFO L353 Elim1Store]: treesize reduction 37, result has 24.5 percent of original size [2022-01-10 06:08:03,304 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 10 case distinctions, treesize of input 193 treesize of output 74 [2022-01-10 06:08:03,328 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 06:08:03,341 INFO L353 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-01-10 06:08:03,341 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 22 [2022-01-10 06:08:03,481 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-01-10 06:08:03,543 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-10 06:08:03,543 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 06:08:04,121 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1564 (_ BitVec 32)) (v_ArrVal_1570 (Array (_ BitVec 64) (_ BitVec 32))) (v_ArrVal_1578 (_ BitVec 32)) (v_ArrVal_1583 (Array (_ BitVec 64) (_ BitVec 64))) (|ULTIMATE.start_dll_circular_insert_~last~1#1.offset| (_ BitVec 64)) (v_ArrVal_1584 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1565 (Array (_ BitVec 64) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~uneq~0#1| (let ((.cse1 (bvadd (_ bv8 64) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|))) (let ((.cse5 (store (let ((.cse7 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base|) |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.offset| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|)))) (store .cse7 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store (select .cse7 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse1 |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.offset|) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| |ULTIMATE.start_dll_circular_insert_~last~1#1.offset|))) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1584)) (.cse2 (store (let ((.cse6 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base|) |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.offset| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|)))) (store .cse6 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store (select .cse6 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse1 |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base|) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|))) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1583))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse4 (select (select .cse5 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (store (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_1565))) (store .cse0 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store (select .cse0 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse1 v_ArrVal_1578) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_1564))) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1570) (select (select .cse2 .cse3) .cse4)) (bvadd (select (select .cse5 .cse3) .cse4) (_ bv16 64)))))))) is different from false [2022-01-10 06:08:04,474 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1564 (_ BitVec 32)) (v_ArrVal_1570 (Array (_ BitVec 64) (_ BitVec 32))) (v_ArrVal_1578 (_ BitVec 32)) (|v_ULTIMATE.start_dll_circular_insert_~last~1#1.offset_26| (_ BitVec 64)) (v_ArrVal_1583 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1584 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1565 (Array (_ BitVec 64) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~uneq~0#1| (let ((.cse8 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|))) (let ((.cse1 (bvadd (_ bv8 64) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|)) (.cse2 (select .cse8 |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset|))) (let ((.cse6 (store (let ((.cse9 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|)))) (store .cse9 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store (select .cse9 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse1 |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset|) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| |v_ULTIMATE.start_dll_circular_insert_~last~1#1.offset_26|))) .cse2 v_ArrVal_1584)) (.cse3 (store (let ((.cse7 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| (store .cse8 |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|)))) (store .cse7 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store (select .cse7 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse1 |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| .cse2))) .cse2 v_ArrVal_1583))) (let ((.cse4 (select (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (store (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1565))) (store .cse0 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store (select .cse0 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse1 v_ArrVal_1578) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_1564))) .cse2 v_ArrVal_1570) (select (select .cse3 .cse4) .cse5)) (bvadd (_ bv16 64) (select (select .cse6 .cse4) .cse5))))))))) is different from false [2022-01-10 06:08:04,656 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1564 (_ BitVec 32)) (v_ArrVal_1570 (Array (_ BitVec 64) (_ BitVec 32))) (v_ArrVal_1578 (_ BitVec 32)) (|v_ULTIMATE.start_dll_circular_insert_~last~1#1.offset_26| (_ BitVec 64)) (v_ArrVal_1583 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1565 (Array (_ BitVec 64) (_ BitVec 32))) (v_ArrVal_1584 (Array (_ BitVec 64) (_ BitVec 64)))) (= |c_ULTIMATE.start_main_~uneq~0#1| (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|))) (let ((.cse9 (select |c_#memory_$Pointer$.base| .cse2)) (.cse10 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|))) (let ((.cse1 (bvadd (_ bv8 64) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset|)) (.cse3 (select .cse9 .cse10))) (let ((.cse7 (store (let ((.cse11 (store |c_#memory_$Pointer$.offset| .cse2 (store (select |c_#memory_$Pointer$.offset| .cse2) .cse10 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset|)))) (store .cse11 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| (store (store (select .cse11 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) .cse1 .cse10) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| |v_ULTIMATE.start_dll_circular_insert_~last~1#1.offset_26|))) .cse3 v_ArrVal_1584)) (.cse4 (store (let ((.cse8 (store |c_#memory_$Pointer$.base| .cse2 (store .cse9 .cse10 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|)))) (store .cse8 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| (store (store (select .cse8 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) .cse1 .cse2) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| .cse3))) .cse3 v_ArrVal_1583))) (let ((.cse5 (select (select .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (store (let ((.cse0 (store |c_#memory_int| .cse2 v_ArrVal_1565))) (store .cse0 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| (store (store (select .cse0 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) .cse1 v_ArrVal_1578) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| v_ArrVal_1564))) .cse3 v_ArrVal_1570) (select (select .cse4 .cse5) .cse6)) (bvadd (select (select .cse7 .cse5) .cse6) (_ bv16 64)))))))))) is different from false [2022-01-10 06:08:05,340 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 06:08:05,340 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 839 treesize of output 832 [2022-01-10 06:08:05,732 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 06:08:05,732 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28104 treesize of output 27316 [2022-01-10 06:08:06,195 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31430 treesize of output 29565 [2022-01-10 06:08:06,274 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29565 treesize of output 25089