./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/list-simple/dll2c_prepend_equal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/list-simple/dll2c_prepend_equal.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e0e4fff172a515598d076941b225a1a1f31b97f5ac14127a866784b10a4e3537 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 13:56:55,358 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 13:56:55,413 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 13:56:55,417 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 13:56:55,418 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 13:56:55,446 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 13:56:55,446 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 13:56:55,447 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 13:56:55,447 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 13:56:55,448 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 13:56:55,448 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 13:56:55,448 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 13:56:55,449 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 13:56:55,449 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 13:56:55,450 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 13:56:55,450 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 13:56:55,450 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 13:56:55,451 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 13:56:55,451 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 13:56:55,451 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 13:56:55,452 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 13:56:55,452 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 13:56:55,452 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 13:56:55,453 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 13:56:55,453 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 13:56:55,453 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 13:56:55,454 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 13:56:55,454 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 13:56:55,454 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 13:56:55,455 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 13:56:55,455 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 13:56:55,455 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 13:56:55,455 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 13:56:55,455 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 13:56:55,456 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 13:56:55,456 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 13:56:55,456 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 13:56:55,456 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 13:56:55,457 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 13:56:55,457 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 13:56:55,457 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 13:56:55,459 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 13:56:55,459 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> e0e4fff172a515598d076941b225a1a1f31b97f5ac14127a866784b10a4e3537 [2024-11-08 13:56:55,693 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 13:56:55,711 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 13:56:55,715 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 13:56:55,716 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 13:56:55,717 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 13:56:55,717 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/dll2c_prepend_equal.i [2024-11-08 13:56:57,125 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 13:56:57,370 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 13:56:57,371 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2c_prepend_equal.i [2024-11-08 13:56:57,383 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f9cab4bcf/1a51abeca802471191c6316ac7b841d2/FLAG03e27bccc [2024-11-08 13:56:57,396 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f9cab4bcf/1a51abeca802471191c6316ac7b841d2 [2024-11-08 13:56:57,398 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 13:56:57,400 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 13:56:57,402 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 13:56:57,402 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 13:56:57,408 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 13:56:57,409 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 01:56:57" (1/1) ... [2024-11-08 13:56:57,410 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2e4f352b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:56:57, skipping insertion in model container [2024-11-08 13:56:57,410 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 01:56:57" (1/1) ... [2024-11-08 13:56:57,456 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 13:56:57,842 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2c_prepend_equal.i[24640,24653] [2024-11-08 13:56:57,847 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 13:56:57,856 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 13:56:57,902 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2c_prepend_equal.i[24640,24653] [2024-11-08 13:56:57,907 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 13:56:57,940 INFO L204 MainTranslator]: Completed translation [2024-11-08 13:56:57,940 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:56:57 WrapperNode [2024-11-08 13:56:57,940 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 13:56:57,941 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 13:56:57,941 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 13:56:57,942 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 13:56:57,946 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:56:57" (1/1) ... [2024-11-08 13:56:57,958 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:56:57" (1/1) ... [2024-11-08 13:56:57,981 INFO L138 Inliner]: procedures = 127, calls = 47, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 137 [2024-11-08 13:56:57,982 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 13:56:57,982 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 13:56:57,983 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 13:56:57,983 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 13:56:57,999 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:56:57" (1/1) ... [2024-11-08 13:56:57,999 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:56:57" (1/1) ... [2024-11-08 13:56:58,007 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:56:57" (1/1) ... [2024-11-08 13:56:58,031 INFO L175 MemorySlicer]: Split 29 memory accesses to 3 slices as follows [2, 18, 9]. 62 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 0, 1]. The 15 writes are split as follows [0, 13, 2]. [2024-11-08 13:56:58,032 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:56:57" (1/1) ... [2024-11-08 13:56:58,032 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:56:57" (1/1) ... [2024-11-08 13:56:58,044 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:56:57" (1/1) ... [2024-11-08 13:56:58,049 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:56:57" (1/1) ... [2024-11-08 13:56:58,051 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:56:57" (1/1) ... [2024-11-08 13:56:58,052 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:56:57" (1/1) ... [2024-11-08 13:56:58,056 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 13:56:58,057 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 13:56:58,057 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 13:56:58,057 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 13:56:58,062 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:56:57" (1/1) ... [2024-11-08 13:56:58,068 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 13:56:58,082 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 13:56:58,100 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 13:56:58,107 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 13:56:58,152 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-08 13:56:58,152 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-08 13:56:58,153 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-08 13:56:58,153 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-08 13:56:58,153 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-08 13:56:58,153 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-08 13:56:58,153 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2024-11-08 13:56:58,153 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2024-11-08 13:56:58,155 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-08 13:56:58,155 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 13:56:58,155 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-08 13:56:58,155 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-08 13:56:58,155 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-08 13:56:58,155 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-08 13:56:58,155 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-08 13:56:58,155 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-08 13:56:58,155 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-08 13:56:58,156 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-08 13:56:58,156 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-08 13:56:58,156 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-08 13:56:58,156 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-11-08 13:56:58,156 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 13:56:58,156 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-08 13:56:58,156 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-08 13:56:58,156 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 13:56:58,156 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 13:56:58,309 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 13:56:58,311 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 13:56:58,617 INFO L? ?]: Removed 51 outVars from TransFormulas that were not future-live. [2024-11-08 13:56:58,617 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 13:56:58,630 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 13:56:58,631 INFO L316 CfgBuilder]: Removed 3 assume(true) statements. [2024-11-08 13:56:58,631 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 01:56:58 BoogieIcfgContainer [2024-11-08 13:56:58,631 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 13:56:58,633 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 13:56:58,634 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 13:56:58,636 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 13:56:58,637 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 01:56:57" (1/3) ... [2024-11-08 13:56:58,637 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15175863 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 01:56:58, skipping insertion in model container [2024-11-08 13:56:58,638 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:56:57" (2/3) ... [2024-11-08 13:56:58,638 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15175863 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 01:56:58, skipping insertion in model container [2024-11-08 13:56:58,638 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 01:56:58" (3/3) ... [2024-11-08 13:56:58,640 INFO L112 eAbstractionObserver]: Analyzing ICFG dll2c_prepend_equal.i [2024-11-08 13:56:58,656 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 13:56:58,656 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 13:56:58,722 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 13:56:58,730 INFO L333 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, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, 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, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@446d293d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 13:56:58,731 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 13:56:58,735 INFO L276 IsEmpty]: Start isEmpty. Operand has 35 states, 29 states have (on average 1.4482758620689655) internal successors, (42), 30 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) [2024-11-08 13:56:58,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-08 13:56:58,742 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 13:56:58,743 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 13:56:58,743 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 13:56:58,747 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 13:56:58,747 INFO L85 PathProgramCache]: Analyzing trace with hash 976010426, now seen corresponding path program 1 times [2024-11-08 13:56:58,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 13:56:58,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729412480] [2024-11-08 13:56:58,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:56:58,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 13:56:58,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:56:58,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 13:56:59,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:56:59,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-08 13:56:59,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:56:59,055 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-08 13:56:59,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 13:56:59,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [729412480] [2024-11-08 13:56:59,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [729412480] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 13:56:59,057 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 13:56:59,057 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 13:56:59,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [808755091] [2024-11-08 13:56:59,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 13:56:59,063 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 13:56:59,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 13:56:59,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 13:56:59,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 13:56:59,086 INFO L87 Difference]: Start difference. First operand has 35 states, 29 states have (on average 1.4482758620689655) internal successors, (42), 30 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) Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 2 states have internal predecessors, (16), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-08 13:56:59,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 13:56:59,168 INFO L93 Difference]: Finished difference Result 61 states and 82 transitions. [2024-11-08 13:56:59,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 13:56:59,173 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 2 states have internal predecessors, (16), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 24 [2024-11-08 13:56:59,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 13:56:59,179 INFO L225 Difference]: With dead ends: 61 [2024-11-08 13:56:59,179 INFO L226 Difference]: Without dead ends: 27 [2024-11-08 13:56:59,182 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 13:56:59,185 INFO L432 NwaCegarLoop]: 43 mSDtfsCounter, 0 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 13:56:59,186 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 69 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 13:56:59,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2024-11-08 13:56:59,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2024-11-08 13:56:59,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 22 states have internal predecessors, (27), 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) [2024-11-08 13:56:59,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 33 transitions. [2024-11-08 13:56:59,222 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 33 transitions. Word has length 24 [2024-11-08 13:56:59,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 13:56:59,223 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 33 transitions. [2024-11-08 13:56:59,223 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 2 states have internal predecessors, (16), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-08 13:56:59,224 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 33 transitions. [2024-11-08 13:56:59,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-08 13:56:59,225 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 13:56:59,225 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 13:56:59,225 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 13:56:59,225 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 13:56:59,226 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 13:56:59,226 INFO L85 PathProgramCache]: Analyzing trace with hash -1442307826, now seen corresponding path program 1 times [2024-11-08 13:56:59,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 13:56:59,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051088977] [2024-11-08 13:56:59,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:56:59,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 13:56:59,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:56:59,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 13:56:59,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:56:59,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-08 13:56:59,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:56:59,604 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-08 13:56:59,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 13:56:59,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051088977] [2024-11-08 13:56:59,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1051088977] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 13:56:59,606 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 13:56:59,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 13:56:59,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1847392960] [2024-11-08 13:56:59,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 13:56:59,608 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 13:56:59,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 13:56:59,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 13:56:59,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 13:56:59,611 INFO L87 Difference]: Start difference. First operand 27 states and 33 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-08 13:56:59,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 13:56:59,707 INFO L93 Difference]: Finished difference Result 50 states and 61 transitions. [2024-11-08 13:56:59,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 13:56:59,707 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 24 [2024-11-08 13:56:59,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 13:56:59,708 INFO L225 Difference]: With dead ends: 50 [2024-11-08 13:56:59,708 INFO L226 Difference]: Without dead ends: 32 [2024-11-08 13:56:59,709 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 13:56:59,710 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 4 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 13:56:59,710 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 72 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 13:56:59,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-11-08 13:56:59,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 28. [2024-11-08 13:56:59,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 23 states have internal predecessors, (28), 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) [2024-11-08 13:56:59,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 34 transitions. [2024-11-08 13:56:59,717 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 34 transitions. Word has length 24 [2024-11-08 13:56:59,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 13:56:59,717 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 34 transitions. [2024-11-08 13:56:59,717 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-08 13:56:59,718 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 34 transitions. [2024-11-08 13:56:59,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-08 13:56:59,719 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 13:56:59,719 INFO L215 NwaCegarLoop]: 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] [2024-11-08 13:56:59,719 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 13:56:59,719 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 13:56:59,720 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 13:56:59,720 INFO L85 PathProgramCache]: Analyzing trace with hash 915772386, now seen corresponding path program 1 times [2024-11-08 13:56:59,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 13:56:59,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988611430] [2024-11-08 13:56:59,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:56:59,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 13:56:59,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:57:00,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 13:57:00,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:57:00,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 13:57:00,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:57:00,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-08 13:57:00,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:57:00,362 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-08 13:57:00,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 13:57:00,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [988611430] [2024-11-08 13:57:00,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [988611430] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 13:57:00,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [3542557] [2024-11-08 13:57:00,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:57:00,365 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 13:57:00,365 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 13:57:00,367 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 13:57:00,369 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-08 13:57:00,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:57:00,595 INFO L255 TraceCheckSpWp]: Trace formula consists of 374 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-08 13:57:00,602 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 13:57:00,772 INFO L378 Elim1Store]: Elim1 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 [2024-11-08 13:57:00,789 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-08 13:57:00,789 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 13:57:00,866 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-08 13:57:00,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [3542557] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 13:57:00,867 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 13:57:00,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 10] total 14 [2024-11-08 13:57:00,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [305291275] [2024-11-08 13:57:00,867 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 13:57:00,868 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-08 13:57:00,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 13:57:00,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-08 13:57:00,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2024-11-08 13:57:00,869 INFO L87 Difference]: Start difference. First operand 28 states and 34 transitions. Second operand has 14 states, 14 states have (on average 2.357142857142857) internal successors, (33), 12 states have internal predecessors, (33), 3 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-08 13:57:04,886 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 13:57:08,916 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 13:57:12,938 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 13:57:16,950 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 13:57:20,973 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 13:57:25,259 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 13:57:29,324 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 13:57:33,352 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 13:57:33,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 13:57:33,357 INFO L93 Difference]: Finished difference Result 59 states and 71 transitions. [2024-11-08 13:57:33,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-08 13:57:33,358 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.357142857142857) internal successors, (33), 12 states have internal predecessors, (33), 3 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) Word has length 34 [2024-11-08 13:57:33,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 13:57:33,359 INFO L225 Difference]: With dead ends: 59 [2024-11-08 13:57:33,359 INFO L226 Difference]: Without dead ends: 36 [2024-11-08 13:57:33,360 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 68 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=56, Invalid=324, Unknown=0, NotChecked=0, Total=380 [2024-11-08 13:57:33,364 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 6 mSDsluCounter, 199 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 1 mSolverCounterUnsat, 8 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 32.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 224 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 8 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 32.4s IncrementalHoareTripleChecker+Time [2024-11-08 13:57:33,365 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 224 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 157 Invalid, 8 Unknown, 0 Unchecked, 32.4s Time] [2024-11-08 13:57:33,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2024-11-08 13:57:33,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2024-11-08 13:57:33,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 29 states have (on average 1.1379310344827587) internal successors, (33), 29 states have internal predecessors, (33), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-08 13:57:33,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 41 transitions. [2024-11-08 13:57:33,376 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 41 transitions. Word has length 34 [2024-11-08 13:57:33,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 13:57:33,377 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 41 transitions. [2024-11-08 13:57:33,377 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.357142857142857) internal successors, (33), 12 states have internal predecessors, (33), 3 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-08 13:57:33,377 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 41 transitions. [2024-11-08 13:57:33,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-08 13:57:33,378 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 13:57:33,379 INFO L215 NwaCegarLoop]: 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] [2024-11-08 13:57:33,400 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-08 13:57:33,581 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 13:57:33,581 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 13:57:33,582 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 13:57:33,582 INFO L85 PathProgramCache]: Analyzing trace with hash 917619428, now seen corresponding path program 1 times [2024-11-08 13:57:33,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 13:57:33,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484634449] [2024-11-08 13:57:33,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:57:33,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 13:57:33,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:57:35,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 13:57:35,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:57:36,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 13:57:36,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:57:36,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-08 13:57:36,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:57:36,415 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-08 13:57:36,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 13:57:36,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [484634449] [2024-11-08 13:57:36,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [484634449] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 13:57:36,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [710219441] [2024-11-08 13:57:36,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:57:36,416 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 13:57:36,416 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 13:57:36,418 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 13:57:36,421 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-08 13:57:36,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:57:36,636 INFO L255 TraceCheckSpWp]: Trace formula consists of 397 conjuncts, 96 conjuncts are in the unsatisfiable core [2024-11-08 13:57:36,646 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 13:57:36,687 INFO L378 Elim1Store]: Elim1 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 [2024-11-08 13:57:36,958 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-11-08 13:57:36,958 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 12 treesize of output 14 [2024-11-08 13:57:37,130 INFO L349 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2024-11-08 13:57:37,130 INFO L378 Elim1Store]: Elim1 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 1 case distinctions, treesize of input 16 treesize of output 17 [2024-11-08 13:57:37,152 INFO L378 Elim1Store]: Elim1 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 34 [2024-11-08 13:57:37,167 INFO L378 Elim1Store]: Elim1 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 23 [2024-11-08 13:57:37,176 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 16 treesize of output 1 [2024-11-08 13:57:37,410 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 13:57:37,411 INFO L378 Elim1Store]: Elim1 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 80 treesize of output 45 [2024-11-08 13:57:37,427 INFO L349 Elim1Store]: treesize reduction 9, result has 25.0 percent of original size [2024-11-08 13:57:37,427 INFO L378 Elim1Store]: Elim1 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 35 [2024-11-08 13:57:37,554 INFO L378 Elim1Store]: Elim1 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 [2024-11-08 13:57:37,641 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 13:57:37,642 INFO L378 Elim1Store]: Elim1 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 89 treesize of output 66 [2024-11-08 13:57:37,668 INFO L349 Elim1Store]: treesize reduction 31, result has 49.2 percent of original size [2024-11-08 13:57:37,669 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 95 treesize of output 100 [2024-11-08 13:57:37,928 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 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 169 treesize of output 174 [2024-11-08 13:57:37,942 INFO L378 Elim1Store]: Elim1 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 0 case distinctions, treesize of input 218 treesize of output 155 [2024-11-08 13:57:37,950 INFO L378 Elim1Store]: Elim1 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 0 case distinctions, treesize of input 162 treesize of output 123 [2024-11-08 13:57:37,957 INFO L378 Elim1Store]: Elim1 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 123 treesize of output 87 [2024-11-08 13:57:37,963 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 13:57:37,964 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 13:57:37,968 INFO L378 Elim1Store]: Elim1 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 93 treesize of output 49 [2024-11-08 13:57:37,980 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 0 case distinctions, treesize of input 63 treesize of output 21 [2024-11-08 13:57:37,995 INFO L378 Elim1Store]: Elim1 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 150 treesize of output 155 [2024-11-08 13:57:38,006 INFO L378 Elim1Store]: Elim1 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 0 case distinctions, treesize of input 213 treesize of output 154 [2024-11-08 13:57:38,015 INFO L378 Elim1Store]: Elim1 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 0 case distinctions, treesize of input 154 treesize of output 115 [2024-11-08 13:57:38,026 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2024-11-08 13:57:38,027 INFO L378 Elim1Store]: Elim1 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 1 case distinctions, treesize of input 122 treesize of output 82 [2024-11-08 13:57:38,038 INFO L378 Elim1Store]: Elim1 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 28 treesize of output 15 [2024-11-08 13:57:38,101 INFO L378 Elim1Store]: Elim1 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 25 treesize of output 17 [2024-11-08 13:57:38,104 INFO L378 Elim1Store]: Elim1 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 21 treesize of output 13 [2024-11-08 13:57:38,195 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 13:57:38,195 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 13:57:38,310 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_690 (Array Int Int)) (v_ArrVal_692 Int) (v_ArrVal_691 (Array Int Int)) (v_ArrVal_695 (Array Int Int))) (let ((.cse2 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|))) (let ((.cse0 (select .cse2 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset|)) (.cse3 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| .cse0) (+ (select .cse3 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset|) 4)))) (or (= (select (select (store (store (store |c_#memory_int#1| .cse0 v_ArrVal_690) .cse1 v_ArrVal_691) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| v_ArrVal_695) (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| (store .cse2 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ 8 (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| (store .cse3 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) |c_ULTIMATE.start_main_~data~0#1|) (not (= v_ArrVal_695 (let ((.cse4 (+ |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| 4))) (store (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| v_ArrVal_692)) .cse0 v_ArrVal_690) .cse1 v_ArrVal_691) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) .cse4 (select v_ArrVal_695 .cse4)))))))))) is different from false [2024-11-08 13:57:38,337 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_690 (Array Int Int)) (v_ArrVal_692 Int) (v_ArrVal_691 (Array Int Int)) (v_ArrVal_695 (Array Int Int))) (let ((.cse2 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|))) (let ((.cse0 (select .cse2 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset|)) (.cse3 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| .cse0) (+ (select .cse3 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset|) 4)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int#1| .cse0 v_ArrVal_690) .cse1 v_ArrVal_691) |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base| v_ArrVal_695) (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| (store .cse2 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| (store .cse3 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 8))) (not (= v_ArrVal_695 (let ((.cse4 (+ |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.offset| 4))) (store (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base| (store (select |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base|) |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.offset| v_ArrVal_692)) .cse0 v_ArrVal_690) .cse1 v_ArrVal_691) |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base|) .cse4 (select v_ArrVal_695 .cse4)))))))))) is different from false [2024-11-08 13:57:38,498 INFO L349 Elim1Store]: treesize reduction 167, result has 42.2 percent of original size [2024-11-08 13:57:38,498 INFO L378 Elim1Store]: Elim1 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 2071 treesize of output 2059 [2024-11-08 13:57:38,542 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 13:57:38,543 INFO L378 Elim1Store]: Elim1 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 2077 treesize of output 2065 [2024-11-08 13:57:38,571 INFO L378 Elim1Store]: Elim1 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 1212 treesize of output 1132 [2024-11-08 13:57:38,596 INFO L378 Elim1Store]: Elim1 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 1420 treesize of output 1260 [2024-11-08 13:57:39,086 INFO L378 Elim1Store]: Elim1 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 11 treesize of output 3 [2024-11-08 13:57:39,248 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 13:57:39,248 INFO L378 Elim1Store]: Elim1 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 1010 treesize of output 962 [2024-11-08 13:57:39,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [710219441] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 13:57:39,768 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 13:57:39,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 23] total 43 [2024-11-08 13:57:39,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077908660] [2024-11-08 13:57:39,769 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 13:57:39,769 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2024-11-08 13:57:39,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 13:57:39,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2024-11-08 13:57:39,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=1944, Unknown=2, NotChecked=178, Total=2256 [2024-11-08 13:57:39,772 INFO L87 Difference]: Start difference. First operand 36 states and 41 transitions. Second operand has 43 states, 40 states have (on average 1.35) internal successors, (54), 34 states have internal predecessors, (54), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-08 13:57:41,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 13:57:41,895 INFO L93 Difference]: Finished difference Result 42 states and 46 transitions. [2024-11-08 13:57:41,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-08 13:57:41,895 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 40 states have (on average 1.35) internal successors, (54), 34 states have internal predecessors, (54), 6 states have call successors, (6), 4 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 34 [2024-11-08 13:57:41,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 13:57:41,896 INFO L225 Difference]: With dead ends: 42 [2024-11-08 13:57:41,896 INFO L226 Difference]: Without dead ends: 40 [2024-11-08 13:57:41,898 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 678 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=246, Invalid=3300, Unknown=2, NotChecked=234, Total=3782 [2024-11-08 13:57:41,899 INFO L432 NwaCegarLoop]: 12 mSDtfsCounter, 30 mSDsluCounter, 261 mSDsCounter, 0 mSdLazyCounter, 700 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 273 SdHoareTripleChecker+Invalid, 706 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 700 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-08 13:57:41,899 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 273 Invalid, 706 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 700 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-08 13:57:41,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2024-11-08 13:57:41,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 38. [2024-11-08 13:57:41,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 31 states have (on average 1.1290322580645162) internal successors, (35), 31 states have internal predecessors, (35), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-08 13:57:41,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 43 transitions. [2024-11-08 13:57:41,906 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 43 transitions. Word has length 34 [2024-11-08 13:57:41,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 13:57:41,906 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 43 transitions. [2024-11-08 13:57:41,906 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 40 states have (on average 1.35) internal successors, (54), 34 states have internal predecessors, (54), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-08 13:57:41,906 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 43 transitions. [2024-11-08 13:57:41,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-08 13:57:41,907 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 13:57:41,907 INFO L215 NwaCegarLoop]: 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] [2024-11-08 13:57:41,928 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-08 13:57:42,108 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2024-11-08 13:57:42,108 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 13:57:42,109 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 13:57:42,109 INFO L85 PathProgramCache]: Analyzing trace with hash -665604212, now seen corresponding path program 1 times [2024-11-08 13:57:42,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 13:57:42,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155690158] [2024-11-08 13:57:42,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:57:42,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 13:57:42,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:57:43,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 13:57:43,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:57:43,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 13:57:43,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:57:43,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-08 13:57:43,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:57:43,512 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-08 13:57:43,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 13:57:43,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155690158] [2024-11-08 13:57:43,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1155690158] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 13:57:43,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2085390593] [2024-11-08 13:57:43,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:57:43,514 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 13:57:43,514 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 13:57:43,516 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 13:57:43,517 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-08 13:57:43,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:57:43,711 INFO L255 TraceCheckSpWp]: Trace formula consists of 413 conjuncts, 74 conjuncts are in the unsatisfiable core [2024-11-08 13:57:43,715 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 13:57:43,720 INFO L378 Elim1Store]: Elim1 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 [2024-11-08 13:57:43,827 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-11-08 13:57:43,828 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 12 treesize of output 14 [2024-11-08 13:57:43,952 INFO L378 Elim1Store]: Elim1 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 34 [2024-11-08 13:57:43,961 INFO L378 Elim1Store]: Elim1 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 23 [2024-11-08 13:57:43,965 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 16 treesize of output 1 [2024-11-08 13:57:43,982 INFO L349 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2024-11-08 13:57:43,982 INFO L378 Elim1Store]: Elim1 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 1 case distinctions, treesize of input 16 treesize of output 17 [2024-11-08 13:57:44,144 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 13:57:44,144 INFO L378 Elim1Store]: Elim1 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 80 treesize of output 45 [2024-11-08 13:57:44,156 INFO L349 Elim1Store]: treesize reduction 9, result has 25.0 percent of original size [2024-11-08 13:57:44,156 INFO L378 Elim1Store]: Elim1 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 35 [2024-11-08 13:57:44,282 INFO L349 Elim1Store]: treesize reduction 31, result has 49.2 percent of original size [2024-11-08 13:57:44,285 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 95 treesize of output 100 [2024-11-08 13:57:48,330 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (and (= |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (not (= |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base| .cse0)) (= |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (let ((.cse3 (+ (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (or (exists ((|v_old(#memory_$Pointer$#1.base)_AFTER_CALL_9| (Array Int (Array Int Int)))) (let ((.cse1 (@diff |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_9| |c_#memory_$Pointer$#1.base|)) (.cse2 (select |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_9| .cse0))) (and (= |c_#memory_$Pointer$#1.base| (store |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_9| .cse1 (select |c_#memory_$Pointer$#1.base| .cse1))) (= |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base| .cse1) (not (= |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base| (select .cse2 .cse3))) (exists ((|v_ULTIMATE.start_dll_circular_create_~last~0#1.offset_7| Int)) (= (select .cse2 |v_ULTIMATE.start_dll_circular_create_~last~0#1.offset_7|) .cse0))))) (let ((.cse5 (select |c_#memory_$Pointer$#1.base| .cse0))) (let ((.cse4 (select .cse5 .cse3))) (and (or (not (= .cse0 .cse4)) (exists ((|v_ULTIMATE.start_dll_circular_create_~last~0#1.offset_7| Int)) (= (select .cse5 |v_ULTIMATE.start_dll_circular_create_~last~0#1.offset_7|) .cse0))) (not (= |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base| .cse4))))))))) is different from false [2024-11-08 13:57:48,334 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (and (= |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (not (= |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base| .cse0)) (= |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (let ((.cse3 (+ (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (or (exists ((|v_old(#memory_$Pointer$#1.base)_AFTER_CALL_9| (Array Int (Array Int Int)))) (let ((.cse1 (@diff |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_9| |c_#memory_$Pointer$#1.base|)) (.cse2 (select |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_9| .cse0))) (and (= |c_#memory_$Pointer$#1.base| (store |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_9| .cse1 (select |c_#memory_$Pointer$#1.base| .cse1))) (= |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base| .cse1) (not (= |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base| (select .cse2 .cse3))) (exists ((|v_ULTIMATE.start_dll_circular_create_~last~0#1.offset_7| Int)) (= (select .cse2 |v_ULTIMATE.start_dll_circular_create_~last~0#1.offset_7|) .cse0))))) (let ((.cse5 (select |c_#memory_$Pointer$#1.base| .cse0))) (let ((.cse4 (select .cse5 .cse3))) (and (or (not (= .cse0 .cse4)) (exists ((|v_ULTIMATE.start_dll_circular_create_~last~0#1.offset_7| Int)) (= (select .cse5 |v_ULTIMATE.start_dll_circular_create_~last~0#1.offset_7|) .cse0))) (not (= |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base| .cse4))))))))) is different from true [2024-11-08 13:57:52,404 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (and (let ((.cse2 (+ (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (or (exists ((|v_old(#memory_$Pointer$#1.base)_AFTER_CALL_9| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_9| |c_#memory_$Pointer$#1.base|)) (.cse1 (select |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_9| .cse3))) (and (= |c_#memory_$Pointer$#1.base| (store |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_9| .cse0 (select |c_#memory_$Pointer$#1.base| .cse0))) (= .cse0 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) (not (= (select .cse1 .cse2) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|)) (exists ((|v_ULTIMATE.start_dll_circular_create_~last~0#1.offset_7| Int)) (= (select .cse1 |v_ULTIMATE.start_dll_circular_create_~last~0#1.offset_7|) .cse3))))) (let ((.cse5 (select |c_#memory_$Pointer$#1.base| .cse3))) (let ((.cse4 (select .cse5 .cse2))) (and (or (not (= .cse3 .cse4)) (exists ((|v_ULTIMATE.start_dll_circular_create_~last~0#1.offset_7| Int)) (= (select .cse5 |v_ULTIMATE.start_dll_circular_create_~last~0#1.offset_7|) .cse3))) (not (= |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| .cse4))))))) (= |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| .cse3)))) is different from false [2024-11-08 13:57:52,407 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (and (let ((.cse2 (+ (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (or (exists ((|v_old(#memory_$Pointer$#1.base)_AFTER_CALL_9| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_9| |c_#memory_$Pointer$#1.base|)) (.cse1 (select |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_9| .cse3))) (and (= |c_#memory_$Pointer$#1.base| (store |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_9| .cse0 (select |c_#memory_$Pointer$#1.base| .cse0))) (= .cse0 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) (not (= (select .cse1 .cse2) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|)) (exists ((|v_ULTIMATE.start_dll_circular_create_~last~0#1.offset_7| Int)) (= (select .cse1 |v_ULTIMATE.start_dll_circular_create_~last~0#1.offset_7|) .cse3))))) (let ((.cse5 (select |c_#memory_$Pointer$#1.base| .cse3))) (let ((.cse4 (select .cse5 .cse2))) (and (or (not (= .cse3 .cse4)) (exists ((|v_ULTIMATE.start_dll_circular_create_~last~0#1.offset_7| Int)) (= (select .cse5 |v_ULTIMATE.start_dll_circular_create_~last~0#1.offset_7|) .cse3))) (not (= |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| .cse4))))))) (= |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| .cse3)))) is different from true [2024-11-08 13:57:52,434 INFO L349 Elim1Store]: treesize reduction 98, result has 1.0 percent of original size [2024-11-08 13:57:52,434 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 164 treesize of output 165 [2024-11-08 13:57:52,440 INFO L378 Elim1Store]: Elim1 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 0 case distinctions, treesize of input 216 treesize of output 157 [2024-11-08 13:57:52,457 INFO L378 Elim1Store]: Elim1 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 0 case distinctions, treesize of input 296 treesize of output 261 [2024-11-08 13:57:52,466 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 16 treesize of output 1 [2024-11-08 13:57:52,503 INFO L378 Elim1Store]: Elim1 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 0 case distinctions, treesize of input 194 treesize of output 131 [2024-11-08 13:57:52,513 INFO L378 Elim1Store]: Elim1 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 0 case distinctions, treesize of input 131 treesize of output 100 [2024-11-08 13:57:52,538 INFO L378 Elim1Store]: Elim1 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 0 case distinctions, treesize of input 180 treesize of output 125 [2024-11-08 13:57:52,545 INFO L378 Elim1Store]: Elim1 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 0 case distinctions, treesize of input 125 treesize of output 94 [2024-11-08 13:57:52,554 INFO L378 Elim1Store]: Elim1 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 0 case distinctions, treesize of input 252 treesize of output 181 [2024-11-08 13:57:52,563 INFO L378 Elim1Store]: Elim1 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 0 case distinctions, treesize of input 188 treesize of output 149 [2024-11-08 13:57:52,618 INFO L349 Elim1Store]: treesize reduction 83, result has 1.2 percent of original size [2024-11-08 13:57:52,619 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 105 treesize of output 116 [2024-11-08 13:57:52,630 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 237 treesize of output 190 [2024-11-08 13:57:56,707 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse6 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse3 (select |c_#memory_$Pointer$#1.base| .cse1)) (.cse4 (+ .cse6 4))) (let ((.cse5 (select .cse3 .cse4))) (or (exists ((v_arrayElimCell_50 Int) (v_ArrVal_975 (Array Int Int)) (v_DerPreprocessor_7 (Array Int Int)) (v_DerPreprocessor_9 (Array Int Int)) (v_DerPreprocessor_6 Int) (v_DerPreprocessor_8 (Array Int Int)) (v_ArrVal_972 (Array Int Int))) (let ((.cse2 (select v_DerPreprocessor_9 .cse6))) (let ((.cse0 (select (select (store (store (store |c_#memory_$Pointer$#1.base| .cse2 v_DerPreprocessor_7) v_DerPreprocessor_6 v_DerPreprocessor_8) .cse1 v_DerPreprocessor_9) .cse2) (+ 4 v_arrayElimCell_50)))) (and (= .cse0 v_DerPreprocessor_6) (not (= .cse0 .cse1)) (not (= .cse0 .cse2)) (= .cse3 (store (select (store (store (store (store |c_#memory_$Pointer$#1.base| v_DerPreprocessor_6 v_DerPreprocessor_8) .cse1 v_DerPreprocessor_9) .cse2 v_ArrVal_972) .cse0 v_ArrVal_975) .cse1) .cse4 .cse5)) (not (= .cse2 .cse1)))))) (exists ((v_arrayElimCell_55 Int)) (and (not (= .cse1 v_arrayElimCell_55)) (exists ((v_ArrVal_975 (Array Int Int)) (|v_#memory_$Pointer$#1.base_56| (Array Int (Array Int Int))) (v_ArrVal_977 Int) (v_arrayElimCell_56 Int) (v_ArrVal_972 (Array Int Int))) (let ((.cse7 (select (select |v_#memory_$Pointer$#1.base_56| v_arrayElimCell_55) (+ 4 v_arrayElimCell_56)))) (and (= |c_#memory_$Pointer$#1.base| (store (store |v_#memory_$Pointer$#1.base_56| .cse7 (select |c_#memory_$Pointer$#1.base| .cse7)) .cse1 (store (select (store (store (store |v_#memory_$Pointer$#1.base_56| .cse1 (store (select |v_#memory_$Pointer$#1.base_56| .cse1) .cse6 v_arrayElimCell_55)) v_arrayElimCell_55 v_ArrVal_972) .cse7 v_ArrVal_975) .cse1) .cse4 v_ArrVal_977))) (= .cse7 v_arrayElimCell_55) (exists ((v_prenex_5 Int) (|v_old(#memory_$Pointer$#1.base)_AFTER_CALL_9| (Array Int (Array Int Int)))) (let ((.cse8 (@diff |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_9| |v_#memory_$Pointer$#1.base_56|))) (and (= (select (select |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_9| v_arrayElimCell_55) v_prenex_5) v_arrayElimCell_55) (= .cse8 .cse1) (= (store |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_9| .cse8 (select |v_#memory_$Pointer$#1.base_56| .cse8)) |v_#memory_$Pointer$#1.base_56|))))))))) (exists ((v_ArrVal_975 (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.offset_7| Int) (v_arrayElimArr_8 (Array Int Int)) (v_DerPreprocessor_11 (Array Int Int)) (v_DerPreprocessor_10 Int) (v_arrayElimCell_56 Int) (v_ArrVal_972 (Array Int Int))) (let ((.cse12 (store (store |c_#memory_$Pointer$#1.base| v_DerPreprocessor_10 v_DerPreprocessor_11) .cse1 v_arrayElimArr_8)) (.cse10 (select v_arrayElimArr_8 .cse6))) (let ((.cse11 (select .cse12 .cse10))) (let ((.cse9 (select .cse11 (+ 4 v_arrayElimCell_56)))) (and (= .cse9 .cse10) (= .cse10 (select .cse11 |v_ULTIMATE.start_dll_circular_create_~last~0#1.offset_7|)) (= (store (select (store (store .cse12 .cse10 v_ArrVal_972) .cse9 v_ArrVal_975) .cse1) .cse4 .cse5) .cse3) (= v_DerPreprocessor_10 .cse9) (not (= .cse10 .cse1))))))))))) is different from false [2024-11-08 13:57:56,713 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse6 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse3 (select |c_#memory_$Pointer$#1.base| .cse1)) (.cse4 (+ .cse6 4))) (let ((.cse5 (select .cse3 .cse4))) (or (exists ((v_arrayElimCell_50 Int) (v_ArrVal_975 (Array Int Int)) (v_DerPreprocessor_7 (Array Int Int)) (v_DerPreprocessor_9 (Array Int Int)) (v_DerPreprocessor_6 Int) (v_DerPreprocessor_8 (Array Int Int)) (v_ArrVal_972 (Array Int Int))) (let ((.cse2 (select v_DerPreprocessor_9 .cse6))) (let ((.cse0 (select (select (store (store (store |c_#memory_$Pointer$#1.base| .cse2 v_DerPreprocessor_7) v_DerPreprocessor_6 v_DerPreprocessor_8) .cse1 v_DerPreprocessor_9) .cse2) (+ 4 v_arrayElimCell_50)))) (and (= .cse0 v_DerPreprocessor_6) (not (= .cse0 .cse1)) (not (= .cse0 .cse2)) (= .cse3 (store (select (store (store (store (store |c_#memory_$Pointer$#1.base| v_DerPreprocessor_6 v_DerPreprocessor_8) .cse1 v_DerPreprocessor_9) .cse2 v_ArrVal_972) .cse0 v_ArrVal_975) .cse1) .cse4 .cse5)) (not (= .cse2 .cse1)))))) (exists ((v_arrayElimCell_55 Int)) (and (not (= .cse1 v_arrayElimCell_55)) (exists ((v_ArrVal_975 (Array Int Int)) (|v_#memory_$Pointer$#1.base_56| (Array Int (Array Int Int))) (v_ArrVal_977 Int) (v_arrayElimCell_56 Int) (v_ArrVal_972 (Array Int Int))) (let ((.cse7 (select (select |v_#memory_$Pointer$#1.base_56| v_arrayElimCell_55) (+ 4 v_arrayElimCell_56)))) (and (= |c_#memory_$Pointer$#1.base| (store (store |v_#memory_$Pointer$#1.base_56| .cse7 (select |c_#memory_$Pointer$#1.base| .cse7)) .cse1 (store (select (store (store (store |v_#memory_$Pointer$#1.base_56| .cse1 (store (select |v_#memory_$Pointer$#1.base_56| .cse1) .cse6 v_arrayElimCell_55)) v_arrayElimCell_55 v_ArrVal_972) .cse7 v_ArrVal_975) .cse1) .cse4 v_ArrVal_977))) (= .cse7 v_arrayElimCell_55) (exists ((v_prenex_5 Int) (|v_old(#memory_$Pointer$#1.base)_AFTER_CALL_9| (Array Int (Array Int Int)))) (let ((.cse8 (@diff |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_9| |v_#memory_$Pointer$#1.base_56|))) (and (= (select (select |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_9| v_arrayElimCell_55) v_prenex_5) v_arrayElimCell_55) (= .cse8 .cse1) (= (store |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_9| .cse8 (select |v_#memory_$Pointer$#1.base_56| .cse8)) |v_#memory_$Pointer$#1.base_56|))))))))) (exists ((v_ArrVal_975 (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.offset_7| Int) (v_arrayElimArr_8 (Array Int Int)) (v_DerPreprocessor_11 (Array Int Int)) (v_DerPreprocessor_10 Int) (v_arrayElimCell_56 Int) (v_ArrVal_972 (Array Int Int))) (let ((.cse12 (store (store |c_#memory_$Pointer$#1.base| v_DerPreprocessor_10 v_DerPreprocessor_11) .cse1 v_arrayElimArr_8)) (.cse10 (select v_arrayElimArr_8 .cse6))) (let ((.cse11 (select .cse12 .cse10))) (let ((.cse9 (select .cse11 (+ 4 v_arrayElimCell_56)))) (and (= .cse9 .cse10) (= .cse10 (select .cse11 |v_ULTIMATE.start_dll_circular_create_~last~0#1.offset_7|)) (= (store (select (store (store .cse12 .cse10 v_ArrVal_972) .cse9 v_ArrVal_975) .cse1) .cse4 .cse5) .cse3) (= v_DerPreprocessor_10 .cse9) (not (= .cse10 .cse1))))))))))) is different from true [2024-11-08 13:57:56,745 INFO L378 Elim1Store]: Elim1 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 531 treesize of output 427 [2024-11-08 13:58:00,818 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (and (let ((.cse7 (select |c_#memory_$Pointer$#1.base| .cse0)) (.cse2 (+ |c_ULTIMATE.start_main_~ptr~0#1.offset| 4))) (let ((.cse6 (select .cse7 .cse2))) (or (exists ((v_prenex_5 Int) (|v_#memory_$Pointer$#1.base_56| (Array Int (Array Int Int))) (|v_old(#memory_$Pointer$#1.base)_AFTER_CALL_9| (Array Int (Array Int Int))) (v_ArrVal_977 Int) (v_prenex_6 (Array Int Int)) (v_arrayElimCell_56 Int) (v_prenex_7 (Array Int Int)) (v_arrayElimCell_55 Int)) (let ((.cse1 (select (select |v_#memory_$Pointer$#1.base_56| v_arrayElimCell_55) (+ 4 v_arrayElimCell_56))) (.cse3 (@diff |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_9| |v_#memory_$Pointer$#1.base_56|))) (and (not (= .cse0 v_arrayElimCell_55)) (= |c_#memory_$Pointer$#1.base| (store (store |v_#memory_$Pointer$#1.base_56| .cse1 (select |c_#memory_$Pointer$#1.base| .cse1)) .cse0 (store (select (store (store (store |v_#memory_$Pointer$#1.base_56| .cse0 (store (select |v_#memory_$Pointer$#1.base_56| .cse0) |c_ULTIMATE.start_main_~ptr~0#1.offset| v_arrayElimCell_55)) v_arrayElimCell_55 v_prenex_7) .cse1 v_prenex_6) .cse0) .cse2 v_ArrVal_977))) (= (select (select |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_9| v_arrayElimCell_55) v_prenex_5) v_arrayElimCell_55) (= .cse1 v_arrayElimCell_55) (= .cse3 .cse0) (= (store |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_9| .cse3 (select |v_#memory_$Pointer$#1.base_56| .cse3)) |v_#memory_$Pointer$#1.base_56|)))) (exists ((v_arrayElimCell_50 Int) (v_ArrVal_975 (Array Int Int)) (v_DerPreprocessor_7 (Array Int Int)) (v_DerPreprocessor_9 (Array Int Int)) (v_DerPreprocessor_6 Int) (v_DerPreprocessor_8 (Array Int Int)) (v_ArrVal_972 (Array Int Int))) (let ((.cse4 (select v_DerPreprocessor_9 |c_ULTIMATE.start_main_~ptr~0#1.offset|))) (let ((.cse5 (select (select (store (store (store |c_#memory_$Pointer$#1.base| .cse4 v_DerPreprocessor_7) v_DerPreprocessor_6 v_DerPreprocessor_8) .cse0 v_DerPreprocessor_9) .cse4) (+ 4 v_arrayElimCell_50)))) (and (not (= .cse4 .cse0)) (= (store (select (store (store (store (store |c_#memory_$Pointer$#1.base| v_DerPreprocessor_6 v_DerPreprocessor_8) .cse0 v_DerPreprocessor_9) .cse4 v_ArrVal_972) .cse5 v_ArrVal_975) .cse0) .cse2 .cse6) .cse7) (not (= .cse5 .cse0)) (= .cse5 v_DerPreprocessor_6) (not (= .cse4 .cse5)))))) (exists ((v_prenex_8 (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.offset_7| Int) (v_arrayElimArr_8 (Array Int Int)) (v_prenex_10 (Array Int Int)) (v_DerPreprocessor_11 (Array Int Int)) (v_DerPreprocessor_10 Int) (v_prenex_9 Int)) (let ((.cse9 (store (store |c_#memory_$Pointer$#1.base| v_DerPreprocessor_10 v_DerPreprocessor_11) .cse0 v_arrayElimArr_8)) (.cse8 (select v_arrayElimArr_8 |c_ULTIMATE.start_main_~ptr~0#1.offset|))) (let ((.cse11 (select .cse9 .cse8))) (let ((.cse10 (select .cse11 (+ v_prenex_9 4)))) (and (not (= .cse8 .cse0)) (= (store (select (store (store .cse9 .cse8 v_prenex_10) .cse10 v_prenex_8) .cse0) .cse2 .cse6) .cse7) (= .cse10 v_DerPreprocessor_10) (= (select .cse11 |v_ULTIMATE.start_dll_circular_create_~last~0#1.offset_7|) .cse8) (= .cse10 .cse8))))))))) (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse0))) is different from false [2024-11-08 13:58:00,821 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (and (let ((.cse7 (select |c_#memory_$Pointer$#1.base| .cse0)) (.cse2 (+ |c_ULTIMATE.start_main_~ptr~0#1.offset| 4))) (let ((.cse6 (select .cse7 .cse2))) (or (exists ((v_prenex_5 Int) (|v_#memory_$Pointer$#1.base_56| (Array Int (Array Int Int))) (|v_old(#memory_$Pointer$#1.base)_AFTER_CALL_9| (Array Int (Array Int Int))) (v_ArrVal_977 Int) (v_prenex_6 (Array Int Int)) (v_arrayElimCell_56 Int) (v_prenex_7 (Array Int Int)) (v_arrayElimCell_55 Int)) (let ((.cse1 (select (select |v_#memory_$Pointer$#1.base_56| v_arrayElimCell_55) (+ 4 v_arrayElimCell_56))) (.cse3 (@diff |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_9| |v_#memory_$Pointer$#1.base_56|))) (and (not (= .cse0 v_arrayElimCell_55)) (= |c_#memory_$Pointer$#1.base| (store (store |v_#memory_$Pointer$#1.base_56| .cse1 (select |c_#memory_$Pointer$#1.base| .cse1)) .cse0 (store (select (store (store (store |v_#memory_$Pointer$#1.base_56| .cse0 (store (select |v_#memory_$Pointer$#1.base_56| .cse0) |c_ULTIMATE.start_main_~ptr~0#1.offset| v_arrayElimCell_55)) v_arrayElimCell_55 v_prenex_7) .cse1 v_prenex_6) .cse0) .cse2 v_ArrVal_977))) (= (select (select |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_9| v_arrayElimCell_55) v_prenex_5) v_arrayElimCell_55) (= .cse1 v_arrayElimCell_55) (= .cse3 .cse0) (= (store |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_9| .cse3 (select |v_#memory_$Pointer$#1.base_56| .cse3)) |v_#memory_$Pointer$#1.base_56|)))) (exists ((v_arrayElimCell_50 Int) (v_ArrVal_975 (Array Int Int)) (v_DerPreprocessor_7 (Array Int Int)) (v_DerPreprocessor_9 (Array Int Int)) (v_DerPreprocessor_6 Int) (v_DerPreprocessor_8 (Array Int Int)) (v_ArrVal_972 (Array Int Int))) (let ((.cse4 (select v_DerPreprocessor_9 |c_ULTIMATE.start_main_~ptr~0#1.offset|))) (let ((.cse5 (select (select (store (store (store |c_#memory_$Pointer$#1.base| .cse4 v_DerPreprocessor_7) v_DerPreprocessor_6 v_DerPreprocessor_8) .cse0 v_DerPreprocessor_9) .cse4) (+ 4 v_arrayElimCell_50)))) (and (not (= .cse4 .cse0)) (= (store (select (store (store (store (store |c_#memory_$Pointer$#1.base| v_DerPreprocessor_6 v_DerPreprocessor_8) .cse0 v_DerPreprocessor_9) .cse4 v_ArrVal_972) .cse5 v_ArrVal_975) .cse0) .cse2 .cse6) .cse7) (not (= .cse5 .cse0)) (= .cse5 v_DerPreprocessor_6) (not (= .cse4 .cse5)))))) (exists ((v_prenex_8 (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.offset_7| Int) (v_arrayElimArr_8 (Array Int Int)) (v_prenex_10 (Array Int Int)) (v_DerPreprocessor_11 (Array Int Int)) (v_DerPreprocessor_10 Int) (v_prenex_9 Int)) (let ((.cse9 (store (store |c_#memory_$Pointer$#1.base| v_DerPreprocessor_10 v_DerPreprocessor_11) .cse0 v_arrayElimArr_8)) (.cse8 (select v_arrayElimArr_8 |c_ULTIMATE.start_main_~ptr~0#1.offset|))) (let ((.cse11 (select .cse9 .cse8))) (let ((.cse10 (select .cse11 (+ v_prenex_9 4)))) (and (not (= .cse8 .cse0)) (= (store (select (store (store .cse9 .cse8 v_prenex_10) .cse10 v_prenex_8) .cse0) .cse2 .cse6) .cse7) (= .cse10 v_DerPreprocessor_10) (= (select .cse11 |v_ULTIMATE.start_dll_circular_create_~last~0#1.offset_7|) .cse8) (= .cse10 .cse8))))))))) (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse0))) is different from true [2024-11-08 13:58:00,956 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 13:58:00,963 INFO L378 Elim1Store]: Elim1 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 282 treesize of output 208 [2024-11-08 13:58:00,975 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2024-11-08 13:58:00,976 INFO L378 Elim1Store]: Elim1 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 203 treesize of output 185 [2024-11-08 13:58:00,990 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 13:58:00,991 INFO L378 Elim1Store]: Elim1 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 185 treesize of output 177 [2024-11-08 13:58:00,998 INFO L378 Elim1Store]: Elim1 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 92 [2024-11-08 13:58:01,005 INFO L378 Elim1Store]: Elim1 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 159 treesize of output 131 [2024-11-08 13:58:01,045 INFO L378 Elim1Store]: Elim1 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 11 treesize of output 7 [2024-11-08 13:58:01,064 INFO L378 Elim1Store]: Elim1 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 16 treesize of output 12 [2024-11-08 13:58:01,073 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 13:58:01,080 INFO L378 Elim1Store]: Elim1 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 272 treesize of output 218 [2024-11-08 13:58:01,094 INFO L378 Elim1Store]: Elim1 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 179 treesize of output 159 [2024-11-08 13:58:01,101 INFO L378 Elim1Store]: Elim1 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 165 treesize of output 145 [2024-11-08 13:58:01,107 INFO L378 Elim1Store]: Elim1 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 183 treesize of output 159 [2024-11-08 13:58:01,117 INFO L378 Elim1Store]: Elim1 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 74 [2024-11-08 13:58:01,138 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (exists ((v_prenex_5 Int) (|v_#memory_$Pointer$#1.base_56| (Array Int (Array Int Int))) (|v_ULTIMATE.start_main_~ptr~0#1.offset_11| Int) (|v_old(#memory_$Pointer$#1.base)_AFTER_CALL_9| (Array Int (Array Int Int))) (v_arrayElimCell_56 Int) (v_prenex_6 (Array Int Int)) (v_arrayElimCell_55 Int) (v_prenex_7 (Array Int Int))) (let ((.cse1 (select (select |v_#memory_$Pointer$#1.base_56| v_arrayElimCell_55) (+ 4 v_arrayElimCell_56))) (.cse2 (@diff |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_9| |v_#memory_$Pointer$#1.base_56|))) (and (= |c_ULTIMATE.start_main_~ptr~0#1.base| (select (select (store (store (store |v_#memory_$Pointer$#1.base_56| .cse0 (store (select |v_#memory_$Pointer$#1.base_56| .cse0) |v_ULTIMATE.start_main_~ptr~0#1.offset_11| v_arrayElimCell_55)) v_arrayElimCell_55 v_prenex_7) .cse1 v_prenex_6) .cse0) |v_ULTIMATE.start_main_~ptr~0#1.offset_11|)) (not (= .cse0 v_arrayElimCell_55)) (= (select (select |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_9| v_arrayElimCell_55) v_prenex_5) v_arrayElimCell_55) (= .cse1 v_arrayElimCell_55) (= .cse2 .cse0) (= (store |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_9| .cse2 (select |v_#memory_$Pointer$#1.base_56| .cse2)) |v_#memory_$Pointer$#1.base_56|)))) (not (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse0)))) is different from false [2024-11-08 13:58:01,141 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (exists ((v_prenex_5 Int) (|v_#memory_$Pointer$#1.base_56| (Array Int (Array Int Int))) (|v_ULTIMATE.start_main_~ptr~0#1.offset_11| Int) (|v_old(#memory_$Pointer$#1.base)_AFTER_CALL_9| (Array Int (Array Int Int))) (v_arrayElimCell_56 Int) (v_prenex_6 (Array Int Int)) (v_arrayElimCell_55 Int) (v_prenex_7 (Array Int Int))) (let ((.cse1 (select (select |v_#memory_$Pointer$#1.base_56| v_arrayElimCell_55) (+ 4 v_arrayElimCell_56))) (.cse2 (@diff |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_9| |v_#memory_$Pointer$#1.base_56|))) (and (= |c_ULTIMATE.start_main_~ptr~0#1.base| (select (select (store (store (store |v_#memory_$Pointer$#1.base_56| .cse0 (store (select |v_#memory_$Pointer$#1.base_56| .cse0) |v_ULTIMATE.start_main_~ptr~0#1.offset_11| v_arrayElimCell_55)) v_arrayElimCell_55 v_prenex_7) .cse1 v_prenex_6) .cse0) |v_ULTIMATE.start_main_~ptr~0#1.offset_11|)) (not (= .cse0 v_arrayElimCell_55)) (= (select (select |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_9| v_arrayElimCell_55) v_prenex_5) v_arrayElimCell_55) (= .cse1 v_arrayElimCell_55) (= .cse2 .cse0) (= (store |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_9| .cse2 (select |v_#memory_$Pointer$#1.base_56| .cse2)) |v_#memory_$Pointer$#1.base_56|)))) (not (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse0)))) is different from true [2024-11-08 13:58:01,153 INFO L378 Elim1Store]: Elim1 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 102 treesize of output 74 [2024-11-08 13:58:01,160 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 13:58:01,161 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 13:58:01,187 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_975 (Array Int Int)) (|ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| Int) (v_ArrVal_978 (Array Int Int)) (v_ArrVal_977 Int) (v_ArrVal_971 (Array Int Int)) (v_ArrVal_972 (Array Int Int))) (not (let ((.cse4 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| (store .cse4 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= .cse0 (let ((.cse3 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|))) (select (select (let ((.cse1 (select .cse4 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset|))) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| .cse1) (+ (select .cse3 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset|) 4)))) (store (store (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_971) .cse2 v_ArrVal_978) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select (store (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| .cse1)) .cse1 v_ArrVal_972) .cse2 v_ArrVal_975) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) (+ |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| 4) v_ArrVal_977)))) .cse0) (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| (store .cse3 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset| |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))))) is different from false [2024-11-08 13:58:01,202 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_975 (Array Int Int)) (|ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| Int) (v_ArrVal_978 (Array Int Int)) (v_ArrVal_977 Int) (v_ArrVal_971 (Array Int Int)) (v_ArrVal_972 (Array Int Int))) (not (let ((.cse3 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|))) (let ((.cse4 (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| (store .cse3 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= (let ((.cse2 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|))) (select (select (let ((.cse0 (select .cse3 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| .cse0) (+ (select .cse2 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset|) 4)))) (store (store (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_971) .cse1 v_ArrVal_978) |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base| (store (select (store (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base|) |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| .cse0)) .cse0 v_ArrVal_972) .cse1 v_ArrVal_975) |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base|) (+ |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| 4) v_ArrVal_977)))) .cse4) (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| (store .cse2 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset| |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) .cse4))))) is different from false [2024-11-08 13:58:01,248 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_975 (Array Int Int)) (|ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| Int) (v_ArrVal_978 (Array Int Int)) (v_ArrVal_977 Int) (v_ArrVal_971 (Array Int Int)) (v_ArrVal_981 (Array Int Int)) (|v_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base_18| Int) (v_ArrVal_972 (Array Int Int))) (or (not (let ((.cse3 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|))) (let ((.cse4 (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| (store .cse3 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset| |v_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base_18|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= (let ((.cse2 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|))) (select (select (let ((.cse0 (select .cse3 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset|))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base_18| v_ArrVal_981) .cse0) (+ (select .cse2 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset|) 4)))) (store (store (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_971) .cse1 v_ArrVal_978) |v_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base_18| (store (select (store (store (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base_18| (store v_ArrVal_981 |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| .cse0)) .cse0 v_ArrVal_972) .cse1 v_ArrVal_975) |v_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base_18|) (+ |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| 4) v_ArrVal_977)))) .cse4) (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| (store .cse2 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset| |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) .cse4)))) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base_18|) 0)))) is different from false [2024-11-08 13:58:01,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2085390593] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 13:58:01,252 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 13:58:01,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 23] total 36 [2024-11-08 13:58:01,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327978980] [2024-11-08 13:58:01,252 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 13:58:01,253 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2024-11-08 13:58:01,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 13:58:01,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2024-11-08 13:58:01,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=855, Unknown=13, NotChecked=520, Total=1482 [2024-11-08 13:58:01,257 INFO L87 Difference]: Start difference. First operand 38 states and 43 transitions. Second operand has 36 states, 34 states have (on average 1.4411764705882353) internal successors, (49), 28 states have internal predecessors, (49), 4 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2024-11-08 13:58:05,659 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| .cse2) 4)) (.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (and (= 1 (select |c_#valid| .cse0)) (= |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (not (= .cse0 |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base|)) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset|) 0) (not (= |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base| .cse1)) (= |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base| .cse2)) (= (select |c_#valid| .cse2) 1) (let ((.cse5 (+ (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (or (exists ((|v_old(#memory_$Pointer$#1.base)_AFTER_CALL_9| (Array Int (Array Int Int)))) (let ((.cse3 (@diff |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_9| |c_#memory_$Pointer$#1.base|)) (.cse4 (select |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_9| .cse1))) (and (= |c_#memory_$Pointer$#1.base| (store |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_9| .cse3 (select |c_#memory_$Pointer$#1.base| .cse3))) (= |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base| .cse3) (not (= |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base| (select .cse4 .cse5))) (exists ((|v_ULTIMATE.start_dll_circular_create_~last~0#1.offset_7| Int)) (= (select .cse4 |v_ULTIMATE.start_dll_circular_create_~last~0#1.offset_7|) .cse1))))) (let ((.cse7 (select |c_#memory_$Pointer$#1.base| .cse1))) (let ((.cse6 (select .cse7 .cse5))) (and (or (not (= .cse1 .cse6)) (exists ((|v_ULTIMATE.start_dll_circular_create_~last~0#1.offset_7| Int)) (= (select .cse7 |v_ULTIMATE.start_dll_circular_create_~last~0#1.offset_7|) .cse1))) (not (= |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base| .cse6)))))))))) is different from false [2024-11-08 13:58:05,661 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| .cse2) 4)) (.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (and (= 1 (select |c_#valid| .cse0)) (= |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (not (= .cse0 |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base|)) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset|) 0) (not (= |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base| .cse1)) (= |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base| .cse2)) (= (select |c_#valid| .cse2) 1) (let ((.cse5 (+ (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (or (exists ((|v_old(#memory_$Pointer$#1.base)_AFTER_CALL_9| (Array Int (Array Int Int)))) (let ((.cse3 (@diff |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_9| |c_#memory_$Pointer$#1.base|)) (.cse4 (select |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_9| .cse1))) (and (= |c_#memory_$Pointer$#1.base| (store |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_9| .cse3 (select |c_#memory_$Pointer$#1.base| .cse3))) (= |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base| .cse3) (not (= |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base| (select .cse4 .cse5))) (exists ((|v_ULTIMATE.start_dll_circular_create_~last~0#1.offset_7| Int)) (= (select .cse4 |v_ULTIMATE.start_dll_circular_create_~last~0#1.offset_7|) .cse1))))) (let ((.cse7 (select |c_#memory_$Pointer$#1.base| .cse1))) (let ((.cse6 (select .cse7 .cse5))) (and (or (not (= .cse1 .cse6)) (exists ((|v_ULTIMATE.start_dll_circular_create_~last~0#1.offset_7| Int)) (= (select .cse7 |v_ULTIMATE.start_dll_circular_create_~last~0#1.offset_7|) .cse1))) (not (= |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base| .cse6)))))))))) is different from true [2024-11-08 13:58:09,664 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset|)) (.cse4 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (and (not (= (select (select |c_#memory_$Pointer$#1.base| .cse0) (+ (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset|) 4)) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|)) (let ((.cse3 (+ (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (or (exists ((|v_old(#memory_$Pointer$#1.base)_AFTER_CALL_9| (Array Int (Array Int Int)))) (let ((.cse1 (@diff |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_9| |c_#memory_$Pointer$#1.base|)) (.cse2 (select |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_9| .cse4))) (and (= |c_#memory_$Pointer$#1.base| (store |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_9| .cse1 (select |c_#memory_$Pointer$#1.base| .cse1))) (= .cse1 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) (not (= (select .cse2 .cse3) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|)) (exists ((|v_ULTIMATE.start_dll_circular_create_~last~0#1.offset_7| Int)) (= (select .cse2 |v_ULTIMATE.start_dll_circular_create_~last~0#1.offset_7|) .cse4))))) (let ((.cse6 (select |c_#memory_$Pointer$#1.base| .cse4))) (let ((.cse5 (select .cse6 .cse3))) (and (or (not (= .cse4 .cse5)) (exists ((|v_ULTIMATE.start_dll_circular_create_~last~0#1.offset_7| Int)) (= (select .cse6 |v_ULTIMATE.start_dll_circular_create_~last~0#1.offset_7|) .cse4))) (not (= |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| .cse5))))))) (= |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (not (= .cse0 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|)) (= |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| .cse4)))) is different from false [2024-11-08 13:58:09,666 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset|)) (.cse4 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (and (not (= (select (select |c_#memory_$Pointer$#1.base| .cse0) (+ (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset|) 4)) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|)) (let ((.cse3 (+ (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (or (exists ((|v_old(#memory_$Pointer$#1.base)_AFTER_CALL_9| (Array Int (Array Int Int)))) (let ((.cse1 (@diff |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_9| |c_#memory_$Pointer$#1.base|)) (.cse2 (select |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_9| .cse4))) (and (= |c_#memory_$Pointer$#1.base| (store |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_9| .cse1 (select |c_#memory_$Pointer$#1.base| .cse1))) (= .cse1 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) (not (= (select .cse2 .cse3) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|)) (exists ((|v_ULTIMATE.start_dll_circular_create_~last~0#1.offset_7| Int)) (= (select .cse2 |v_ULTIMATE.start_dll_circular_create_~last~0#1.offset_7|) .cse4))))) (let ((.cse6 (select |c_#memory_$Pointer$#1.base| .cse4))) (let ((.cse5 (select .cse6 .cse3))) (and (or (not (= .cse4 .cse5)) (exists ((|v_ULTIMATE.start_dll_circular_create_~last~0#1.offset_7| Int)) (= (select .cse6 |v_ULTIMATE.start_dll_circular_create_~last~0#1.offset_7|) .cse4))) (not (= |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| .cse5))))))) (= |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (not (= .cse0 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|)) (= |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| .cse4)))) is different from true [2024-11-08 13:58:13,674 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (select |c_#memory_$Pointer$#1.base| .cse2)) (.cse1 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (and (not (= (select .cse0 .cse1) .cse2)) (let ((.cse5 (+ .cse1 4))) (let ((.cse6 (select .cse0 .cse5))) (or (exists ((v_arrayElimCell_50 Int) (v_ArrVal_975 (Array Int Int)) (v_DerPreprocessor_7 (Array Int Int)) (v_DerPreprocessor_9 (Array Int Int)) (v_DerPreprocessor_6 Int) (v_DerPreprocessor_8 (Array Int Int)) (v_ArrVal_972 (Array Int Int))) (let ((.cse4 (select v_DerPreprocessor_9 .cse1))) (let ((.cse3 (select (select (store (store (store |c_#memory_$Pointer$#1.base| .cse4 v_DerPreprocessor_7) v_DerPreprocessor_6 v_DerPreprocessor_8) .cse2 v_DerPreprocessor_9) .cse4) (+ 4 v_arrayElimCell_50)))) (and (= .cse3 v_DerPreprocessor_6) (not (= .cse3 .cse2)) (not (= .cse3 .cse4)) (= .cse0 (store (select (store (store (store (store |c_#memory_$Pointer$#1.base| v_DerPreprocessor_6 v_DerPreprocessor_8) .cse2 v_DerPreprocessor_9) .cse4 v_ArrVal_972) .cse3 v_ArrVal_975) .cse2) .cse5 .cse6)) (not (= .cse4 .cse2)))))) (exists ((v_arrayElimCell_55 Int)) (and (not (= .cse2 v_arrayElimCell_55)) (exists ((v_ArrVal_975 (Array Int Int)) (|v_#memory_$Pointer$#1.base_56| (Array Int (Array Int Int))) (v_ArrVal_977 Int) (v_arrayElimCell_56 Int) (v_ArrVal_972 (Array Int Int))) (let ((.cse7 (select (select |v_#memory_$Pointer$#1.base_56| v_arrayElimCell_55) (+ 4 v_arrayElimCell_56)))) (and (= |c_#memory_$Pointer$#1.base| (store (store |v_#memory_$Pointer$#1.base_56| .cse7 (select |c_#memory_$Pointer$#1.base| .cse7)) .cse2 (store (select (store (store (store |v_#memory_$Pointer$#1.base_56| .cse2 (store (select |v_#memory_$Pointer$#1.base_56| .cse2) .cse1 v_arrayElimCell_55)) v_arrayElimCell_55 v_ArrVal_972) .cse7 v_ArrVal_975) .cse2) .cse5 v_ArrVal_977))) (= .cse7 v_arrayElimCell_55) (exists ((v_prenex_5 Int) (|v_old(#memory_$Pointer$#1.base)_AFTER_CALL_9| (Array Int (Array Int Int)))) (let ((.cse8 (@diff |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_9| |v_#memory_$Pointer$#1.base_56|))) (and (= (select (select |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_9| v_arrayElimCell_55) v_prenex_5) v_arrayElimCell_55) (= .cse8 .cse2) (= (store |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_9| .cse8 (select |v_#memory_$Pointer$#1.base_56| .cse8)) |v_#memory_$Pointer$#1.base_56|))))))))) (exists ((v_ArrVal_975 (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.offset_7| Int) (v_arrayElimArr_8 (Array Int Int)) (v_DerPreprocessor_11 (Array Int Int)) (v_DerPreprocessor_10 Int) (v_arrayElimCell_56 Int) (v_ArrVal_972 (Array Int Int))) (let ((.cse12 (store (store |c_#memory_$Pointer$#1.base| v_DerPreprocessor_10 v_DerPreprocessor_11) .cse2 v_arrayElimArr_8)) (.cse10 (select v_arrayElimArr_8 .cse1))) (let ((.cse11 (select .cse12 .cse10))) (let ((.cse9 (select .cse11 (+ 4 v_arrayElimCell_56)))) (and (= .cse9 .cse10) (= .cse10 (select .cse11 |v_ULTIMATE.start_dll_circular_create_~last~0#1.offset_7|)) (= (store (select (store (store .cse12 .cse10 v_ArrVal_972) .cse9 v_ArrVal_975) .cse2) .cse5 .cse6) .cse0) (= v_DerPreprocessor_10 .cse9) (not (= .cse10 .cse2))))))))))))) is different from false [2024-11-08 13:58:13,682 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (select |c_#memory_$Pointer$#1.base| .cse2)) (.cse1 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (and (not (= (select .cse0 .cse1) .cse2)) (let ((.cse5 (+ .cse1 4))) (let ((.cse6 (select .cse0 .cse5))) (or (exists ((v_arrayElimCell_50 Int) (v_ArrVal_975 (Array Int Int)) (v_DerPreprocessor_7 (Array Int Int)) (v_DerPreprocessor_9 (Array Int Int)) (v_DerPreprocessor_6 Int) (v_DerPreprocessor_8 (Array Int Int)) (v_ArrVal_972 (Array Int Int))) (let ((.cse4 (select v_DerPreprocessor_9 .cse1))) (let ((.cse3 (select (select (store (store (store |c_#memory_$Pointer$#1.base| .cse4 v_DerPreprocessor_7) v_DerPreprocessor_6 v_DerPreprocessor_8) .cse2 v_DerPreprocessor_9) .cse4) (+ 4 v_arrayElimCell_50)))) (and (= .cse3 v_DerPreprocessor_6) (not (= .cse3 .cse2)) (not (= .cse3 .cse4)) (= .cse0 (store (select (store (store (store (store |c_#memory_$Pointer$#1.base| v_DerPreprocessor_6 v_DerPreprocessor_8) .cse2 v_DerPreprocessor_9) .cse4 v_ArrVal_972) .cse3 v_ArrVal_975) .cse2) .cse5 .cse6)) (not (= .cse4 .cse2)))))) (exists ((v_arrayElimCell_55 Int)) (and (not (= .cse2 v_arrayElimCell_55)) (exists ((v_ArrVal_975 (Array Int Int)) (|v_#memory_$Pointer$#1.base_56| (Array Int (Array Int Int))) (v_ArrVal_977 Int) (v_arrayElimCell_56 Int) (v_ArrVal_972 (Array Int Int))) (let ((.cse7 (select (select |v_#memory_$Pointer$#1.base_56| v_arrayElimCell_55) (+ 4 v_arrayElimCell_56)))) (and (= |c_#memory_$Pointer$#1.base| (store (store |v_#memory_$Pointer$#1.base_56| .cse7 (select |c_#memory_$Pointer$#1.base| .cse7)) .cse2 (store (select (store (store (store |v_#memory_$Pointer$#1.base_56| .cse2 (store (select |v_#memory_$Pointer$#1.base_56| .cse2) .cse1 v_arrayElimCell_55)) v_arrayElimCell_55 v_ArrVal_972) .cse7 v_ArrVal_975) .cse2) .cse5 v_ArrVal_977))) (= .cse7 v_arrayElimCell_55) (exists ((v_prenex_5 Int) (|v_old(#memory_$Pointer$#1.base)_AFTER_CALL_9| (Array Int (Array Int Int)))) (let ((.cse8 (@diff |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_9| |v_#memory_$Pointer$#1.base_56|))) (and (= (select (select |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_9| v_arrayElimCell_55) v_prenex_5) v_arrayElimCell_55) (= .cse8 .cse2) (= (store |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_9| .cse8 (select |v_#memory_$Pointer$#1.base_56| .cse8)) |v_#memory_$Pointer$#1.base_56|))))))))) (exists ((v_ArrVal_975 (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.offset_7| Int) (v_arrayElimArr_8 (Array Int Int)) (v_DerPreprocessor_11 (Array Int Int)) (v_DerPreprocessor_10 Int) (v_arrayElimCell_56 Int) (v_ArrVal_972 (Array Int Int))) (let ((.cse12 (store (store |c_#memory_$Pointer$#1.base| v_DerPreprocessor_10 v_DerPreprocessor_11) .cse2 v_arrayElimArr_8)) (.cse10 (select v_arrayElimArr_8 .cse1))) (let ((.cse11 (select .cse12 .cse10))) (let ((.cse9 (select .cse11 (+ 4 v_arrayElimCell_56)))) (and (= .cse9 .cse10) (= .cse10 (select .cse11 |v_ULTIMATE.start_dll_circular_create_~last~0#1.offset_7|)) (= (store (select (store (store .cse12 .cse10 v_ArrVal_972) .cse9 v_ArrVal_975) .cse2) .cse5 .cse6) .cse0) (= v_DerPreprocessor_10 .cse9) (not (= .cse10 .cse2))))))))))))) is different from true [2024-11-08 13:58:17,686 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (and (let ((.cse7 (select |c_#memory_$Pointer$#1.base| .cse0)) (.cse2 (+ |c_ULTIMATE.start_main_~ptr~0#1.offset| 4))) (let ((.cse6 (select .cse7 .cse2))) (or (exists ((v_prenex_5 Int) (|v_#memory_$Pointer$#1.base_56| (Array Int (Array Int Int))) (|v_old(#memory_$Pointer$#1.base)_AFTER_CALL_9| (Array Int (Array Int Int))) (v_ArrVal_977 Int) (v_prenex_6 (Array Int Int)) (v_arrayElimCell_56 Int) (v_prenex_7 (Array Int Int)) (v_arrayElimCell_55 Int)) (let ((.cse1 (select (select |v_#memory_$Pointer$#1.base_56| v_arrayElimCell_55) (+ 4 v_arrayElimCell_56))) (.cse3 (@diff |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_9| |v_#memory_$Pointer$#1.base_56|))) (and (not (= .cse0 v_arrayElimCell_55)) (= |c_#memory_$Pointer$#1.base| (store (store |v_#memory_$Pointer$#1.base_56| .cse1 (select |c_#memory_$Pointer$#1.base| .cse1)) .cse0 (store (select (store (store (store |v_#memory_$Pointer$#1.base_56| .cse0 (store (select |v_#memory_$Pointer$#1.base_56| .cse0) |c_ULTIMATE.start_main_~ptr~0#1.offset| v_arrayElimCell_55)) v_arrayElimCell_55 v_prenex_7) .cse1 v_prenex_6) .cse0) .cse2 v_ArrVal_977))) (= (select (select |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_9| v_arrayElimCell_55) v_prenex_5) v_arrayElimCell_55) (= .cse1 v_arrayElimCell_55) (= .cse3 .cse0) (= (store |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_9| .cse3 (select |v_#memory_$Pointer$#1.base_56| .cse3)) |v_#memory_$Pointer$#1.base_56|)))) (exists ((v_arrayElimCell_50 Int) (v_ArrVal_975 (Array Int Int)) (v_DerPreprocessor_7 (Array Int Int)) (v_DerPreprocessor_9 (Array Int Int)) (v_DerPreprocessor_6 Int) (v_DerPreprocessor_8 (Array Int Int)) (v_ArrVal_972 (Array Int Int))) (let ((.cse4 (select v_DerPreprocessor_9 |c_ULTIMATE.start_main_~ptr~0#1.offset|))) (let ((.cse5 (select (select (store (store (store |c_#memory_$Pointer$#1.base| .cse4 v_DerPreprocessor_7) v_DerPreprocessor_6 v_DerPreprocessor_8) .cse0 v_DerPreprocessor_9) .cse4) (+ 4 v_arrayElimCell_50)))) (and (not (= .cse4 .cse0)) (= (store (select (store (store (store (store |c_#memory_$Pointer$#1.base| v_DerPreprocessor_6 v_DerPreprocessor_8) .cse0 v_DerPreprocessor_9) .cse4 v_ArrVal_972) .cse5 v_ArrVal_975) .cse0) .cse2 .cse6) .cse7) (not (= .cse5 .cse0)) (= .cse5 v_DerPreprocessor_6) (not (= .cse4 .cse5)))))) (exists ((v_prenex_8 (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.offset_7| Int) (v_arrayElimArr_8 (Array Int Int)) (v_prenex_10 (Array Int Int)) (v_DerPreprocessor_11 (Array Int Int)) (v_DerPreprocessor_10 Int) (v_prenex_9 Int)) (let ((.cse9 (store (store |c_#memory_$Pointer$#1.base| v_DerPreprocessor_10 v_DerPreprocessor_11) .cse0 v_arrayElimArr_8)) (.cse8 (select v_arrayElimArr_8 |c_ULTIMATE.start_main_~ptr~0#1.offset|))) (let ((.cse11 (select .cse9 .cse8))) (let ((.cse10 (select .cse11 (+ v_prenex_9 4)))) (and (not (= .cse8 .cse0)) (= (store (select (store (store .cse9 .cse8 v_prenex_10) .cse10 v_prenex_8) .cse0) .cse2 .cse6) .cse7) (= .cse10 v_DerPreprocessor_10) (= (select .cse11 |v_ULTIMATE.start_dll_circular_create_~last~0#1.offset_7|) .cse8) (= .cse10 .cse8))))))))) (not (= (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~ptr~0#1.base|) |c_ULTIMATE.start_main_~ptr~0#1.offset|) .cse0)) (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse0))) is different from false [2024-11-08 13:58:17,689 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (and (let ((.cse7 (select |c_#memory_$Pointer$#1.base| .cse0)) (.cse2 (+ |c_ULTIMATE.start_main_~ptr~0#1.offset| 4))) (let ((.cse6 (select .cse7 .cse2))) (or (exists ((v_prenex_5 Int) (|v_#memory_$Pointer$#1.base_56| (Array Int (Array Int Int))) (|v_old(#memory_$Pointer$#1.base)_AFTER_CALL_9| (Array Int (Array Int Int))) (v_ArrVal_977 Int) (v_prenex_6 (Array Int Int)) (v_arrayElimCell_56 Int) (v_prenex_7 (Array Int Int)) (v_arrayElimCell_55 Int)) (let ((.cse1 (select (select |v_#memory_$Pointer$#1.base_56| v_arrayElimCell_55) (+ 4 v_arrayElimCell_56))) (.cse3 (@diff |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_9| |v_#memory_$Pointer$#1.base_56|))) (and (not (= .cse0 v_arrayElimCell_55)) (= |c_#memory_$Pointer$#1.base| (store (store |v_#memory_$Pointer$#1.base_56| .cse1 (select |c_#memory_$Pointer$#1.base| .cse1)) .cse0 (store (select (store (store (store |v_#memory_$Pointer$#1.base_56| .cse0 (store (select |v_#memory_$Pointer$#1.base_56| .cse0) |c_ULTIMATE.start_main_~ptr~0#1.offset| v_arrayElimCell_55)) v_arrayElimCell_55 v_prenex_7) .cse1 v_prenex_6) .cse0) .cse2 v_ArrVal_977))) (= (select (select |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_9| v_arrayElimCell_55) v_prenex_5) v_arrayElimCell_55) (= .cse1 v_arrayElimCell_55) (= .cse3 .cse0) (= (store |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_9| .cse3 (select |v_#memory_$Pointer$#1.base_56| .cse3)) |v_#memory_$Pointer$#1.base_56|)))) (exists ((v_arrayElimCell_50 Int) (v_ArrVal_975 (Array Int Int)) (v_DerPreprocessor_7 (Array Int Int)) (v_DerPreprocessor_9 (Array Int Int)) (v_DerPreprocessor_6 Int) (v_DerPreprocessor_8 (Array Int Int)) (v_ArrVal_972 (Array Int Int))) (let ((.cse4 (select v_DerPreprocessor_9 |c_ULTIMATE.start_main_~ptr~0#1.offset|))) (let ((.cse5 (select (select (store (store (store |c_#memory_$Pointer$#1.base| .cse4 v_DerPreprocessor_7) v_DerPreprocessor_6 v_DerPreprocessor_8) .cse0 v_DerPreprocessor_9) .cse4) (+ 4 v_arrayElimCell_50)))) (and (not (= .cse4 .cse0)) (= (store (select (store (store (store (store |c_#memory_$Pointer$#1.base| v_DerPreprocessor_6 v_DerPreprocessor_8) .cse0 v_DerPreprocessor_9) .cse4 v_ArrVal_972) .cse5 v_ArrVal_975) .cse0) .cse2 .cse6) .cse7) (not (= .cse5 .cse0)) (= .cse5 v_DerPreprocessor_6) (not (= .cse4 .cse5)))))) (exists ((v_prenex_8 (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.offset_7| Int) (v_arrayElimArr_8 (Array Int Int)) (v_prenex_10 (Array Int Int)) (v_DerPreprocessor_11 (Array Int Int)) (v_DerPreprocessor_10 Int) (v_prenex_9 Int)) (let ((.cse9 (store (store |c_#memory_$Pointer$#1.base| v_DerPreprocessor_10 v_DerPreprocessor_11) .cse0 v_arrayElimArr_8)) (.cse8 (select v_arrayElimArr_8 |c_ULTIMATE.start_main_~ptr~0#1.offset|))) (let ((.cse11 (select .cse9 .cse8))) (let ((.cse10 (select .cse11 (+ v_prenex_9 4)))) (and (not (= .cse8 .cse0)) (= (store (select (store (store .cse9 .cse8 v_prenex_10) .cse10 v_prenex_8) .cse0) .cse2 .cse6) .cse7) (= .cse10 v_DerPreprocessor_10) (= (select .cse11 |v_ULTIMATE.start_dll_circular_create_~last~0#1.offset_7|) .cse8) (= .cse10 .cse8))))))))) (not (= (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~ptr~0#1.base|) |c_ULTIMATE.start_main_~ptr~0#1.offset|) .cse0)) (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse0))) is different from true [2024-11-08 13:58:17,694 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (not (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse1)))) (and .cse0 (or (exists ((v_prenex_5 Int) (|v_#memory_$Pointer$#1.base_56| (Array Int (Array Int Int))) (|v_ULTIMATE.start_main_~ptr~0#1.offset_11| Int) (|v_old(#memory_$Pointer$#1.base)_AFTER_CALL_9| (Array Int (Array Int Int))) (v_arrayElimCell_56 Int) (v_prenex_6 (Array Int Int)) (v_arrayElimCell_55 Int) (v_prenex_7 (Array Int Int))) (let ((.cse2 (select (select |v_#memory_$Pointer$#1.base_56| v_arrayElimCell_55) (+ 4 v_arrayElimCell_56))) (.cse3 (@diff |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_9| |v_#memory_$Pointer$#1.base_56|))) (and (= |c_ULTIMATE.start_main_~ptr~0#1.base| (select (select (store (store (store |v_#memory_$Pointer$#1.base_56| .cse1 (store (select |v_#memory_$Pointer$#1.base_56| .cse1) |v_ULTIMATE.start_main_~ptr~0#1.offset_11| v_arrayElimCell_55)) v_arrayElimCell_55 v_prenex_7) .cse2 v_prenex_6) .cse1) |v_ULTIMATE.start_main_~ptr~0#1.offset_11|)) (not (= .cse1 v_arrayElimCell_55)) (= (select (select |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_9| v_arrayElimCell_55) v_prenex_5) v_arrayElimCell_55) (= .cse2 v_arrayElimCell_55) (= .cse3 .cse1) (= (store |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_9| .cse3 (select |v_#memory_$Pointer$#1.base_56| .cse3)) |v_#memory_$Pointer$#1.base_56|)))) .cse0)))) is different from false [2024-11-08 13:58:17,696 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (not (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse1)))) (and .cse0 (or (exists ((v_prenex_5 Int) (|v_#memory_$Pointer$#1.base_56| (Array Int (Array Int Int))) (|v_ULTIMATE.start_main_~ptr~0#1.offset_11| Int) (|v_old(#memory_$Pointer$#1.base)_AFTER_CALL_9| (Array Int (Array Int Int))) (v_arrayElimCell_56 Int) (v_prenex_6 (Array Int Int)) (v_arrayElimCell_55 Int) (v_prenex_7 (Array Int Int))) (let ((.cse2 (select (select |v_#memory_$Pointer$#1.base_56| v_arrayElimCell_55) (+ 4 v_arrayElimCell_56))) (.cse3 (@diff |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_9| |v_#memory_$Pointer$#1.base_56|))) (and (= |c_ULTIMATE.start_main_~ptr~0#1.base| (select (select (store (store (store |v_#memory_$Pointer$#1.base_56| .cse1 (store (select |v_#memory_$Pointer$#1.base_56| .cse1) |v_ULTIMATE.start_main_~ptr~0#1.offset_11| v_arrayElimCell_55)) v_arrayElimCell_55 v_prenex_7) .cse2 v_prenex_6) .cse1) |v_ULTIMATE.start_main_~ptr~0#1.offset_11|)) (not (= .cse1 v_arrayElimCell_55)) (= (select (select |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_9| v_arrayElimCell_55) v_prenex_5) v_arrayElimCell_55) (= .cse2 v_arrayElimCell_55) (= .cse3 .cse1) (= (store |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_9| .cse3 (select |v_#memory_$Pointer$#1.base_56| .cse3)) |v_#memory_$Pointer$#1.base_56|)))) .cse0)))) is different from true [2024-11-08 13:58:17,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 13:58:17,808 INFO L93 Difference]: Finished difference Result 43 states and 48 transitions. [2024-11-08 13:58:17,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-08 13:58:17,809 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 34 states have (on average 1.4411764705882353) internal successors, (49), 28 states have internal predecessors, (49), 4 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) Word has length 37 [2024-11-08 13:58:17,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 13:58:17,810 INFO L225 Difference]: With dead ends: 43 [2024-11-08 13:58:17,810 INFO L226 Difference]: Without dead ends: 40 [2024-11-08 13:58:17,811 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 48 ConstructedPredicates, 13 IntricatePredicates, 0 DeprecatedPredicates, 204 ImplicationChecksByTransitivity, 32.9s TimeCoverageRelationStatistics Valid=144, Invalid=1217, Unknown=23, NotChecked=1066, Total=2450 [2024-11-08 13:58:17,812 INFO L432 NwaCegarLoop]: 18 mSDtfsCounter, 7 mSDsluCounter, 234 mSDsCounter, 0 mSdLazyCounter, 440 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 252 SdHoareTripleChecker+Invalid, 817 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 440 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 373 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-08 13:58:17,812 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 252 Invalid, 817 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 440 Invalid, 0 Unknown, 373 Unchecked, 0.3s Time] [2024-11-08 13:58:17,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2024-11-08 13:58:17,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2024-11-08 13:58:17,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 33 states have (on average 1.121212121212121) internal successors, (37), 33 states have internal predecessors, (37), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-08 13:58:17,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 45 transitions. [2024-11-08 13:58:17,819 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 45 transitions. Word has length 37 [2024-11-08 13:58:17,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 13:58:17,819 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 45 transitions. [2024-11-08 13:58:17,820 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 34 states have (on average 1.4411764705882353) internal successors, (49), 28 states have internal predecessors, (49), 4 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2024-11-08 13:58:17,820 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 45 transitions. [2024-11-08 13:58:17,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-08 13:58:17,821 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 13:58:17,821 INFO L215 NwaCegarLoop]: 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, 1] [2024-11-08 13:58:17,835 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-08 13:58:18,021 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 13:58:18,022 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 13:58:18,022 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 13:58:18,022 INFO L85 PathProgramCache]: Analyzing trace with hash 841147066, now seen corresponding path program 1 times [2024-11-08 13:58:18,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 13:58:18,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1960164813] [2024-11-08 13:58:18,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:58:18,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 13:58:18,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:58:20,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 13:58:20,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:58:20,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 13:58:20,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:58:20,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-08 13:58:20,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:58:20,726 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-08 13:58:20,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 13:58:20,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1960164813] [2024-11-08 13:58:20,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1960164813] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 13:58:20,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [618159646] [2024-11-08 13:58:20,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:58:20,727 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 13:58:20,727 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 13:58:20,728 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 13:58:20,729 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-08 13:58:20,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:58:20,921 INFO L255 TraceCheckSpWp]: Trace formula consists of 412 conjuncts, 133 conjuncts are in the unsatisfiable core [2024-11-08 13:58:20,928 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 13:58:20,967 INFO L378 Elim1Store]: Elim1 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 [2024-11-08 13:58:21,203 INFO L378 Elim1Store]: Elim1 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 11 treesize of output 7 [2024-11-08 13:58:21,265 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-08 13:58:21,266 INFO L378 Elim1Store]: Elim1 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 17 treesize of output 21 [2024-11-08 13:58:21,346 INFO L378 Elim1Store]: Elim1 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 23 treesize of output 11 [2024-11-08 13:58:21,408 INFO L378 Elim1Store]: Elim1 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 16 treesize of output 11 [2024-11-08 13:58:21,565 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 13:58:21,569 INFO L378 Elim1Store]: Elim1 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 26 treesize of output 23 [2024-11-08 13:58:21,574 INFO L378 Elim1Store]: Elim1 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 18 treesize of output 11 [2024-11-08 13:58:21,582 INFO L378 Elim1Store]: Elim1 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 32 [2024-11-08 13:58:21,597 INFO L378 Elim1Store]: Elim1 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 45 [2024-11-08 13:58:21,838 INFO L378 Elim1Store]: Elim1 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 9 treesize of output 3 [2024-11-08 13:58:21,851 INFO L378 Elim1Store]: Elim1 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 82 treesize of output 50 [2024-11-08 13:58:21,860 INFO L378 Elim1Store]: Elim1 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 25 treesize of output 19 [2024-11-08 13:58:21,872 INFO L378 Elim1Store]: Elim1 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 15 treesize of output 7 [2024-11-08 13:58:22,151 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 13:58:22,152 INFO L378 Elim1Store]: Elim1 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 90 treesize of output 57 [2024-11-08 13:58:22,158 INFO L378 Elim1Store]: Elim1 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 65 treesize of output 49 [2024-11-08 13:58:22,173 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2024-11-08 13:58:22,174 INFO L378 Elim1Store]: Elim1 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 28 treesize of output 30 [2024-11-08 13:58:22,181 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 1 [2024-11-08 13:58:22,185 INFO L378 Elim1Store]: Elim1 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 20 treesize of output 15 [2024-11-08 13:58:22,412 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 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 112 treesize of output 108 [2024-11-08 13:58:22,427 INFO L349 Elim1Store]: treesize reduction 74, result has 1.3 percent of original size [2024-11-08 13:58:22,427 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 277 treesize of output 242 [2024-11-08 13:58:22,435 INFO L378 Elim1Store]: Elim1 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 0 case distinctions, treesize of input 367 treesize of output 248 [2024-11-08 13:58:22,451 INFO L349 Elim1Store]: treesize reduction 110, result has 0.9 percent of original size [2024-11-08 13:58:22,451 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 608 treesize of output 340 [2024-11-08 13:58:22,460 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 90 treesize of output 91 [2024-11-08 13:58:22,473 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 13:58:22,476 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 113 treesize of output 35 [2024-11-08 13:58:22,481 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 23 treesize of output 11 [2024-11-08 13:58:22,487 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 13:58:22,491 INFO L378 Elim1Store]: Elim1 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 100 treesize of output 34 [2024-11-08 13:58:22,497 INFO L378 Elim1Store]: Elim1 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 25 treesize of output 21 [2024-11-08 13:58:22,501 INFO L378 Elim1Store]: Elim1 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 34 treesize of output 19 [2024-11-08 13:58:22,508 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 1 [2024-11-08 13:58:22,527 INFO L349 Elim1Store]: treesize reduction 37, result has 15.9 percent of original size [2024-11-08 13:58:22,527 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 26 treesize of output 21 [2024-11-08 13:58:22,742 INFO L378 Elim1Store]: Elim1 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 11 treesize of output 3 [2024-11-08 13:58:22,748 INFO L378 Elim1Store]: Elim1 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 43 treesize of output 19 [2024-11-08 13:58:22,831 INFO L378 Elim1Store]: Elim1 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 [2024-11-08 13:58:22,987 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 7 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 13:58:22,987 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 13:58:23,424 INFO L349 Elim1Store]: treesize reduction 208, result has 43.5 percent of original size [2024-11-08 13:58:23,425 INFO L378 Elim1Store]: Elim1 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 5606 treesize of output 4917 [2024-11-08 13:58:23,496 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 13:58:23,496 INFO L378 Elim1Store]: Elim1 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 3467 treesize of output 3455 [2024-11-08 13:58:23,522 INFO L378 Elim1Store]: Elim1 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 4170 treesize of output 4058 [2024-11-08 13:58:23,561 INFO L378 Elim1Store]: Elim1 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 2603 treesize of output 2575 [2024-11-08 13:58:23,589 INFO L378 Elim1Store]: Elim1 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 4030 treesize of output 3974 [2024-11-08 13:58:23,651 INFO L378 Elim1Store]: Elim1 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 18 treesize of output 4 [2024-11-08 13:58:23,828 INFO L349 Elim1Store]: treesize reduction 12, result has 78.9 percent of original size [2024-11-08 13:58:23,828 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 4933 treesize of output 4857