./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 4f9af400 extending candidate: java ['java'] extending candidate: /usr/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/oracle-jdk-bin-*/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/openjdk-*/bin/java ['java', '/usr/bin/java'] extending candidate: /usr/lib/jvm/java-*-openjdk-amd64/bin/java ['java', '/usr/bin/java', '/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java', '/usr/lib/jvm/java-17-openjdk-amd64/bin/java', '/usr/lib/jvm/java-11-openjdk-amd64/bin/java', '/usr/lib/jvm/java-1.17.0-openjdk-amd64/bin/java'] ['/root/.sdkman/candidates/java/21.0.5-tem/bin/java', '-Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config', '-Xmx15G', '-Xms4m', '-jar', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar', '-data', '@noDefault', '-ultimatedata', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data', '-tc', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml', '-i', '../sv-benchmarks/c/list-simple/dll2c_prepend_equal.i', '-s', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf', '--cacsl2boogietranslator.entry.function', 'main', '--witnessprinter.witness.directory', '/storage/repos/ultimate-jdk21/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())) )\n\n', '--witnessprinter.graph.data.producer', 'Automizer', '--witnessprinter.graph.data.architecture', '32bit', '--witnessprinter.graph.data.programhash', 'e0e4fff172a515598d076941b225a1a1f31b97f5ac14127a866784b10a4e3537'] Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/list-simple/dll2c_prepend_equal.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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.3.0-?-4f9af40 [2024-11-06 22:27:24,818 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-06 22:27:24,886 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-06 22:27:24,895 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-06 22:27:24,896 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-06 22:27:24,922 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-06 22:27:24,924 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-06 22:27:24,924 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-06 22:27:24,924 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-06 22:27:24,924 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-06 22:27:24,925 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-06 22:27:24,925 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-06 22:27:24,925 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-06 22:27:24,925 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-06 22:27:24,925 INFO L153 SettingsManager]: * Use SBE=true [2024-11-06 22:27:24,925 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-06 22:27:24,925 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-06 22:27:24,925 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-06 22:27:24,926 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-06 22:27:24,926 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-06 22:27:24,926 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-06 22:27:24,926 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-06 22:27:24,926 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-06 22:27:24,926 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-06 22:27:24,926 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-06 22:27:24,926 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-06 22:27:24,926 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-06 22:27:24,926 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-06 22:27:24,926 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-06 22:27:24,926 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-06 22:27:24,926 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-06 22:27:24,927 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-06 22:27:24,927 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-06 22:27:24,927 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-06 22:27:24,927 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-06 22:27:24,927 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-06 22:27:24,927 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-06 22:27:24,929 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-06 22:27:24,929 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-06 22:27:24,929 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-06 22:27:24,929 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-06 22:27:24,929 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-06 22:27:24,929 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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-jdk21/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-06 22:27:25,225 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-06 22:27:25,236 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-06 22:27:25,238 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-06 22:27:25,240 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-06 22:27:25,240 INFO L274 PluginConnector]: CDTParser initialized [2024-11-06 22:27:25,242 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/dll2c_prepend_equal.i [2024-11-06 22:27:26,527 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-06 22:27:26,865 INFO L384 CDTParser]: Found 1 translation units. [2024-11-06 22:27:26,868 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/list-simple/dll2c_prepend_equal.i [2024-11-06 22:27:26,886 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5707bc844/d0de742d0c06474cb05fa686142625e6/FLAGecf72652e [2024-11-06 22:27:26,904 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5707bc844/d0de742d0c06474cb05fa686142625e6 [2024-11-06 22:27:26,907 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-06 22:27:26,909 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-06 22:27:26,911 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-06 22:27:26,911 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-06 22:27:26,915 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-06 22:27:26,916 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:27:26" (1/1) ... [2024-11-06 22:27:26,917 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7f1320a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:27:26, skipping insertion in model container [2024-11-06 22:27:26,917 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:27:26" (1/1) ... [2024-11-06 22:27:26,951 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-06 22:27:27,258 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/list-simple/dll2c_prepend_equal.i[24640,24653] [2024-11-06 22:27:27,261 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-06 22:27:27,272 INFO L200 MainTranslator]: Completed pre-run [2024-11-06 22:27:27,326 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/list-simple/dll2c_prepend_equal.i[24640,24653] [2024-11-06 22:27:27,332 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-06 22:27:27,361 INFO L204 MainTranslator]: Completed translation [2024-11-06 22:27:27,362 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:27:27 WrapperNode [2024-11-06 22:27:27,363 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-06 22:27:27,364 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-06 22:27:27,364 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-06 22:27:27,364 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-06 22:27:27,370 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:27:27" (1/1) ... [2024-11-06 22:27:27,384 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:27:27" (1/1) ... [2024-11-06 22:27:27,406 INFO L138 Inliner]: procedures = 127, calls = 47, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 137 [2024-11-06 22:27:27,407 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-06 22:27:27,408 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-06 22:27:27,408 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-06 22:27:27,408 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-06 22:27:27,416 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:27:27" (1/1) ... [2024-11-06 22:27:27,416 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:27:27" (1/1) ... [2024-11-06 22:27:27,420 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:27:27" (1/1) ... [2024-11-06 22:27:27,440 INFO L175 MemorySlicer]: Split 29 memory accesses to 3 slices as follows [2, 9, 18]. 62 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 1, 0]. The 15 writes are split as follows [0, 2, 13]. [2024-11-06 22:27:27,441 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:27:27" (1/1) ... [2024-11-06 22:27:27,441 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:27:27" (1/1) ... [2024-11-06 22:27:27,453 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:27:27" (1/1) ... [2024-11-06 22:27:27,458 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:27:27" (1/1) ... [2024-11-06 22:27:27,460 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:27:27" (1/1) ... [2024-11-06 22:27:27,461 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:27:27" (1/1) ... [2024-11-06 22:27:27,469 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-06 22:27:27,474 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-06 22:27:27,474 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-06 22:27:27,474 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-06 22:27:27,475 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:27:27" (1/1) ... [2024-11-06 22:27:27,480 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-06 22:27:27,490 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 22:27:27,502 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-06 22:27:27,504 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-06 22:27:27,524 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-06 22:27:27,524 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-06 22:27:27,525 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-06 22:27:27,525 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-06 22:27:27,525 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-06 22:27:27,525 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-06 22:27:27,525 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2024-11-06 22:27:27,525 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2024-11-06 22:27:27,525 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-06 22:27:27,526 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-06 22:27:27,526 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-06 22:27:27,526 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-06 22:27:27,526 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-06 22:27:27,526 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-06 22:27:27,526 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-06 22:27:27,526 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-06 22:27:27,526 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-06 22:27:27,526 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-06 22:27:27,526 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-06 22:27:27,526 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-06 22:27:27,526 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-11-06 22:27:27,526 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-06 22:27:27,526 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-06 22:27:27,526 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-06 22:27:27,526 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-06 22:27:27,526 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-06 22:27:27,651 INFO L238 CfgBuilder]: Building ICFG [2024-11-06 22:27:27,652 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-06 22:27:27,897 INFO L? ?]: Removed 51 outVars from TransFormulas that were not future-live. [2024-11-06 22:27:27,897 INFO L287 CfgBuilder]: Performing block encoding [2024-11-06 22:27:27,907 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-06 22:27:27,907 INFO L316 CfgBuilder]: Removed 3 assume(true) statements. [2024-11-06 22:27:27,907 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:27:27 BoogieIcfgContainer [2024-11-06 22:27:27,908 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-06 22:27:27,910 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-06 22:27:27,910 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-06 22:27:27,914 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-06 22:27:27,914 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 10:27:26" (1/3) ... [2024-11-06 22:27:27,915 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@666f4def and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:27:27, skipping insertion in model container [2024-11-06 22:27:27,915 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:27:27" (2/3) ... [2024-11-06 22:27:27,915 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@666f4def and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:27:27, skipping insertion in model container [2024-11-06 22:27:27,915 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:27:27" (3/3) ... [2024-11-06 22:27:27,916 INFO L112 eAbstractionObserver]: Analyzing ICFG dll2c_prepend_equal.i [2024-11-06 22:27:27,930 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-06 22:27:27,930 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-06 22:27:27,979 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-06 22:27:27,999 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;@6a8e6bb3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-06 22:27:27,999 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-06 22:27:28,004 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-06 22:27:28,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-06 22:27:28,010 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 22:27:28,011 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-06 22:27:28,012 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 22:27:28,017 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 22:27:28,017 INFO L85 PathProgramCache]: Analyzing trace with hash 976010426, now seen corresponding path program 1 times [2024-11-06 22:27:28,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 22:27:28,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901652399] [2024-11-06 22:27:28,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 22:27:28,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 22:27:28,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:27:28,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-06 22:27:28,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:27:28,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-06 22:27:28,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:27:28,346 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-06 22:27:28,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 22:27:28,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1901652399] [2024-11-06 22:27:28,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1901652399] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 22:27:28,350 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 22:27:28,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 22:27:28,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [872490007] [2024-11-06 22:27:28,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 22:27:28,357 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 22:27:28,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 22:27:28,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 22:27:28,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 22:27:28,377 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-06 22:27:28,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 22:27:28,469 INFO L93 Difference]: Finished difference Result 61 states and 82 transitions. [2024-11-06 22:27:28,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 22:27:28,472 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-06 22:27:28,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 22:27:28,476 INFO L225 Difference]: With dead ends: 61 [2024-11-06 22:27:28,477 INFO L226 Difference]: Without dead ends: 27 [2024-11-06 22:27:28,479 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-06 22:27:28,481 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-06 22:27:28,482 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-06 22:27:28,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2024-11-06 22:27:28,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2024-11-06 22:27:28,504 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-06 22:27:28,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 33 transitions. [2024-11-06 22:27:28,510 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 33 transitions. Word has length 24 [2024-11-06 22:27:28,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 22:27:28,512 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 33 transitions. [2024-11-06 22:27:28,512 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-06 22:27:28,512 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 33 transitions. [2024-11-06 22:27:28,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-06 22:27:28,513 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 22:27:28,513 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-06 22:27:28,513 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-06 22:27:28,513 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 22:27:28,514 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 22:27:28,514 INFO L85 PathProgramCache]: Analyzing trace with hash -1442307826, now seen corresponding path program 1 times [2024-11-06 22:27:28,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 22:27:28,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1920967082] [2024-11-06 22:27:28,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 22:27:28,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 22:27:28,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:27:28,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-06 22:27:28,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:27:28,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-06 22:27:28,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:27:28,799 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-06 22:27:28,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 22:27:28,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1920967082] [2024-11-06 22:27:28,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1920967082] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 22:27:28,803 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 22:27:28,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-06 22:27:28,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1381203337] [2024-11-06 22:27:28,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 22:27:28,804 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-06 22:27:28,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 22:27:28,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-06 22:27:28,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-06 22:27:28,806 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-06 22:27:28,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 22:27:28,887 INFO L93 Difference]: Finished difference Result 50 states and 61 transitions. [2024-11-06 22:27:28,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-06 22:27:28,888 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-06 22:27:28,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 22:27:28,889 INFO L225 Difference]: With dead ends: 50 [2024-11-06 22:27:28,890 INFO L226 Difference]: Without dead ends: 32 [2024-11-06 22:27:28,890 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-06 22:27:28,891 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-06 22:27:28,893 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-06 22:27:28,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-11-06 22:27:28,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 28. [2024-11-06 22:27:28,899 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-06 22:27:28,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 34 transitions. [2024-11-06 22:27:28,900 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 34 transitions. Word has length 24 [2024-11-06 22:27:28,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 22:27:28,901 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 34 transitions. [2024-11-06 22:27:28,901 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-06 22:27:28,901 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 34 transitions. [2024-11-06 22:27:28,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-06 22:27:28,902 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 22:27:28,902 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-06 22:27:28,903 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-06 22:27:28,903 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 22:27:28,904 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 22:27:28,904 INFO L85 PathProgramCache]: Analyzing trace with hash 915772386, now seen corresponding path program 1 times [2024-11-06 22:27:28,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 22:27:28,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332434431] [2024-11-06 22:27:28,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 22:27:28,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 22:27:28,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:27:29,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-06 22:27:29,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:27:29,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-06 22:27:29,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:27:29,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-06 22:27:29,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:27:29,475 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-06 22:27:29,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 22:27:29,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [332434431] [2024-11-06 22:27:29,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [332434431] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-06 22:27:29,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [717485649] [2024-11-06 22:27:29,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 22:27:29,476 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 22:27:29,477 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 22:27:29,479 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-06 22:27:29,481 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-06 22:27:29,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:27:29,696 INFO L255 TraceCheckSpWp]: Trace formula consists of 374 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-06 22:27:29,702 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 22:27:29,878 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-06 22:27:29,898 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-06 22:27:29,899 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-06 22:27:29,966 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-06 22:27:29,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [717485649] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-06 22:27:29,967 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-06 22:27:29,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 10] total 14 [2024-11-06 22:27:29,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [938049274] [2024-11-06 22:27:29,967 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-06 22:27:29,968 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-06 22:27:29,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 22:27:29,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-06 22:27:29,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2024-11-06 22:27:29,969 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-06 22:27:33,989 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-06 22:27:38,013 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-06 22:27:42,030 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-06 22:27:46,046 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-06 22:27:50,071 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-06 22:27:54,346 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-06 22:27:58,402 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-06 22:28:02,425 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-06 22:28:02,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 22:28:02,430 INFO L93 Difference]: Finished difference Result 59 states and 71 transitions. [2024-11-06 22:28:02,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-06 22:28:02,431 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-06 22:28:02,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 22:28:02,431 INFO L225 Difference]: With dead ends: 59 [2024-11-06 22:28:02,432 INFO L226 Difference]: Without dead ends: 36 [2024-11-06 22:28:02,432 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-06 22:28:02,433 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.3s IncrementalHoareTripleChecker+Time [2024-11-06 22:28:02,433 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.3s Time] [2024-11-06 22:28:02,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2024-11-06 22:28:02,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2024-11-06 22:28:02,439 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-06 22:28:02,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 41 transitions. [2024-11-06 22:28:02,440 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 41 transitions. Word has length 34 [2024-11-06 22:28:02,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 22:28:02,441 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 41 transitions. [2024-11-06 22:28:02,441 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-06 22:28:02,442 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 41 transitions. [2024-11-06 22:28:02,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-06 22:28:02,443 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 22:28:02,443 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-06 22:28:02,457 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-06 22:28:02,644 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 22:28:02,644 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 22:28:02,645 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 22:28:02,645 INFO L85 PathProgramCache]: Analyzing trace with hash 917619428, now seen corresponding path program 1 times [2024-11-06 22:28:02,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 22:28:02,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235294704] [2024-11-06 22:28:02,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 22:28:02,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 22:28:02,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:28:04,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-06 22:28:04,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:28:04,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-06 22:28:04,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:28:05,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-06 22:28:05,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:28:05,297 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-06 22:28:05,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 22:28:05,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1235294704] [2024-11-06 22:28:05,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1235294704] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-06 22:28:05,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1176648733] [2024-11-06 22:28:05,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 22:28:05,298 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 22:28:05,298 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 22:28:05,300 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-06 22:28:05,302 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-06 22:28:05,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:28:05,504 INFO L255 TraceCheckSpWp]: Trace formula consists of 397 conjuncts, 108 conjuncts are in the unsatisfiable core [2024-11-06 22:28:05,511 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 22:28:05,547 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-06 22:28:05,779 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-11-06 22:28:05,780 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-06 22:28:05,982 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-06 22:28:05,995 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 56 treesize of output 21 [2024-11-06 22:28:06,000 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 12 treesize of output 1 [2024-11-06 22:28:06,009 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-06 22:28:06,018 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-06 22:28:06,019 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 18 treesize of output 1 [2024-11-06 22:28:06,155 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 13 treesize of output 5 [2024-11-06 22:28:06,161 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-06 22:28:06,161 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 15 treesize of output 7 [2024-11-06 22:28:06,314 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-06 22:28:06,443 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-06 22:28:06,444 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 22 treesize of output 17 [2024-11-06 22:28:06,463 INFO L349 Elim1Store]: treesize reduction 28, result has 42.9 percent of original size [2024-11-06 22:28:06,463 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 28 treesize of output 30 [2024-11-06 22:28:06,680 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-06 22:28:06,681 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-06 22:28:06,689 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 107 treesize of output 60 [2024-11-06 22:28:06,695 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 60 treesize of output 29 [2024-11-06 22:28:06,699 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 21 treesize of output 13 [2024-11-06 22:28:06,708 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-06 22:28:06,717 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-06 22:28:06,718 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-06 22:28:06,721 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 94 treesize of output 60 [2024-11-06 22:28:06,726 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 59 treesize of output 28 [2024-11-06 22:28:06,730 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 20 treesize of output 12 [2024-11-06 22:28:06,746 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 21 [2024-11-06 22:28:06,770 INFO L349 Elim1Store]: treesize reduction 33, result has 31.3 percent of original size [2024-11-06 22:28:06,771 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 30 treesize of output 22 [2024-11-06 22:28:06,823 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-06 22:28:06,826 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-06 22:28:06,927 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-06 22:28:06,927 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-06 22:28:07,050 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_690 (Array Int Int)) (v_ArrVal_692 (Array Int Int)) (v_ArrVal_694 (Array Int Int)) (v_ArrVal_693 (Array Int Int))) (let ((.cse3 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|))) (let ((.cse0 (select .cse3 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset|)) (.cse4 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| .cse0) (+ (select .cse4 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset|) 4)))) (or (not (= v_ArrVal_690 (let ((.cse2 (+ |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| 4))) (store (select (store (store (store |c_#memory_int#2| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| v_ArrVal_692) .cse0 v_ArrVal_694) .cse1 v_ArrVal_693) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) .cse2 (select v_ArrVal_690 .cse2))))) (not (= v_ArrVal_692 (store (select |c_#memory_int#2| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| (select v_ArrVal_692 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset|)))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int#2| .cse0 v_ArrVal_694) .cse1 v_ArrVal_693) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| v_ArrVal_690) (select (select (store |c_#memory_$Pointer$#1.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_~new_head~1#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store |c_#memory_$Pointer$#1.offset| |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.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 8)))))))) is different from false [2024-11-06 22:28:07,086 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_690 (Array Int Int)) (v_ArrVal_692 (Array Int Int)) (v_ArrVal_694 (Array Int Int)) (v_ArrVal_693 (Array Int Int))) (let ((.cse2 (select |c_#memory_$Pointer$#1.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$#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.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#2| .cse0 v_ArrVal_694) .cse1 v_ArrVal_693) |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base| v_ArrVal_690) (select (select (store |c_#memory_$Pointer$#1.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$#1.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_690 (let ((.cse4 (+ |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.offset| 4))) (store (select (store (store (store |c_#memory_int#2| |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base| v_ArrVal_692) .cse0 v_ArrVal_694) .cse1 v_ArrVal_693) |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base|) .cse4 (select v_ArrVal_690 .cse4))))) (not (= v_ArrVal_692 (store (select |c_#memory_int#2| |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base|) |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.offset| (select v_ArrVal_692 |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.offset|))))))))) is different from false [2024-11-06 22:28:07,180 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-06 22:28:07,181 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 2650 treesize of output 2612 [2024-11-06 22:28:07,236 INFO L349 Elim1Store]: treesize reduction 42, result has 55.3 percent of original size [2024-11-06 22:28:07,236 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 404 treesize of output 405 [2024-11-06 22:28:07,286 INFO L349 Elim1Store]: treesize reduction 42, result has 55.3 percent of original size [2024-11-06 22:28:07,286 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 354 treesize of output 380 [2024-11-06 22:28:07,631 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-06 22:28:07,631 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 8 [2024-11-06 22:28:07,715 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-06 22:28:07,716 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 52 treesize of output 54 [2024-11-06 22:28:07,789 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-06 22:28:07,789 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 52 treesize of output 54 [2024-11-06 22:28:07,873 INFO L349 Elim1Store]: treesize reduction 100, result has 41.2 percent of original size [2024-11-06 22:28:07,874 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 502 treesize of output 536 [2024-11-06 22:28:07,935 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-06 22:28:07,935 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 70 treesize of output 92 [2024-11-06 22:28:08,000 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-06 22:28:08,000 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 70 treesize of output 92 [2024-11-06 22:28:08,117 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-06 22:28:08,117 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 70 treesize of output 92 [2024-11-06 22:28:08,568 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-06 22:28:08,568 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 71 treesize of output 73 [2024-11-06 22:28:08,592 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 12 treesize of output 8 [2024-11-06 22:28:08,650 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-06 22:28:08,650 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 62 treesize of output 64 [2024-11-06 22:28:08,683 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-06 22:28:08,683 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 309 treesize of output 261 [2024-11-06 22:28:08,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1176648733] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-06 22:28:08,959 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-06 22:28:08,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 23] total 40 [2024-11-06 22:28:08,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1696317175] [2024-11-06 22:28:08,960 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-06 22:28:08,961 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2024-11-06 22:28:08,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 22:28:08,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2024-11-06 22:28:08,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=1683, Unknown=2, NotChecked=166, Total=1980 [2024-11-06 22:28:08,964 INFO L87 Difference]: Start difference. First operand 36 states and 41 transitions. Second operand has 40 states, 37 states have (on average 1.3783783783783783) internal successors, (51), 31 states have internal predecessors, (51), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-06 22:28:10,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 22:28:10,935 INFO L93 Difference]: Finished difference Result 42 states and 46 transitions. [2024-11-06 22:28:10,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-06 22:28:10,935 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 37 states have (on average 1.3783783783783783) internal successors, (51), 31 states have internal predecessors, (51), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 34 [2024-11-06 22:28:10,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 22:28:10,936 INFO L225 Difference]: With dead ends: 42 [2024-11-06 22:28:10,936 INFO L226 Difference]: Without dead ends: 40 [2024-11-06 22:28:10,937 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 590 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=225, Invalid=2751, Unknown=2, NotChecked=214, Total=3192 [2024-11-06 22:28:10,938 INFO L432 NwaCegarLoop]: 16 mSDtfsCounter, 30 mSDsluCounter, 339 mSDsCounter, 0 mSdLazyCounter, 851 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 355 SdHoareTripleChecker+Invalid, 854 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 851 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-06 22:28:10,938 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 355 Invalid, 854 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 851 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-06 22:28:10,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2024-11-06 22:28:10,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 38. [2024-11-06 22:28:10,942 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-06 22:28:10,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 43 transitions. [2024-11-06 22:28:10,943 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 43 transitions. Word has length 34 [2024-11-06 22:28:10,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 22:28:10,943 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 43 transitions. [2024-11-06 22:28:10,943 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 37 states have (on average 1.3783783783783783) internal successors, (51), 31 states have internal predecessors, (51), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-06 22:28:10,944 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 43 transitions. [2024-11-06 22:28:10,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-06 22:28:10,944 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 22:28:10,944 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-06 22:28:10,959 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-06 22:28:11,145 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 22:28:11,145 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 22:28:11,145 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 22:28:11,145 INFO L85 PathProgramCache]: Analyzing trace with hash -665604212, now seen corresponding path program 1 times [2024-11-06 22:28:11,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 22:28:11,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [555368780] [2024-11-06 22:28:11,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 22:28:11,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 22:28:11,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:28:12,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-06 22:28:12,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:28:12,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-06 22:28:12,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:28:12,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-06 22:28:12,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:28:12,726 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-06 22:28:12,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 22:28:12,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [555368780] [2024-11-06 22:28:12,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [555368780] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-06 22:28:12,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [142013419] [2024-11-06 22:28:12,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 22:28:12,726 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 22:28:12,727 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 22:28:12,729 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-06 22:28:12,731 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-06 22:28:12,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:28:12,925 INFO L255 TraceCheckSpWp]: Trace formula consists of 413 conjuncts, 78 conjuncts are in the unsatisfiable core [2024-11-06 22:28:12,929 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 22:28:12,932 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-06 22:28:13,076 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-11-06 22:28:13,076 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-06 22:28:13,192 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-06 22:28:13,200 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-06 22:28:13,200 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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-06 22:28:13,205 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-06 22:28:13,215 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 8 treesize of output 1 [2024-11-06 22:28:17,372 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 152 treesize of output 104 [2024-11-06 22:28:17,382 INFO L349 Elim1Store]: treesize reduction 17, result has 15.0 percent of original size [2024-11-06 22:28:17,383 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 60 treesize of output 47 [2024-11-06 22:28:17,386 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 15 treesize of output 7 [2024-11-06 22:28:17,500 INFO L349 Elim1Store]: treesize reduction 31, result has 49.2 percent of original size [2024-11-06 22:28:17,501 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 119 treesize of output 124 [2024-11-06 22:28:21,561 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.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 ((.cse1 (+ (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (or (exists ((|v_old(#memory_$Pointer$#2.base)_AFTER_CALL_9| (Array Int (Array Int Int)))) (let ((.cse2 (@diff |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_9| |c_#memory_$Pointer$#2.base|))) (and (= .cse0 (select (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_9| .cse0) .cse1)) (= (store |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_9| .cse2 (select |c_#memory_$Pointer$#2.base| .cse2)) |c_#memory_$Pointer$#2.base|) (= .cse2 |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base|)))) (exists ((|v_old(#memory_$Pointer$#2.base)_AFTER_CALL_9| (Array Int (Array Int Int)))) (let ((.cse5 (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_9| .cse0))) (let ((.cse4 (select .cse5 .cse1)) (.cse3 (@diff |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_9| |c_#memory_$Pointer$#2.base|))) (and (= (store |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_9| .cse3 (select |c_#memory_$Pointer$#2.base| .cse3)) |c_#memory_$Pointer$#2.base|) (not (= |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base| .cse4)) (exists ((v_DerPreprocessor_5 (Array Int Int)) (v_DerPreprocessor_4 (Array Int Int))) (= (store (select (store (store |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_9| .cse0 v_DerPreprocessor_4) .cse4 v_DerPreprocessor_5) .cse0) .cse1 .cse4) .cse5)) (= .cse3 |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base|))))) (let ((.cse6 (select |c_#memory_$Pointer$#2.base| .cse0))) (let ((.cse7 (select .cse6 .cse1))) (and (or (exists ((v_DerPreprocessor_5 (Array Int Int)) (v_DerPreprocessor_4 (Array Int Int))) (= .cse6 (store (select (store (store |c_#memory_$Pointer$#2.base| .cse0 v_DerPreprocessor_4) .cse7 v_DerPreprocessor_5) .cse0) .cse1 .cse7))) (= .cse0 .cse7)) (not (= |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base| .cse7))))))))) is different from false [2024-11-06 22:28:21,564 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.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 ((.cse1 (+ (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (or (exists ((|v_old(#memory_$Pointer$#2.base)_AFTER_CALL_9| (Array Int (Array Int Int)))) (let ((.cse2 (@diff |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_9| |c_#memory_$Pointer$#2.base|))) (and (= .cse0 (select (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_9| .cse0) .cse1)) (= (store |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_9| .cse2 (select |c_#memory_$Pointer$#2.base| .cse2)) |c_#memory_$Pointer$#2.base|) (= .cse2 |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base|)))) (exists ((|v_old(#memory_$Pointer$#2.base)_AFTER_CALL_9| (Array Int (Array Int Int)))) (let ((.cse5 (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_9| .cse0))) (let ((.cse4 (select .cse5 .cse1)) (.cse3 (@diff |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_9| |c_#memory_$Pointer$#2.base|))) (and (= (store |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_9| .cse3 (select |c_#memory_$Pointer$#2.base| .cse3)) |c_#memory_$Pointer$#2.base|) (not (= |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base| .cse4)) (exists ((v_DerPreprocessor_5 (Array Int Int)) (v_DerPreprocessor_4 (Array Int Int))) (= (store (select (store (store |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_9| .cse0 v_DerPreprocessor_4) .cse4 v_DerPreprocessor_5) .cse0) .cse1 .cse4) .cse5)) (= .cse3 |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base|))))) (let ((.cse6 (select |c_#memory_$Pointer$#2.base| .cse0))) (let ((.cse7 (select .cse6 .cse1))) (and (or (exists ((v_DerPreprocessor_5 (Array Int Int)) (v_DerPreprocessor_4 (Array Int Int))) (= .cse6 (store (select (store (store |c_#memory_$Pointer$#2.base| .cse0 v_DerPreprocessor_4) .cse7 v_DerPreprocessor_5) .cse0) .cse1 .cse7))) (= .cse0 .cse7)) (not (= |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base| .cse7))))))))) is different from true [2024-11-06 22:28:25,627 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (and (not (= .cse0 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|)) (= |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (let ((.cse3 (+ (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (or (exists ((|v_old(#memory_$Pointer$#2.base)_AFTER_CALL_9| (Array Int (Array Int Int)))) (let ((.cse4 (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_9| .cse0))) (let ((.cse1 (@diff |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_9| |c_#memory_$Pointer$#2.base|)) (.cse2 (select .cse4 .cse3))) (and (= (store |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_9| .cse1 (select |c_#memory_$Pointer$#2.base| .cse1)) |c_#memory_$Pointer$#2.base|) (= .cse1 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) (exists ((v_DerPreprocessor_5 (Array Int Int)) (v_DerPreprocessor_4 (Array Int Int))) (= (store (select (store (store |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_9| .cse0 v_DerPreprocessor_4) .cse2 v_DerPreprocessor_5) .cse0) .cse3 .cse2) .cse4)) (not (= |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| .cse2)))))) (let ((.cse5 (select |c_#memory_$Pointer$#2.base| .cse0))) (let ((.cse6 (select .cse5 .cse3))) (and (or (exists ((v_DerPreprocessor_5 (Array Int Int)) (v_DerPreprocessor_4 (Array Int Int))) (= .cse5 (store (select (store (store |c_#memory_$Pointer$#2.base| .cse0 v_DerPreprocessor_4) .cse6 v_DerPreprocessor_5) .cse0) .cse3 .cse6))) (= .cse0 .cse6)) (not (= |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| .cse6))))))) (= |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) is different from false [2024-11-06 22:28:25,630 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (and (not (= .cse0 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|)) (= |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (let ((.cse3 (+ (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (or (exists ((|v_old(#memory_$Pointer$#2.base)_AFTER_CALL_9| (Array Int (Array Int Int)))) (let ((.cse4 (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_9| .cse0))) (let ((.cse1 (@diff |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_9| |c_#memory_$Pointer$#2.base|)) (.cse2 (select .cse4 .cse3))) (and (= (store |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_9| .cse1 (select |c_#memory_$Pointer$#2.base| .cse1)) |c_#memory_$Pointer$#2.base|) (= .cse1 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) (exists ((v_DerPreprocessor_5 (Array Int Int)) (v_DerPreprocessor_4 (Array Int Int))) (= (store (select (store (store |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_9| .cse0 v_DerPreprocessor_4) .cse2 v_DerPreprocessor_5) .cse0) .cse3 .cse2) .cse4)) (not (= |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| .cse2)))))) (let ((.cse5 (select |c_#memory_$Pointer$#2.base| .cse0))) (let ((.cse6 (select .cse5 .cse3))) (and (or (exists ((v_DerPreprocessor_5 (Array Int Int)) (v_DerPreprocessor_4 (Array Int Int))) (= .cse5 (store (select (store (store |c_#memory_$Pointer$#2.base| .cse0 v_DerPreprocessor_4) .cse6 v_DerPreprocessor_5) .cse0) .cse3 .cse6))) (= .cse0 .cse6)) (not (= |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| .cse6))))))) (= |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) is different from true [2024-11-06 22:28:25,659 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 227 treesize of output 160 [2024-11-06 22:28:25,666 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 167 treesize of output 124 [2024-11-06 22:28:25,683 INFO L349 Elim1Store]: treesize reduction 115, result has 0.9 percent of original size [2024-11-06 22:28:25,684 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 150 treesize of output 151 [2024-11-06 22:28:25,690 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 202 treesize of output 151 [2024-11-06 22:28:25,705 INFO L349 Elim1Store]: treesize reduction 118, result has 0.8 percent of original size [2024-11-06 22:28:25,705 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 3 case distinctions, treesize of input 481 treesize of output 310 [2024-11-06 22:28:25,711 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 49 treesize of output 26 [2024-11-06 22:28:25,716 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 43 treesize of output 19 [2024-11-06 22:28:25,719 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 32 treesize of output 24 [2024-11-06 22:28:25,729 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 241 treesize of output 166 [2024-11-06 22:28:25,735 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 173 treesize of output 130 [2024-11-06 22:28:25,745 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 360 treesize of output 257 [2024-11-06 22:28:25,750 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 264 treesize of output 201 [2024-11-06 22:28:25,764 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 28 treesize of output 20 [2024-11-06 22:28:25,808 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 28 treesize of output 12 [2024-11-06 22:28:25,812 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-06 22:28:25,816 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 22:28:25,816 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-06 22:28:26,014 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_975 (Array Int Int)) (v_ArrVal_977 (Array Int Int)) (v_ArrVal_981 Int) (|ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| Int) (v_ArrVal_982 (Array Int Int)) (v_ArrVal_983 (Array Int Int))) (not (let ((.cse4 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#1.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_#t~ret9#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$#1.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$#2.base| .cse1) (+ (select .cse3 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset|) 4)))) (store (store (store |c_#memory_$Pointer$#2.base| .cse1 v_ArrVal_983) .cse2 v_ArrVal_982) |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base| (store (select (store (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base| (store (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base|) |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| .cse1)) .cse1 v_ArrVal_975) .cse2 v_ArrVal_977) |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base|) (+ |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| 4) v_ArrVal_981)))) .cse0) (select (select (store |c_#memory_$Pointer$#1.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-06 22:28:26,058 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_986 (Array Int Int)) (v_ArrVal_975 (Array Int Int)) (v_ArrVal_977 (Array Int Int)) (v_ArrVal_981 Int) (|ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| Int) (v_ArrVal_982 (Array Int Int)) (|v_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base_18| Int) (v_ArrVal_983 (Array Int Int))) (or (not (let ((.cse4 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| (store .cse4 |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|))) (= .cse0 (let ((.cse3 (select |c_#memory_$Pointer$#1.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 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base_18| v_ArrVal_986) .cse1) (+ (select .cse3 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset|) 4)))) (store (store (store |c_#memory_$Pointer$#2.base| .cse1 v_ArrVal_983) .cse2 v_ArrVal_982) |v_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base_18| (store (select (store (store (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base_18| (store v_ArrVal_986 |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| .cse1)) .cse1 v_ArrVal_975) .cse2 v_ArrVal_977) |v_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base_18|) (+ |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| 4) v_ArrVal_981)))) .cse0) (select (select (store |c_#memory_$Pointer$#1.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|))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base_18|) 0)))) is different from false [2024-11-06 22:28:26,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [142013419] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-06 22:28:26,060 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-06 22:28:26,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 23] total 35 [2024-11-06 22:28:26,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2086218988] [2024-11-06 22:28:26,061 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-06 22:28:26,061 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2024-11-06 22:28:26,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 22:28:26,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2024-11-06 22:28:26,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=1012, Unknown=31, NotChecked=268, Total=1406 [2024-11-06 22:28:26,062 INFO L87 Difference]: Start difference. First operand 38 states and 43 transitions. Second operand has 35 states, 33 states have (on average 1.5151515151515151) internal successors, (50), 27 states have internal predecessors, (50), 5 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-06 22:28:30,486 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse9 (select (select |c_#memory_$Pointer$#2.base| .cse0) 4))) (and (= (select |c_#valid| .cse0) 1) (not (= .cse0 |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base|)) (= |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| .cse1)) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset|) 0) (= |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (let ((.cse2 (+ (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (or (exists ((|v_old(#memory_$Pointer$#2.base)_AFTER_CALL_9| (Array Int (Array Int Int)))) (let ((.cse3 (@diff |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_9| |c_#memory_$Pointer$#2.base|))) (and (= .cse1 (select (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_9| .cse1) .cse2)) (= (store |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_9| .cse3 (select |c_#memory_$Pointer$#2.base| .cse3)) |c_#memory_$Pointer$#2.base|) (= .cse3 |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base|)))) (exists ((|v_old(#memory_$Pointer$#2.base)_AFTER_CALL_9| (Array Int (Array Int Int)))) (let ((.cse6 (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_9| .cse1))) (let ((.cse5 (select .cse6 .cse2)) (.cse4 (@diff |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_9| |c_#memory_$Pointer$#2.base|))) (and (= (store |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_9| .cse4 (select |c_#memory_$Pointer$#2.base| .cse4)) |c_#memory_$Pointer$#2.base|) (not (= |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base| .cse5)) (exists ((v_DerPreprocessor_5 (Array Int Int)) (v_DerPreprocessor_4 (Array Int Int))) (= (store (select (store (store |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_9| .cse1 v_DerPreprocessor_4) .cse5 v_DerPreprocessor_5) .cse1) .cse2 .cse5) .cse6)) (= .cse4 |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base|))))) (let ((.cse7 (select |c_#memory_$Pointer$#2.base| .cse1))) (let ((.cse8 (select .cse7 .cse2))) (and (or (exists ((v_DerPreprocessor_5 (Array Int Int)) (v_DerPreprocessor_4 (Array Int Int))) (= .cse7 (store (select (store (store |c_#memory_$Pointer$#2.base| .cse1 v_DerPreprocessor_4) .cse8 v_DerPreprocessor_5) .cse1) .cse2 .cse8))) (= .cse1 .cse8)) (not (= |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base| .cse8))))))) (not (= .cse9 |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base|)) (= (select |c_#valid| .cse9) 1)))) is different from false [2024-11-06 22:28:30,489 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse9 (select (select |c_#memory_$Pointer$#2.base| .cse0) 4))) (and (= (select |c_#valid| .cse0) 1) (not (= .cse0 |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base|)) (= |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| .cse1)) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset|) 0) (= |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (let ((.cse2 (+ (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (or (exists ((|v_old(#memory_$Pointer$#2.base)_AFTER_CALL_9| (Array Int (Array Int Int)))) (let ((.cse3 (@diff |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_9| |c_#memory_$Pointer$#2.base|))) (and (= .cse1 (select (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_9| .cse1) .cse2)) (= (store |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_9| .cse3 (select |c_#memory_$Pointer$#2.base| .cse3)) |c_#memory_$Pointer$#2.base|) (= .cse3 |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base|)))) (exists ((|v_old(#memory_$Pointer$#2.base)_AFTER_CALL_9| (Array Int (Array Int Int)))) (let ((.cse6 (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_9| .cse1))) (let ((.cse5 (select .cse6 .cse2)) (.cse4 (@diff |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_9| |c_#memory_$Pointer$#2.base|))) (and (= (store |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_9| .cse4 (select |c_#memory_$Pointer$#2.base| .cse4)) |c_#memory_$Pointer$#2.base|) (not (= |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base| .cse5)) (exists ((v_DerPreprocessor_5 (Array Int Int)) (v_DerPreprocessor_4 (Array Int Int))) (= (store (select (store (store |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_9| .cse1 v_DerPreprocessor_4) .cse5 v_DerPreprocessor_5) .cse1) .cse2 .cse5) .cse6)) (= .cse4 |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base|))))) (let ((.cse7 (select |c_#memory_$Pointer$#2.base| .cse1))) (let ((.cse8 (select .cse7 .cse2))) (and (or (exists ((v_DerPreprocessor_5 (Array Int Int)) (v_DerPreprocessor_4 (Array Int Int))) (= .cse7 (store (select (store (store |c_#memory_$Pointer$#2.base| .cse1 v_DerPreprocessor_4) .cse8 v_DerPreprocessor_5) .cse1) .cse2 .cse8))) (= .cse1 .cse8)) (not (= |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base| .cse8))))))) (not (= .cse9 |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base|)) (= (select |c_#valid| .cse9) 1)))) is different from true [2024-11-06 22:28:34,492 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset|)) (.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (and (not (= .cse0 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|)) (= |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (not (= .cse1 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|)) (not (= (select (select |c_#memory_$Pointer$#2.base| .cse1) 4) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|)) (let ((.cse4 (+ (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (or (exists ((|v_old(#memory_$Pointer$#2.base)_AFTER_CALL_9| (Array Int (Array Int Int)))) (let ((.cse5 (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_9| .cse0))) (let ((.cse2 (@diff |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_9| |c_#memory_$Pointer$#2.base|)) (.cse3 (select .cse5 .cse4))) (and (= (store |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_9| .cse2 (select |c_#memory_$Pointer$#2.base| .cse2)) |c_#memory_$Pointer$#2.base|) (= .cse2 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) (exists ((v_DerPreprocessor_5 (Array Int Int)) (v_DerPreprocessor_4 (Array Int Int))) (= (store (select (store (store |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_9| .cse0 v_DerPreprocessor_4) .cse3 v_DerPreprocessor_5) .cse0) .cse4 .cse3) .cse5)) (not (= |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| .cse3)))))) (let ((.cse6 (select |c_#memory_$Pointer$#2.base| .cse0))) (let ((.cse7 (select .cse6 .cse4))) (and (or (exists ((v_DerPreprocessor_5 (Array Int Int)) (v_DerPreprocessor_4 (Array Int Int))) (= .cse6 (store (select (store (store |c_#memory_$Pointer$#2.base| .cse0 v_DerPreprocessor_4) .cse7 v_DerPreprocessor_5) .cse0) .cse4 .cse7))) (= .cse0 .cse7)) (not (= |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| .cse7))))))) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset|) 0) (= |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) is different from false [2024-11-06 22:28:34,495 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset|)) (.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (and (not (= .cse0 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|)) (= |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (not (= .cse1 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|)) (not (= (select (select |c_#memory_$Pointer$#2.base| .cse1) 4) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|)) (let ((.cse4 (+ (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (or (exists ((|v_old(#memory_$Pointer$#2.base)_AFTER_CALL_9| (Array Int (Array Int Int)))) (let ((.cse5 (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_9| .cse0))) (let ((.cse2 (@diff |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_9| |c_#memory_$Pointer$#2.base|)) (.cse3 (select .cse5 .cse4))) (and (= (store |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_9| .cse2 (select |c_#memory_$Pointer$#2.base| .cse2)) |c_#memory_$Pointer$#2.base|) (= .cse2 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) (exists ((v_DerPreprocessor_5 (Array Int Int)) (v_DerPreprocessor_4 (Array Int Int))) (= (store (select (store (store |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_9| .cse0 v_DerPreprocessor_4) .cse3 v_DerPreprocessor_5) .cse0) .cse4 .cse3) .cse5)) (not (= |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| .cse3)))))) (let ((.cse6 (select |c_#memory_$Pointer$#2.base| .cse0))) (let ((.cse7 (select .cse6 .cse4))) (and (or (exists ((v_DerPreprocessor_5 (Array Int Int)) (v_DerPreprocessor_4 (Array Int Int))) (= .cse6 (store (select (store (store |c_#memory_$Pointer$#2.base| .cse0 v_DerPreprocessor_4) .cse7 v_DerPreprocessor_5) .cse0) .cse4 .cse7))) (= .cse0 .cse7)) (not (= |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| .cse7))))))) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset|) 0) (= |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) is different from true [2024-11-06 22:28:34,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 22:28:34,760 INFO L93 Difference]: Finished difference Result 47 states and 52 transitions. [2024-11-06 22:28:34,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-06 22:28:34,761 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 33 states have (on average 1.5151515151515151) internal successors, (50), 27 states have internal predecessors, (50), 5 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Word has length 37 [2024-11-06 22:28:34,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 22:28:34,762 INFO L225 Difference]: With dead ends: 47 [2024-11-06 22:28:34,762 INFO L226 Difference]: Without dead ends: 44 [2024-11-06 22:28:34,763 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 49 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 342 ImplicationChecksByTransitivity, 21.2s TimeCoverageRelationStatistics Valid=161, Invalid=1805, Unknown=38, NotChecked=546, Total=2550 [2024-11-06 22:28:34,763 INFO L432 NwaCegarLoop]: 15 mSDtfsCounter, 30 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 552 mSolverCounterSat, 3 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 706 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 552 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 150 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-06 22:28:34,764 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 219 Invalid, 706 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 552 Invalid, 1 Unknown, 150 Unchecked, 0.4s Time] [2024-11-06 22:28:34,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2024-11-06 22:28:34,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 40. [2024-11-06 22:28:34,768 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-06 22:28:34,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 45 transitions. [2024-11-06 22:28:34,772 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 45 transitions. Word has length 37 [2024-11-06 22:28:34,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 22:28:34,772 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 45 transitions. [2024-11-06 22:28:34,772 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 33 states have (on average 1.5151515151515151) internal successors, (50), 27 states have internal predecessors, (50), 5 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-06 22:28:34,772 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 45 transitions. [2024-11-06 22:28:34,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-06 22:28:34,773 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 22:28:34,773 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-06 22:28:34,790 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-06 22:28:34,973 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 22:28:34,974 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 22:28:34,974 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 22:28:34,974 INFO L85 PathProgramCache]: Analyzing trace with hash 841147066, now seen corresponding path program 1 times [2024-11-06 22:28:34,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 22:28:34,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107974703] [2024-11-06 22:28:34,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 22:28:34,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 22:28:35,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:28:36,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-06 22:28:36,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:28:36,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-06 22:28:36,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:28:36,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-06 22:28:36,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:28:37,200 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-06 22:28:37,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 22:28:37,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107974703] [2024-11-06 22:28:37,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [107974703] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-06 22:28:37,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [69200713] [2024-11-06 22:28:37,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 22:28:37,201 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 22:28:37,201 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 22:28:37,203 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-06 22:28:37,204 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-06 22:28:37,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:28:37,401 INFO L255 TraceCheckSpWp]: Trace formula consists of 412 conjuncts, 136 conjuncts are in the unsatisfiable core [2024-11-06 22:28:37,408 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 22:28:37,440 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-06 22:28:37,572 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-06 22:28:37,627 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (exists ((|v_old(#valid)_AFTER_CALL_11| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_11| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|) 0) (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_11| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_11| .cse0 (select |c_#valid| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_11| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1))) (= (select (select |c_#memory_int#2| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|) 8) 1) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|) 1)) is different from false [2024-11-06 22:28:37,628 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (exists ((|v_old(#valid)_AFTER_CALL_11| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_11| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|) 0) (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_11| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_11| .cse0 (select |c_#valid| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_11| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1))) (= (select (select |c_#memory_int#2| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|) 8) 1) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|) 1)) is different from true [2024-11-06 22:28:37,648 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 23 treesize of output 11 [2024-11-06 22:28:37,652 WARN L851 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int#2| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 8) 1) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (exists ((|v_old(#valid)_AFTER_CALL_11| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_11| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0) (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_11| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_11| .cse0 (select |c_#valid| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_11| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1))) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 1)) is different from false [2024-11-06 22:28:37,654 WARN L873 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int#2| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 8) 1) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (exists ((|v_old(#valid)_AFTER_CALL_11| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_11| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0) (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_11| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_11| .cse0 (select |c_#valid| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_11| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1))) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 1)) is different from true [2024-11-06 22:28:37,668 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-06 22:28:37,669 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 1 case distinctions, treesize of input 16 treesize of output 15 [2024-11-06 22:28:37,685 WARN L851 $PredicateComparison]: unable to prove that (and (or (= (select (select |c_#memory_int#2| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 8) 1) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 1) (exists ((|v_old(#valid)_AFTER_CALL_11| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_11| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0) (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_11| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_11| .cse0 (select |c_#valid| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_11| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1)))) is different from false [2024-11-06 22:28:37,687 WARN L873 $PredicateComparison]: unable to prove that (and (or (= (select (select |c_#memory_int#2| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 8) 1) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 1) (exists ((|v_old(#valid)_AFTER_CALL_11| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_11| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0) (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_11| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_11| .cse0 (select |c_#valid| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_11| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1)))) is different from true [2024-11-06 22:28:37,705 WARN L851 $PredicateComparison]: unable to prove that (and (= 0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_old(#valid)_AFTER_CALL_11| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_11| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0) (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_11| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_11| .cse0 (select |c_#valid| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_11| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1))) (or (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= (select (select |c_#memory_int#2| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 8) 1)) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1)) is different from false [2024-11-06 22:28:37,706 WARN L873 $PredicateComparison]: unable to prove that (and (= 0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_old(#valid)_AFTER_CALL_11| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_11| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0) (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_11| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_11| .cse0 (select |c_#valid| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_11| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1))) (or (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= (select (select |c_#memory_int#2| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 8) 1)) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1)) is different from true [2024-11-06 22:28:37,735 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-06 22:28:37,738 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-06 22:28:37,741 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-06 22:28:37,749 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-06 22:28:37,757 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-06 22:28:37,781 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_create_#res#1.base|))) (let ((.cse0 (select .cse1 4))) (and (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) 1) (exists ((|v_ULTIMATE.start_dll_circular_create_~last~0#1.offset_8| Int) (v_arrayElimArr_8 (Array Int Int)) (v_DerPreprocessor_7 (Array Int Int))) (and (= |c_ULTIMATE.start_dll_circular_create_#res#1.base| (select v_arrayElimArr_8 |v_ULTIMATE.start_dll_circular_create_~last~0#1.offset_8|)) (= (store (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_create_#res#1.base| v_DerPreprocessor_7) .cse0 v_arrayElimArr_8) |c_ULTIMATE.start_dll_circular_create_#res#1.base|) 4 .cse0) .cse1))) (not (= .cse0 |c_ULTIMATE.start_dll_circular_create_#res#1.base|)) (= |c_ULTIMATE.start_dll_circular_create_#res#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= (select (select |c_#memory_int#2| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) 8) 1) (exists ((|v_old(#valid)_AFTER_CALL_11| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_11| .cse0) 1) (= |c_#valid| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_11| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_11| .cse2 (select |c_#valid| .cse2)))) (= (select |v_old(#valid)_AFTER_CALL_11| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) 0)))))) is different from false [2024-11-06 22:28:37,784 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_create_#res#1.base|))) (let ((.cse0 (select .cse1 4))) (and (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) 1) (exists ((|v_ULTIMATE.start_dll_circular_create_~last~0#1.offset_8| Int) (v_arrayElimArr_8 (Array Int Int)) (v_DerPreprocessor_7 (Array Int Int))) (and (= |c_ULTIMATE.start_dll_circular_create_#res#1.base| (select v_arrayElimArr_8 |v_ULTIMATE.start_dll_circular_create_~last~0#1.offset_8|)) (= (store (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_create_#res#1.base| v_DerPreprocessor_7) .cse0 v_arrayElimArr_8) |c_ULTIMATE.start_dll_circular_create_#res#1.base|) 4 .cse0) .cse1))) (not (= .cse0 |c_ULTIMATE.start_dll_circular_create_#res#1.base|)) (= |c_ULTIMATE.start_dll_circular_create_#res#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= (select (select |c_#memory_int#2| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) 8) 1) (exists ((|v_old(#valid)_AFTER_CALL_11| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_11| .cse0) 1) (= |c_#valid| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_11| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_11| .cse2 (select |c_#valid| .cse2)))) (= (select |v_old(#valid)_AFTER_CALL_11| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) 0)))))) is different from true [2024-11-06 22:28:37,826 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse1 (select |c_#memory_$Pointer$#2.base| .cse0))) (let ((.cse2 (select .cse1 4))) (and (= (select (select |c_#memory_int#2| .cse0) 8) 1) (= |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (exists ((|v_ULTIMATE.start_dll_circular_create_~last~0#1.offset_8| Int) (v_arrayElimArr_8 (Array Int Int)) (v_DerPreprocessor_7 (Array Int Int))) (and (= .cse1 (store (select (store (store |c_#memory_$Pointer$#2.base| .cse0 v_DerPreprocessor_7) .cse2 v_arrayElimArr_8) .cse0) 4 .cse2)) (= .cse0 (select v_arrayElimArr_8 |v_ULTIMATE.start_dll_circular_create_~last~0#1.offset_8|)))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (not (= .cse2 .cse0)) (= |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_old(#valid)_AFTER_CALL_11| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_11| .cse0) 0) (= (select |v_old(#valid)_AFTER_CALL_11| .cse2) 1) (= |c_#valid| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_11| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_11| .cse3 (select |c_#valid| .cse3)))))) (= (select |c_#valid| .cse0) 1) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0))))) is different from false [2024-11-06 22:28:37,829 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse1 (select |c_#memory_$Pointer$#2.base| .cse0))) (let ((.cse2 (select .cse1 4))) (and (= (select (select |c_#memory_int#2| .cse0) 8) 1) (= |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (exists ((|v_ULTIMATE.start_dll_circular_create_~last~0#1.offset_8| Int) (v_arrayElimArr_8 (Array Int Int)) (v_DerPreprocessor_7 (Array Int Int))) (and (= .cse1 (store (select (store (store |c_#memory_$Pointer$#2.base| .cse0 v_DerPreprocessor_7) .cse2 v_arrayElimArr_8) .cse0) 4 .cse2)) (= .cse0 (select v_arrayElimArr_8 |v_ULTIMATE.start_dll_circular_create_~last~0#1.offset_8|)))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (not (= .cse2 .cse0)) (= |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_old(#valid)_AFTER_CALL_11| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_11| .cse0) 0) (= (select |v_old(#valid)_AFTER_CALL_11| .cse2) 1) (= |c_#valid| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_11| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_11| .cse3 (select |c_#valid| .cse3)))))) (= (select |c_#valid| .cse0) 1) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0))))) is different from true [2024-11-06 22:28:37,844 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 104 treesize of output 56 [2024-11-06 22:28:37,849 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 9 treesize of output 7 [2024-11-06 22:28:37,855 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 11 treesize of output 3 [2024-11-06 22:28:37,860 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 8 treesize of output 1 [2024-11-06 22:28:37,865 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 14 [2024-11-06 22:28:37,891 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_#valid| |c_old(#valid)|) (exists ((|v_ULTIMATE.start_dll_circular_prepend_~head#1.base_BEFORE_CALL_5| Int) (|v_old(#valid)_AFTER_CALL_11| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_prepend_~head#1.offset_BEFORE_CALL_5| Int) (|v_#valid_BEFORE_CALL_11| (Array Int Int)) (v_arrayElimCell_86 Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_circular_prepend_~head#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_dll_circular_prepend_~head#1.offset_BEFORE_CALL_5|))) (and (= |v_#valid_BEFORE_CALL_11| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_11| |v_#valid_BEFORE_CALL_11|))) (store |v_old(#valid)_AFTER_CALL_11| .cse0 (select |v_#valid_BEFORE_CALL_11| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_11| v_arrayElimCell_86) 1) (= 1 (select |v_#valid_BEFORE_CALL_11| .cse1)) (= (select |v_old(#valid)_AFTER_CALL_11| .cse1) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_circular_prepend_~head#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_dll_circular_prepend_~head#1.offset_BEFORE_CALL_5|) 0)))) (= |c_old(#memory_int#2)| |c_#memory_int#2|) (= |c_old(#memory_$Pointer$#2.base)| |c_#memory_$Pointer$#2.base|)) is different from false [2024-11-06 22:28:37,893 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_#valid| |c_old(#valid)|) (exists ((|v_ULTIMATE.start_dll_circular_prepend_~head#1.base_BEFORE_CALL_5| Int) (|v_old(#valid)_AFTER_CALL_11| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_prepend_~head#1.offset_BEFORE_CALL_5| Int) (|v_#valid_BEFORE_CALL_11| (Array Int Int)) (v_arrayElimCell_86 Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_circular_prepend_~head#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_dll_circular_prepend_~head#1.offset_BEFORE_CALL_5|))) (and (= |v_#valid_BEFORE_CALL_11| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_11| |v_#valid_BEFORE_CALL_11|))) (store |v_old(#valid)_AFTER_CALL_11| .cse0 (select |v_#valid_BEFORE_CALL_11| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_11| v_arrayElimCell_86) 1) (= 1 (select |v_#valid_BEFORE_CALL_11| .cse1)) (= (select |v_old(#valid)_AFTER_CALL_11| .cse1) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_circular_prepend_~head#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_dll_circular_prepend_~head#1.offset_BEFORE_CALL_5|) 0)))) (= |c_old(#memory_int#2)| |c_#memory_int#2|) (= |c_old(#memory_$Pointer$#2.base)| |c_#memory_$Pointer$#2.base|)) is different from true [2024-11-06 22:28:37,922 WARN L851 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_dll_circular_prepend_~head#1.base_BEFORE_CALL_5| Int) (|v_old(#valid)_AFTER_CALL_11| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_prepend_~head#1.offset_BEFORE_CALL_5| Int) (|v_#valid_BEFORE_CALL_11| (Array Int Int)) (v_arrayElimCell_86 Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_circular_prepend_~head#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_dll_circular_prepend_~head#1.offset_BEFORE_CALL_5|))) (and (= |v_#valid_BEFORE_CALL_11| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_11| |v_#valid_BEFORE_CALL_11|))) (store |v_old(#valid)_AFTER_CALL_11| .cse0 (select |v_#valid_BEFORE_CALL_11| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_11| v_arrayElimCell_86) 1) (= 1 (select |v_#valid_BEFORE_CALL_11| .cse1)) (= (select |v_old(#valid)_AFTER_CALL_11| .cse1) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_circular_prepend_~head#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_dll_circular_prepend_~head#1.offset_BEFORE_CALL_5|) 0)))) (= |c_node_create_~temp~0#1.offset| 0) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (= |c_old(#memory_int#2)| |c_#memory_int#2|) (= |c_old(#memory_$Pointer$#2.base)| |c_#memory_$Pointer$#2.base|)) is different from false [2024-11-06 22:28:37,924 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_dll_circular_prepend_~head#1.base_BEFORE_CALL_5| Int) (|v_old(#valid)_AFTER_CALL_11| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_prepend_~head#1.offset_BEFORE_CALL_5| Int) (|v_#valid_BEFORE_CALL_11| (Array Int Int)) (v_arrayElimCell_86 Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_circular_prepend_~head#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_dll_circular_prepend_~head#1.offset_BEFORE_CALL_5|))) (and (= |v_#valid_BEFORE_CALL_11| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_11| |v_#valid_BEFORE_CALL_11|))) (store |v_old(#valid)_AFTER_CALL_11| .cse0 (select |v_#valid_BEFORE_CALL_11| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_11| v_arrayElimCell_86) 1) (= 1 (select |v_#valid_BEFORE_CALL_11| .cse1)) (= (select |v_old(#valid)_AFTER_CALL_11| .cse1) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_circular_prepend_~head#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_dll_circular_prepend_~head#1.offset_BEFORE_CALL_5|) 0)))) (= |c_node_create_~temp~0#1.offset| 0) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (= |c_old(#memory_int#2)| |c_#memory_int#2|) (= |c_old(#memory_$Pointer$#2.base)| |c_#memory_$Pointer$#2.base|)) is different from true [2024-11-06 22:28:37,988 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_node_create_#res#1.offset| 0) (= (select |c_old(#valid)| |c_node_create_#res#1.base|) 0) (exists ((|v_ULTIMATE.start_dll_circular_prepend_~head#1.base_BEFORE_CALL_5| Int) (|v_old(#valid)_AFTER_CALL_11| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_prepend_~head#1.offset_BEFORE_CALL_5| Int) (|v_#valid_BEFORE_CALL_11| (Array Int Int)) (v_arrayElimCell_86 Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_circular_prepend_~head#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_dll_circular_prepend_~head#1.offset_BEFORE_CALL_5|))) (and (= |v_#valid_BEFORE_CALL_11| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_11| |v_#valid_BEFORE_CALL_11|))) (store |v_old(#valid)_AFTER_CALL_11| .cse0 (select |v_#valid_BEFORE_CALL_11| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_11| v_arrayElimCell_86) 1) (= 1 (select |v_#valid_BEFORE_CALL_11| .cse1)) (= (select |v_old(#valid)_AFTER_CALL_11| .cse1) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_circular_prepend_~head#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_dll_circular_prepend_~head#1.offset_BEFORE_CALL_5|) 0)))) (= (store |c_old(#memory_$Pointer$#2.base)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$#2.base| |c_node_create_#res#1.base|)) |c_#memory_$Pointer$#2.base|) (= (store |c_old(#memory_int#2)| |c_node_create_#res#1.base| (select |c_#memory_int#2| |c_node_create_#res#1.base|)) |c_#memory_int#2|)) is different from false [2024-11-06 22:28:37,990 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_node_create_#res#1.offset| 0) (= (select |c_old(#valid)| |c_node_create_#res#1.base|) 0) (exists ((|v_ULTIMATE.start_dll_circular_prepend_~head#1.base_BEFORE_CALL_5| Int) (|v_old(#valid)_AFTER_CALL_11| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_prepend_~head#1.offset_BEFORE_CALL_5| Int) (|v_#valid_BEFORE_CALL_11| (Array Int Int)) (v_arrayElimCell_86 Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_circular_prepend_~head#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_dll_circular_prepend_~head#1.offset_BEFORE_CALL_5|))) (and (= |v_#valid_BEFORE_CALL_11| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_11| |v_#valid_BEFORE_CALL_11|))) (store |v_old(#valid)_AFTER_CALL_11| .cse0 (select |v_#valid_BEFORE_CALL_11| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_11| v_arrayElimCell_86) 1) (= 1 (select |v_#valid_BEFORE_CALL_11| .cse1)) (= (select |v_old(#valid)_AFTER_CALL_11| .cse1) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_circular_prepend_~head#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_dll_circular_prepend_~head#1.offset_BEFORE_CALL_5|) 0)))) (= (store |c_old(#memory_$Pointer$#2.base)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$#2.base| |c_node_create_#res#1.base|)) |c_#memory_$Pointer$#2.base|) (= (store |c_old(#memory_int#2)| |c_node_create_#res#1.base| (select |c_#memory_int#2| |c_node_create_#res#1.base|)) |c_#memory_int#2|)) is different from true [2024-11-06 22:28:38,047 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2024-11-06 22:28:38,047 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 1 case distinctions, treesize of input 20 treesize of output 23 [2024-11-06 22:28:38,059 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-06 22:28:38,060 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 112 treesize of output 65 [2024-11-06 22:28:38,067 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 20 treesize of output 1 [2024-11-06 22:28:38,091 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 9 treesize of output 7 [2024-11-06 22:28:38,115 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| .cse0) 4))) (and (or (= (select (select |c_#memory_int#2| .cse0) 8) 1) (= |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base| .cse0)) (= |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (exists ((|v_ULTIMATE.start_dll_circular_prepend_~head#1.base_BEFORE_CALL_5| Int) (|v_old(#valid)_AFTER_CALL_11| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_prepend_~head#1.offset_BEFORE_CALL_5| Int) (|v_#valid_BEFORE_CALL_11| (Array Int Int)) (v_arrayElimCell_86 Int)) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_circular_prepend_~head#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_dll_circular_prepend_~head#1.offset_BEFORE_CALL_5|))) (and (= |v_#valid_BEFORE_CALL_11| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_11| |v_#valid_BEFORE_CALL_11|))) (store |v_old(#valid)_AFTER_CALL_11| .cse1 (select |v_#valid_BEFORE_CALL_11| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_11| v_arrayElimCell_86) 1) (= 1 (select |v_#valid_BEFORE_CALL_11| .cse2)) (= (select |v_old(#valid)_AFTER_CALL_11| .cse2) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_circular_prepend_~head#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_dll_circular_prepend_~head#1.offset_BEFORE_CALL_5|) 0)))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (not (= .cse3 .cse0)) (= |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_12| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_13| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_12| |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_13| .cse3) 1) (= (select |v_old(#valid)_AFTER_CALL_13| .cse0) 0) (= (select |v_old(#valid)_AFTER_CALL_12| .cse0) 1) (= (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_13| |v_old(#valid)_AFTER_CALL_12|))) (store |v_old(#valid)_AFTER_CALL_13| .cse4 (select |v_old(#valid)_AFTER_CALL_12| .cse4))) |v_old(#valid)_AFTER_CALL_12|))) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)))) is different from false [2024-11-06 22:28:38,119 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| .cse0) 4))) (and (or (= (select (select |c_#memory_int#2| .cse0) 8) 1) (= |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base| .cse0)) (= |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (exists ((|v_ULTIMATE.start_dll_circular_prepend_~head#1.base_BEFORE_CALL_5| Int) (|v_old(#valid)_AFTER_CALL_11| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_prepend_~head#1.offset_BEFORE_CALL_5| Int) (|v_#valid_BEFORE_CALL_11| (Array Int Int)) (v_arrayElimCell_86 Int)) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_circular_prepend_~head#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_dll_circular_prepend_~head#1.offset_BEFORE_CALL_5|))) (and (= |v_#valid_BEFORE_CALL_11| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_11| |v_#valid_BEFORE_CALL_11|))) (store |v_old(#valid)_AFTER_CALL_11| .cse1 (select |v_#valid_BEFORE_CALL_11| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_11| v_arrayElimCell_86) 1) (= 1 (select |v_#valid_BEFORE_CALL_11| .cse2)) (= (select |v_old(#valid)_AFTER_CALL_11| .cse2) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_circular_prepend_~head#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_dll_circular_prepend_~head#1.offset_BEFORE_CALL_5|) 0)))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (not (= .cse3 .cse0)) (= |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_12| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_13| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_12| |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_13| .cse3) 1) (= (select |v_old(#valid)_AFTER_CALL_13| .cse0) 0) (= (select |v_old(#valid)_AFTER_CALL_12| .cse0) 1) (= (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_13| |v_old(#valid)_AFTER_CALL_12|))) (store |v_old(#valid)_AFTER_CALL_13| .cse4 (select |v_old(#valid)_AFTER_CALL_12| .cse4))) |v_old(#valid)_AFTER_CALL_12|))) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)))) is different from true [2024-11-06 22:28:38,203 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| .cse2) 4))) (and (= |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (exists ((|v_ULTIMATE.start_dll_circular_prepend_~head#1.base_BEFORE_CALL_5| Int) (|v_old(#valid)_AFTER_CALL_11| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_prepend_~head#1.offset_BEFORE_CALL_5| Int) (|v_#valid_BEFORE_CALL_11| (Array Int Int)) (v_arrayElimCell_86 Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_circular_prepend_~head#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_dll_circular_prepend_~head#1.offset_BEFORE_CALL_5|))) (and (= |v_#valid_BEFORE_CALL_11| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_11| |v_#valid_BEFORE_CALL_11|))) (store |v_old(#valid)_AFTER_CALL_11| .cse0 (select |v_#valid_BEFORE_CALL_11| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_11| v_arrayElimCell_86) 1) (= 1 (select |v_#valid_BEFORE_CALL_11| .cse1)) (= (select |v_old(#valid)_AFTER_CALL_11| .cse1) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_circular_prepend_~head#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_dll_circular_prepend_~head#1.offset_BEFORE_CALL_5|) 0)))) (or (= (select (select |c_#memory_int#2| .cse2) 8) 1) (= .cse2 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|)) (= |c_ULTIMATE.start_main_~data~0#1| 1) (not (= .cse3 .cse2)) (= |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_12| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_13| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_12| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_13| .cse3) 1) (= (select |v_old(#valid)_AFTER_CALL_13| .cse2) 0) (= (select |v_old(#valid)_AFTER_CALL_12| .cse2) 1) (= (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_13| |v_old(#valid)_AFTER_CALL_12|))) (store |v_old(#valid)_AFTER_CALL_13| .cse4 (select |v_old(#valid)_AFTER_CALL_12| .cse4))) |v_old(#valid)_AFTER_CALL_12|))) (= |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)))) is different from false [2024-11-06 22:28:38,207 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| .cse2) 4))) (and (= |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (exists ((|v_ULTIMATE.start_dll_circular_prepend_~head#1.base_BEFORE_CALL_5| Int) (|v_old(#valid)_AFTER_CALL_11| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_prepend_~head#1.offset_BEFORE_CALL_5| Int) (|v_#valid_BEFORE_CALL_11| (Array Int Int)) (v_arrayElimCell_86 Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_circular_prepend_~head#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_dll_circular_prepend_~head#1.offset_BEFORE_CALL_5|))) (and (= |v_#valid_BEFORE_CALL_11| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_11| |v_#valid_BEFORE_CALL_11|))) (store |v_old(#valid)_AFTER_CALL_11| .cse0 (select |v_#valid_BEFORE_CALL_11| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_11| v_arrayElimCell_86) 1) (= 1 (select |v_#valid_BEFORE_CALL_11| .cse1)) (= (select |v_old(#valid)_AFTER_CALL_11| .cse1) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_circular_prepend_~head#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_dll_circular_prepend_~head#1.offset_BEFORE_CALL_5|) 0)))) (or (= (select (select |c_#memory_int#2| .cse2) 8) 1) (= .cse2 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|)) (= |c_ULTIMATE.start_main_~data~0#1| 1) (not (= .cse3 .cse2)) (= |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_12| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_13| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_12| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_13| .cse3) 1) (= (select |v_old(#valid)_AFTER_CALL_13| .cse2) 0) (= (select |v_old(#valid)_AFTER_CALL_12| .cse2) 1) (= (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_13| |v_old(#valid)_AFTER_CALL_12|))) (store |v_old(#valid)_AFTER_CALL_13| .cse4 (select |v_old(#valid)_AFTER_CALL_12| .cse4))) |v_old(#valid)_AFTER_CALL_12|))) (= |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)))) is different from true [2024-11-06 22:28:38,267 WARN L214 Elim1Store]: Array PQE input equivalent to false [2024-11-06 22:28:38,288 WARN L214 Elim1Store]: Array PQE input equivalent to false [2024-11-06 22:28:38,317 WARN L214 Elim1Store]: Array PQE input equivalent to false [2024-11-06 22:28:38,350 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 87 treesize of output 99 [2024-11-06 22:28:38,385 INFO L349 Elim1Store]: treesize reduction 74, result has 1.3 percent of original size [2024-11-06 22:28:38,385 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 281 treesize of output 240 [2024-11-06 22:28:38,670 INFO L349 Elim1Store]: treesize reduction 20, result has 58.3 percent of original size [2024-11-06 22:28:38,671 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 407 treesize of output 299 [2024-11-06 22:28:38,717 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-06 22:28:38,725 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-06 22:28:38,736 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 111 treesize of output 27 [2024-11-06 22:28:38,754 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-06 22:28:38,762 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 102 treesize of output 22 [2024-11-06 22:28:38,799 INFO L349 Elim1Store]: treesize reduction 37, result has 15.9 percent of original size [2024-11-06 22:28:38,799 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-06 22:28:38,815 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 8 treesize of output 1 [2024-11-06 22:28:38,828 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 22 treesize of output 13 [2024-11-06 22:28:40,431 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-06 22:28:42,452 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (and (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 0) 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (let ((.cse4 (select |c_#memory_$Pointer$#2.base| .cse0))) (let ((.cse3 (select .cse4 4))) (let ((.cse14 (exists ((|v_old(#valid)_AFTER_CALL_12| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_13| (Array Int Int)) (v_DerPreprocessor_11 (Array Int Int)) (v_DerPreprocessor_10 Int) (v_DerPreprocessor_12 (Array Int Int)) (v_ArrVal_1283 (Array Int Int)) (v_DerPreprocessor_13 (Array Int Int)) (v_ArrVal_1281 (Array Int Int))) (let ((.cse17 (select v_DerPreprocessor_13 0))) (let ((.cse18 (select (select (store (store (store |c_#memory_$Pointer$#2.base| .cse17 v_DerPreprocessor_11) v_DerPreprocessor_10 v_DerPreprocessor_12) .cse0 v_DerPreprocessor_13) .cse17) 4))) (and (= (select |v_old(#valid)_AFTER_CALL_12| .cse17) 1) (= (store (select (store (store (store (store |c_#memory_$Pointer$#2.base| v_DerPreprocessor_10 v_DerPreprocessor_12) .cse0 v_DerPreprocessor_13) .cse17 v_ArrVal_1283) .cse18 v_ArrVal_1281) .cse0) 4 .cse3) .cse4) (= (select |v_old(#valid)_AFTER_CALL_13| .cse17) 0) (= (select |v_old(#valid)_AFTER_CALL_13| .cse18) 1) (= .cse18 v_DerPreprocessor_10) (= (let ((.cse19 (@diff |v_old(#valid)_AFTER_CALL_13| |v_old(#valid)_AFTER_CALL_12|))) (store |v_old(#valid)_AFTER_CALL_13| .cse19 (select |v_old(#valid)_AFTER_CALL_12| .cse19))) |v_old(#valid)_AFTER_CALL_12|) (= (select (select |c_#memory_int#2| .cse17) 8) 1) (= (select |v_old(#valid)_AFTER_CALL_12| .cse0) 0))))))) (or (exists ((|v_old(#valid)_AFTER_CALL_11| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_12| (Array Int Int)) (|v_#valid_BEFORE_CALL_11| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_13| (Array Int Int)) (v_DerPreprocessor_11 (Array Int Int)) (v_DerPreprocessor_10 Int) (v_DerPreprocessor_12 (Array Int Int)) (v_arrayElimCell_86 Int) (v_ArrVal_1283 (Array Int Int)) (v_DerPreprocessor_13 (Array Int Int)) (v_ArrVal_1281 (Array Int Int))) (let ((.cse1 (select v_DerPreprocessor_13 0))) (let ((.cse2 (select (select (store (store (store |c_#memory_$Pointer$#2.base| .cse1 v_DerPreprocessor_11) v_DerPreprocessor_10 v_DerPreprocessor_12) .cse0 v_DerPreprocessor_13) .cse1) 4))) (and (= (select |v_old(#valid)_AFTER_CALL_12| .cse1) 1) (= (store (select (store (store (store (store |c_#memory_$Pointer$#2.base| v_DerPreprocessor_10 v_DerPreprocessor_12) .cse0 v_DerPreprocessor_13) .cse1 v_ArrVal_1283) .cse2 v_ArrVal_1281) .cse0) 4 .cse3) .cse4) (= (select |v_old(#valid)_AFTER_CALL_13| .cse1) 0) (= (select |v_old(#valid)_AFTER_CALL_11| .cse1) 0) (= (select |v_old(#valid)_AFTER_CALL_13| .cse2) 1) (= (select |v_#valid_BEFORE_CALL_11| .cse1) 1) (= .cse2 v_DerPreprocessor_10) (= |v_#valid_BEFORE_CALL_11| (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_11| |v_#valid_BEFORE_CALL_11|))) (store |v_old(#valid)_AFTER_CALL_11| .cse5 (select |v_#valid_BEFORE_CALL_11| .cse5)))) (= (select |v_old(#valid)_AFTER_CALL_11| v_arrayElimCell_86) 1) (= (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_13| |v_old(#valid)_AFTER_CALL_12|))) (store |v_old(#valid)_AFTER_CALL_13| .cse6 (select |v_old(#valid)_AFTER_CALL_12| .cse6))) |v_old(#valid)_AFTER_CALL_12|) (= (select (select |c_#memory_int#2| .cse1) 8) 1) (= (select |v_old(#valid)_AFTER_CALL_12| .cse0) 0))))) (exists ((|v_old(#valid)_AFTER_CALL_11| (Array Int Int)) (v_arrayElimCell_86 Int)) (and (= (select |v_old(#valid)_AFTER_CALL_11| v_arrayElimCell_86) 1) (exists ((|v_#valid_BEFORE_CALL_11| (Array Int Int))) (and (= |v_#valid_BEFORE_CALL_11| (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_11| |v_#valid_BEFORE_CALL_11|))) (store |v_old(#valid)_AFTER_CALL_11| .cse7 (select |v_#valid_BEFORE_CALL_11| .cse7)))) (exists ((|v_ULTIMATE.start_dll_circular_prepend_~head#1.base_BEFORE_CALL_5| Int) (|v_ULTIMATE.start_dll_circular_prepend_~head#1.offset_BEFORE_CALL_5| Int)) (let ((.cse8 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_circular_prepend_~head#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_dll_circular_prepend_~head#1.offset_BEFORE_CALL_5|))) (and (= 1 (select |v_#valid_BEFORE_CALL_11| .cse8)) (= (select |v_old(#valid)_AFTER_CALL_11| .cse8) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_circular_prepend_~head#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_dll_circular_prepend_~head#1.offset_BEFORE_CALL_5|) 0) (exists ((|v_old(#valid)_AFTER_CALL_12| (Array Int Int))) (and (exists ((|v_old(#valid)_AFTER_CALL_13| (Array Int Int))) (and (exists ((v_DerPreprocessor_11 (Array Int Int)) (v_DerPreprocessor_10 Int) (v_DerPreprocessor_12 (Array Int Int)) (v_ArrVal_1283 (Array Int Int)) (v_DerPreprocessor_13 (Array Int Int)) (v_ArrVal_1281 (Array Int Int))) (let ((.cse9 (select v_DerPreprocessor_13 0))) (let ((.cse10 (select (select (store (store (store |c_#memory_$Pointer$#2.base| .cse9 v_DerPreprocessor_11) v_DerPreprocessor_10 v_DerPreprocessor_12) .cse0 v_DerPreprocessor_13) .cse9) 4))) (and (= (select |v_old(#valid)_AFTER_CALL_12| .cse9) 1) (= (store (select (store (store (store (store |c_#memory_$Pointer$#2.base| v_DerPreprocessor_10 v_DerPreprocessor_12) .cse0 v_DerPreprocessor_13) .cse9 v_ArrVal_1283) .cse10 v_ArrVal_1281) .cse0) 4 .cse3) .cse4) (= (select |v_old(#valid)_AFTER_CALL_13| .cse9) 0) (= (select |v_old(#valid)_AFTER_CALL_13| .cse10) 1) (= .cse10 v_DerPreprocessor_10) (= .cse8 .cse9) (= (select (select |c_#memory_int#2| .cse9) 8) 1))))) (= (let ((.cse11 (@diff |v_old(#valid)_AFTER_CALL_13| |v_old(#valid)_AFTER_CALL_12|))) (store |v_old(#valid)_AFTER_CALL_13| .cse11 (select |v_old(#valid)_AFTER_CALL_12| .cse11))) |v_old(#valid)_AFTER_CALL_12|))) (= (select |v_old(#valid)_AFTER_CALL_12| .cse0) 0)))))))))) (and (exists ((|v_ULTIMATE.start_dll_circular_prepend_~head#1.base_BEFORE_CALL_5| Int) (|v_old(#valid)_AFTER_CALL_11| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_prepend_~head#1.offset_BEFORE_CALL_5| Int) (|v_#valid_BEFORE_CALL_11| (Array Int Int)) (v_arrayElimCell_86 Int)) (let ((.cse13 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_circular_prepend_~head#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_dll_circular_prepend_~head#1.offset_BEFORE_CALL_5|))) (and (= |v_#valid_BEFORE_CALL_11| (let ((.cse12 (@diff |v_old(#valid)_AFTER_CALL_11| |v_#valid_BEFORE_CALL_11|))) (store |v_old(#valid)_AFTER_CALL_11| .cse12 (select |v_#valid_BEFORE_CALL_11| .cse12)))) (= (select |v_old(#valid)_AFTER_CALL_11| v_arrayElimCell_86) 1) (= 1 (select |v_#valid_BEFORE_CALL_11| .cse13)) (= (select |v_old(#valid)_AFTER_CALL_11| .cse13) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_circular_prepend_~head#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_dll_circular_prepend_~head#1.offset_BEFORE_CALL_5|) 0) (not (= |v_ULTIMATE.start_dll_circular_prepend_~head#1.base_BEFORE_CALL_5| |c_ULTIMATE.start_main_~#s~0#1.base|))))) .cse14) (and (exists ((|v_ULTIMATE.start_dll_circular_prepend_~head#1.base_BEFORE_CALL_5| Int) (|v_old(#valid)_AFTER_CALL_11| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_prepend_~head#1.offset_BEFORE_CALL_5| Int) (|v_#valid_BEFORE_CALL_11| (Array Int Int)) (v_arrayElimCell_86 Int)) (let ((.cse16 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_circular_prepend_~head#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_dll_circular_prepend_~head#1.offset_BEFORE_CALL_5|))) (and (= |v_#valid_BEFORE_CALL_11| (let ((.cse15 (@diff |v_old(#valid)_AFTER_CALL_11| |v_#valid_BEFORE_CALL_11|))) (store |v_old(#valid)_AFTER_CALL_11| .cse15 (select |v_#valid_BEFORE_CALL_11| .cse15)))) (= (select |v_old(#valid)_AFTER_CALL_11| v_arrayElimCell_86) 1) (= 1 (select |v_#valid_BEFORE_CALL_11| .cse16)) (= (select |v_old(#valid)_AFTER_CALL_11| .cse16) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_circular_prepend_~head#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_dll_circular_prepend_~head#1.offset_BEFORE_CALL_5|) 0) (not (= |c_ULTIMATE.start_main_~#s~0#1.offset| |v_ULTIMATE.start_dll_circular_prepend_~head#1.offset_BEFORE_CALL_5|))))) .cse14))))) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0))) is different from false [2024-11-06 22:28:42,458 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (and (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 0) 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (let ((.cse4 (select |c_#memory_$Pointer$#2.base| .cse0))) (let ((.cse3 (select .cse4 4))) (let ((.cse14 (exists ((|v_old(#valid)_AFTER_CALL_12| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_13| (Array Int Int)) (v_DerPreprocessor_11 (Array Int Int)) (v_DerPreprocessor_10 Int) (v_DerPreprocessor_12 (Array Int Int)) (v_ArrVal_1283 (Array Int Int)) (v_DerPreprocessor_13 (Array Int Int)) (v_ArrVal_1281 (Array Int Int))) (let ((.cse17 (select v_DerPreprocessor_13 0))) (let ((.cse18 (select (select (store (store (store |c_#memory_$Pointer$#2.base| .cse17 v_DerPreprocessor_11) v_DerPreprocessor_10 v_DerPreprocessor_12) .cse0 v_DerPreprocessor_13) .cse17) 4))) (and (= (select |v_old(#valid)_AFTER_CALL_12| .cse17) 1) (= (store (select (store (store (store (store |c_#memory_$Pointer$#2.base| v_DerPreprocessor_10 v_DerPreprocessor_12) .cse0 v_DerPreprocessor_13) .cse17 v_ArrVal_1283) .cse18 v_ArrVal_1281) .cse0) 4 .cse3) .cse4) (= (select |v_old(#valid)_AFTER_CALL_13| .cse17) 0) (= (select |v_old(#valid)_AFTER_CALL_13| .cse18) 1) (= .cse18 v_DerPreprocessor_10) (= (let ((.cse19 (@diff |v_old(#valid)_AFTER_CALL_13| |v_old(#valid)_AFTER_CALL_12|))) (store |v_old(#valid)_AFTER_CALL_13| .cse19 (select |v_old(#valid)_AFTER_CALL_12| .cse19))) |v_old(#valid)_AFTER_CALL_12|) (= (select (select |c_#memory_int#2| .cse17) 8) 1) (= (select |v_old(#valid)_AFTER_CALL_12| .cse0) 0))))))) (or (exists ((|v_old(#valid)_AFTER_CALL_11| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_12| (Array Int Int)) (|v_#valid_BEFORE_CALL_11| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_13| (Array Int Int)) (v_DerPreprocessor_11 (Array Int Int)) (v_DerPreprocessor_10 Int) (v_DerPreprocessor_12 (Array Int Int)) (v_arrayElimCell_86 Int) (v_ArrVal_1283 (Array Int Int)) (v_DerPreprocessor_13 (Array Int Int)) (v_ArrVal_1281 (Array Int Int))) (let ((.cse1 (select v_DerPreprocessor_13 0))) (let ((.cse2 (select (select (store (store (store |c_#memory_$Pointer$#2.base| .cse1 v_DerPreprocessor_11) v_DerPreprocessor_10 v_DerPreprocessor_12) .cse0 v_DerPreprocessor_13) .cse1) 4))) (and (= (select |v_old(#valid)_AFTER_CALL_12| .cse1) 1) (= (store (select (store (store (store (store |c_#memory_$Pointer$#2.base| v_DerPreprocessor_10 v_DerPreprocessor_12) .cse0 v_DerPreprocessor_13) .cse1 v_ArrVal_1283) .cse2 v_ArrVal_1281) .cse0) 4 .cse3) .cse4) (= (select |v_old(#valid)_AFTER_CALL_13| .cse1) 0) (= (select |v_old(#valid)_AFTER_CALL_11| .cse1) 0) (= (select |v_old(#valid)_AFTER_CALL_13| .cse2) 1) (= (select |v_#valid_BEFORE_CALL_11| .cse1) 1) (= .cse2 v_DerPreprocessor_10) (= |v_#valid_BEFORE_CALL_11| (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_11| |v_#valid_BEFORE_CALL_11|))) (store |v_old(#valid)_AFTER_CALL_11| .cse5 (select |v_#valid_BEFORE_CALL_11| .cse5)))) (= (select |v_old(#valid)_AFTER_CALL_11| v_arrayElimCell_86) 1) (= (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_13| |v_old(#valid)_AFTER_CALL_12|))) (store |v_old(#valid)_AFTER_CALL_13| .cse6 (select |v_old(#valid)_AFTER_CALL_12| .cse6))) |v_old(#valid)_AFTER_CALL_12|) (= (select (select |c_#memory_int#2| .cse1) 8) 1) (= (select |v_old(#valid)_AFTER_CALL_12| .cse0) 0))))) (exists ((|v_old(#valid)_AFTER_CALL_11| (Array Int Int)) (v_arrayElimCell_86 Int)) (and (= (select |v_old(#valid)_AFTER_CALL_11| v_arrayElimCell_86) 1) (exists ((|v_#valid_BEFORE_CALL_11| (Array Int Int))) (and (= |v_#valid_BEFORE_CALL_11| (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_11| |v_#valid_BEFORE_CALL_11|))) (store |v_old(#valid)_AFTER_CALL_11| .cse7 (select |v_#valid_BEFORE_CALL_11| .cse7)))) (exists ((|v_ULTIMATE.start_dll_circular_prepend_~head#1.base_BEFORE_CALL_5| Int) (|v_ULTIMATE.start_dll_circular_prepend_~head#1.offset_BEFORE_CALL_5| Int)) (let ((.cse8 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_circular_prepend_~head#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_dll_circular_prepend_~head#1.offset_BEFORE_CALL_5|))) (and (= 1 (select |v_#valid_BEFORE_CALL_11| .cse8)) (= (select |v_old(#valid)_AFTER_CALL_11| .cse8) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_circular_prepend_~head#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_dll_circular_prepend_~head#1.offset_BEFORE_CALL_5|) 0) (exists ((|v_old(#valid)_AFTER_CALL_12| (Array Int Int))) (and (exists ((|v_old(#valid)_AFTER_CALL_13| (Array Int Int))) (and (exists ((v_DerPreprocessor_11 (Array Int Int)) (v_DerPreprocessor_10 Int) (v_DerPreprocessor_12 (Array Int Int)) (v_ArrVal_1283 (Array Int Int)) (v_DerPreprocessor_13 (Array Int Int)) (v_ArrVal_1281 (Array Int Int))) (let ((.cse9 (select v_DerPreprocessor_13 0))) (let ((.cse10 (select (select (store (store (store |c_#memory_$Pointer$#2.base| .cse9 v_DerPreprocessor_11) v_DerPreprocessor_10 v_DerPreprocessor_12) .cse0 v_DerPreprocessor_13) .cse9) 4))) (and (= (select |v_old(#valid)_AFTER_CALL_12| .cse9) 1) (= (store (select (store (store (store (store |c_#memory_$Pointer$#2.base| v_DerPreprocessor_10 v_DerPreprocessor_12) .cse0 v_DerPreprocessor_13) .cse9 v_ArrVal_1283) .cse10 v_ArrVal_1281) .cse0) 4 .cse3) .cse4) (= (select |v_old(#valid)_AFTER_CALL_13| .cse9) 0) (= (select |v_old(#valid)_AFTER_CALL_13| .cse10) 1) (= .cse10 v_DerPreprocessor_10) (= .cse8 .cse9) (= (select (select |c_#memory_int#2| .cse9) 8) 1))))) (= (let ((.cse11 (@diff |v_old(#valid)_AFTER_CALL_13| |v_old(#valid)_AFTER_CALL_12|))) (store |v_old(#valid)_AFTER_CALL_13| .cse11 (select |v_old(#valid)_AFTER_CALL_12| .cse11))) |v_old(#valid)_AFTER_CALL_12|))) (= (select |v_old(#valid)_AFTER_CALL_12| .cse0) 0)))))))))) (and (exists ((|v_ULTIMATE.start_dll_circular_prepend_~head#1.base_BEFORE_CALL_5| Int) (|v_old(#valid)_AFTER_CALL_11| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_prepend_~head#1.offset_BEFORE_CALL_5| Int) (|v_#valid_BEFORE_CALL_11| (Array Int Int)) (v_arrayElimCell_86 Int)) (let ((.cse13 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_circular_prepend_~head#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_dll_circular_prepend_~head#1.offset_BEFORE_CALL_5|))) (and (= |v_#valid_BEFORE_CALL_11| (let ((.cse12 (@diff |v_old(#valid)_AFTER_CALL_11| |v_#valid_BEFORE_CALL_11|))) (store |v_old(#valid)_AFTER_CALL_11| .cse12 (select |v_#valid_BEFORE_CALL_11| .cse12)))) (= (select |v_old(#valid)_AFTER_CALL_11| v_arrayElimCell_86) 1) (= 1 (select |v_#valid_BEFORE_CALL_11| .cse13)) (= (select |v_old(#valid)_AFTER_CALL_11| .cse13) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_circular_prepend_~head#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_dll_circular_prepend_~head#1.offset_BEFORE_CALL_5|) 0) (not (= |v_ULTIMATE.start_dll_circular_prepend_~head#1.base_BEFORE_CALL_5| |c_ULTIMATE.start_main_~#s~0#1.base|))))) .cse14) (and (exists ((|v_ULTIMATE.start_dll_circular_prepend_~head#1.base_BEFORE_CALL_5| Int) (|v_old(#valid)_AFTER_CALL_11| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_prepend_~head#1.offset_BEFORE_CALL_5| Int) (|v_#valid_BEFORE_CALL_11| (Array Int Int)) (v_arrayElimCell_86 Int)) (let ((.cse16 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_circular_prepend_~head#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_dll_circular_prepend_~head#1.offset_BEFORE_CALL_5|))) (and (= |v_#valid_BEFORE_CALL_11| (let ((.cse15 (@diff |v_old(#valid)_AFTER_CALL_11| |v_#valid_BEFORE_CALL_11|))) (store |v_old(#valid)_AFTER_CALL_11| .cse15 (select |v_#valid_BEFORE_CALL_11| .cse15)))) (= (select |v_old(#valid)_AFTER_CALL_11| v_arrayElimCell_86) 1) (= 1 (select |v_#valid_BEFORE_CALL_11| .cse16)) (= (select |v_old(#valid)_AFTER_CALL_11| .cse16) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_circular_prepend_~head#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_dll_circular_prepend_~head#1.offset_BEFORE_CALL_5|) 0) (not (= |c_ULTIMATE.start_main_~#s~0#1.offset| |v_ULTIMATE.start_dll_circular_prepend_~head#1.offset_BEFORE_CALL_5|))))) .cse14))))) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0))) is different from true [2024-11-06 22:28:42,810 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-06 22:28:42,810 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 834 treesize of output 742 [2024-11-06 22:28:43,027 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-06 22:28:43,027 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 667 treesize of output 723