./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/list-simple/dll2c_append_unequal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/list-simple/dll2c_append_unequal.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 9aabbeff87ba819b44dc608a3105d0ba81b71cd88693ecf2e6bf3860a7863e64 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-09 22:07:01,267 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 22:07:01,329 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-09 22:07:01,333 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 22:07:01,334 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 22:07:01,360 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 22:07:01,361 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 22:07:01,362 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 22:07:01,362 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 22:07:01,365 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 22:07:01,365 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 22:07:01,366 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 22:07:01,366 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 22:07:01,366 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 22:07:01,366 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 22:07:01,367 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 22:07:01,367 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 22:07:01,367 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 22:07:01,369 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 22:07:01,369 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 22:07:01,369 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 22:07:01,369 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 22:07:01,370 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 22:07:01,370 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 22:07:01,370 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 22:07:01,370 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 22:07:01,370 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 22:07:01,370 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 22:07:01,370 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-09 22:07:01,371 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 22:07:01,371 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 22:07:01,371 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 22:07:01,371 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 22:07:01,371 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 22:07:01,371 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 22:07:01,372 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 22:07:01,372 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 22:07:01,372 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 22:07:01,372 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 22:07:01,373 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 22:07:01,373 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 22:07:01,374 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 22:07:01,374 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 9aabbeff87ba819b44dc608a3105d0ba81b71cd88693ecf2e6bf3860a7863e64 [2024-11-09 22:07:01,603 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 22:07:01,632 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 22:07:01,635 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 22:07:01,636 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 22:07:01,636 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 22:07:01,637 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/dll2c_append_unequal.i [2024-11-09 22:07:02,950 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 22:07:03,143 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 22:07:03,144 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2c_append_unequal.i [2024-11-09 22:07:03,157 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f5d2c3678/862c305058554d218c76343250abd4a7/FLAG989a7f677 [2024-11-09 22:07:03,527 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f5d2c3678/862c305058554d218c76343250abd4a7 [2024-11-09 22:07:03,529 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 22:07:03,530 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 22:07:03,536 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 22:07:03,536 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 22:07:03,540 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 22:07:03,541 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 10:07:03" (1/1) ... [2024-11-09 22:07:03,541 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@20bed17b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:07:03, skipping insertion in model container [2024-11-09 22:07:03,542 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 10:07:03" (1/1) ... [2024-11-09 22:07:03,576 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 22:07:03,897 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2c_append_unequal.i[24672,24685] [2024-11-09 22:07:03,904 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 22:07:03,911 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 22:07:03,959 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2c_append_unequal.i[24672,24685] [2024-11-09 22:07:03,961 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 22:07:03,989 INFO L204 MainTranslator]: Completed translation [2024-11-09 22:07:03,989 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:07:03 WrapperNode [2024-11-09 22:07:03,989 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 22:07:03,990 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 22:07:03,991 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 22:07:03,991 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 22:07:03,996 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:07:03" (1/1) ... [2024-11-09 22:07:04,009 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:07:03" (1/1) ... [2024-11-09 22:07:04,032 INFO L138 Inliner]: procedures = 127, calls = 49, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 146 [2024-11-09 22:07:04,032 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 22:07:04,033 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 22:07:04,033 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 22:07:04,034 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 22:07:04,042 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:07:03" (1/1) ... [2024-11-09 22:07:04,043 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:07:03" (1/1) ... [2024-11-09 22:07:04,045 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:07:03" (1/1) ... [2024-11-09 22:07:04,062 INFO L175 MemorySlicer]: Split 31 memory accesses to 3 slices as follows [2, 20, 9]. 65 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 0, 1]. The 14 writes are split as follows [0, 13, 1]. [2024-11-09 22:07:04,062 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:07:03" (1/1) ... [2024-11-09 22:07:04,062 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:07:03" (1/1) ... [2024-11-09 22:07:04,073 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:07:03" (1/1) ... [2024-11-09 22:07:04,074 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:07:03" (1/1) ... [2024-11-09 22:07:04,075 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:07:03" (1/1) ... [2024-11-09 22:07:04,076 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:07:03" (1/1) ... [2024-11-09 22:07:04,079 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 22:07:04,080 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-09 22:07:04,080 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-09 22:07:04,080 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-09 22:07:04,081 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:07:03" (1/1) ... [2024-11-09 22:07:04,089 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 22:07:04,098 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 22:07:04,114 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-09 22:07:04,118 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-09 22:07:04,163 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-09 22:07:04,163 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-09 22:07:04,163 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-09 22:07:04,163 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-09 22:07:04,163 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-09 22:07:04,163 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-09 22:07:04,164 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2024-11-09 22:07:04,164 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2024-11-09 22:07:04,164 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-09 22:07:04,164 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 22:07:04,164 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-09 22:07:04,164 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-09 22:07:04,164 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-09 22:07:04,164 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-09 22:07:04,164 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-09 22:07:04,164 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-09 22:07:04,164 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-09 22:07:04,164 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-09 22:07:04,165 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-09 22:07:04,165 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-09 22:07:04,165 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-11-09 22:07:04,165 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 22:07:04,165 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-09 22:07:04,165 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-09 22:07:04,165 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 22:07:04,165 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 22:07:04,285 INFO L256 CfgBuilder]: Building ICFG [2024-11-09 22:07:04,287 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 22:07:04,440 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L629: call ULTIMATE.dealloc(main_~#s~0#1.base, main_~#s~0#1.offset);havoc main_~#s~0#1.base, main_~#s~0#1.offset; [2024-11-09 22:07:04,461 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint myexit_returnLabel#1: assume true;havoc myexit_~s#1;havoc myexit_#in~s#1;assume { :end_inline_myexit } true; [2024-11-09 22:07:04,474 INFO L? ?]: Removed 55 outVars from TransFormulas that were not future-live. [2024-11-09 22:07:04,474 INFO L307 CfgBuilder]: Performing block encoding [2024-11-09 22:07:04,488 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 22:07:04,490 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-09 22:07:04,491 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 10:07:04 BoogieIcfgContainer [2024-11-09 22:07:04,491 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-09 22:07:04,492 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 22:07:04,492 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 22:07:04,497 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 22:07:04,497 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 10:07:03" (1/3) ... [2024-11-09 22:07:04,498 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d4edaed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 10:07:04, skipping insertion in model container [2024-11-09 22:07:04,498 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:07:03" (2/3) ... [2024-11-09 22:07:04,498 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d4edaed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 10:07:04, skipping insertion in model container [2024-11-09 22:07:04,499 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 10:07:04" (3/3) ... [2024-11-09 22:07:04,502 INFO L112 eAbstractionObserver]: Analyzing ICFG dll2c_append_unequal.i [2024-11-09 22:07:04,516 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 22:07:04,516 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 22:07:04,556 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 22:07:04,561 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;@47d2ada8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 22:07:04,562 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 22:07:04,566 INFO L276 IsEmpty]: Start isEmpty. Operand has 40 states, 34 states have (on average 1.411764705882353) internal successors, (48), 35 states have internal predecessors, (48), 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-09 22:07:04,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-09 22:07:04,572 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 22:07:04,572 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, 1] [2024-11-09 22:07:04,572 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 22:07:04,576 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 22:07:04,576 INFO L85 PathProgramCache]: Analyzing trace with hash -1850886095, now seen corresponding path program 1 times [2024-11-09 22:07:04,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 22:07:04,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201189883] [2024-11-09 22:07:04,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:07:04,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 22:07:04,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:07:04,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 22:07:04,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:07:04,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-09 22:07:04,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:07:04,876 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-09 22:07:04,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 22:07:04,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [201189883] [2024-11-09 22:07:04,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [201189883] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 22:07:04,882 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 22:07:04,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 22:07:04,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357193160] [2024-11-09 22:07:04,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 22:07:04,887 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 22:07:04,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 22:07:04,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 22:07:04,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 22:07:04,908 INFO L87 Difference]: Start difference. First operand has 40 states, 34 states have (on average 1.411764705882353) internal successors, (48), 35 states have internal predecessors, (48), 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.666666666666667) internal successors, (17), 2 states have internal predecessors, (17), 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-09 22:07:04,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 22:07:04,971 INFO L93 Difference]: Finished difference Result 69 states and 92 transitions. [2024-11-09 22:07:04,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 22:07:04,974 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 2 states have internal predecessors, (17), 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 25 [2024-11-09 22:07:04,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 22:07:04,978 INFO L225 Difference]: With dead ends: 69 [2024-11-09 22:07:04,979 INFO L226 Difference]: Without dead ends: 30 [2024-11-09 22:07:04,981 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-09 22:07:04,983 INFO L432 NwaCegarLoop]: 48 mSDtfsCounter, 0 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 78 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-09 22:07:04,984 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 78 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 22:07:04,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2024-11-09 22:07:05,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2024-11-09 22:07:05,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 25 states have (on average 1.24) internal successors, (31), 25 states have internal predecessors, (31), 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-09 22:07:05,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 37 transitions. [2024-11-09 22:07:05,010 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 37 transitions. Word has length 25 [2024-11-09 22:07:05,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 22:07:05,011 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 37 transitions. [2024-11-09 22:07:05,012 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 2 states have internal predecessors, (17), 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-09 22:07:05,012 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 37 transitions. [2024-11-09 22:07:05,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-09 22:07:05,013 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 22:07:05,013 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, 1, 1] [2024-11-09 22:07:05,013 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 22:07:05,014 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 22:07:05,014 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 22:07:05,014 INFO L85 PathProgramCache]: Analyzing trace with hash 12397201, now seen corresponding path program 1 times [2024-11-09 22:07:05,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 22:07:05,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970731514] [2024-11-09 22:07:05,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:07:05,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 22:07:05,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:07:05,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 22:07:05,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:07:05,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-09 22:07:05,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:07:05,272 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-09 22:07:05,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 22:07:05,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1970731514] [2024-11-09 22:07:05,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1970731514] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 22:07:05,273 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 22:07:05,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 22:07:05,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1161563994] [2024-11-09 22:07:05,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 22:07:05,274 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 22:07:05,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 22:07:05,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 22:07:05,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 22:07:05,275 INFO L87 Difference]: Start difference. First operand 30 states and 37 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 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-09 22:07:05,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 22:07:05,330 INFO L93 Difference]: Finished difference Result 56 states and 69 transitions. [2024-11-09 22:07:05,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 22:07:05,330 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 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 26 [2024-11-09 22:07:05,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 22:07:05,332 INFO L225 Difference]: With dead ends: 56 [2024-11-09 22:07:05,332 INFO L226 Difference]: Without dead ends: 36 [2024-11-09 22:07:05,332 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-09 22:07:05,333 INFO L432 NwaCegarLoop]: 34 mSDtfsCounter, 4 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 22:07:05,334 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 83 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 22:07:05,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2024-11-09 22:07:05,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 32. [2024-11-09 22:07:05,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 27 states have internal predecessors, (33), 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-09 22:07:05,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 39 transitions. [2024-11-09 22:07:05,341 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 39 transitions. Word has length 26 [2024-11-09 22:07:05,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 22:07:05,341 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 39 transitions. [2024-11-09 22:07:05,342 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 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-09 22:07:05,342 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 39 transitions. [2024-11-09 22:07:05,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-09 22:07:05,343 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 22:07:05,344 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-09 22:07:05,344 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 22:07:05,344 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 22:07:05,345 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 22:07:05,345 INFO L85 PathProgramCache]: Analyzing trace with hash -2125706348, now seen corresponding path program 1 times [2024-11-09 22:07:05,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 22:07:05,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [86972356] [2024-11-09 22:07:05,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:07:05,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 22:07:05,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:07:05,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 22:07:05,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:07:05,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 22:07:05,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:07:05,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-09 22:07:05,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:07:05,545 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-09 22:07:05,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 22:07:05,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [86972356] [2024-11-09 22:07:05,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [86972356] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 22:07:05,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [784836887] [2024-11-09 22:07:05,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:07:05,547 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 22:07:05,547 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 22:07:05,549 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 22:07:05,550 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-09 22:07:05,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:07:05,691 INFO L255 TraceCheckSpWp]: Trace formula consists of 370 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-09 22:07:05,695 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 22:07:05,740 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 22:07:05,740 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 22:07:05,785 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-09 22:07:05,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [784836887] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 22:07:05,785 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 22:07:05,785 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 7 [2024-11-09 22:07:05,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [964008730] [2024-11-09 22:07:05,786 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 22:07:05,786 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 22:07:05,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 22:07:05,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 22:07:05,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-09 22:07:05,787 INFO L87 Difference]: Start difference. First operand 32 states and 39 transitions. Second operand has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 5 states have internal predecessors, (33), 3 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-09 22:07:05,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 22:07:05,840 INFO L93 Difference]: Finished difference Result 61 states and 76 transitions. [2024-11-09 22:07:05,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 22:07:05,840 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 5 states have internal predecessors, (33), 3 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 37 [2024-11-09 22:07:05,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 22:07:05,841 INFO L225 Difference]: With dead ends: 61 [2024-11-09 22:07:05,841 INFO L226 Difference]: Without dead ends: 35 [2024-11-09 22:07:05,842 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-09 22:07:05,842 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 0 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 22:07:05,843 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 166 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 22:07:05,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2024-11-09 22:07:05,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2024-11-09 22:07:05,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 29 states have (on average 1.206896551724138) internal successors, (35), 29 states have internal predecessors, (35), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-09 22:07:05,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 43 transitions. [2024-11-09 22:07:05,847 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 43 transitions. Word has length 37 [2024-11-09 22:07:05,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 22:07:05,848 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 43 transitions. [2024-11-09 22:07:05,848 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 5 states have internal predecessors, (33), 3 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-09 22:07:05,848 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 43 transitions. [2024-11-09 22:07:05,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-09 22:07:05,851 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 22:07:05,851 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-09 22:07:05,864 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-09 22:07:06,054 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 22:07:06,055 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 22:07:06,055 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 22:07:06,055 INFO L85 PathProgramCache]: Analyzing trace with hash -1281234477, now seen corresponding path program 1 times [2024-11-09 22:07:06,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 22:07:06,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [226545214] [2024-11-09 22:07:06,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:07:06,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 22:07:06,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:07:06,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 22:07:06,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:07:06,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 22:07:06,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:07:06,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-09 22:07:06,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:07:06,437 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-09 22:07:06,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 22:07:06,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [226545214] [2024-11-09 22:07:06,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [226545214] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 22:07:06,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1334744839] [2024-11-09 22:07:06,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:07:06,440 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 22:07:06,440 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 22:07:06,442 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 22:07:06,443 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-09 22:07:06,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:07:06,581 INFO L255 TraceCheckSpWp]: Trace formula consists of 379 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-09 22:07:06,583 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 22:07:06,725 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-09 22:07:06,746 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 22:07:06,746 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 22:07:06,792 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-09 22:07:06,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1334744839] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 22:07:06,793 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 22:07:06,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 10] total 14 [2024-11-09 22:07:06,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299027219] [2024-11-09 22:07:06,793 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 22:07:06,794 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-09 22:07:06,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 22:07:06,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-09 22:07:06,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2024-11-09 22:07:06,795 INFO L87 Difference]: Start difference. First operand 35 states and 43 transitions. Second operand has 14 states, 14 states have (on average 2.5714285714285716) internal successors, (36), 12 states have internal predecessors, (36), 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-09 22:07:10,814 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-09 22:07:14,853 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-09 22:07:18,864 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-09 22:07:22,883 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-09 22:07:26,918 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-09 22:07:31,121 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-09 22:07:35,146 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-09 22:07:35,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 22:07:35,149 INFO L93 Difference]: Finished difference Result 66 states and 79 transitions. [2024-11-09 22:07:35,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-09 22:07:35,150 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.5714285714285716) internal successors, (36), 12 states have internal predecessors, (36), 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 37 [2024-11-09 22:07:35,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 22:07:35,150 INFO L225 Difference]: With dead ends: 66 [2024-11-09 22:07:35,150 INFO L226 Difference]: Without dead ends: 40 [2024-11-09 22:07:35,151 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 74 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=56, Invalid=324, Unknown=0, NotChecked=0, Total=380 [2024-11-09 22:07:35,152 INFO L432 NwaCegarLoop]: 27 mSDtfsCounter, 17 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 193 mSolverCounterSat, 1 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 28.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 289 SdHoareTripleChecker+Invalid, 201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 193 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 28.2s IncrementalHoareTripleChecker+Time [2024-11-09 22:07:35,152 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 289 Invalid, 201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 193 Invalid, 7 Unknown, 0 Unchecked, 28.2s Time] [2024-11-09 22:07:35,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2024-11-09 22:07:35,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 37. [2024-11-09 22:07:35,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 31 states have (on average 1.1290322580645162) internal successors, (35), 31 states have internal predecessors, (35), 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-09 22:07:35,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 41 transitions. [2024-11-09 22:07:35,158 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 41 transitions. Word has length 37 [2024-11-09 22:07:35,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 22:07:35,159 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 41 transitions. [2024-11-09 22:07:35,159 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.5714285714285716) internal successors, (36), 12 states have internal predecessors, (36), 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-09 22:07:35,159 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2024-11-09 22:07:35,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-09 22:07:35,160 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 22:07:35,160 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-09 22:07:35,175 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-09 22:07:35,360 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2024-11-09 22:07:35,361 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 22:07:35,361 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 22:07:35,361 INFO L85 PathProgramCache]: Analyzing trace with hash -1252605326, now seen corresponding path program 1 times [2024-11-09 22:07:35,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 22:07:35,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [978849942] [2024-11-09 22:07:35,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:07:35,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 22:07:35,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:07:36,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 22:07:36,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:07:36,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 22:07:36,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:07:36,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-09 22:07:36,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:07:37,112 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-09 22:07:37,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 22:07:37,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [978849942] [2024-11-09 22:07:37,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [978849942] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 22:07:37,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1399124257] [2024-11-09 22:07:37,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:07:37,113 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 22:07:37,114 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 22:07:37,115 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 22:07:37,116 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-09 22:07:37,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:07:37,490 INFO L255 TraceCheckSpWp]: Trace formula consists of 384 conjuncts, 120 conjuncts are in the unsatisfiable core [2024-11-09 22:07:37,496 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 22:07:37,538 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-09 22:07:37,734 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-09 22:07:37,811 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-09 22:07:37,811 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-09 22:07:37,871 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-09 22:07:37,941 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-09 22:07:38,074 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 22:07:38,081 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 23 [2024-11-09 22:07:38,084 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 11 [2024-11-09 22:07:38,091 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 32 [2024-11-09 22:07:38,098 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 48 treesize of output 19 [2024-11-09 22:07:38,106 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1 [2024-11-09 22:07:38,226 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-09 22:07:38,230 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-09 22:07:38,234 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-09 22:07:38,449 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 22:07:38,450 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-09 22:07:38,469 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2024-11-09 22:07:38,470 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-09 22:07:38,484 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2024-11-09 22:07:38,659 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 84 treesize of output 52 [2024-11-09 22:07:38,662 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 22:07:38,663 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 22:07:38,667 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 45 treesize of output 36 [2024-11-09 22:07:38,674 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 26 treesize of output 15 [2024-11-09 22:07:38,731 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 19 treesize of output 11 [2024-11-09 22:07:38,794 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 22:07:38,794 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 22:07:39,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1399124257] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 22:07:39,218 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 22:07:39,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 24] total 43 [2024-11-09 22:07:39,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541097415] [2024-11-09 22:07:39,219 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 22:07:39,219 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2024-11-09 22:07:39,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 22:07:39,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2024-11-09 22:07:39,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=2065, Unknown=40, NotChecked=0, Total=2256 [2024-11-09 22:07:39,220 INFO L87 Difference]: Start difference. First operand 37 states and 41 transitions. Second operand has 43 states, 39 states have (on average 1.435897435897436) internal successors, (56), 34 states have internal predecessors, (56), 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-09 22:07:40,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 22:07:40,304 INFO L93 Difference]: Finished difference Result 70 states and 79 transitions. [2024-11-09 22:07:40,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-09 22:07:40,304 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 39 states have (on average 1.435897435897436) internal successors, (56), 34 states have internal predecessors, (56), 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 37 [2024-11-09 22:07:40,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 22:07:40,306 INFO L225 Difference]: With dead ends: 70 [2024-11-09 22:07:40,306 INFO L226 Difference]: Without dead ends: 67 [2024-11-09 22:07:40,307 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 878 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=262, Invalid=3478, Unknown=42, NotChecked=0, Total=3782 [2024-11-09 22:07:40,307 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 48 mSDsluCounter, 402 mSDsCounter, 0 mSdLazyCounter, 713 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 422 SdHoareTripleChecker+Invalid, 727 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 713 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-09 22:07:40,307 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 422 Invalid, 727 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 713 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-09 22:07:40,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2024-11-09 22:07:40,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 56. [2024-11-09 22:07:40,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 47 states have (on average 1.1063829787234043) internal successors, (52), 47 states have internal predecessors, (52), 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-09 22:07:40,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 62 transitions. [2024-11-09 22:07:40,315 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 62 transitions. Word has length 37 [2024-11-09 22:07:40,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 22:07:40,315 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 62 transitions. [2024-11-09 22:07:40,315 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 39 states have (on average 1.435897435897436) internal successors, (56), 34 states have internal predecessors, (56), 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-09 22:07:40,316 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 62 transitions. [2024-11-09 22:07:40,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-09 22:07:40,316 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 22:07:40,316 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-09 22:07:40,332 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-09 22:07:40,517 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 22:07:40,518 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 22:07:40,518 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 22:07:40,518 INFO L85 PathProgramCache]: Analyzing trace with hash -1610190524, now seen corresponding path program 1 times [2024-11-09 22:07:40,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 22:07:40,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988789068] [2024-11-09 22:07:40,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:07:40,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 22:07:40,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:07:41,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 22:07:41,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:07:41,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 22:07:41,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:07:41,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-09 22:07:41,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:07:41,966 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-09 22:07:41,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 22:07:41,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [988789068] [2024-11-09 22:07:41,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [988789068] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 22:07:41,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [687161939] [2024-11-09 22:07:41,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:07:41,967 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 22:07:41,967 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 22:07:41,969 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 22:07:41,970 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-09 22:07:42,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:07:42,353 INFO L255 TraceCheckSpWp]: Trace formula consists of 406 conjuncts, 91 conjuncts are in the unsatisfiable core [2024-11-09 22:07:42,357 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 22:07:42,377 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-09 22:07:42,525 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-09 22:07:42,525 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-09 22:07:42,566 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-09 22:07:42,606 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-09 22:07:42,606 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 41 treesize of output 38 [2024-11-09 22:07:42,713 INFO L349 Elim1Store]: treesize reduction 52, result has 22.4 percent of original size [2024-11-09 22:07:42,714 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 2 case distinctions, treesize of input 67 treesize of output 36 [2024-11-09 22:07:42,886 INFO L349 Elim1Store]: treesize reduction 42, result has 2.3 percent of original size [2024-11-09 22:07:42,887 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 96 treesize of output 27 [2024-11-09 22:07:42,890 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-09 22:07:42,977 INFO L349 Elim1Store]: treesize reduction 8, result has 77.1 percent of original size [2024-11-09 22:07:42,978 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 34 treesize of output 36 [2024-11-09 22:07:47,020 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (and (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| 0) (let ((.cse4 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse5 (+ .cse4 4))) (or (exists ((|v_ULTIMATE.start_dll_circular_create_~last~0#1.offset_9| Int) (|v_old(#memory_$Pointer$#1.base)_AFTER_CALL_12| (Array Int (Array Int Int)))) (let ((.cse3 (select |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_12| .cse1))) (let ((.cse2 (select .cse3 .cse5)) (.cse0 (@diff |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_12| |c_#memory_$Pointer$#1.base|))) (and (= |c_#memory_$Pointer$#1.base| (store |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_12| .cse0 (select |c_#memory_$Pointer$#1.base| .cse0))) (not (= .cse1 .cse2)) (= (select .cse3 .cse4) .cse2) (= .cse1 (select (select |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_12| .cse2) |v_ULTIMATE.start_dll_circular_create_~last~0#1.offset_9|)) (not (= |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| .cse2)) (= |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| .cse0))))) (let ((.cse7 (select |c_#memory_$Pointer$#1.base| .cse1))) (let ((.cse6 (select .cse7 .cse5))) (and (not (= |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| .cse6)) (= (select .cse7 .cse4) .cse6) (not (= .cse6 .cse1)) (exists ((|v_ULTIMATE.start_dll_circular_create_~last~0#1.offset_9| Int)) (= .cse1 (select (select |c_#memory_$Pointer$#1.base| .cse6) |v_ULTIMATE.start_dll_circular_create_~last~0#1.offset_9|))))))))) (not (= |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| .cse1)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) is different from false [2024-11-09 22:07:47,022 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (and (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| 0) (let ((.cse4 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse5 (+ .cse4 4))) (or (exists ((|v_ULTIMATE.start_dll_circular_create_~last~0#1.offset_9| Int) (|v_old(#memory_$Pointer$#1.base)_AFTER_CALL_12| (Array Int (Array Int Int)))) (let ((.cse3 (select |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_12| .cse1))) (let ((.cse2 (select .cse3 .cse5)) (.cse0 (@diff |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_12| |c_#memory_$Pointer$#1.base|))) (and (= |c_#memory_$Pointer$#1.base| (store |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_12| .cse0 (select |c_#memory_$Pointer$#1.base| .cse0))) (not (= .cse1 .cse2)) (= (select .cse3 .cse4) .cse2) (= .cse1 (select (select |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_12| .cse2) |v_ULTIMATE.start_dll_circular_create_~last~0#1.offset_9|)) (not (= |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| .cse2)) (= |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| .cse0))))) (let ((.cse7 (select |c_#memory_$Pointer$#1.base| .cse1))) (let ((.cse6 (select .cse7 .cse5))) (and (not (= |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| .cse6)) (= (select .cse7 .cse4) .cse6) (not (= .cse6 .cse1)) (exists ((|v_ULTIMATE.start_dll_circular_create_~last~0#1.offset_9| Int)) (= .cse1 (select (select |c_#memory_$Pointer$#1.base| .cse6) |v_ULTIMATE.start_dll_circular_create_~last~0#1.offset_9|))))))))) (not (= |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| .cse1)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) is different from true [2024-11-09 22:07:51,062 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (and (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (not (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| .cse0)) (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse4 (+ .cse2 4))) (or (let ((.cse1 (select |c_#memory_$Pointer$#1.base| .cse0))) (let ((.cse3 (select .cse1 .cse4))) (and (= (select .cse1 .cse2) .cse3) (not (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| .cse3)) (not (= .cse3 .cse0)) (exists ((|v_ULTIMATE.start_dll_circular_create_~last~0#1.offset_9| Int)) (= .cse0 (select (select |c_#memory_$Pointer$#1.base| .cse3) |v_ULTIMATE.start_dll_circular_create_~last~0#1.offset_9|)))))) (exists ((|v_ULTIMATE.start_dll_circular_create_~last~0#1.offset_9| Int) (|v_old(#memory_$Pointer$#1.base)_AFTER_CALL_12| (Array Int (Array Int Int)))) (let ((.cse7 (select |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_12| .cse0))) (let ((.cse5 (@diff |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_12| |c_#memory_$Pointer$#1.base|)) (.cse6 (select .cse7 .cse4))) (and (= |c_#memory_$Pointer$#1.base| (store |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_12| .cse5 (select |c_#memory_$Pointer$#1.base| .cse5))) (not (= .cse0 .cse6)) (= (select .cse7 .cse2) .cse6) (= .cse0 (select (select |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_12| .cse6) |v_ULTIMATE.start_dll_circular_create_~last~0#1.offset_9|)) (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| .cse5) (not (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| .cse6))))))))))) is different from false [2024-11-09 22:07:55,064 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (and (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (not (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| .cse0)) (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse4 (+ .cse2 4))) (or (let ((.cse1 (select |c_#memory_$Pointer$#1.base| .cse0))) (let ((.cse3 (select .cse1 .cse4))) (and (= (select .cse1 .cse2) .cse3) (not (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| .cse3)) (not (= .cse3 .cse0)) (exists ((|v_ULTIMATE.start_dll_circular_create_~last~0#1.offset_9| Int)) (= .cse0 (select (select |c_#memory_$Pointer$#1.base| .cse3) |v_ULTIMATE.start_dll_circular_create_~last~0#1.offset_9|)))))) (exists ((|v_ULTIMATE.start_dll_circular_create_~last~0#1.offset_9| Int) (|v_old(#memory_$Pointer$#1.base)_AFTER_CALL_12| (Array Int (Array Int Int)))) (let ((.cse7 (select |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_12| .cse0))) (let ((.cse5 (@diff |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_12| |c_#memory_$Pointer$#1.base|)) (.cse6 (select .cse7 .cse4))) (and (= |c_#memory_$Pointer$#1.base| (store |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_12| .cse5 (select |c_#memory_$Pointer$#1.base| .cse5))) (not (= .cse0 .cse6)) (= (select .cse7 .cse2) .cse6) (= .cse0 (select (select |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_12| .cse6) |v_ULTIMATE.start_dll_circular_create_~last~0#1.offset_9|)) (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| .cse5) (not (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| .cse6))))))))))) is different from true [2024-11-09 22:07:55,095 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 413 treesize of output 357 [2024-11-09 22:07:55,169 INFO L349 Elim1Store]: treesize reduction 636, result has 7.0 percent of original size [2024-11-09 22:07:55,169 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 4 new quantified variables, introduced 5 case distinctions, treesize of input 466 treesize of output 135 [2024-11-09 22:07:55,217 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse8 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0)) (.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse12 (select |c_#memory_$Pointer$#1.base| .cse1)) (.cse3 (+ .cse8 4))) (let ((.cse0 (select .cse12 .cse3))) (and (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (not (= .cse0 .cse1)) (or (exists ((|v_#memory_$Pointer$#1.base_74| (Array Int (Array Int Int))) (v_arrayElimCell_36 Int) (|v_ULTIMATE.start_dll_circular_append_~new_last~0#1.offset_14| Int)) (and (= (let ((.cse2 (let ((.cse5 (select (select |v_#memory_$Pointer$#1.base_74| .cse1) .cse3))) (let ((.cse4 (store |v_#memory_$Pointer$#1.base_74| .cse5 (store (select |v_#memory_$Pointer$#1.base_74| .cse5) v_arrayElimCell_36 .cse0)))) (store .cse4 .cse0 (store (store (select .cse4 .cse0) (+ 4 |v_ULTIMATE.start_dll_circular_append_~new_last~0#1.offset_14|) .cse5) |v_ULTIMATE.start_dll_circular_append_~new_last~0#1.offset_14| .cse1)))))) (store .cse2 .cse1 (store (select .cse2 .cse1) .cse3 .cse0))) |c_#memory_$Pointer$#1.base|) (exists ((|v_ULTIMATE.start_dll_circular_create_~last~0#1.offset_9| Int) (|v_old(#memory_$Pointer$#1.base)_AFTER_CALL_12| (Array Int (Array Int Int)))) (let ((.cse7 (select |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_12| .cse1))) (let ((.cse6 (select .cse7 .cse3)) (.cse9 (@diff |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_12| |v_#memory_$Pointer$#1.base_74|))) (and (not (= .cse1 .cse6)) (= (select .cse7 .cse8) .cse6) (= .cse1 (select (select |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_12| .cse6) |v_ULTIMATE.start_dll_circular_create_~last~0#1.offset_9|)) (= (store |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_12| .cse9 (select |v_#memory_$Pointer$#1.base_74| .cse9)) |v_#memory_$Pointer$#1.base_74|) (not (= .cse0 .cse6)) (= .cse9 .cse0))))))) (let ((.cse11 (select .cse12 .cse8))) (and (exists ((|v_ULTIMATE.start_dll_circular_append_~new_last~0#1.offset_14| Int)) (let ((.cse10 (select |c_#memory_$Pointer$#1.base| .cse0))) (and (= (select .cse10 (+ 4 |v_ULTIMATE.start_dll_circular_append_~new_last~0#1.offset_14|)) .cse11) (= .cse1 (select .cse10 |v_ULTIMATE.start_dll_circular_append_~new_last~0#1.offset_14|))))) (exists ((v_arrayElimCell_36 Int)) (= (select (select |c_#memory_$Pointer$#1.base| .cse11) v_arrayElimCell_36) .cse0)) (not (= .cse11 .cse1)) (not (= .cse11 .cse0))))))))) is different from false [2024-11-09 22:07:55,219 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse8 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0)) (.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse12 (select |c_#memory_$Pointer$#1.base| .cse1)) (.cse3 (+ .cse8 4))) (let ((.cse0 (select .cse12 .cse3))) (and (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (not (= .cse0 .cse1)) (or (exists ((|v_#memory_$Pointer$#1.base_74| (Array Int (Array Int Int))) (v_arrayElimCell_36 Int) (|v_ULTIMATE.start_dll_circular_append_~new_last~0#1.offset_14| Int)) (and (= (let ((.cse2 (let ((.cse5 (select (select |v_#memory_$Pointer$#1.base_74| .cse1) .cse3))) (let ((.cse4 (store |v_#memory_$Pointer$#1.base_74| .cse5 (store (select |v_#memory_$Pointer$#1.base_74| .cse5) v_arrayElimCell_36 .cse0)))) (store .cse4 .cse0 (store (store (select .cse4 .cse0) (+ 4 |v_ULTIMATE.start_dll_circular_append_~new_last~0#1.offset_14|) .cse5) |v_ULTIMATE.start_dll_circular_append_~new_last~0#1.offset_14| .cse1)))))) (store .cse2 .cse1 (store (select .cse2 .cse1) .cse3 .cse0))) |c_#memory_$Pointer$#1.base|) (exists ((|v_ULTIMATE.start_dll_circular_create_~last~0#1.offset_9| Int) (|v_old(#memory_$Pointer$#1.base)_AFTER_CALL_12| (Array Int (Array Int Int)))) (let ((.cse7 (select |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_12| .cse1))) (let ((.cse6 (select .cse7 .cse3)) (.cse9 (@diff |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_12| |v_#memory_$Pointer$#1.base_74|))) (and (not (= .cse1 .cse6)) (= (select .cse7 .cse8) .cse6) (= .cse1 (select (select |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_12| .cse6) |v_ULTIMATE.start_dll_circular_create_~last~0#1.offset_9|)) (= (store |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_12| .cse9 (select |v_#memory_$Pointer$#1.base_74| .cse9)) |v_#memory_$Pointer$#1.base_74|) (not (= .cse0 .cse6)) (= .cse9 .cse0))))))) (let ((.cse11 (select .cse12 .cse8))) (and (exists ((|v_ULTIMATE.start_dll_circular_append_~new_last~0#1.offset_14| Int)) (let ((.cse10 (select |c_#memory_$Pointer$#1.base| .cse0))) (and (= (select .cse10 (+ 4 |v_ULTIMATE.start_dll_circular_append_~new_last~0#1.offset_14|)) .cse11) (= .cse1 (select .cse10 |v_ULTIMATE.start_dll_circular_append_~new_last~0#1.offset_14|))))) (exists ((v_arrayElimCell_36 Int)) (= (select (select |c_#memory_$Pointer$#1.base| .cse11) v_arrayElimCell_36) .cse0)) (not (= .cse11 .cse1)) (not (= .cse11 .cse0))))))))) is different from true [2024-11-09 22:07:55,294 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0)) (.cse2 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse12 (select |c_#memory_$Pointer$#1.base| .cse2)) (.cse4 (+ .cse0 4))) (let ((.cse1 (select .cse12 .cse4))) (and (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= .cse0 |c_ULTIMATE.start_main_~ptr~0#1.offset|) (not (= .cse1 .cse2)) (or (exists ((|v_#memory_$Pointer$#1.base_74| (Array Int (Array Int Int))) (v_arrayElimCell_36 Int) (|v_ULTIMATE.start_dll_circular_append_~new_last~0#1.offset_14| Int)) (and (= (let ((.cse3 (let ((.cse6 (select (select |v_#memory_$Pointer$#1.base_74| .cse2) .cse4))) (let ((.cse5 (store |v_#memory_$Pointer$#1.base_74| .cse6 (store (select |v_#memory_$Pointer$#1.base_74| .cse6) v_arrayElimCell_36 .cse1)))) (store .cse5 .cse1 (store (store (select .cse5 .cse1) (+ 4 |v_ULTIMATE.start_dll_circular_append_~new_last~0#1.offset_14|) .cse6) |v_ULTIMATE.start_dll_circular_append_~new_last~0#1.offset_14| .cse2)))))) (store .cse3 .cse2 (store (select .cse3 .cse2) .cse4 .cse1))) |c_#memory_$Pointer$#1.base|) (exists ((|v_ULTIMATE.start_dll_circular_create_~last~0#1.offset_9| Int) (|v_old(#memory_$Pointer$#1.base)_AFTER_CALL_12| (Array Int (Array Int Int)))) (let ((.cse8 (select |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_12| .cse2))) (let ((.cse7 (select .cse8 .cse4)) (.cse9 (@diff |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_12| |v_#memory_$Pointer$#1.base_74|))) (and (not (= .cse2 .cse7)) (= (select .cse8 .cse0) .cse7) (= .cse2 (select (select |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_12| .cse7) |v_ULTIMATE.start_dll_circular_create_~last~0#1.offset_9|)) (= (store |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_12| .cse9 (select |v_#memory_$Pointer$#1.base_74| .cse9)) |v_#memory_$Pointer$#1.base_74|) (not (= .cse1 .cse7)) (= .cse9 .cse1))))))) (let ((.cse11 (select .cse12 .cse0))) (and (exists ((|v_ULTIMATE.start_dll_circular_append_~new_last~0#1.offset_14| Int)) (let ((.cse10 (select |c_#memory_$Pointer$#1.base| .cse1))) (and (= (select .cse10 (+ 4 |v_ULTIMATE.start_dll_circular_append_~new_last~0#1.offset_14|)) .cse11) (= .cse2 (select .cse10 |v_ULTIMATE.start_dll_circular_append_~new_last~0#1.offset_14|))))) (exists ((v_arrayElimCell_36 Int)) (= (select (select |c_#memory_$Pointer$#1.base| .cse11) v_arrayElimCell_36) .cse1)) (not (= .cse11 .cse2)) (not (= .cse11 .cse1))))) (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse2))))) is different from false [2024-11-09 22:07:55,299 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0)) (.cse2 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse12 (select |c_#memory_$Pointer$#1.base| .cse2)) (.cse4 (+ .cse0 4))) (let ((.cse1 (select .cse12 .cse4))) (and (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= .cse0 |c_ULTIMATE.start_main_~ptr~0#1.offset|) (not (= .cse1 .cse2)) (or (exists ((|v_#memory_$Pointer$#1.base_74| (Array Int (Array Int Int))) (v_arrayElimCell_36 Int) (|v_ULTIMATE.start_dll_circular_append_~new_last~0#1.offset_14| Int)) (and (= (let ((.cse3 (let ((.cse6 (select (select |v_#memory_$Pointer$#1.base_74| .cse2) .cse4))) (let ((.cse5 (store |v_#memory_$Pointer$#1.base_74| .cse6 (store (select |v_#memory_$Pointer$#1.base_74| .cse6) v_arrayElimCell_36 .cse1)))) (store .cse5 .cse1 (store (store (select .cse5 .cse1) (+ 4 |v_ULTIMATE.start_dll_circular_append_~new_last~0#1.offset_14|) .cse6) |v_ULTIMATE.start_dll_circular_append_~new_last~0#1.offset_14| .cse2)))))) (store .cse3 .cse2 (store (select .cse3 .cse2) .cse4 .cse1))) |c_#memory_$Pointer$#1.base|) (exists ((|v_ULTIMATE.start_dll_circular_create_~last~0#1.offset_9| Int) (|v_old(#memory_$Pointer$#1.base)_AFTER_CALL_12| (Array Int (Array Int Int)))) (let ((.cse8 (select |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_12| .cse2))) (let ((.cse7 (select .cse8 .cse4)) (.cse9 (@diff |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_12| |v_#memory_$Pointer$#1.base_74|))) (and (not (= .cse2 .cse7)) (= (select .cse8 .cse0) .cse7) (= .cse2 (select (select |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_12| .cse7) |v_ULTIMATE.start_dll_circular_create_~last~0#1.offset_9|)) (= (store |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_12| .cse9 (select |v_#memory_$Pointer$#1.base_74| .cse9)) |v_#memory_$Pointer$#1.base_74|) (not (= .cse1 .cse7)) (= .cse9 .cse1))))))) (let ((.cse11 (select .cse12 .cse0))) (and (exists ((|v_ULTIMATE.start_dll_circular_append_~new_last~0#1.offset_14| Int)) (let ((.cse10 (select |c_#memory_$Pointer$#1.base| .cse1))) (and (= (select .cse10 (+ 4 |v_ULTIMATE.start_dll_circular_append_~new_last~0#1.offset_14|)) .cse11) (= .cse2 (select .cse10 |v_ULTIMATE.start_dll_circular_append_~new_last~0#1.offset_14|))))) (exists ((v_arrayElimCell_36 Int)) (= (select (select |c_#memory_$Pointer$#1.base| .cse11) v_arrayElimCell_36) .cse1)) (not (= .cse11 .cse2)) (not (= .cse11 .cse1))))) (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse2))))) is different from true [2024-11-09 22:07:55,391 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 697 treesize of output 513 [2024-11-09 22:07:55,396 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 513 treesize of output 361 [2024-11-09 22:07:55,471 INFO L349 Elim1Store]: treesize reduction 104, result has 1.0 percent of original size [2024-11-09 22:07:55,471 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 10 case distinctions, treesize of input 98 treesize of output 34 [2024-11-09 22:07:59,475 WARN L851 $PredicateComparison]: unable to prove that (or (not (= |c_ULTIMATE.start_main_~ptr~0#1.base| |c_ULTIMATE.start_main_#t~mem21#1.base|)) (exists ((|v_#memory_$Pointer$#1.base_74| (Array Int (Array Int Int))) (v_arrayElimCell_41 Int) (v_prenex_4 Int) (v_arrayElimCell_40 Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.offset_9| Int) (v_prenex_3 Int) (|v_old(#memory_$Pointer$#1.base)_AFTER_CALL_12| (Array Int (Array Int Int)))) (let ((.cse5 (select |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_12| v_arrayElimCell_40)) (.cse3 (+ 4 v_arrayElimCell_41))) (let ((.cse4 (@diff |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_12| |v_#memory_$Pointer$#1.base_74|)) (.cse0 (select .cse5 .cse3))) (and (not (= .cse0 |c_ULTIMATE.start_main_#t~mem21#1.base|)) (not (= .cse0 v_arrayElimCell_40)) (= |c_ULTIMATE.start_main_~ptr~0#1.base| (select (select (let ((.cse2 (select (select |v_#memory_$Pointer$#1.base_74| v_arrayElimCell_40) .cse3))) (let ((.cse1 (store |v_#memory_$Pointer$#1.base_74| .cse2 (store (select |v_#memory_$Pointer$#1.base_74| .cse2) v_prenex_3 |c_ULTIMATE.start_main_#t~mem21#1.base|)))) (store .cse1 |c_ULTIMATE.start_main_#t~mem21#1.base| (store (store (select .cse1 |c_ULTIMATE.start_main_#t~mem21#1.base|) (+ v_prenex_4 4) .cse2) v_prenex_4 v_arrayElimCell_40)))) v_arrayElimCell_40) v_arrayElimCell_41)) (not (= v_arrayElimCell_40 |c_ULTIMATE.start_main_#t~mem21#1.base|)) (= (store |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_12| .cse4 (select |v_#memory_$Pointer$#1.base_74| .cse4)) |v_#memory_$Pointer$#1.base_74|) (= (select .cse5 v_arrayElimCell_41) .cse0) (= .cse4 |c_ULTIMATE.start_main_#t~mem21#1.base|) (= (select (select |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_12| .cse0) |v_ULTIMATE.start_dll_circular_create_~last~0#1.offset_9|) v_arrayElimCell_40)))))) is different from false [2024-11-09 22:07:59,478 WARN L873 $PredicateComparison]: unable to prove that (or (not (= |c_ULTIMATE.start_main_~ptr~0#1.base| |c_ULTIMATE.start_main_#t~mem21#1.base|)) (exists ((|v_#memory_$Pointer$#1.base_74| (Array Int (Array Int Int))) (v_arrayElimCell_41 Int) (v_prenex_4 Int) (v_arrayElimCell_40 Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.offset_9| Int) (v_prenex_3 Int) (|v_old(#memory_$Pointer$#1.base)_AFTER_CALL_12| (Array Int (Array Int Int)))) (let ((.cse5 (select |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_12| v_arrayElimCell_40)) (.cse3 (+ 4 v_arrayElimCell_41))) (let ((.cse4 (@diff |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_12| |v_#memory_$Pointer$#1.base_74|)) (.cse0 (select .cse5 .cse3))) (and (not (= .cse0 |c_ULTIMATE.start_main_#t~mem21#1.base|)) (not (= .cse0 v_arrayElimCell_40)) (= |c_ULTIMATE.start_main_~ptr~0#1.base| (select (select (let ((.cse2 (select (select |v_#memory_$Pointer$#1.base_74| v_arrayElimCell_40) .cse3))) (let ((.cse1 (store |v_#memory_$Pointer$#1.base_74| .cse2 (store (select |v_#memory_$Pointer$#1.base_74| .cse2) v_prenex_3 |c_ULTIMATE.start_main_#t~mem21#1.base|)))) (store .cse1 |c_ULTIMATE.start_main_#t~mem21#1.base| (store (store (select .cse1 |c_ULTIMATE.start_main_#t~mem21#1.base|) (+ v_prenex_4 4) .cse2) v_prenex_4 v_arrayElimCell_40)))) v_arrayElimCell_40) v_arrayElimCell_41)) (not (= v_arrayElimCell_40 |c_ULTIMATE.start_main_#t~mem21#1.base|)) (= (store |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_12| .cse4 (select |v_#memory_$Pointer$#1.base_74| .cse4)) |v_#memory_$Pointer$#1.base_74|) (= (select .cse5 v_arrayElimCell_41) .cse0) (= .cse4 |c_ULTIMATE.start_main_#t~mem21#1.base|) (= (select (select |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_12| .cse0) |v_ULTIMATE.start_dll_circular_create_~last~0#1.offset_9|) v_arrayElimCell_40)))))) is different from true [2024-11-09 22:07:59,485 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 22:07:59,486 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 22:07:59,540 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 598 treesize of output 486 [2024-11-09 22:08:27,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [687161939] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 22:08:27,650 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 22:08:27,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 24] total 40 [2024-11-09 22:08:27,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [172623074] [2024-11-09 22:08:27,651 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 22:08:27,651 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2024-11-09 22:08:27,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 22:08:27,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2024-11-09 22:08:27,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=1447, Unknown=15, NotChecked=400, Total=1980 [2024-11-09 22:08:27,652 INFO L87 Difference]: Start difference. First operand 56 states and 62 transitions. Second operand has 40 states, 37 states have (on average 1.5405405405405406) internal successors, (57), 31 states have internal predecessors, (57), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-09 22:08:36,102 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse9 (select .cse4 0)) (.cse6 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse14 (select |c_#memory_$Pointer$#1.base| .cse6)) (.cse10 (+ .cse9 4)) (.cse3 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))) (let ((.cse2 (select |c_#memory_$Pointer$#1.base| .cse3)) (.cse1 (select .cse14 .cse10))) (let ((.cse11 (= (select .cse14 .cse9) .cse1)) (.cse12 (not (= .cse1 .cse6))) (.cse0 (select .cse2 0)) (.cse13 (exists ((|v_ULTIMATE.start_dll_circular_create_~last~0#1.offset_9| Int)) (= .cse6 (select (select |c_#memory_$Pointer$#1.base| .cse1) |v_ULTIMATE.start_dll_circular_create_~last~0#1.offset_9|))))) (and (not (= |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| .cse0)) (= (select |c_#valid| .cse1) 1) (not (= (select .cse2 4) .cse3)) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| 0) (= (select .cse4 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (or (exists ((|v_ULTIMATE.start_dll_circular_create_~last~0#1.offset_9| Int) (|v_old(#memory_$Pointer$#1.base)_AFTER_CALL_12| (Array Int (Array Int Int)))) (let ((.cse8 (select |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_12| .cse6))) (let ((.cse7 (select .cse8 .cse10)) (.cse5 (@diff |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_12| |c_#memory_$Pointer$#1.base|))) (and (= |c_#memory_$Pointer$#1.base| (store |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_12| .cse5 (select |c_#memory_$Pointer$#1.base| .cse5))) (not (= .cse6 .cse7)) (= (select .cse8 .cse9) .cse7) (= .cse6 (select (select |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_12| .cse7) |v_ULTIMATE.start_dll_circular_create_~last~0#1.offset_9|)) (not (= |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| .cse7)) (= |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| .cse5))))) (and (not (= |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| .cse1)) .cse11 .cse12 .cse13)) (= (select |c_#valid| .cse6) 1) (not (= |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| .cse3)) (not (= |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| .cse6)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) .cse11 .cse12 (= (select |c_#valid| .cse3) 1) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= (select |c_#valid| .cse0) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 0) .cse13)))))) is different from false [2024-11-09 22:08:36,118 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse9 (select .cse4 0)) (.cse6 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse14 (select |c_#memory_$Pointer$#1.base| .cse6)) (.cse10 (+ .cse9 4)) (.cse3 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))) (let ((.cse2 (select |c_#memory_$Pointer$#1.base| .cse3)) (.cse1 (select .cse14 .cse10))) (let ((.cse11 (= (select .cse14 .cse9) .cse1)) (.cse12 (not (= .cse1 .cse6))) (.cse0 (select .cse2 0)) (.cse13 (exists ((|v_ULTIMATE.start_dll_circular_create_~last~0#1.offset_9| Int)) (= .cse6 (select (select |c_#memory_$Pointer$#1.base| .cse1) |v_ULTIMATE.start_dll_circular_create_~last~0#1.offset_9|))))) (and (not (= |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| .cse0)) (= (select |c_#valid| .cse1) 1) (not (= (select .cse2 4) .cse3)) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| 0) (= (select .cse4 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (or (exists ((|v_ULTIMATE.start_dll_circular_create_~last~0#1.offset_9| Int) (|v_old(#memory_$Pointer$#1.base)_AFTER_CALL_12| (Array Int (Array Int Int)))) (let ((.cse8 (select |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_12| .cse6))) (let ((.cse7 (select .cse8 .cse10)) (.cse5 (@diff |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_12| |c_#memory_$Pointer$#1.base|))) (and (= |c_#memory_$Pointer$#1.base| (store |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_12| .cse5 (select |c_#memory_$Pointer$#1.base| .cse5))) (not (= .cse6 .cse7)) (= (select .cse8 .cse9) .cse7) (= .cse6 (select (select |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_12| .cse7) |v_ULTIMATE.start_dll_circular_create_~last~0#1.offset_9|)) (not (= |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| .cse7)) (= |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| .cse5))))) (and (not (= |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| .cse1)) .cse11 .cse12 .cse13)) (= (select |c_#valid| .cse6) 1) (not (= |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| .cse3)) (not (= |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| .cse6)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) .cse11 .cse12 (= (select |c_#valid| .cse3) 1) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= (select |c_#valid| .cse0) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 0) .cse13)))))) is different from true [2024-11-09 22:08:40,121 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse12 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))) (let ((.cse1 (select |c_#memory_$Pointer$#1.base| .cse12))) (let ((.cse0 (select (let ((.cse11 (select .cse1 4))) (let ((.cse10 (store |c_#memory_$Pointer$#1.base| .cse11 (store (select |c_#memory_$Pointer$#1.base| .cse11) (select (select |c_#memory_$Pointer$#1.offset| .cse12) 4) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)))) (store .cse10 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| (store (store (select .cse10 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| 4) .cse11) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| .cse12)))) .cse12)) (.cse2 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (and (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| 0) (not (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| (select .cse0 0))) (= .cse1 .cse0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (not (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| .cse2)) (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (let ((.cse4 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse6 (+ .cse4 4))) (or (let ((.cse3 (select |c_#memory_$Pointer$#1.base| .cse2))) (let ((.cse5 (select .cse3 .cse6))) (and (= (select .cse3 .cse4) .cse5) (not (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| .cse5)) (not (= .cse5 .cse2)) (exists ((|v_ULTIMATE.start_dll_circular_create_~last~0#1.offset_9| Int)) (= .cse2 (select (select |c_#memory_$Pointer$#1.base| .cse5) |v_ULTIMATE.start_dll_circular_create_~last~0#1.offset_9|)))))) (exists ((|v_ULTIMATE.start_dll_circular_create_~last~0#1.offset_9| Int) (|v_old(#memory_$Pointer$#1.base)_AFTER_CALL_12| (Array Int (Array Int Int)))) (let ((.cse9 (select |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_12| .cse2))) (let ((.cse7 (@diff |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_12| |c_#memory_$Pointer$#1.base|)) (.cse8 (select .cse9 .cse6))) (and (= |c_#memory_$Pointer$#1.base| (store |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_12| .cse7 (select |c_#memory_$Pointer$#1.base| .cse7))) (not (= .cse2 .cse8)) (= (select .cse9 .cse4) .cse8) (= .cse2 (select (select |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_12| .cse8) |v_ULTIMATE.start_dll_circular_create_~last~0#1.offset_9|)) (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| .cse7) (not (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| .cse8))))))))) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 0))))) is different from false [2024-11-09 22:08:44,123 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse12 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))) (let ((.cse1 (select |c_#memory_$Pointer$#1.base| .cse12))) (let ((.cse0 (select (let ((.cse11 (select .cse1 4))) (let ((.cse10 (store |c_#memory_$Pointer$#1.base| .cse11 (store (select |c_#memory_$Pointer$#1.base| .cse11) (select (select |c_#memory_$Pointer$#1.offset| .cse12) 4) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)))) (store .cse10 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| (store (store (select .cse10 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| 4) .cse11) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| .cse12)))) .cse12)) (.cse2 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (and (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| 0) (not (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| (select .cse0 0))) (= .cse1 .cse0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (not (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| .cse2)) (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (let ((.cse4 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse6 (+ .cse4 4))) (or (let ((.cse3 (select |c_#memory_$Pointer$#1.base| .cse2))) (let ((.cse5 (select .cse3 .cse6))) (and (= (select .cse3 .cse4) .cse5) (not (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| .cse5)) (not (= .cse5 .cse2)) (exists ((|v_ULTIMATE.start_dll_circular_create_~last~0#1.offset_9| Int)) (= .cse2 (select (select |c_#memory_$Pointer$#1.base| .cse5) |v_ULTIMATE.start_dll_circular_create_~last~0#1.offset_9|)))))) (exists ((|v_ULTIMATE.start_dll_circular_create_~last~0#1.offset_9| Int) (|v_old(#memory_$Pointer$#1.base)_AFTER_CALL_12| (Array Int (Array Int Int)))) (let ((.cse9 (select |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_12| .cse2))) (let ((.cse7 (@diff |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_12| |c_#memory_$Pointer$#1.base|)) (.cse8 (select .cse9 .cse6))) (and (= |c_#memory_$Pointer$#1.base| (store |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_12| .cse7 (select |c_#memory_$Pointer$#1.base| .cse7))) (not (= .cse2 .cse8)) (= (select .cse9 .cse4) .cse8) (= .cse2 (select (select |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_12| .cse8) |v_ULTIMATE.start_dll_circular_create_~last~0#1.offset_9|)) (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| .cse7) (not (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| .cse8))))))))) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 0))))) is different from true