./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/list-simple/sll2c_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/sll2c_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', 'f682d6a9f9df80cf11b356f08ea6be5ab5adaf1b414fc8a476877af8610cc552'] 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/sll2c_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 f682d6a9f9df80cf11b356f08ea6be5ab5adaf1b414fc8a476877af8610cc552 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-06 22:29:15,414 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-06 22:29:15,497 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:29:15,501 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-06 22:29:15,502 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-06 22:29:15,529 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-06 22:29:15,533 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-06 22:29:15,533 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-06 22:29:15,533 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-06 22:29:15,534 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-06 22:29:15,534 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-06 22:29:15,535 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-06 22:29:15,535 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-06 22:29:15,535 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-06 22:29:15,535 INFO L153 SettingsManager]: * Use SBE=true [2024-11-06 22:29:15,535 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-06 22:29:15,535 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-06 22:29:15,535 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-06 22:29:15,536 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-06 22:29:15,536 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-06 22:29:15,536 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-06 22:29:15,536 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-06 22:29:15,536 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-06 22:29:15,536 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-06 22:29:15,536 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-06 22:29:15,536 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-06 22:29:15,536 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-06 22:29:15,536 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-06 22:29:15,536 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-06 22:29:15,536 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-06 22:29:15,536 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-06 22:29:15,536 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-06 22:29:15,536 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-06 22:29:15,536 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-06 22:29:15,537 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-06 22:29:15,537 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-06 22:29:15,537 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-06 22:29:15,537 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-06 22:29:15,537 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-06 22:29:15,537 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-06 22:29:15,537 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-06 22:29:15,537 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-06 22:29:15,537 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 -> f682d6a9f9df80cf11b356f08ea6be5ab5adaf1b414fc8a476877af8610cc552 [2024-11-06 22:29:15,823 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-06 22:29:15,832 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-06 22:29:15,835 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-06 22:29:15,836 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-06 22:29:15,836 INFO L274 PluginConnector]: CDTParser initialized [2024-11-06 22:29:15,838 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/sll2c_prepend_equal.i [2024-11-06 22:29:17,172 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-06 22:29:17,482 INFO L384 CDTParser]: Found 1 translation units. [2024-11-06 22:29:17,484 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/list-simple/sll2c_prepend_equal.i [2024-11-06 22:29:17,502 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8a8678937/e5cffe732a7845859d55df6e8ca42b8b/FLAG31029af81 [2024-11-06 22:29:17,523 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8a8678937/e5cffe732a7845859d55df6e8ca42b8b [2024-11-06 22:29:17,526 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-06 22:29:17,528 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-06 22:29:17,530 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-06 22:29:17,530 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-06 22:29:17,534 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-06 22:29:17,535 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:29:17" (1/1) ... [2024-11-06 22:29:17,536 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@45dd6f0e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:29:17, skipping insertion in model container [2024-11-06 22:29:17,536 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:29:17" (1/1) ... [2024-11-06 22:29:17,571 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-06 22:29:17,827 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/sll2c_prepend_equal.i[24458,24471] [2024-11-06 22:29:17,831 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-06 22:29:17,839 INFO L200 MainTranslator]: Completed pre-run [2024-11-06 22:29:17,891 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/sll2c_prepend_equal.i[24458,24471] [2024-11-06 22:29:17,892 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-06 22:29:17,924 INFO L204 MainTranslator]: Completed translation [2024-11-06 22:29:17,926 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:29:17 WrapperNode [2024-11-06 22:29:17,927 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-06 22:29:17,928 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-06 22:29:17,928 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-06 22:29:17,929 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-06 22:29:17,934 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:29:17" (1/1) ... [2024-11-06 22:29:17,948 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:29:17" (1/1) ... [2024-11-06 22:29:17,973 INFO L138 Inliner]: procedures = 127, calls = 43, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 140 [2024-11-06 22:29:17,974 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-06 22:29:17,974 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-06 22:29:17,974 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-06 22:29:17,975 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-06 22:29:17,982 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:29:17" (1/1) ... [2024-11-06 22:29:17,983 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:29:17" (1/1) ... [2024-11-06 22:29:17,987 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:29:17" (1/1) ... [2024-11-06 22:29:18,018 INFO L175 MemorySlicer]: Split 25 memory accesses to 3 slices as follows [2, 13, 10]. 52 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 0, 1]. The 9 writes are split as follows [0, 7, 2]. [2024-11-06 22:29:18,019 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:29:17" (1/1) ... [2024-11-06 22:29:18,020 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:29:17" (1/1) ... [2024-11-06 22:29:18,032 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:29:17" (1/1) ... [2024-11-06 22:29:18,038 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:29:17" (1/1) ... [2024-11-06 22:29:18,040 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:29:17" (1/1) ... [2024-11-06 22:29:18,041 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:29:17" (1/1) ... [2024-11-06 22:29:18,044 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-06 22:29:18,048 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-06 22:29:18,051 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-06 22:29:18,051 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-06 22:29:18,052 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:29:17" (1/1) ... [2024-11-06 22:29:18,061 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-06 22:29:18,075 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 22:29:18,089 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:29:18,093 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:29:18,116 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-06 22:29:18,116 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-06 22:29:18,116 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-06 22:29:18,117 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-06 22:29:18,117 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-06 22:29:18,117 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-06 22:29:18,117 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2024-11-06 22:29:18,117 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2024-11-06 22:29:18,117 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-06 22:29:18,117 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-06 22:29:18,118 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-06 22:29:18,118 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-06 22:29:18,118 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-06 22:29:18,118 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-06 22:29:18,118 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-06 22:29:18,118 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-06 22:29:18,118 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-06 22:29:18,118 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-06 22:29:18,119 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-06 22:29:18,119 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-06 22:29:18,119 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-11-06 22:29:18,119 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-06 22:29:18,119 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-06 22:29:18,119 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-06 22:29:18,119 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-06 22:29:18,120 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-06 22:29:18,256 INFO L238 CfgBuilder]: Building ICFG [2024-11-06 22:29:18,258 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-06 22:29:18,493 INFO L? ?]: Removed 47 outVars from TransFormulas that were not future-live. [2024-11-06 22:29:18,493 INFO L287 CfgBuilder]: Performing block encoding [2024-11-06 22:29:18,503 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-06 22:29:18,504 INFO L316 CfgBuilder]: Removed 4 assume(true) statements. [2024-11-06 22:29:18,504 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:29:18 BoogieIcfgContainer [2024-11-06 22:29:18,504 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-06 22:29:18,507 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-06 22:29:18,507 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-06 22:29:18,511 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-06 22:29:18,512 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 10:29:17" (1/3) ... [2024-11-06 22:29:18,512 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e0f9506 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:29:18, skipping insertion in model container [2024-11-06 22:29:18,512 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:29:17" (2/3) ... [2024-11-06 22:29:18,512 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e0f9506 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:29:18, skipping insertion in model container [2024-11-06 22:29:18,513 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:29:18" (3/3) ... [2024-11-06 22:29:18,514 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2c_prepend_equal.i [2024-11-06 22:29:18,526 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-06 22:29:18,527 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-06 22:29:18,576 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-06 22:29:18,587 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;@126781ba, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-06 22:29:18,587 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-06 22:29:18,593 INFO L276 IsEmpty]: Start isEmpty. Operand has 36 states, 30 states have (on average 1.4666666666666666) internal successors, (44), 31 states have internal predecessors, (44), 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:29:18,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-06 22:29:18,619 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 22:29:18,619 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:29:18,620 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 22:29:18,624 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 22:29:18,626 INFO L85 PathProgramCache]: Analyzing trace with hash -483023916, now seen corresponding path program 1 times [2024-11-06 22:29:18,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 22:29:18,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [301244209] [2024-11-06 22:29:18,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 22:29:18,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 22:29:18,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:29:18,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-06 22:29:18,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:29:18,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-06 22:29:18,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:29:18,926 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:29:18,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 22:29:18,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [301244209] [2024-11-06 22:29:18,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [301244209] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 22:29:18,927 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 22:29:18,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 22:29:18,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [660303006] [2024-11-06 22:29:18,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 22:29:18,932 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 22:29:18,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 22:29:18,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 22:29:18,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 22:29:18,951 INFO L87 Difference]: Start difference. First operand has 36 states, 30 states have (on average 1.4666666666666666) internal successors, (44), 31 states have internal predecessors, (44), 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:29:19,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 22:29:19,005 INFO L93 Difference]: Finished difference Result 65 states and 89 transitions. [2024-11-06 22:29:19,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 22:29:19,007 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:29:19,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 22:29:19,012 INFO L225 Difference]: With dead ends: 65 [2024-11-06 22:29:19,012 INFO L226 Difference]: Without dead ends: 28 [2024-11-06 22:29:19,015 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:29:19,017 INFO L432 NwaCegarLoop]: 44 mSDtfsCounter, 0 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-06 22:29:19,017 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 70 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-06 22:29:19,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2024-11-06 22:29:19,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2024-11-06 22:29:19,041 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:29:19,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 34 transitions. [2024-11-06 22:29:19,047 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 34 transitions. Word has length 24 [2024-11-06 22:29:19,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 22:29:19,047 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 34 transitions. [2024-11-06 22:29:19,048 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:29:19,048 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 34 transitions. [2024-11-06 22:29:19,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-06 22:29:19,049 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 22:29:19,049 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:29:19,049 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-06 22:29:19,049 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 22:29:19,050 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 22:29:19,050 INFO L85 PathProgramCache]: Analyzing trace with hash -938400178, now seen corresponding path program 1 times [2024-11-06 22:29:19,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 22:29:19,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677664069] [2024-11-06 22:29:19,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 22:29:19,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 22:29:19,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:29:19,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-06 22:29:19,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:29:19,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-06 22:29:19,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:29:19,314 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:29:19,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 22:29:19,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [677664069] [2024-11-06 22:29:19,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [677664069] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 22:29:19,315 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 22:29:19,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-06 22:29:19,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [97832098] [2024-11-06 22:29:19,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 22:29:19,319 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-06 22:29:19,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 22:29:19,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-06 22:29:19,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-06 22:29:19,320 INFO L87 Difference]: Start difference. First operand 28 states and 34 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:29:19,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 22:29:19,402 INFO L93 Difference]: Finished difference Result 52 states and 63 transitions. [2024-11-06 22:29:19,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-06 22:29:19,403 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:29:19,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 22:29:19,404 INFO L225 Difference]: With dead ends: 52 [2024-11-06 22:29:19,404 INFO L226 Difference]: Without dead ends: 31 [2024-11-06 22:29:19,404 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:29:19,405 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 1 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 75 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:29:19,405 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 75 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-06 22:29:19,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2024-11-06 22:29:19,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 29. [2024-11-06 22:29:19,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 states have internal predecessors, (29), 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:29:19,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 35 transitions. [2024-11-06 22:29:19,414 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 35 transitions. Word has length 24 [2024-11-06 22:29:19,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 22:29:19,415 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 35 transitions. [2024-11-06 22:29:19,415 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:29:19,415 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 35 transitions. [2024-11-06 22:29:19,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-06 22:29:19,415 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 22:29:19,416 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] [2024-11-06 22:29:19,416 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-06 22:29:19,416 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 22:29:19,416 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 22:29:19,416 INFO L85 PathProgramCache]: Analyzing trace with hash 436872902, now seen corresponding path program 1 times [2024-11-06 22:29:19,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 22:29:19,416 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1260783489] [2024-11-06 22:29:19,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 22:29:19,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 22:29:19,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:29:19,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-06 22:29:19,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:29:19,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-06 22:29:19,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:29:19,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-06 22:29:19,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:29:19,955 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:29:19,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 22:29:19,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1260783489] [2024-11-06 22:29:19,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1260783489] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-06 22:29:19,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1995486240] [2024-11-06 22:29:19,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 22:29:19,959 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 22:29:19,959 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 22:29:19,966 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:29:19,968 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:29:20,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:29:20,160 INFO L255 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-06 22:29:20,168 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 22:29:20,324 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:29:20,342 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:29:20,342 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-06 22:29:20,411 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:29:20,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1995486240] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-06 22:29:20,411 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-06 22:29:20,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 9] total 13 [2024-11-06 22:29:20,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1935485997] [2024-11-06 22:29:20,412 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-06 22:29:20,412 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-06 22:29:20,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 22:29:20,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-06 22:29:20,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2024-11-06 22:29:20,413 INFO L87 Difference]: Start difference. First operand 29 states and 35 transitions. Second operand has 13 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 11 states have internal predecessors, (31), 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:29:24,429 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:29:28,461 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:29:32,477 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:29:36,490 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:29:40,629 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:29:44,672 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:29:44,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 22:29:44,677 INFO L93 Difference]: Finished difference Result 44 states and 51 transitions. [2024-11-06 22:29:44,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-06 22:29:44,678 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 11 states have internal predecessors, (31), 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 32 [2024-11-06 22:29:44,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 22:29:44,679 INFO L225 Difference]: With dead ends: 44 [2024-11-06 22:29:44,679 INFO L226 Difference]: Without dead ends: 36 [2024-11-06 22:29:44,679 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 64 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=50, Invalid=256, Unknown=0, NotChecked=0, Total=306 [2024-11-06 22:29:44,680 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 11 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 0 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 24.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 232 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 24.2s IncrementalHoareTripleChecker+Time [2024-11-06 22:29:44,680 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 232 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 160 Invalid, 6 Unknown, 0 Unchecked, 24.2s Time] [2024-11-06 22:29:44,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2024-11-06 22:29:44,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 34. [2024-11-06 22:29:44,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 28 states have (on average 1.1428571428571428) internal successors, (32), 28 states have internal predecessors, (32), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-06 22:29:44,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions. [2024-11-06 22:29:44,686 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 38 transitions. Word has length 32 [2024-11-06 22:29:44,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 22:29:44,688 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 38 transitions. [2024-11-06 22:29:44,688 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 11 states have internal predecessors, (31), 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:29:44,688 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2024-11-06 22:29:44,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-06 22:29:44,690 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 22:29:44,690 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] [2024-11-06 22:29:44,709 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:29:44,894 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:29:44,895 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 22:29:44,895 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 22:29:44,895 INFO L85 PathProgramCache]: Analyzing trace with hash -1205420011, now seen corresponding path program 1 times [2024-11-06 22:29:44,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 22:29:44,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564881695] [2024-11-06 22:29:44,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 22:29:44,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 22:29:44,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:29:46,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-06 22:29:46,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:29:46,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-06 22:29:46,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:29:46,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-06 22:29:46,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:29:46,348 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-06 22:29:46,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 22:29:46,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [564881695] [2024-11-06 22:29:46,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [564881695] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-06 22:29:46,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1634529345] [2024-11-06 22:29:46,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 22:29:46,349 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 22:29:46,349 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 22:29:46,352 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:29:46,353 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:29:46,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:29:46,539 INFO L255 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 69 conjuncts are in the unsatisfiable core [2024-11-06 22:29:46,544 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 22:29:46,585 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:29:46,768 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 3 [2024-11-06 22:29:46,839 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:29:46,909 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2024-11-06 22:29:46,909 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 15 [2024-11-06 22:29:47,157 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 15 treesize of output 1 [2024-11-06 22:29:47,164 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 52 [2024-11-06 22:29:47,174 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 34 treesize of output 21 [2024-11-06 22:29:47,177 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 28 treesize of output 8 [2024-11-06 22:29:47,224 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:29:47,228 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:29:47,310 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:29:47,310 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-06 22:29:47,419 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 86 treesize of output 82 [2024-11-06 22:29:47,484 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|)) (.cse4 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse1 (forall ((v_ArrVal_472 Int) (v_ArrVal_474 (Array Int Int)) (v_arrayElimCell_10 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse6 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_472)) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_474) .cse4) (+ 4 v_arrayElimCell_10))))) (.cse2 (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse0 (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse5 (+ |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| 4))) (and (or .cse0 .cse1) (or .cse2 .cse1) (forall ((v_ArrVal_472 Int) (v_ArrVal_474 (Array Int Int)) (v_arrayElimCell_10 Int)) (let ((.cse3 (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse6 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_472)) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_474))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse3 .cse4) (+ 4 v_arrayElimCell_10))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse3 (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse5))))) (or (not .cse2) (not .cse0) (forall ((v_ArrVal_472 Int) (v_ArrVal_474 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse6 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_472)) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_474) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) .cse5))))))) is different from false [2024-11-06 22:29:47,589 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|))) (let ((.cse4 (select |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|)) (.cse5 (select .cse1 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (.cse3 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse6 (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse2 (+ |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| 4)) (.cse8 (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse7 (forall ((v_ArrVal_472 Int) (v_ArrVal_474 (Array Int Int)) (v_arrayElimCell_10 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse4 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_472)) .cse5 v_ArrVal_474) .cse3) (+ 4 v_arrayElimCell_10)))))) (and (forall ((v_ArrVal_472 Int) (v_ArrVal_474 (Array Int Int)) (v_arrayElimCell_10 Int)) (let ((.cse0 (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse4 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_472)) .cse5 v_ArrVal_474))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse0 (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse1 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse2)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse0 .cse3) (+ 4 v_arrayElimCell_10)))))) (or .cse6 .cse7) (or (not .cse8) (not .cse6) (forall ((v_ArrVal_472 Int) (v_ArrVal_474 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse4 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_472)) .cse5 v_ArrVal_474) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) .cse2)))) (or .cse8 .cse7))))) is different from false [2024-11-06 22:29:47,639 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|))) (let ((.cse2 (select |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base|)) (.cse3 (select .cse6 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (.cse7 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse4 (+ |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.offset| 4)) (.cse0 (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse1 (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse8 (forall ((v_ArrVal_472 Int) (v_ArrVal_474 (Array Int Int)) (v_arrayElimCell_10 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| (store .cse2 |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.offset| v_ArrVal_472)) .cse3 v_ArrVal_474) .cse7) (+ 4 v_arrayElimCell_10)))))) (and (or (not .cse0) (not .cse1) (forall ((v_ArrVal_472 Int) (v_ArrVal_474 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| (store .cse2 |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.offset| v_ArrVal_472)) .cse3 v_ArrVal_474) |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base|) .cse4)))) (forall ((v_ArrVal_472 Int) (v_ArrVal_474 (Array Int Int)) (v_arrayElimCell_10 Int)) (let ((.cse5 (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| (store .cse2 |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.offset| v_ArrVal_472)) .cse3 v_ArrVal_474))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse5 (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse6 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse4)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse5 .cse7) (+ 4 v_arrayElimCell_10)))))) (or .cse0 .cse8) (or .cse1 .cse8))))) is different from false [2024-11-06 22:29:47,738 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-06 22:29:47,738 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 4 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 8 case distinctions, treesize of input 188 treesize of output 250 [2024-11-06 22:29:47,879 INFO L349 Elim1Store]: treesize reduction 300, result has 22.5 percent of original size [2024-11-06 22:29:47,880 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 9 case distinctions, treesize of input 227 treesize of output 291 [2024-11-06 22:29:47,904 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-06 22:29:47,904 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 169 treesize of output 170 [2024-11-06 22:29:47,982 INFO L349 Elim1Store]: treesize reduction 12, result has 78.9 percent of original size [2024-11-06 22:29:47,983 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 370 treesize of output 380 [2024-11-06 22:29:48,002 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 272 treesize of output 268 [2024-11-06 22:29:48,019 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 268 treesize of output 264 [2024-11-06 22:29:48,039 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 273 treesize of output 265 [2024-11-06 22:29:48,072 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 260 treesize of output 252 [2024-11-06 22:29:48,094 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-06 22:29:48,094 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 261 treesize of output 261 [2024-11-06 22:29:48,315 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 8 treesize of output 4 [2024-11-06 22:29:48,337 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 8 treesize of output 4 [2024-11-06 22:29:48,581 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 8 treesize of output 4 [2024-11-06 22:29:48,997 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-06 22:29:48,997 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 176 treesize of output 168 [2024-11-06 22:29:49,642 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-06 22:29:49,642 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 14 select indices, 14 select index equivalence classes, 0 disjoint index pairs (out of 91 index pairs), introduced 14 new quantified variables, introduced 91 case distinctions, treesize of input 305 treesize of output 965 [2024-11-06 22:29:58,273 INFO L349 Elim1Store]: treesize reduction 120, result has 0.8 percent of original size [2024-11-06 22:29:58,273 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 136 treesize of output 1 [2024-11-06 22:29:58,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1634529345] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-06 22:29:58,330 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-06 22:29:58,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 32 [2024-11-06 22:29:58,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416652770] [2024-11-06 22:29:58,331 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-06 22:29:58,331 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-11-06 22:29:58,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 22:29:58,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-11-06 22:29:58,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=1173, Unknown=3, NotChecked=210, Total=1482 [2024-11-06 22:29:58,333 INFO L87 Difference]: Start difference. First operand 34 states and 38 transitions. Second operand has 32 states, 30 states have (on average 1.7666666666666666) internal successors, (53), 26 states have internal predecessors, (53), 5 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2024-11-06 22:29:59,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 22:29:59,193 INFO L93 Difference]: Finished difference Result 72 states and 85 transitions. [2024-11-06 22:29:59,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-11-06 22:29:59,194 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 30 states have (on average 1.7666666666666666) internal successors, (53), 26 states have internal predecessors, (53), 5 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 35 [2024-11-06 22:29:59,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 22:29:59,195 INFO L225 Difference]: With dead ends: 72 [2024-11-06 22:29:59,195 INFO L226 Difference]: Without dead ends: 63 [2024-11-06 22:29:59,197 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 301 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=185, Invalid=2274, Unknown=3, NotChecked=294, Total=2756 [2024-11-06 22:29:59,197 INFO L432 NwaCegarLoop]: 24 mSDtfsCounter, 48 mSDsluCounter, 420 mSDsCounter, 0 mSdLazyCounter, 656 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 444 SdHoareTripleChecker+Invalid, 665 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 656 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-06 22:29:59,198 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 444 Invalid, 665 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 656 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-06 22:29:59,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2024-11-06 22:29:59,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 50. [2024-11-06 22:29:59,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 42 states have (on average 1.1428571428571428) internal successors, (48), 42 states have internal predecessors, (48), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-06 22:29:59,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 58 transitions. [2024-11-06 22:29:59,207 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 58 transitions. Word has length 35 [2024-11-06 22:29:59,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 22:29:59,207 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 58 transitions. [2024-11-06 22:29:59,207 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 30 states have (on average 1.7666666666666666) internal successors, (53), 26 states have internal predecessors, (53), 5 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2024-11-06 22:29:59,207 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 58 transitions. [2024-11-06 22:29:59,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-06 22:29:59,208 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 22:29:59,208 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] [2024-11-06 22:29:59,221 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:29:59,411 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:29:59,412 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 22:29:59,412 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 22:29:59,412 INFO L85 PathProgramCache]: Analyzing trace with hash 790772624, now seen corresponding path program 1 times [2024-11-06 22:29:59,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 22:29:59,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1146666224] [2024-11-06 22:29:59,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 22:29:59,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 22:29:59,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:30:00,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-06 22:30:00,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:30:01,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-06 22:30:01,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:30:01,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-06 22:30:01,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:30:01,322 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:30:01,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 22:30:01,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1146666224] [2024-11-06 22:30:01,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1146666224] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-06 22:30:01,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [945542965] [2024-11-06 22:30:01,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 22:30:01,323 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 22:30:01,324 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 22:30:01,326 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:30:01,327 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:30:01,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:30:01,491 INFO L255 TraceCheckSpWp]: Trace formula consists of 351 conjuncts, 115 conjuncts are in the unsatisfiable core [2024-11-06 22:30:01,499 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 22:30:01,644 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:30:01,724 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 15 treesize of output 1 [2024-11-06 22:30:01,798 INFO L349 Elim1Store]: treesize reduction 17, result has 39.3 percent of original size [2024-11-06 22:30:01,798 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 23 treesize of output 15 [2024-11-06 22:30:01,959 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-06 22:30:01,959 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 19 treesize of output 19 [2024-11-06 22:30:01,965 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 3 [2024-11-06 22:30:02,109 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:30:02,208 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2024-11-06 22:30:02,209 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 15 [2024-11-06 22:30:02,235 INFO L349 Elim1Store]: treesize reduction 25, result has 26.5 percent of original size [2024-11-06 22:30:02,235 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 2 case distinctions, treesize of input 27 treesize of output 29 [2024-11-06 22:30:02,523 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-06 22:30:02,523 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-06 22:30:02,524 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 7 [2024-11-06 22:30:02,612 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 7 treesize of output 3 [2024-11-06 22:30:02,747 INFO L349 Elim1Store]: treesize reduction 50, result has 48.5 percent of original size [2024-11-06 22:30:02,747 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 100 treesize of output 143 [2024-11-06 22:30:02,758 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 15 [2024-11-06 22:30:02,778 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-06 22:30:02,783 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 106 [2024-11-06 22:30:02,807 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-06 22:30:02,814 INFO L349 Elim1Store]: treesize reduction 23, result has 4.2 percent of original size [2024-11-06 22:30:02,814 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 64 treesize of output 23 [2024-11-06 22:30:02,840 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 43 treesize of output 14 [2024-11-06 22:30:02,864 INFO L349 Elim1Store]: treesize reduction 23, result has 4.2 percent of original size [2024-11-06 22:30:02,865 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 29 [2024-11-06 22:30:02,890 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-06 22:30:02,895 INFO L349 Elim1Store]: treesize reduction 31, result has 3.1 percent of original size [2024-11-06 22:30:02,895 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 64 treesize of output 32 [2024-11-06 22:30:02,925 INFO L349 Elim1Store]: treesize reduction 33, result has 31.3 percent of original size [2024-11-06 22:30:02,926 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:30:02,933 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 28 treesize of output 8 [2024-11-06 22:30:03,008 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:30:03,011 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 16 [2024-11-06 22:30:03,126 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 7 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-06 22:30:03,126 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-06 22:30:03,406 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 12 treesize of output 8 [2024-11-06 22:30:04,071 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-06 22:30:04,071 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 894 treesize of output 876 [2024-11-06 22:30:04,393 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2024-11-06 22:30:04,566 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-06 22:30:04,567 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 645 treesize of output 605 [2024-11-06 22:30:04,645 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-06 22:30:04,646 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-06 22:30:04,652 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-06 22:30:04,653 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-06 22:30:04,664 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 306 treesize of output 274 [2024-11-06 22:30:04,708 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-06 22:30:04,712 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 97 treesize of output 81 [2024-11-06 22:30:04,723 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-06 22:30:04,727 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 82 treesize of output 66 [2024-11-06 22:30:04,736 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-06 22:30:04,743 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-06 22:30:04,744 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-06 22:30:04,750 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-06 22:30:04,751 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-06 22:30:04,758 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-06 22:30:04,759 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-06 22:30:04,762 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 23 treesize of output 7 [2024-11-06 22:30:04,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [945542965] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-06 22:30:04,965 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-06 22:30:04,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 44 [2024-11-06 22:30:04,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581905873] [2024-11-06 22:30:04,965 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-06 22:30:04,966 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2024-11-06 22:30:04,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 22:30:04,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2024-11-06 22:30:04,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=2546, Unknown=52, NotChecked=0, Total=2756 [2024-11-06 22:30:04,968 INFO L87 Difference]: Start difference. First operand 50 states and 58 transitions. Second operand has 44 states, 41 states have (on average 1.3902439024390243) internal successors, (57), 36 states have internal predecessors, (57), 6 states have call successors, (6), 3 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:30:06,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 22:30:06,952 INFO L93 Difference]: Finished difference Result 81 states and 94 transitions. [2024-11-06 22:30:06,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2024-11-06 22:30:06,953 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 41 states have (on average 1.3902439024390243) internal successors, (57), 36 states have internal predecessors, (57), 6 states have call successors, (6), 3 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 37 [2024-11-06 22:30:06,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 22:30:06,954 INFO L225 Difference]: With dead ends: 81 [2024-11-06 22:30:06,954 INFO L226 Difference]: Without dead ends: 79 [2024-11-06 22:30:06,956 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 944 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=400, Invalid=5710, Unknown=52, NotChecked=0, Total=6162 [2024-11-06 22:30:06,956 INFO L432 NwaCegarLoop]: 16 mSDtfsCounter, 56 mSDsluCounter, 366 mSDsCounter, 0 mSdLazyCounter, 953 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 382 SdHoareTripleChecker+Invalid, 959 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 953 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-06 22:30:06,956 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 382 Invalid, 959 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 953 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-06 22:30:06,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2024-11-06 22:30:06,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 52. [2024-11-06 22:30:06,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 44 states have (on average 1.1590909090909092) internal successors, (51), 44 states have internal predecessors, (51), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-06 22:30:06,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 61 transitions. [2024-11-06 22:30:06,967 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 61 transitions. Word has length 37 [2024-11-06 22:30:06,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 22:30:06,967 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 61 transitions. [2024-11-06 22:30:06,967 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 41 states have (on average 1.3902439024390243) internal successors, (57), 36 states have internal predecessors, (57), 6 states have call successors, (6), 3 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:30:06,968 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 61 transitions. [2024-11-06 22:30:06,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-06 22:30:06,968 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 22:30:06,968 INFO L215 NwaCegarLoop]: trace histogram [3, 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] [2024-11-06 22:30:06,983 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:30:07,169 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:30:07,169 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 22:30:07,169 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 22:30:07,169 INFO L85 PathProgramCache]: Analyzing trace with hash -718486453, now seen corresponding path program 2 times [2024-11-06 22:30:07,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 22:30:07,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1495982776] [2024-11-06 22:30:07,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 22:30:07,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 22:30:07,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:30:08,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-06 22:30:08,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:30:08,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-06 22:30:08,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:30:08,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-06 22:30:08,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:30:08,668 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 8 proven. 11 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-06 22:30:08,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 22:30:08,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1495982776] [2024-11-06 22:30:08,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1495982776] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-06 22:30:08,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1619240852] [2024-11-06 22:30:08,669 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-06 22:30:08,669 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 22:30:08,669 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 22:30:08,672 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:30:08,674 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:30:08,847 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-06 22:30:08,848 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-06 22:30:08,855 INFO L255 TraceCheckSpWp]: Trace formula consists of 364 conjuncts, 113 conjuncts are in the unsatisfiable core [2024-11-06 22:30:08,860 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 22:30:08,867 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:30:08,987 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) 1) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) 0) (= |c_#valid| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|))) (store |v_#valid_BEFORE_CALL_6| .cse0 (select |c_#valid| .cse0)))) (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1))) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|)) is different from false [2024-11-06 22:30:08,989 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) 1) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) 0) (= |c_#valid| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|))) (store |v_#valid_BEFORE_CALL_6| .cse0 (select |c_#valid| .cse0)))) (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1))) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|)) is different from true [2024-11-06 22:30:09,006 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:30:09,012 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:30:09,017 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 0)) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 0) 0) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (and (= |c_#valid| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|))) (store |v_#valid_BEFORE_CALL_6| .cse0 (select |c_#valid| .cse0)))) (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1))) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 1) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0)) is different from false [2024-11-06 22:30:09,021 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 0)) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 0) 0) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (and (= |c_#valid| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|))) (store |v_#valid_BEFORE_CALL_6| .cse0 (select |c_#valid| .cse0)))) (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1))) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 1) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0)) is different from true [2024-11-06 22:30:09,067 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2024-11-06 22:30:09,068 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 34 [2024-11-06 22:30:09,089 INFO L349 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2024-11-06 22:30:09,089 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 27 treesize of output 22 [2024-11-06 22:30:09,096 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) 0))) (and (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_6| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) 0) (= |c_#valid| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|))) (store |v_#valid_BEFORE_CALL_6| .cse1 (select |c_#valid| .cse1)))))) (= |c_ULTIMATE.start_sll_circular_create_#res#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.offset| .cse0) 0) 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) 1) (= 0 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) 0)) (= |c_ULTIMATE.start_sll_circular_create_#res#1.base| (select (select |c_#memory_$Pointer$#1.base| .cse0) 0)))) is different from false [2024-11-06 22:30:09,099 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) 0))) (and (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_6| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) 0) (= |c_#valid| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|))) (store |v_#valid_BEFORE_CALL_6| .cse1 (select |c_#valid| .cse1)))))) (= |c_ULTIMATE.start_sll_circular_create_#res#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.offset| .cse0) 0) 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) 1) (= 0 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) 0)) (= |c_ULTIMATE.start_sll_circular_create_#res#1.base| (select (select |c_#memory_$Pointer$#1.base| .cse0) 0)))) is different from true [2024-11-06 22:30:09,123 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| .cse1) 0))) (and (= (select (select |c_#memory_$Pointer$#1.offset| .cse0) 0) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|) 0) (= (select (select |c_#memory_$Pointer$#1.base| .cse0) 0) .cse1) (= (select (select |c_#memory_$Pointer$#1.offset| .cse1) 0) 0) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_6| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_6| .cse0) 1) (= |c_#valid| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|))) (store |v_#valid_BEFORE_CALL_6| .cse2 (select |c_#valid| .cse2)))))) (= (select |c_#valid| .cse1) 1)))) is different from false [2024-11-06 22:30:09,125 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| .cse1) 0))) (and (= (select (select |c_#memory_$Pointer$#1.offset| .cse0) 0) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|) 0) (= (select (select |c_#memory_$Pointer$#1.base| .cse0) 0) .cse1) (= (select (select |c_#memory_$Pointer$#1.offset| .cse1) 0) 0) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_6| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_6| .cse0) 1) (= |c_#valid| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|))) (store |v_#valid_BEFORE_CALL_6| .cse2 (select |c_#valid| .cse2)))))) (= (select |c_#valid| .cse1) 1)))) is different from true [2024-11-06 22:30:09,141 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-06 22:30:09,142 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 23 [2024-11-06 22:30:09,148 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-06 22:30:09,148 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2024-11-06 22:30:09,167 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_#valid| |c_old(#valid)|) (= |c_#memory_$Pointer$#1.offset| |c_old(#memory_$Pointer$#1.offset)|) (= |c_#memory_$Pointer$#1.base| |c_old(#memory_$Pointer$#1.base)|) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (v_arrayElimIndex_2 Int) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_5| Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_5| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_5|))) (and (= (select |v_#valid_BEFORE_CALL_7| .cse0) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_5|) 0) (= (select |v_#valid_BEFORE_CALL_6| v_arrayElimIndex_2) 1) (= (select |v_#valid_BEFORE_CALL_6| .cse0) 0) (= |v_#valid_BEFORE_CALL_7| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse1 (select |v_#valid_BEFORE_CALL_7| .cse1)))))))) is different from false [2024-11-06 22:30:09,169 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_#valid| |c_old(#valid)|) (= |c_#memory_$Pointer$#1.offset| |c_old(#memory_$Pointer$#1.offset)|) (= |c_#memory_$Pointer$#1.base| |c_old(#memory_$Pointer$#1.base)|) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (v_arrayElimIndex_2 Int) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_5| Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_5| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_5|))) (and (= (select |v_#valid_BEFORE_CALL_7| .cse0) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_5|) 0) (= (select |v_#valid_BEFORE_CALL_6| v_arrayElimIndex_2) 1) (= (select |v_#valid_BEFORE_CALL_6| .cse0) 0) (= |v_#valid_BEFORE_CALL_7| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse1 (select |v_#valid_BEFORE_CALL_7| .cse1)))))))) is different from true [2024-11-06 22:30:09,191 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_#memory_$Pointer$#1.offset| |c_old(#memory_$Pointer$#1.offset)|) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (= |c_#memory_$Pointer$#1.base| |c_old(#memory_$Pointer$#1.base)|) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (v_arrayElimIndex_2 Int) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_5| Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_5| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_5|))) (and (= (select |v_#valid_BEFORE_CALL_7| .cse0) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_5|) 0) (= (select |v_#valid_BEFORE_CALL_6| v_arrayElimIndex_2) 1) (= (select |v_#valid_BEFORE_CALL_6| .cse0) 0) (= |v_#valid_BEFORE_CALL_7| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse1 (select |v_#valid_BEFORE_CALL_7| .cse1)))))))) is different from false [2024-11-06 22:30:09,193 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_#memory_$Pointer$#1.offset| |c_old(#memory_$Pointer$#1.offset)|) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (= |c_#memory_$Pointer$#1.base| |c_old(#memory_$Pointer$#1.base)|) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (v_arrayElimIndex_2 Int) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_5| Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_5| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_5|))) (and (= (select |v_#valid_BEFORE_CALL_7| .cse0) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_5|) 0) (= (select |v_#valid_BEFORE_CALL_6| v_arrayElimIndex_2) 1) (= (select |v_#valid_BEFORE_CALL_6| .cse0) 0) (= |v_#valid_BEFORE_CALL_7| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse1 (select |v_#valid_BEFORE_CALL_7| .cse1)))))))) is different from true [2024-11-06 22:30:09,238 WARN L851 $PredicateComparison]: unable to prove that (and (exists ((|v_node_create_~temp~0#1.base_31| Int)) (and (= |c_#memory_$Pointer$#1.base| (store |c_old(#memory_$Pointer$#1.base)| |v_node_create_~temp~0#1.base_31| (select |c_#memory_$Pointer$#1.base| |v_node_create_~temp~0#1.base_31|))) (= (select |c_old(#valid)| |v_node_create_~temp~0#1.base_31|) 0) (= |c_#memory_$Pointer$#1.offset| (store |c_old(#memory_$Pointer$#1.offset)| |v_node_create_~temp~0#1.base_31| (select |c_#memory_$Pointer$#1.offset| |v_node_create_~temp~0#1.base_31|))))) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (v_arrayElimIndex_2 Int) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_5| Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_5| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_5|))) (and (= (select |v_#valid_BEFORE_CALL_7| .cse0) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_5|) 0) (= (select |v_#valid_BEFORE_CALL_6| v_arrayElimIndex_2) 1) (= (select |v_#valid_BEFORE_CALL_6| .cse0) 0) (= |v_#valid_BEFORE_CALL_7| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse1 (select |v_#valid_BEFORE_CALL_7| .cse1)))))))) is different from false [2024-11-06 22:30:09,240 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((|v_node_create_~temp~0#1.base_31| Int)) (and (= |c_#memory_$Pointer$#1.base| (store |c_old(#memory_$Pointer$#1.base)| |v_node_create_~temp~0#1.base_31| (select |c_#memory_$Pointer$#1.base| |v_node_create_~temp~0#1.base_31|))) (= (select |c_old(#valid)| |v_node_create_~temp~0#1.base_31|) 0) (= |c_#memory_$Pointer$#1.offset| (store |c_old(#memory_$Pointer$#1.offset)| |v_node_create_~temp~0#1.base_31| (select |c_#memory_$Pointer$#1.offset| |v_node_create_~temp~0#1.base_31|))))) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (v_arrayElimIndex_2 Int) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_5| Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_5| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_5|))) (and (= (select |v_#valid_BEFORE_CALL_7| .cse0) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_5|) 0) (= (select |v_#valid_BEFORE_CALL_6| v_arrayElimIndex_2) 1) (= (select |v_#valid_BEFORE_CALL_6| .cse0) 0) (= |v_#valid_BEFORE_CALL_7| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse1 (select |v_#valid_BEFORE_CALL_7| .cse1)))))))) is different from true [2024-11-06 22:30:09,292 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-06 22:30:09,303 INFO L349 Elim1Store]: treesize reduction 29, result has 14.7 percent of original size [2024-11-06 22:30:09,303 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 56 treesize of output 45 [2024-11-06 22:30:09,310 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-06 22:30:09,311 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-06 22:30:09,312 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-06 22:30:09,313 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 33 [2024-11-06 22:30:09,344 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| .cse2) 0))) (and (= (select (select |c_#memory_$Pointer$#1.offset| .cse0) 0) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|) 0) (exists ((|v_old(#valid)_AFTER_CALL_12| (Array Int Int)) (|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_node_create_~temp~0#1.base_31| Int)) (and (= (select |v_#valid_BEFORE_CALL_9| .cse0) 1) (= |v_old(#valid)_AFTER_CALL_12| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_9| |v_old(#valid)_AFTER_CALL_12|))) (store |v_#valid_BEFORE_CALL_9| .cse1 (select |v_old(#valid)_AFTER_CALL_12| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_12| |v_node_create_~temp~0#1.base_31|) 0) (= (select |v_#valid_BEFORE_CALL_9| .cse2) 0) (= (select |v_old(#valid)_AFTER_CALL_12| .cse2) 1))) (= (select (select |c_#memory_$Pointer$#1.base| .cse0) 0) .cse2) (= (select (select |c_#memory_$Pointer$#1.offset| .cse2) 0) 0) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (v_arrayElimIndex_2 Int) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_5| Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_5| Int)) (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_5|))) (and (= (select |v_#valid_BEFORE_CALL_7| .cse3) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_5|) 0) (= (select |v_#valid_BEFORE_CALL_6| v_arrayElimIndex_2) 1) (= (select |v_#valid_BEFORE_CALL_6| .cse3) 0) (= |v_#valid_BEFORE_CALL_7| (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse4 (select |v_#valid_BEFORE_CALL_7| .cse4)))))))))) is different from false [2024-11-06 22:30:09,347 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| .cse2) 0))) (and (= (select (select |c_#memory_$Pointer$#1.offset| .cse0) 0) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|) 0) (exists ((|v_old(#valid)_AFTER_CALL_12| (Array Int Int)) (|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_node_create_~temp~0#1.base_31| Int)) (and (= (select |v_#valid_BEFORE_CALL_9| .cse0) 1) (= |v_old(#valid)_AFTER_CALL_12| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_9| |v_old(#valid)_AFTER_CALL_12|))) (store |v_#valid_BEFORE_CALL_9| .cse1 (select |v_old(#valid)_AFTER_CALL_12| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_12| |v_node_create_~temp~0#1.base_31|) 0) (= (select |v_#valid_BEFORE_CALL_9| .cse2) 0) (= (select |v_old(#valid)_AFTER_CALL_12| .cse2) 1))) (= (select (select |c_#memory_$Pointer$#1.base| .cse0) 0) .cse2) (= (select (select |c_#memory_$Pointer$#1.offset| .cse2) 0) 0) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (v_arrayElimIndex_2 Int) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_5| Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_5| Int)) (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_5|))) (and (= (select |v_#valid_BEFORE_CALL_7| .cse3) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_5|) 0) (= (select |v_#valid_BEFORE_CALL_6| v_arrayElimIndex_2) 1) (= (select |v_#valid_BEFORE_CALL_6| .cse3) 0) (= |v_#valid_BEFORE_CALL_7| (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse4 (select |v_#valid_BEFORE_CALL_7| .cse4)))))))))) is different from true [2024-11-06 22:30:09,455 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| .cse0) 0))) (and (= |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| .cse0) (= |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.offset| .cse1) 0) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|) 0) (exists ((|v_old(#valid)_AFTER_CALL_12| (Array Int Int)) (|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_node_create_~temp~0#1.base_31| Int)) (and (= (select |v_#valid_BEFORE_CALL_9| .cse1) 1) (= |v_old(#valid)_AFTER_CALL_12| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_9| |v_old(#valid)_AFTER_CALL_12|))) (store |v_#valid_BEFORE_CALL_9| .cse2 (select |v_old(#valid)_AFTER_CALL_12| .cse2)))) (= (select |v_old(#valid)_AFTER_CALL_12| |v_node_create_~temp~0#1.base_31|) 0) (= (select |v_#valid_BEFORE_CALL_9| .cse0) 0) (= (select |v_old(#valid)_AFTER_CALL_12| .cse0) 1))) (= (select (select |c_#memory_$Pointer$#1.base| .cse1) 0) .cse0) (= (select (select |c_#memory_$Pointer$#1.offset| .cse0) 0) 0) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (v_arrayElimIndex_2 Int) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_5| Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_5| Int)) (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_5|))) (and (= (select |v_#valid_BEFORE_CALL_7| .cse3) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_5|) 0) (= (select |v_#valid_BEFORE_CALL_6| v_arrayElimIndex_2) 1) (= (select |v_#valid_BEFORE_CALL_6| .cse3) 0) (= |v_#valid_BEFORE_CALL_7| (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse4 (select |v_#valid_BEFORE_CALL_7| .cse4)))))))))) is different from false [2024-11-06 22:30:09,458 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| .cse0) 0))) (and (= |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| .cse0) (= |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.offset| .cse1) 0) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|) 0) (exists ((|v_old(#valid)_AFTER_CALL_12| (Array Int Int)) (|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_node_create_~temp~0#1.base_31| Int)) (and (= (select |v_#valid_BEFORE_CALL_9| .cse1) 1) (= |v_old(#valid)_AFTER_CALL_12| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_9| |v_old(#valid)_AFTER_CALL_12|))) (store |v_#valid_BEFORE_CALL_9| .cse2 (select |v_old(#valid)_AFTER_CALL_12| .cse2)))) (= (select |v_old(#valid)_AFTER_CALL_12| |v_node_create_~temp~0#1.base_31|) 0) (= (select |v_#valid_BEFORE_CALL_9| .cse0) 0) (= (select |v_old(#valid)_AFTER_CALL_12| .cse0) 1))) (= (select (select |c_#memory_$Pointer$#1.base| .cse1) 0) .cse0) (= (select (select |c_#memory_$Pointer$#1.offset| .cse0) 0) 0) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (v_arrayElimIndex_2 Int) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_5| Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_5| Int)) (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_5|))) (and (= (select |v_#valid_BEFORE_CALL_7| .cse3) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_5|) 0) (= (select |v_#valid_BEFORE_CALL_6| v_arrayElimIndex_2) 1) (= (select |v_#valid_BEFORE_CALL_6| .cse3) 0) (= |v_#valid_BEFORE_CALL_7| (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse4 (select |v_#valid_BEFORE_CALL_7| .cse4)))))))))) is different from true [2024-11-06 22:30:09,570 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| .cse2) 0))) (and (= .cse0 |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) (= |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.offset| .cse0) 0) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|) 0) (exists ((|v_old(#valid)_AFTER_CALL_12| (Array Int Int)) (|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_node_create_~temp~0#1.base_31| Int)) (and (= (select |v_#valid_BEFORE_CALL_9| .cse0) 1) (= |v_old(#valid)_AFTER_CALL_12| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_9| |v_old(#valid)_AFTER_CALL_12|))) (store |v_#valid_BEFORE_CALL_9| .cse1 (select |v_old(#valid)_AFTER_CALL_12| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_12| |v_node_create_~temp~0#1.base_31|) 0) (= (select |v_#valid_BEFORE_CALL_9| .cse2) 0) (= (select |v_old(#valid)_AFTER_CALL_12| .cse2) 1))) (= (select (select |c_#memory_$Pointer$#1.base| .cse0) 0) .cse2) (= (select (select |c_#memory_$Pointer$#1.offset| .cse2) 0) 0) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (v_arrayElimIndex_2 Int) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_5| Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_5| Int)) (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_5|))) (and (= (select |v_#valid_BEFORE_CALL_7| .cse3) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_5|) 0) (= (select |v_#valid_BEFORE_CALL_6| v_arrayElimIndex_2) 1) (= (select |v_#valid_BEFORE_CALL_6| .cse3) 0) (= |v_#valid_BEFORE_CALL_7| (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse4 (select |v_#valid_BEFORE_CALL_7| .cse4)))))))))) is different from false [2024-11-06 22:30:09,572 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| .cse2) 0))) (and (= .cse0 |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) (= |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.offset| .cse0) 0) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|) 0) (exists ((|v_old(#valid)_AFTER_CALL_12| (Array Int Int)) (|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_node_create_~temp~0#1.base_31| Int)) (and (= (select |v_#valid_BEFORE_CALL_9| .cse0) 1) (= |v_old(#valid)_AFTER_CALL_12| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_9| |v_old(#valid)_AFTER_CALL_12|))) (store |v_#valid_BEFORE_CALL_9| .cse1 (select |v_old(#valid)_AFTER_CALL_12| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_12| |v_node_create_~temp~0#1.base_31|) 0) (= (select |v_#valid_BEFORE_CALL_9| .cse2) 0) (= (select |v_old(#valid)_AFTER_CALL_12| .cse2) 1))) (= (select (select |c_#memory_$Pointer$#1.base| .cse0) 0) .cse2) (= (select (select |c_#memory_$Pointer$#1.offset| .cse2) 0) 0) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (v_arrayElimIndex_2 Int) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_5| Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_5| Int)) (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_5|))) (and (= (select |v_#valid_BEFORE_CALL_7| .cse3) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_5|) 0) (= (select |v_#valid_BEFORE_CALL_6| v_arrayElimIndex_2) 1) (= (select |v_#valid_BEFORE_CALL_6| .cse3) 0) (= |v_#valid_BEFORE_CALL_7| (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse4 (select |v_#valid_BEFORE_CALL_7| .cse4)))))))))) is different from true [2024-11-06 22:30:09,598 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-06 22:30:09,598 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 113 treesize of output 81 [2024-11-06 22:30:09,608 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-06 22:30:09,608 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 15 treesize of output 7 [2024-11-06 22:30:09,627 INFO L349 Elim1Store]: treesize reduction 22, result has 12.0 percent of original size [2024-11-06 22:30:09,627 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 28 [2024-11-06 22:30:09,647 WARN L851 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) 0) 0) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_12| (Array Int Int)) (|v_node_create_~temp~0#1.base_31| Int)) (and (= (select |v_old(#valid)_AFTER_CALL_12| |c_ULTIMATE.start_sll_circular_prepend_#t~mem13#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_9| |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_9| |c_ULTIMATE.start_sll_circular_prepend_#t~mem13#1.base|) 0) (= |v_old(#valid)_AFTER_CALL_12| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_9| |v_old(#valid)_AFTER_CALL_12|))) (store |v_#valid_BEFORE_CALL_9| .cse0 (select |v_old(#valid)_AFTER_CALL_12| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_12| |v_node_create_~temp~0#1.base_31|) 0))) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_prepend_#t~mem13#1.base|) 0) 0) (= |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_prepend_#t~mem13#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_prepend_#t~mem12#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_prepend_#t~mem12#1.base| |c_ULTIMATE.start_sll_circular_prepend_#t~mem13#1.base|)) is different from false [2024-11-06 22:30:09,648 WARN L873 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) 0) 0) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_12| (Array Int Int)) (|v_node_create_~temp~0#1.base_31| Int)) (and (= (select |v_old(#valid)_AFTER_CALL_12| |c_ULTIMATE.start_sll_circular_prepend_#t~mem13#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_9| |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_9| |c_ULTIMATE.start_sll_circular_prepend_#t~mem13#1.base|) 0) (= |v_old(#valid)_AFTER_CALL_12| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_9| |v_old(#valid)_AFTER_CALL_12|))) (store |v_#valid_BEFORE_CALL_9| .cse0 (select |v_old(#valid)_AFTER_CALL_12| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_12| |v_node_create_~temp~0#1.base_31|) 0))) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_prepend_#t~mem13#1.base|) 0) 0) (= |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_prepend_#t~mem13#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_prepend_#t~mem12#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_prepend_#t~mem12#1.base| |c_ULTIMATE.start_sll_circular_prepend_#t~mem13#1.base|)) is different from true [2024-11-06 22:30:09,650 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 12 not checked. [2024-11-06 22:30:09,650 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-06 22:30:09,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1619240852] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-06 22:30:09,844 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-06 22:30:09,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 32 [2024-11-06 22:30:09,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071062352] [2024-11-06 22:30:09,845 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-06 22:30:09,845 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-11-06 22:30:09,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 22:30:09,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-11-06 22:30:09,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=587, Unknown=22, NotChecked=638, Total=1332 [2024-11-06 22:30:09,846 INFO L87 Difference]: Start difference. First operand 52 states and 61 transitions. Second operand has 32 states, 30 states have (on average 1.6333333333333333) internal successors, (49), 26 states have internal predecessors, (49), 4 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2024-11-06 22:30:10,057 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) 1) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1) (not (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|)) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) 0) (= |c_#valid| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|))) (store |v_#valid_BEFORE_CALL_6| .cse0 (select |c_#valid| .cse0)))) (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1))) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|)) is different from false [2024-11-06 22:30:10,059 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) 1) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1) (not (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|)) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) 0) (= |c_#valid| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|))) (store |v_#valid_BEFORE_CALL_6| .cse0 (select |c_#valid| .cse0)))) (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1))) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|)) is different from true [2024-11-06 22:30:10,063 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 0)) (not (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|)) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 0) 0) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (and (= |c_#valid| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|))) (store |v_#valid_BEFORE_CALL_6| .cse0 (select |c_#valid| .cse0)))) (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1))) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 1) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0)) is different from false [2024-11-06 22:30:10,065 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 0)) (not (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|)) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 0) 0) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (and (= |c_#valid| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|))) (store |v_#valid_BEFORE_CALL_6| .cse0 (select |c_#valid| .cse0)))) (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1))) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 1) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0)) is different from true [2024-11-06 22:30:10,069 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) 0))) (and (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_6| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) 0) (= |c_#valid| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|))) (store |v_#valid_BEFORE_CALL_6| .cse1 (select |c_#valid| .cse1)))))) (= |c_ULTIMATE.start_sll_circular_create_#res#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.offset| .cse0) 0) 0) (= (select |c_#valid| .cse0) 1) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) 1) (= 0 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) 0)) (= |c_ULTIMATE.start_sll_circular_create_#res#1.base| (select (select |c_#memory_$Pointer$#1.base| .cse0) 0)))) is different from false [2024-11-06 22:30:10,071 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) 0))) (and (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_6| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) 0) (= |c_#valid| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|))) (store |v_#valid_BEFORE_CALL_6| .cse1 (select |c_#valid| .cse1)))))) (= |c_ULTIMATE.start_sll_circular_create_#res#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.offset| .cse0) 0) 0) (= (select |c_#valid| .cse0) 1) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) 1) (= 0 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) 0)) (= |c_ULTIMATE.start_sll_circular_create_#res#1.base| (select (select |c_#memory_$Pointer$#1.base| .cse0) 0)))) is different from true [2024-11-06 22:30:10,076 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|))) (let ((.cse0 (select |c_#memory_$Pointer$#1.base| .cse3))) (let ((.cse2 (select .cse0 0))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| .cse2) 0))) (and (= (select |c_#valid| (select .cse0 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) 1) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= .cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (= (select (select |c_#memory_$Pointer$#1.offset| .cse2) 0) 0) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|) 0) (= .cse1 .cse3) (= (select (select |c_#memory_$Pointer$#1.offset| .cse3) 0) 0) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_6| .cse3) 0) (= (select |v_#valid_BEFORE_CALL_6| .cse2) 1) (= |c_#valid| (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|))) (store |v_#valid_BEFORE_CALL_6| .cse4 (select |c_#valid| .cse4)))))) (= (select |c_#valid| .cse3) 1)))))) is different from false [2024-11-06 22:30:10,078 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|))) (let ((.cse0 (select |c_#memory_$Pointer$#1.base| .cse3))) (let ((.cse2 (select .cse0 0))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| .cse2) 0))) (and (= (select |c_#valid| (select .cse0 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) 1) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= .cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (= (select (select |c_#memory_$Pointer$#1.offset| .cse2) 0) 0) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|) 0) (= .cse1 .cse3) (= (select (select |c_#memory_$Pointer$#1.offset| .cse3) 0) 0) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_6| .cse3) 0) (= (select |v_#valid_BEFORE_CALL_6| .cse2) 1) (= |c_#valid| (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|))) (store |v_#valid_BEFORE_CALL_6| .cse4 (select |c_#valid| .cse4)))))) (= (select |c_#valid| .cse3) 1)))))) is different from true [2024-11-06 22:30:10,082 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_#memory_int#1| |c_old(#memory_int#1)|) (= |c_#valid| |c_old(#valid)|) (= |c_#memory_$Pointer$#1.offset| |c_old(#memory_$Pointer$#1.offset)|) (= |c_#memory_$Pointer$#1.base| |c_old(#memory_$Pointer$#1.base)|) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (v_arrayElimIndex_2 Int) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_5| Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_5| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_5|))) (and (= (select |v_#valid_BEFORE_CALL_7| .cse0) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_5|) 0) (= (select |v_#valid_BEFORE_CALL_6| v_arrayElimIndex_2) 1) (= (select |v_#valid_BEFORE_CALL_6| .cse0) 0) (= |v_#valid_BEFORE_CALL_7| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse1 (select |v_#valid_BEFORE_CALL_7| .cse1))))))) (= |c_old(#length)| |c_#length|)) is different from false [2024-11-06 22:30:10,085 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_#memory_int#1| |c_old(#memory_int#1)|) (= |c_#valid| |c_old(#valid)|) (= |c_#memory_$Pointer$#1.offset| |c_old(#memory_$Pointer$#1.offset)|) (= |c_#memory_$Pointer$#1.base| |c_old(#memory_$Pointer$#1.base)|) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (v_arrayElimIndex_2 Int) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_5| Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_5| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_5|))) (and (= (select |v_#valid_BEFORE_CALL_7| .cse0) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_5|) 0) (= (select |v_#valid_BEFORE_CALL_6| v_arrayElimIndex_2) 1) (= (select |v_#valid_BEFORE_CALL_6| .cse0) 0) (= |v_#valid_BEFORE_CALL_7| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse1 (select |v_#valid_BEFORE_CALL_7| .cse1))))))) (= |c_old(#length)| |c_#length|)) is different from true [2024-11-06 22:30:10,089 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_#memory_$Pointer$#1.offset| |c_old(#memory_$Pointer$#1.offset)|) (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| 1)) (= |c_node_create_~temp~0#1.offset| 0) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (= |c_#memory_$Pointer$#1.base| |c_old(#memory_$Pointer$#1.base)|) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (v_arrayElimIndex_2 Int) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_5| Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_5| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_5|))) (and (= (select |v_#valid_BEFORE_CALL_7| .cse0) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_5|) 0) (= (select |v_#valid_BEFORE_CALL_6| v_arrayElimIndex_2) 1) (= (select |v_#valid_BEFORE_CALL_6| .cse0) 0) (= |v_#valid_BEFORE_CALL_7| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse1 (select |v_#valid_BEFORE_CALL_7| .cse1)))))))) is different from false [2024-11-06 22:30:10,091 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_#memory_$Pointer$#1.offset| |c_old(#memory_$Pointer$#1.offset)|) (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| 1)) (= |c_node_create_~temp~0#1.offset| 0) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (= |c_#memory_$Pointer$#1.base| |c_old(#memory_$Pointer$#1.base)|) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (v_arrayElimIndex_2 Int) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_5| Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_5| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_5|))) (and (= (select |v_#valid_BEFORE_CALL_7| .cse0) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_5|) 0) (= (select |v_#valid_BEFORE_CALL_6| v_arrayElimIndex_2) 1) (= (select |v_#valid_BEFORE_CALL_6| .cse0) 0) (= |v_#valid_BEFORE_CALL_7| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse1 (select |v_#valid_BEFORE_CALL_7| .cse1)))))))) is different from true [2024-11-06 22:30:10,103 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (@diff |c_old(#memory_$Pointer$#1.offset)| |c_#memory_$Pointer$#1.offset|)) (.cse0 (@diff |c_old(#memory_$Pointer$#1.base)| |c_#memory_$Pointer$#1.base|))) (and (= |c_node_create_#res#1.offset| 0) (= (select |c_old(#valid)| |c_node_create_#res#1.base|) 0) (= (select |c_#valid| |c_node_create_#res#1.base|) 1) (= |c_#memory_$Pointer$#1.base| (store |c_old(#memory_$Pointer$#1.base)| .cse0 (select |c_#memory_$Pointer$#1.base| .cse0))) (exists ((|v_node_create_~temp~0#1.base_31| Int)) (and (= |c_#memory_$Pointer$#1.base| (store |c_old(#memory_$Pointer$#1.base)| |v_node_create_~temp~0#1.base_31| (select |c_#memory_$Pointer$#1.base| |v_node_create_~temp~0#1.base_31|))) (= (select |c_old(#valid)| |v_node_create_~temp~0#1.base_31|) 0) (= |c_#memory_$Pointer$#1.offset| (store |c_old(#memory_$Pointer$#1.offset)| |v_node_create_~temp~0#1.base_31| (select |c_#memory_$Pointer$#1.offset| |v_node_create_~temp~0#1.base_31|))))) (= |c_#valid| (let ((.cse1 (@diff |c_old(#valid)| |c_#valid|))) (store |c_old(#valid)| .cse1 (select |c_#valid| .cse1)))) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (v_arrayElimIndex_2 Int) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_5| Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_5| Int)) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_5|))) (and (= (select |v_#valid_BEFORE_CALL_7| .cse2) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_5|) 0) (= (select |v_#valid_BEFORE_CALL_6| v_arrayElimIndex_2) 1) (= (select |v_#valid_BEFORE_CALL_6| .cse2) 0) (= |v_#valid_BEFORE_CALL_7| (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse3 (select |v_#valid_BEFORE_CALL_7| .cse3))))))) (or (= |c_#memory_$Pointer$#1.offset| |c_old(#memory_$Pointer$#1.offset)|) (= (select |c_old(#valid)| .cse4) 0)) (= |c_#memory_$Pointer$#1.offset| (store |c_old(#memory_$Pointer$#1.offset)| .cse4 (select |c_#memory_$Pointer$#1.offset| .cse4))) (or (= (select |c_old(#valid)| .cse0) 0) (= |c_#memory_$Pointer$#1.base| |c_old(#memory_$Pointer$#1.base)|)))) is different from false [2024-11-06 22:30:10,108 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse4 (@diff |c_old(#memory_$Pointer$#1.offset)| |c_#memory_$Pointer$#1.offset|)) (.cse0 (@diff |c_old(#memory_$Pointer$#1.base)| |c_#memory_$Pointer$#1.base|))) (and (= |c_node_create_#res#1.offset| 0) (= (select |c_old(#valid)| |c_node_create_#res#1.base|) 0) (= (select |c_#valid| |c_node_create_#res#1.base|) 1) (= |c_#memory_$Pointer$#1.base| (store |c_old(#memory_$Pointer$#1.base)| .cse0 (select |c_#memory_$Pointer$#1.base| .cse0))) (exists ((|v_node_create_~temp~0#1.base_31| Int)) (and (= |c_#memory_$Pointer$#1.base| (store |c_old(#memory_$Pointer$#1.base)| |v_node_create_~temp~0#1.base_31| (select |c_#memory_$Pointer$#1.base| |v_node_create_~temp~0#1.base_31|))) (= (select |c_old(#valid)| |v_node_create_~temp~0#1.base_31|) 0) (= |c_#memory_$Pointer$#1.offset| (store |c_old(#memory_$Pointer$#1.offset)| |v_node_create_~temp~0#1.base_31| (select |c_#memory_$Pointer$#1.offset| |v_node_create_~temp~0#1.base_31|))))) (= |c_#valid| (let ((.cse1 (@diff |c_old(#valid)| |c_#valid|))) (store |c_old(#valid)| .cse1 (select |c_#valid| .cse1)))) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (v_arrayElimIndex_2 Int) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_5| Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_5| Int)) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_5|))) (and (= (select |v_#valid_BEFORE_CALL_7| .cse2) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_5|) 0) (= (select |v_#valid_BEFORE_CALL_6| v_arrayElimIndex_2) 1) (= (select |v_#valid_BEFORE_CALL_6| .cse2) 0) (= |v_#valid_BEFORE_CALL_7| (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse3 (select |v_#valid_BEFORE_CALL_7| .cse3))))))) (or (= |c_#memory_$Pointer$#1.offset| |c_old(#memory_$Pointer$#1.offset)|) (= (select |c_old(#valid)| .cse4) 0)) (= |c_#memory_$Pointer$#1.offset| (store |c_old(#memory_$Pointer$#1.offset)| .cse4 (select |c_#memory_$Pointer$#1.offset| .cse4))) (or (= (select |c_old(#valid)| .cse0) 0) (= |c_#memory_$Pointer$#1.base| |c_old(#memory_$Pointer$#1.base)|)))) is different from true [2024-11-06 22:30:10,119 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse9 (select |c_#memory_$Pointer$#1.base| .cse5))) (let ((.cse3 (select .cse9 0)) (.cse6 (select |c_#memory_$Pointer$#1.offset| .cse5)) (.cse2 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (.cse0 (select .cse9 .cse1))) (and (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= (select (select |c_#memory_$Pointer$#1.offset| .cse0) .cse1) .cse2) (= (select (select |c_#memory_$Pointer$#1.offset| .cse3) 0) 0) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= .cse2 0) (exists ((|v_old(#valid)_AFTER_CALL_12| (Array Int Int)) (|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_node_create_~temp~0#1.base_31| Int)) (and (= (select |v_#valid_BEFORE_CALL_9| .cse3) 1) (= |v_old(#valid)_AFTER_CALL_12| (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_9| |v_old(#valid)_AFTER_CALL_12|))) (store |v_#valid_BEFORE_CALL_9| .cse4 (select |v_old(#valid)_AFTER_CALL_12| .cse4)))) (= (select |v_old(#valid)_AFTER_CALL_12| |v_node_create_~temp~0#1.base_31|) 0) (= (select |v_#valid_BEFORE_CALL_9| .cse5) 0) (= (select |v_old(#valid)_AFTER_CALL_12| .cse5) 1))) (= (select (select |c_#memory_$Pointer$#1.base| .cse3) 0) .cse5) (= (select .cse6 0) 0) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (v_arrayElimIndex_2 Int) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_5| Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_5| Int)) (let ((.cse7 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_5|))) (and (= (select |v_#valid_BEFORE_CALL_7| .cse7) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_5|) 0) (= (select |v_#valid_BEFORE_CALL_6| v_arrayElimIndex_2) 1) (= (select |v_#valid_BEFORE_CALL_6| .cse7) 0) (= |v_#valid_BEFORE_CALL_7| (let ((.cse8 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse8 (select |v_#valid_BEFORE_CALL_7| .cse8))))))) (= (select .cse6 .cse1) .cse2) (= (select (select |c_#memory_$Pointer$#1.base| .cse0) .cse1) (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))) is different from false [2024-11-06 22:30:10,123 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse5 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse9 (select |c_#memory_$Pointer$#1.base| .cse5))) (let ((.cse3 (select .cse9 0)) (.cse6 (select |c_#memory_$Pointer$#1.offset| .cse5)) (.cse2 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (.cse0 (select .cse9 .cse1))) (and (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= (select (select |c_#memory_$Pointer$#1.offset| .cse0) .cse1) .cse2) (= (select (select |c_#memory_$Pointer$#1.offset| .cse3) 0) 0) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= .cse2 0) (exists ((|v_old(#valid)_AFTER_CALL_12| (Array Int Int)) (|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_node_create_~temp~0#1.base_31| Int)) (and (= (select |v_#valid_BEFORE_CALL_9| .cse3) 1) (= |v_old(#valid)_AFTER_CALL_12| (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_9| |v_old(#valid)_AFTER_CALL_12|))) (store |v_#valid_BEFORE_CALL_9| .cse4 (select |v_old(#valid)_AFTER_CALL_12| .cse4)))) (= (select |v_old(#valid)_AFTER_CALL_12| |v_node_create_~temp~0#1.base_31|) 0) (= (select |v_#valid_BEFORE_CALL_9| .cse5) 0) (= (select |v_old(#valid)_AFTER_CALL_12| .cse5) 1))) (= (select (select |c_#memory_$Pointer$#1.base| .cse3) 0) .cse5) (= (select .cse6 0) 0) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (v_arrayElimIndex_2 Int) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_5| Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_5| Int)) (let ((.cse7 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_5|))) (and (= (select |v_#valid_BEFORE_CALL_7| .cse7) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_5|) 0) (= (select |v_#valid_BEFORE_CALL_6| v_arrayElimIndex_2) 1) (= (select |v_#valid_BEFORE_CALL_6| .cse7) 0) (= |v_#valid_BEFORE_CALL_7| (let ((.cse8 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse8 (select |v_#valid_BEFORE_CALL_7| .cse8))))))) (= (select .cse6 .cse1) .cse2) (= (select (select |c_#memory_$Pointer$#1.base| .cse0) .cse1) (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))) is different from true [2024-11-06 22:30:10,136 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|))) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| .cse1) 0)) (.cse0 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (.cse4 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset|))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset|) .cse0) (= |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| .cse1) (= |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= (select (select |c_#memory_$Pointer$#1.offset| .cse2) 0) 0) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= .cse0 0) (exists ((|v_old(#valid)_AFTER_CALL_12| (Array Int Int)) (|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_node_create_~temp~0#1.base_31| Int)) (and (= (select |v_#valid_BEFORE_CALL_9| .cse2) 1) (= |v_old(#valid)_AFTER_CALL_12| (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_9| |v_old(#valid)_AFTER_CALL_12|))) (store |v_#valid_BEFORE_CALL_9| .cse3 (select |v_old(#valid)_AFTER_CALL_12| .cse3)))) (= (select |v_old(#valid)_AFTER_CALL_12| |v_node_create_~temp~0#1.base_31|) 0) (= (select |v_#valid_BEFORE_CALL_9| .cse1) 0) (= (select |v_old(#valid)_AFTER_CALL_12| .cse1) 1))) (= (select (select |c_#memory_$Pointer$#1.base| .cse2) 0) .cse1) (= (select (select |c_#memory_$Pointer$#1.offset| .cse1) 0) 0) (= .cse0 (select (select |c_#memory_$Pointer$#1.offset| .cse4) .cse0)) (= (select (select |c_#memory_$Pointer$#1.base| .cse4) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (v_arrayElimIndex_2 Int) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_5| Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_5| Int)) (let ((.cse5 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_5|))) (and (= (select |v_#valid_BEFORE_CALL_7| .cse5) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_5|) 0) (= (select |v_#valid_BEFORE_CALL_6| v_arrayElimIndex_2) 1) (= (select |v_#valid_BEFORE_CALL_6| .cse5) 0) (= |v_#valid_BEFORE_CALL_7| (let ((.cse6 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse6 (select |v_#valid_BEFORE_CALL_7| .cse6)))))))))) is different from false [2024-11-06 22:30:10,140 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|))) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| .cse1) 0)) (.cse0 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (.cse4 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset|))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset|) .cse0) (= |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| .cse1) (= |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= (select (select |c_#memory_$Pointer$#1.offset| .cse2) 0) 0) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= .cse0 0) (exists ((|v_old(#valid)_AFTER_CALL_12| (Array Int Int)) (|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_node_create_~temp~0#1.base_31| Int)) (and (= (select |v_#valid_BEFORE_CALL_9| .cse2) 1) (= |v_old(#valid)_AFTER_CALL_12| (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_9| |v_old(#valid)_AFTER_CALL_12|))) (store |v_#valid_BEFORE_CALL_9| .cse3 (select |v_old(#valid)_AFTER_CALL_12| .cse3)))) (= (select |v_old(#valid)_AFTER_CALL_12| |v_node_create_~temp~0#1.base_31|) 0) (= (select |v_#valid_BEFORE_CALL_9| .cse1) 0) (= (select |v_old(#valid)_AFTER_CALL_12| .cse1) 1))) (= (select (select |c_#memory_$Pointer$#1.base| .cse2) 0) .cse1) (= (select (select |c_#memory_$Pointer$#1.offset| .cse1) 0) 0) (= .cse0 (select (select |c_#memory_$Pointer$#1.offset| .cse4) .cse0)) (= (select (select |c_#memory_$Pointer$#1.base| .cse4) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (v_arrayElimIndex_2 Int) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_5| Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_5| Int)) (let ((.cse5 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_5|))) (and (= (select |v_#valid_BEFORE_CALL_7| .cse5) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_5|) 0) (= (select |v_#valid_BEFORE_CALL_6| v_arrayElimIndex_2) 1) (= (select |v_#valid_BEFORE_CALL_6| .cse5) 0) (= |v_#valid_BEFORE_CALL_7| (let ((.cse6 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse6 (select |v_#valid_BEFORE_CALL_7| .cse6)))))))))) is different from true [2024-11-06 22:30:10,152 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (.cse2 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset|)) (.cse3 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset|)) (.cse4 (select (select |c_#memory_$Pointer$#1.base| .cse0) 0))) (and (= |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| .cse0) (= .cse1 (select (select |c_#memory_$Pointer$#1.offset| .cse2) .cse3)) (= |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= (select (select |c_#memory_$Pointer$#1.offset| .cse4) 0) 0) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= .cse1 0) (= (select (select |c_#memory_$Pointer$#1.base| .cse2) .cse3) (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (exists ((|v_old(#valid)_AFTER_CALL_12| (Array Int Int)) (|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_node_create_~temp~0#1.base_31| Int)) (and (= (select |v_#valid_BEFORE_CALL_9| .cse4) 1) (= |v_old(#valid)_AFTER_CALL_12| (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_9| |v_old(#valid)_AFTER_CALL_12|))) (store |v_#valid_BEFORE_CALL_9| .cse5 (select |v_old(#valid)_AFTER_CALL_12| .cse5)))) (= (select |v_old(#valid)_AFTER_CALL_12| |v_node_create_~temp~0#1.base_31|) 0) (= (select |v_#valid_BEFORE_CALL_9| .cse0) 0) (= (select |v_old(#valid)_AFTER_CALL_12| .cse0) 1))) (= (select (select |c_#memory_$Pointer$#1.base| .cse4) 0) .cse0) (= (select (select |c_#memory_$Pointer$#1.offset| .cse0) 0) 0) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (v_arrayElimIndex_2 Int) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_5| Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_5| Int)) (let ((.cse6 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_5|))) (and (= (select |v_#valid_BEFORE_CALL_7| .cse6) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_5|) 0) (= (select |v_#valid_BEFORE_CALL_6| v_arrayElimIndex_2) 1) (= (select |v_#valid_BEFORE_CALL_6| .cse6) 0) (= |v_#valid_BEFORE_CALL_7| (let ((.cse7 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse7 (select |v_#valid_BEFORE_CALL_7| .cse7))))))) (= |c_ULTIMATE.start_sll_circular_prepend_#t~mem12#1.offset| |c_ULTIMATE.start_sll_circular_prepend_#t~mem13#1.offset|)))) is different from false [2024-11-06 22:30:10,155 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (.cse2 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset|)) (.cse3 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset|)) (.cse4 (select (select |c_#memory_$Pointer$#1.base| .cse0) 0))) (and (= |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| .cse0) (= .cse1 (select (select |c_#memory_$Pointer$#1.offset| .cse2) .cse3)) (= |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= (select (select |c_#memory_$Pointer$#1.offset| .cse4) 0) 0) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= .cse1 0) (= (select (select |c_#memory_$Pointer$#1.base| .cse2) .cse3) (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (exists ((|v_old(#valid)_AFTER_CALL_12| (Array Int Int)) (|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_node_create_~temp~0#1.base_31| Int)) (and (= (select |v_#valid_BEFORE_CALL_9| .cse4) 1) (= |v_old(#valid)_AFTER_CALL_12| (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_9| |v_old(#valid)_AFTER_CALL_12|))) (store |v_#valid_BEFORE_CALL_9| .cse5 (select |v_old(#valid)_AFTER_CALL_12| .cse5)))) (= (select |v_old(#valid)_AFTER_CALL_12| |v_node_create_~temp~0#1.base_31|) 0) (= (select |v_#valid_BEFORE_CALL_9| .cse0) 0) (= (select |v_old(#valid)_AFTER_CALL_12| .cse0) 1))) (= (select (select |c_#memory_$Pointer$#1.base| .cse4) 0) .cse0) (= (select (select |c_#memory_$Pointer$#1.offset| .cse0) 0) 0) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (v_arrayElimIndex_2 Int) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_5| Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_5| Int)) (let ((.cse6 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_5|))) (and (= (select |v_#valid_BEFORE_CALL_7| .cse6) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_5|) 0) (= (select |v_#valid_BEFORE_CALL_6| v_arrayElimIndex_2) 1) (= (select |v_#valid_BEFORE_CALL_6| .cse6) 0) (= |v_#valid_BEFORE_CALL_7| (let ((.cse7 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse7 (select |v_#valid_BEFORE_CALL_7| .cse7))))))) (= |c_ULTIMATE.start_sll_circular_prepend_#t~mem12#1.offset| |c_ULTIMATE.start_sll_circular_prepend_#t~mem13#1.offset|)))) is different from true [2024-11-06 22:30:10,168 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (.cse0 (select (select |c_#memory_$Pointer$#1.base| .cse3) 0))) (and (= .cse0 |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) (= (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset|)) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset|) .cse1) (= |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= (select (select |c_#memory_$Pointer$#1.offset| .cse0) 0) 0) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= .cse1 0) (exists ((|v_old(#valid)_AFTER_CALL_12| (Array Int Int)) (|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_node_create_~temp~0#1.base_31| Int)) (and (= (select |v_#valid_BEFORE_CALL_9| .cse0) 1) (= |v_old(#valid)_AFTER_CALL_12| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_9| |v_old(#valid)_AFTER_CALL_12|))) (store |v_#valid_BEFORE_CALL_9| .cse2 (select |v_old(#valid)_AFTER_CALL_12| .cse2)))) (= (select |v_old(#valid)_AFTER_CALL_12| |v_node_create_~temp~0#1.base_31|) 0) (= (select |v_#valid_BEFORE_CALL_9| .cse3) 0) (= (select |v_old(#valid)_AFTER_CALL_12| .cse3) 1))) (= (select (select |c_#memory_$Pointer$#1.base| .cse0) 0) .cse3) (= (select (select |c_#memory_$Pointer$#1.offset| .cse3) 0) 0) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (v_arrayElimIndex_2 Int) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_5| Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_5| Int)) (let ((.cse4 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_5|))) (and (= (select |v_#valid_BEFORE_CALL_7| .cse4) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_5|) 0) (= (select |v_#valid_BEFORE_CALL_6| v_arrayElimIndex_2) 1) (= (select |v_#valid_BEFORE_CALL_6| .cse4) 0) (= |v_#valid_BEFORE_CALL_7| (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse5 (select |v_#valid_BEFORE_CALL_7| .cse5)))))))))) is different from false [2024-11-06 22:30:10,172 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (.cse0 (select (select |c_#memory_$Pointer$#1.base| .cse3) 0))) (and (= .cse0 |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) (= (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset|)) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset|) .cse1) (= |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= (select (select |c_#memory_$Pointer$#1.offset| .cse0) 0) 0) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= .cse1 0) (exists ((|v_old(#valid)_AFTER_CALL_12| (Array Int Int)) (|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_node_create_~temp~0#1.base_31| Int)) (and (= (select |v_#valid_BEFORE_CALL_9| .cse0) 1) (= |v_old(#valid)_AFTER_CALL_12| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_9| |v_old(#valid)_AFTER_CALL_12|))) (store |v_#valid_BEFORE_CALL_9| .cse2 (select |v_old(#valid)_AFTER_CALL_12| .cse2)))) (= (select |v_old(#valid)_AFTER_CALL_12| |v_node_create_~temp~0#1.base_31|) 0) (= (select |v_#valid_BEFORE_CALL_9| .cse3) 0) (= (select |v_old(#valid)_AFTER_CALL_12| .cse3) 1))) (= (select (select |c_#memory_$Pointer$#1.base| .cse0) 0) .cse3) (= (select (select |c_#memory_$Pointer$#1.offset| .cse3) 0) 0) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (v_arrayElimIndex_2 Int) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_5| Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_5| Int)) (let ((.cse4 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_5|))) (and (= (select |v_#valid_BEFORE_CALL_7| .cse4) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_5|) 0) (= (select |v_#valid_BEFORE_CALL_6| v_arrayElimIndex_2) 1) (= (select |v_#valid_BEFORE_CALL_6| .cse4) 0) (= |v_#valid_BEFORE_CALL_7| (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse5 (select |v_#valid_BEFORE_CALL_7| .cse5)))))))))) is different from true [2024-11-06 22:30:10,177 WARN L851 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) 0) 0) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_12| (Array Int Int)) (|v_node_create_~temp~0#1.base_31| Int)) (and (= (select |v_old(#valid)_AFTER_CALL_12| |c_ULTIMATE.start_sll_circular_prepend_#t~mem13#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_9| |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_9| |c_ULTIMATE.start_sll_circular_prepend_#t~mem13#1.base|) 0) (= |v_old(#valid)_AFTER_CALL_12| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_9| |v_old(#valid)_AFTER_CALL_12|))) (store |v_#valid_BEFORE_CALL_9| .cse0 (select |v_old(#valid)_AFTER_CALL_12| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_12| |v_node_create_~temp~0#1.base_31|) 0))) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_prepend_#t~mem13#1.base|) 0) 0) (= |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_sll_circular_prepend_#t~mem13#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_prepend_#t~mem12#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_prepend_#t~mem12#1.offset| |c_ULTIMATE.start_sll_circular_prepend_#t~mem13#1.offset|) (= |c_ULTIMATE.start_sll_circular_prepend_#t~mem12#1.base| |c_ULTIMATE.start_sll_circular_prepend_#t~mem13#1.base|)) is different from false [2024-11-06 22:30:10,179 WARN L873 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) 0) 0) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_12| (Array Int Int)) (|v_node_create_~temp~0#1.base_31| Int)) (and (= (select |v_old(#valid)_AFTER_CALL_12| |c_ULTIMATE.start_sll_circular_prepend_#t~mem13#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_9| |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_9| |c_ULTIMATE.start_sll_circular_prepend_#t~mem13#1.base|) 0) (= |v_old(#valid)_AFTER_CALL_12| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_9| |v_old(#valid)_AFTER_CALL_12|))) (store |v_#valid_BEFORE_CALL_9| .cse0 (select |v_old(#valid)_AFTER_CALL_12| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_12| |v_node_create_~temp~0#1.base_31|) 0))) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_prepend_#t~mem13#1.base|) 0) 0) (= |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_sll_circular_prepend_#t~mem13#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_prepend_#t~mem12#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_prepend_#t~mem12#1.offset| |c_ULTIMATE.start_sll_circular_prepend_#t~mem13#1.offset|) (= |c_ULTIMATE.start_sll_circular_prepend_#t~mem12#1.base| |c_ULTIMATE.start_sll_circular_prepend_#t~mem13#1.base|)) is different from true [2024-11-06 22:30:10,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 22:30:10,304 INFO L93 Difference]: Finished difference Result 70 states and 81 transitions. [2024-11-06 22:30:10,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-06 22:30:10,305 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 30 states have (on average 1.6333333333333333) internal successors, (49), 26 states have internal predecessors, (49), 4 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) Word has length 39 [2024-11-06 22:30:10,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 22:30:10,306 INFO L225 Difference]: With dead ends: 70 [2024-11-06 22:30:10,306 INFO L226 Difference]: Without dead ends: 59 [2024-11-06 22:30:10,306 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 38 SyntacticMatches, 2 SemanticMatches, 49 ConstructedPredicates, 23 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=120, Invalid=682, Unknown=46, NotChecked=1702, Total=2550 [2024-11-06 22:30:10,307 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 0 mSDsluCounter, 293 mSDsCounter, 0 mSdLazyCounter, 252 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 321 SdHoareTripleChecker+Invalid, 1138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 252 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 884 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-06 22:30:10,307 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 321 Invalid, 1138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 252 Invalid, 0 Unknown, 884 Unchecked, 0.2s Time] [2024-11-06 22:30:10,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2024-11-06 22:30:10,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2024-11-06 22:30:10,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 50 states have (on average 1.14) internal successors, (57), 50 states have internal predecessors, (57), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-06 22:30:10,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 67 transitions. [2024-11-06 22:30:10,323 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 67 transitions. Word has length 39 [2024-11-06 22:30:10,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 22:30:10,323 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 67 transitions. [2024-11-06 22:30:10,323 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 30 states have (on average 1.6333333333333333) internal successors, (49), 26 states have internal predecessors, (49), 4 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2024-11-06 22:30:10,324 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 67 transitions. [2024-11-06 22:30:10,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-06 22:30:10,325 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 22:30:10,325 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, 1, 1] [2024-11-06 22:30:10,339 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-06 22:30:10,528 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-11-06 22:30:10,528 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 22:30:10,528 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 22:30:10,528 INFO L85 PathProgramCache]: Analyzing trace with hash 12485255, now seen corresponding path program 1 times [2024-11-06 22:30:10,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 22:30:10,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229903364] [2024-11-06 22:30:10,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 22:30:10,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 22:30:10,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:30:11,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-06 22:30:11,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:30:11,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-06 22:30:11,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:30:11,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-06 22:30:11,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:30:11,455 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-06 22:30:11,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 22:30:11,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1229903364] [2024-11-06 22:30:11,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1229903364] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-06 22:30:11,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1062071273] [2024-11-06 22:30:11,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 22:30:11,455 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 22:30:11,455 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 22:30:11,458 INFO L229 MonitoredProcess]: Starting monitored process 6 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:30:11,460 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-06 22:30:11,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:30:11,623 INFO L255 TraceCheckSpWp]: Trace formula consists of 367 conjuncts, 75 conjuncts are in the unsatisfiable core [2024-11-06 22:30:11,628 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 22:30:11,635 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 6 treesize of output 5 [2024-11-06 22:30:11,833 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 9 treesize of output 3 [2024-11-06 22:30:11,917 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 7 [2024-11-06 22:30:11,971 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2024-11-06 22:30:11,971 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2024-11-06 22:30:12,333 INFO L349 Elim1Store]: treesize reduction 43, result has 40.3 percent of original size [2024-11-06 22:30:12,334 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 78 treesize of output 39 [2024-11-06 22:30:12,362 INFO L349 Elim1Store]: treesize reduction 20, result has 58.3 percent of original size [2024-11-06 22:30:12,363 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 59 treesize of output 55 [2024-11-06 22:30:12,391 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:30:12,439 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 7 treesize of output 3 [2024-11-06 22:30:12,497 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 40 treesize of output 16 [2024-11-06 22:30:12,536 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:30:12,577 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-06 22:30:12,577 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-06 22:30:12,588 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 150 treesize of output 146 [2024-11-06 22:30:13,087 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-06 22:30:13,088 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 1570 treesize of output 1564 [2024-11-06 22:30:14,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1062071273] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-06 22:30:14,059 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-06 22:30:14,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 19] total 38 [2024-11-06 22:30:14,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [535381811] [2024-11-06 22:30:14,059 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-06 22:30:14,060 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2024-11-06 22:30:14,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 22:30:14,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2024-11-06 22:30:14,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=1690, Unknown=0, NotChecked=0, Total=1806 [2024-11-06 22:30:14,061 INFO L87 Difference]: Start difference. First operand 59 states and 67 transitions. Second operand has 38 states, 36 states have (on average 1.6388888888888888) internal successors, (59), 32 states have internal predecessors, (59), 3 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-06 22:30:18,094 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:30:22,143 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:30:23,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 22:30:23,014 INFO L93 Difference]: Finished difference Result 72 states and 80 transitions. [2024-11-06 22:30:23,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-06 22:30:23,014 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 36 states have (on average 1.6388888888888888) internal successors, (59), 32 states have internal predecessors, (59), 3 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Word has length 40 [2024-11-06 22:30:23,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 22:30:23,015 INFO L225 Difference]: With dead ends: 72 [2024-11-06 22:30:23,015 INFO L226 Difference]: Without dead ends: 69 [2024-11-06 22:30:23,016 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 416 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=217, Invalid=3205, Unknown=0, NotChecked=0, Total=3422 [2024-11-06 22:30:23,016 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 44 mSDsluCounter, 411 mSDsCounter, 0 mSdLazyCounter, 841 mSolverCounterSat, 2 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 431 SdHoareTripleChecker+Invalid, 845 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 841 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.5s IncrementalHoareTripleChecker+Time [2024-11-06 22:30:23,017 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 431 Invalid, 845 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 841 Invalid, 2 Unknown, 0 Unchecked, 8.5s Time] [2024-11-06 22:30:23,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2024-11-06 22:30:23,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 63. [2024-11-06 22:30:23,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 54 states have (on average 1.1481481481481481) internal successors, (62), 54 states have internal predecessors, (62), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-06 22:30:23,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 72 transitions. [2024-11-06 22:30:23,028 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 72 transitions. Word has length 40 [2024-11-06 22:30:23,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 22:30:23,028 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 72 transitions. [2024-11-06 22:30:23,028 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 36 states have (on average 1.6388888888888888) internal successors, (59), 32 states have internal predecessors, (59), 3 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-06 22:30:23,028 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 72 transitions. [2024-11-06 22:30:23,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-06 22:30:23,029 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 22:30:23,029 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 22:30:23,049 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-06 22:30:23,229 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 22:30:23,229 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 22:30:23,230 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 22:30:23,230 INFO L85 PathProgramCache]: Analyzing trace with hash 387084070, now seen corresponding path program 1 times [2024-11-06 22:30:23,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 22:30:23,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1113921607] [2024-11-06 22:30:23,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 22:30:23,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 22:30:23,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:30:24,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-06 22:30:24,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:30:24,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-06 22:30:24,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:30:24,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-06 22:30:24,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:30:25,217 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 4 proven. 13 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-06 22:30:25,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 22:30:25,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1113921607] [2024-11-06 22:30:25,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1113921607] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-06 22:30:25,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [65656487] [2024-11-06 22:30:25,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 22:30:25,217 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 22:30:25,217 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 22:30:25,219 INFO L229 MonitoredProcess]: Starting monitored process 7 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:30:25,229 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-06 22:30:25,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:30:25,398 INFO L255 TraceCheckSpWp]: Trace formula consists of 366 conjuncts, 161 conjuncts are in the unsatisfiable core [2024-11-06 22:30:25,406 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 22:30:25,443 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:30:25,625 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-06 22:30:25,689 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-06 22:30:25,690 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 17 treesize of output 21 [2024-11-06 22:30:25,746 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 11 treesize of output 7 [2024-11-06 22:30:25,754 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 23 treesize of output 11 [2024-11-06 22:30:25,760 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 11 treesize of output 7 [2024-11-06 22:30:25,837 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-06 22:30:25,837 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 66 treesize of output 57 [2024-11-06 22:30:25,843 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2024-11-06 22:30:25,847 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2024-11-06 22:30:26,012 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 30 treesize of output 14 [2024-11-06 22:30:26,019 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-06 22:30:26,024 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:30:26,028 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:30:26,270 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-06 22:30:26,271 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 48 treesize of output 32 [2024-11-06 22:30:26,284 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2024-11-06 22:30:26,285 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2024-11-06 22:30:26,294 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 20 treesize of output 15 [2024-11-06 22:30:26,303 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 20 treesize of output 15 [2024-11-06 22:30:27,212 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 54 [2024-11-06 22:30:27,236 INFO L349 Elim1Store]: treesize reduction 92, result has 22.7 percent of original size [2024-11-06 22:30:27,236 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 172 treesize of output 123 [2024-11-06 22:30:27,244 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 15 [2024-11-06 22:30:27,274 INFO L349 Elim1Store]: treesize reduction 20, result has 58.3 percent of original size [2024-11-06 22:30:27,274 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 184 treesize of output 136 [2024-11-06 22:30:27,300 INFO L349 Elim1Store]: treesize reduction 80, result has 15.8 percent of original size [2024-11-06 22:30:27,301 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 289 treesize of output 164 [2024-11-06 22:30:27,307 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 17 treesize of output 15 [2024-11-06 22:30:27,313 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 41 [2024-11-06 22:30:27,348 INFO L349 Elim1Store]: treesize reduction 33, result has 31.3 percent of original size [2024-11-06 22:30:27,348 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:30:27,376 WARN L214 Elim1Store]: Array PQE input equivalent to false [2024-11-06 22:30:27,460 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 172 treesize of output 124 [2024-11-06 22:30:27,463 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 128 treesize of output 88 [2024-11-06 22:30:27,580 INFO L349 Elim1Store]: treesize reduction 21, result has 27.6 percent of original size [2024-11-06 22:30:27,581 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 85 treesize of output 52 [2024-11-06 22:30:27,584 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-06 22:30:27,685 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 7 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 22:30:27,685 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-06 22:30:27,836 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1237 (Array Int Int)) (v_ArrVal_1236 (Array Int Int)) (|ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| Int) (v_ArrVal_1241 (Array Int Int)) (v_ArrVal_1240 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse3 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|)) (.cse0 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse0 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse3 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_1236) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_1240) (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| (select .cse0 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|))) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_1237) .cse1) .cse2)) (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| (select .cse3 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|))) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_1241) .cse1) .cse2) 4)))))) is different from false [2024-11-06 22:30:29,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [65656487] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-06 22:30:29,179 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-06 22:30:29,179 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 28] total 50 [2024-11-06 22:30:29,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817474552] [2024-11-06 22:30:29,179 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-06 22:30:29,180 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2024-11-06 22:30:29,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 22:30:29,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2024-11-06 22:30:29,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=174, Invalid=3368, Unknown=2, NotChecked=116, Total=3660 [2024-11-06 22:30:29,181 INFO L87 Difference]: Start difference. First operand 63 states and 72 transitions. Second operand has 50 states, 46 states have (on average 1.4130434782608696) internal successors, (65), 41 states have internal predecessors, (65), 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:30:31,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 22:30:31,788 INFO L93 Difference]: Finished difference Result 82 states and 93 transitions. [2024-11-06 22:30:31,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-11-06 22:30:31,789 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 46 states have (on average 1.4130434782608696) internal successors, (65), 41 states have internal predecessors, (65), 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 41 [2024-11-06 22:30:31,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 22:30:31,791 INFO L225 Difference]: With dead ends: 82 [2024-11-06 22:30:31,791 INFO L226 Difference]: Without dead ends: 80 [2024-11-06 22:30:31,792 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1198 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=367, Invalid=5955, Unknown=2, NotChecked=156, Total=6480 [2024-11-06 22:30:31,793 INFO L432 NwaCegarLoop]: 14 mSDtfsCounter, 58 mSDsluCounter, 327 mSDsCounter, 0 mSdLazyCounter, 1142 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 341 SdHoareTripleChecker+Invalid, 1152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 1142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-06 22:30:31,794 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 341 Invalid, 1152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 1142 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-06 22:30:31,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2024-11-06 22:30:31,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 71. [2024-11-06 22:30:31,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 62 states have (on average 1.1290322580645162) internal successors, (70), 62 states have internal predecessors, (70), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-06 22:30:31,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 80 transitions. [2024-11-06 22:30:31,818 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 80 transitions. Word has length 41 [2024-11-06 22:30:31,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 22:30:31,819 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 80 transitions. [2024-11-06 22:30:31,819 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 46 states have (on average 1.4130434782608696) internal successors, (65), 41 states have internal predecessors, (65), 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:30:31,819 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 80 transitions. [2024-11-06 22:30:31,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-06 22:30:31,820 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 22:30:31,820 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 22:30:31,838 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-06 22:30:32,020 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2024-11-06 22:30:32,021 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 22:30:32,021 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 22:30:32,021 INFO L85 PathProgramCache]: Analyzing trace with hash -364798159, now seen corresponding path program 1 times [2024-11-06 22:30:32,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 22:30:32,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667409907] [2024-11-06 22:30:32,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 22:30:32,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 22:30:32,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:30:33,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-06 22:30:33,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:30:33,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-06 22:30:33,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:30:33,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-06 22:30:33,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:30:33,476 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 15 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-06 22:30:33,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 22:30:33,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [667409907] [2024-11-06 22:30:33,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [667409907] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-06 22:30:33,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [795718603] [2024-11-06 22:30:33,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 22:30:33,477 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 22:30:33,477 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 22:30:33,479 INFO L229 MonitoredProcess]: Starting monitored process 8 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:30:33,481 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-06 22:30:33,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:30:33,676 INFO L255 TraceCheckSpWp]: Trace formula consists of 382 conjuncts, 118 conjuncts are in the unsatisfiable core [2024-11-06 22:30:33,680 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 22:30:33,682 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:30:33,905 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-06 22:30:33,905 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-11-06 22:30:33,943 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-06 22:30:33,996 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-06 22:30:33,996 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 33 [2024-11-06 22:30:34,082 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 30 treesize of output 14 [2024-11-06 22:30:34,085 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-06 22:30:34,244 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-06 22:30:34,246 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 38 treesize of output 27 [2024-11-06 22:30:34,256 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2024-11-06 22:30:34,257 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2024-11-06 22:30:34,600 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 144 treesize of output 93 [2024-11-06 22:30:34,605 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 28 [2024-11-06 22:30:34,608 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 47 [2024-11-06 22:30:34,626 INFO L349 Elim1Store]: treesize reduction 60, result has 20.0 percent of original size [2024-11-06 22:30:34,626 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 125 treesize of output 74 [2024-11-06 22:30:34,636 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 15 [2024-11-06 22:30:34,654 INFO L349 Elim1Store]: treesize reduction 37, result has 15.9 percent of original size [2024-11-06 22:30:34,655 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:30:34,863 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2024-11-06 22:30:34,989 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-06 22:30:34,989 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 15 treesize of output 7 [2024-11-06 22:30:35,060 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2024-11-06 22:30:35,060 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 27 [2024-11-06 22:30:35,064 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:30:35,065 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 22:30:35,065 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-06 22:30:35,157 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-06 22:30:35,157 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 121 treesize of output 122 [2024-11-06 22:30:35,165 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-06 22:30:35,165 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 245 treesize of output 248 [2024-11-06 22:30:35,171 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 204 treesize of output 190 [2024-11-06 22:30:38,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [795718603] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-06 22:30:38,084 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-06 22:30:38,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 48 [2024-11-06 22:30:38,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2042479781] [2024-11-06 22:30:38,085 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-06 22:30:38,085 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2024-11-06 22:30:38,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 22:30:38,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2024-11-06 22:30:38,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=2785, Unknown=35, NotChecked=0, Total=2970 [2024-11-06 22:30:38,087 INFO L87 Difference]: Start difference. First operand 71 states and 80 transitions. Second operand has 48 states, 46 states have (on average 1.5217391304347827) internal successors, (70), 39 states have internal predecessors, (70), 5 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2024-11-06 22:30:40,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 22:30:40,250 INFO L93 Difference]: Finished difference Result 91 states and 101 transitions. [2024-11-06 22:30:40,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-11-06 22:30:40,250 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 46 states have (on average 1.5217391304347827) internal successors, (70), 39 states have internal predecessors, (70), 5 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 44 [2024-11-06 22:30:40,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 22:30:40,251 INFO L225 Difference]: With dead ends: 91 [2024-11-06 22:30:40,251 INFO L226 Difference]: Without dead ends: 88 [2024-11-06 22:30:40,252 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 720 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=290, Invalid=4782, Unknown=40, NotChecked=0, Total=5112 [2024-11-06 22:30:40,253 INFO L432 NwaCegarLoop]: 19 mSDtfsCounter, 69 mSDsluCounter, 480 mSDsCounter, 0 mSdLazyCounter, 1140 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 499 SdHoareTripleChecker+Invalid, 1149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 1140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-06 22:30:40,253 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 499 Invalid, 1149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 1140 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-06 22:30:40,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2024-11-06 22:30:40,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 69. [2024-11-06 22:30:40,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 60 states have (on average 1.1333333333333333) internal successors, (68), 60 states have internal predecessors, (68), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-06 22:30:40,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 78 transitions. [2024-11-06 22:30:40,269 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 78 transitions. Word has length 44 [2024-11-06 22:30:40,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 22:30:40,269 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 78 transitions. [2024-11-06 22:30:40,269 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 46 states have (on average 1.5217391304347827) internal successors, (70), 39 states have internal predecessors, (70), 5 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2024-11-06 22:30:40,269 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 78 transitions. [2024-11-06 22:30:40,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-06 22:30:40,270 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 22:30:40,270 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]