./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/list-simple/dll2c_prepend_unequal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3061b6dc Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/list-simple/dll2c_prepend_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 583b66b9d59d34de12ff7e58a8eb24a95055476e3f5044dc2a7c6b2bb83f4c67 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-18 13:07:52,421 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-18 13:07:52,517 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-18 13:07:52,521 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-18 13:07:52,521 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-18 13:07:52,544 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-18 13:07:52,545 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-18 13:07:52,546 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-18 13:07:52,546 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-18 13:07:52,547 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-18 13:07:52,547 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-18 13:07:52,548 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-18 13:07:52,548 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-18 13:07:52,549 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-18 13:07:52,549 INFO L153 SettingsManager]: * Use SBE=true [2024-11-18 13:07:52,550 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-18 13:07:52,550 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-18 13:07:52,550 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-18 13:07:52,551 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-18 13:07:52,551 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-18 13:07:52,551 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-18 13:07:52,552 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-18 13:07:52,552 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-18 13:07:52,553 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-18 13:07:52,553 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-18 13:07:52,553 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-18 13:07:52,554 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-18 13:07:52,554 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-18 13:07:52,555 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-18 13:07:52,555 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-18 13:07:52,555 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-18 13:07:52,556 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-18 13:07:52,556 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-18 13:07:52,556 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-18 13:07:52,557 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-18 13:07:52,557 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-18 13:07:52,557 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-18 13:07:52,558 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-18 13:07:52,558 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-18 13:07:52,558 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-18 13:07:52,558 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-18 13:07:52,559 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-18 13:07:52,559 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 -> 583b66b9d59d34de12ff7e58a8eb24a95055476e3f5044dc2a7c6b2bb83f4c67 [2024-11-18 13:07:52,826 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-18 13:07:52,848 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-18 13:07:52,852 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-18 13:07:52,853 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-18 13:07:52,854 INFO L274 PluginConnector]: CDTParser initialized [2024-11-18 13:07:52,855 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/dll2c_prepend_unequal.i [2024-11-18 13:07:54,332 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-18 13:07:54,544 INFO L384 CDTParser]: Found 1 translation units. [2024-11-18 13:07:54,545 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2c_prepend_unequal.i [2024-11-18 13:07:54,556 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/448502189/15f4f56182ca48e18fa6cae3e4ea1554/FLAGfb99b974a [2024-11-18 13:07:54,566 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/448502189/15f4f56182ca48e18fa6cae3e4ea1554 [2024-11-18 13:07:54,568 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-18 13:07:54,569 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-18 13:07:54,570 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-18 13:07:54,570 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-18 13:07:54,575 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-18 13:07:54,576 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 01:07:54" (1/1) ... [2024-11-18 13:07:54,577 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@36a06b3a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:07:54, skipping insertion in model container [2024-11-18 13:07:54,577 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 01:07:54" (1/1) ... [2024-11-18 13:07:54,621 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-18 13:07:54,904 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2c_prepend_unequal.i[24729,24742] [2024-11-18 13:07:54,910 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-18 13:07:54,918 INFO L200 MainTranslator]: Completed pre-run [2024-11-18 13:07:54,964 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2c_prepend_unequal.i[24729,24742] [2024-11-18 13:07:54,968 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-18 13:07:55,002 INFO L204 MainTranslator]: Completed translation [2024-11-18 13:07:55,003 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:07:55 WrapperNode [2024-11-18 13:07:55,003 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-18 13:07:55,004 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-18 13:07:55,004 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-18 13:07:55,004 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-18 13:07:55,011 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:07:55" (1/1) ... [2024-11-18 13:07:55,024 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:07:55" (1/1) ... [2024-11-18 13:07:55,052 INFO L138 Inliner]: procedures = 127, calls = 49, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 146 [2024-11-18 13:07:55,053 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-18 13:07:55,053 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-18 13:07:55,053 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-18 13:07:55,053 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-18 13:07:55,062 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:07:55" (1/1) ... [2024-11-18 13:07:55,062 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:07:55" (1/1) ... [2024-11-18 13:07:55,067 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:07:55" (1/1) ... [2024-11-18 13:07:55,101 INFO L175 MemorySlicer]: Split 31 memory accesses to 3 slices as follows [2, 9, 20]. 65 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 1, 0]. The 15 writes are split as follows [0, 2, 13]. [2024-11-18 13:07:55,102 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:07:55" (1/1) ... [2024-11-18 13:07:55,102 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:07:55" (1/1) ... [2024-11-18 13:07:55,109 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:07:55" (1/1) ... [2024-11-18 13:07:55,112 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:07:55" (1/1) ... [2024-11-18 13:07:55,113 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:07:55" (1/1) ... [2024-11-18 13:07:55,115 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:07:55" (1/1) ... [2024-11-18 13:07:55,118 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-18 13:07:55,119 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-18 13:07:55,119 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-18 13:07:55,119 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-18 13:07:55,120 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:07:55" (1/1) ... [2024-11-18 13:07:55,125 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-18 13:07:55,139 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 13:07:55,155 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-18 13:07:55,157 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-18 13:07:55,211 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-18 13:07:55,211 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-18 13:07:55,211 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-18 13:07:55,211 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-18 13:07:55,211 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-18 13:07:55,211 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-18 13:07:55,212 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2024-11-18 13:07:55,212 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2024-11-18 13:07:55,212 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-18 13:07:55,212 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-18 13:07:55,225 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-18 13:07:55,225 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-18 13:07:55,226 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-18 13:07:55,226 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-18 13:07:55,226 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-18 13:07:55,226 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-18 13:07:55,227 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-18 13:07:55,227 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-18 13:07:55,228 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-18 13:07:55,228 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-18 13:07:55,229 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-11-18 13:07:55,229 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-18 13:07:55,229 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-18 13:07:55,229 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-18 13:07:55,229 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-18 13:07:55,230 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-18 13:07:55,360 INFO L238 CfgBuilder]: Building ICFG [2024-11-18 13:07:55,362 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-18 13:07:55,664 INFO L? ?]: Removed 53 outVars from TransFormulas that were not future-live. [2024-11-18 13:07:55,665 INFO L287 CfgBuilder]: Performing block encoding [2024-11-18 13:07:55,683 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-18 13:07:55,684 INFO L316 CfgBuilder]: Removed 3 assume(true) statements. [2024-11-18 13:07:55,684 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 01:07:55 BoogieIcfgContainer [2024-11-18 13:07:55,684 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-18 13:07:55,686 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-18 13:07:55,686 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-18 13:07:55,691 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-18 13:07:55,692 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 01:07:54" (1/3) ... [2024-11-18 13:07:55,693 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34409a2a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 01:07:55, skipping insertion in model container [2024-11-18 13:07:55,693 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:07:55" (2/3) ... [2024-11-18 13:07:55,693 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34409a2a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 01:07:55, skipping insertion in model container [2024-11-18 13:07:55,693 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 01:07:55" (3/3) ... [2024-11-18 13:07:55,695 INFO L112 eAbstractionObserver]: Analyzing ICFG dll2c_prepend_unequal.i [2024-11-18 13:07:55,708 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-18 13:07:55,708 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-18 13:07:55,757 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-18 13:07:55,764 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;@7353fa36, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-18 13:07:55,765 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-18 13:07:55,770 INFO L276 IsEmpty]: Start isEmpty. Operand has 36 states, 30 states have (on average 1.4666666666666666) internal successors, (44), 31 states have internal predecessors, (44), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-18 13:07:55,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-18 13:07:55,778 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 13:07:55,779 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 13:07:55,780 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 13:07:55,785 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 13:07:55,785 INFO L85 PathProgramCache]: Analyzing trace with hash 1640936773, now seen corresponding path program 1 times [2024-11-18 13:07:55,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 13:07:55,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [193478167] [2024-11-18 13:07:55,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 13:07:55,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 13:07:55,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 13:07:56,098 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-18 13:07:56,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 13:07:56,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [193478167] [2024-11-18 13:07:56,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [193478167] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 13:07:56,100 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 13:07:56,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-18 13:07:56,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [81636420] [2024-11-18 13:07:56,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 13:07:56,108 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-18 13:07:56,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 13:07:56,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-18 13:07:56,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-18 13:07:56,137 INFO L87 Difference]: Start difference. First operand has 36 states, 30 states have (on average 1.4666666666666666) internal successors, (44), 31 states have internal predecessors, (44), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 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-18 13:07:56,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 13:07:56,158 INFO L93 Difference]: Finished difference Result 63 states and 86 transitions. [2024-11-18 13:07:56,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-18 13:07:56,160 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 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 23 [2024-11-18 13:07:56,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 13:07:56,166 INFO L225 Difference]: With dead ends: 63 [2024-11-18 13:07:56,166 INFO L226 Difference]: Without dead ends: 28 [2024-11-18 13:07:56,169 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-18 13:07:56,174 INFO L432 NwaCegarLoop]: 46 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 13:07:56,175 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 13:07:56,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2024-11-18 13:07:56,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2024-11-18 13:07:56,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 23 states have internal predecessors, (29), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-18 13:07:56,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 35 transitions. [2024-11-18 13:07:56,212 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 35 transitions. Word has length 23 [2024-11-18 13:07:56,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 13:07:56,213 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 35 transitions. [2024-11-18 13:07:56,214 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 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-18 13:07:56,214 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 35 transitions. [2024-11-18 13:07:56,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-18 13:07:56,216 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 13:07:56,216 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 13:07:56,217 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-18 13:07:56,217 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 13:07:56,218 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 13:07:56,218 INFO L85 PathProgramCache]: Analyzing trace with hash -376735694, now seen corresponding path program 1 times [2024-11-18 13:07:56,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 13:07:56,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2002235881] [2024-11-18 13:07:56,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 13:07:56,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 13:07:56,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 13:07:56,475 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-18 13:07:56,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 13:07:56,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2002235881] [2024-11-18 13:07:56,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2002235881] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 13:07:56,477 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 13:07:56,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-18 13:07:56,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1430365695] [2024-11-18 13:07:56,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 13:07:56,479 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 13:07:56,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 13:07:56,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 13:07:56,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 13:07:56,483 INFO L87 Difference]: Start difference. First operand 28 states and 35 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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-18 13:07:56,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 13:07:56,504 INFO L93 Difference]: Finished difference Result 52 states and 65 transitions. [2024-11-18 13:07:56,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 13:07:56,505 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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 23 [2024-11-18 13:07:56,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 13:07:56,506 INFO L225 Difference]: With dead ends: 52 [2024-11-18 13:07:56,506 INFO L226 Difference]: Without dead ends: 33 [2024-11-18 13:07:56,507 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-18 13:07:56,508 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 4 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 13:07:56,509 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 61 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 13:07:56,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2024-11-18 13:07:56,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 29. [2024-11-18 13:07:56,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 24 states have (on average 1.25) internal successors, (30), 24 states have internal predecessors, (30), 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-18 13:07:56,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 36 transitions. [2024-11-18 13:07:56,519 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 36 transitions. Word has length 23 [2024-11-18 13:07:56,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 13:07:56,519 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 36 transitions. [2024-11-18 13:07:56,519 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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-18 13:07:56,519 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 36 transitions. [2024-11-18 13:07:56,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-18 13:07:56,521 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 13:07:56,521 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 13:07:56,521 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-18 13:07:56,522 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 13:07:56,524 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 13:07:56,524 INFO L85 PathProgramCache]: Analyzing trace with hash 900211966, now seen corresponding path program 1 times [2024-11-18 13:07:56,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 13:07:56,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792315665] [2024-11-18 13:07:56,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 13:07:56,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 13:07:56,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 13:07:57,024 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-18 13:07:57,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 13:07:57,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [792315665] [2024-11-18 13:07:57,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [792315665] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 13:07:57,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1250173639] [2024-11-18 13:07:57,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 13:07:57,025 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 13:07:57,026 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 13:07:57,029 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-18 13:07:57,031 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-18 13:07:57,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 13:07:57,236 INFO L255 TraceCheckSpWp]: Trace formula consists of 374 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-18 13:07:57,244 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 13:07:57,409 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-18 13:07:57,425 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-18 13:07:57,426 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-18 13:07:57,501 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-18 13:07:57,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1250173639] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-18 13:07:57,502 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-18 13:07:57,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 10] total 13 [2024-11-18 13:07:57,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185134130] [2024-11-18 13:07:57,502 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-18 13:07:57,503 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-18 13:07:57,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 13:07:57,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-18 13:07:57,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2024-11-18 13:07:57,508 INFO L87 Difference]: Start difference. First operand 29 states and 36 transitions. Second operand has 13 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 12 states have internal predecessors, (30), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-18 13:08:01,540 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-18 13:08:05,574 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-18 13:08:09,590 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-18 13:08:13,616 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-18 13:08:17,896 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-18 13:08:21,956 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-18 13:08:25,985 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-18 13:08:25,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 13:08:25,991 INFO L93 Difference]: Finished difference Result 61 states and 75 transitions. [2024-11-18 13:08:25,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-18 13:08:25,991 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 12 states have internal predecessors, (30), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) Word has length 33 [2024-11-18 13:08:25,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 13:08:25,992 INFO L225 Difference]: With dead ends: 61 [2024-11-18 13:08:25,992 INFO L226 Difference]: Without dead ends: 37 [2024-11-18 13:08:25,993 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 62 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=50, Invalid=256, Unknown=0, NotChecked=0, Total=306 [2024-11-18 13:08:25,994 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 5 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 1 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 28.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 291 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 28.4s IncrementalHoareTripleChecker+Time [2024-11-18 13:08:25,994 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 291 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 141 Invalid, 7 Unknown, 0 Unchecked, 28.4s Time] [2024-11-18 13:08:25,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2024-11-18 13:08:25,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2024-11-18 13:08:25,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 30 states have (on average 1.1666666666666667) internal successors, (35), 30 states have internal predecessors, (35), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-18 13:08:26,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 43 transitions. [2024-11-18 13:08:26,002 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 43 transitions. Word has length 33 [2024-11-18 13:08:26,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 13:08:26,002 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 43 transitions. [2024-11-18 13:08:26,002 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 12 states have internal predecessors, (30), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-18 13:08:26,002 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 43 transitions. [2024-11-18 13:08:26,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-18 13:08:26,003 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 13:08:26,003 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 13:08:26,021 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-18 13:08:26,204 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-18 13:08:26,204 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 13:08:26,205 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 13:08:26,205 INFO L85 PathProgramCache]: Analyzing trace with hash 900271548, now seen corresponding path program 1 times [2024-11-18 13:08:26,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 13:08:26,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [325707106] [2024-11-18 13:08:26,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 13:08:26,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 13:08:26,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 13:08:28,639 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 13:08:28,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 13:08:28,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [325707106] [2024-11-18 13:08:28,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [325707106] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 13:08:28,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1547742187] [2024-11-18 13:08:28,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 13:08:28,641 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 13:08:28,642 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 13:08:28,644 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-18 13:08:28,646 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-18 13:08:28,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 13:08:28,863 INFO L255 TraceCheckSpWp]: Trace formula consists of 397 conjuncts, 94 conjuncts are in the unsatisfiable core [2024-11-18 13:08:28,870 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 13:08:28,881 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-18 13:08:29,003 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-11-18 13:08:29,004 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2024-11-18 13:08:29,135 INFO L349 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2024-11-18 13:08:29,136 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 17 [2024-11-18 13:08:29,153 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 34 [2024-11-18 13:08:29,169 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 53 [2024-11-18 13:08:33,415 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 199 treesize of output 139 [2024-11-18 13:08:33,427 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 83 [2024-11-18 13:08:33,438 INFO L349 Elim1Store]: treesize reduction 17, result has 15.0 percent of original size [2024-11-18 13:08:33,438 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 93 treesize of output 80 [2024-11-18 13:08:33,471 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-18 13:08:33,610 INFO L349 Elim1Store]: treesize reduction 31, result has 49.2 percent of original size [2024-11-18 13:08:33,611 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 166 treesize of output 171 [2024-11-18 13:08:37,742 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (and (= |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int#2| |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base|) 8)) (not (= |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base| .cse0)) (= |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.offset| 0) (let ((.cse3 (+ (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (or (exists ((|v_old(#memory_$Pointer$#2.base)_AFTER_CALL_6| (Array Int (Array Int Int)))) (let ((.cse4 (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_6| .cse0))) (let ((.cse1 (@diff |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_6| |c_#memory_$Pointer$#2.base|)) (.cse2 (select .cse4 .cse3))) (and (= |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base| .cse1) (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_arrayElimArr_2 (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.offset_6| Int)) (and (= (store (select (store (store |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_6| .cse0 v_DerPreprocessor_1) .cse2 v_arrayElimArr_2) .cse0) .cse3 .cse2) .cse4) (= .cse0 (select v_arrayElimArr_2 |v_ULTIMATE.start_dll_circular_create_~last~0#1.offset_6|)))) (= (store |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_6| .cse1 (select |c_#memory_$Pointer$#2.base| .cse1)) |c_#memory_$Pointer$#2.base|) (not (= .cse2 .cse0)) (not (= |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base| .cse2)))))) (exists ((|v_old(#memory_$Pointer$#2.base)_AFTER_CALL_6| (Array Int (Array Int Int)))) (let ((.cse5 (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_6| .cse0)) (.cse6 (@diff |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_6| |c_#memory_$Pointer$#2.base|))) (and (exists ((v_prenex_3 Int)) (= (select .cse5 v_prenex_3) .cse0)) (= |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base| .cse6) (= (select .cse5 .cse3) .cse0) (= (store |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_6| .cse6 (select |c_#memory_$Pointer$#2.base| .cse6)) |c_#memory_$Pointer$#2.base|)))) (let ((.cse8 (select |c_#memory_$Pointer$#2.base| .cse0))) (let ((.cse9 (select .cse8 .cse3))) (and (let ((.cse7 (= .cse0 .cse9))) (or (and .cse7 (exists ((v_prenex_3 Int)) (= (select .cse8 v_prenex_3) .cse0))) (and (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_arrayElimArr_2 (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.offset_6| Int)) (and (= .cse0 (select v_arrayElimArr_2 |v_ULTIMATE.start_dll_circular_create_~last~0#1.offset_6|)) (= .cse8 (store (select (store (store |c_#memory_$Pointer$#2.base| .cse0 v_DerPreprocessor_1) .cse9 v_arrayElimArr_2) .cse0) .cse3 .cse9)))) (not .cse7)))) (not (= |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base| .cse9))))))))) is different from false [2024-11-18 13:08:37,748 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (and (= |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int#2| |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base|) 8)) (not (= |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base| .cse0)) (= |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.offset| 0) (let ((.cse3 (+ (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (or (exists ((|v_old(#memory_$Pointer$#2.base)_AFTER_CALL_6| (Array Int (Array Int Int)))) (let ((.cse4 (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_6| .cse0))) (let ((.cse1 (@diff |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_6| |c_#memory_$Pointer$#2.base|)) (.cse2 (select .cse4 .cse3))) (and (= |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base| .cse1) (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_arrayElimArr_2 (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.offset_6| Int)) (and (= (store (select (store (store |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_6| .cse0 v_DerPreprocessor_1) .cse2 v_arrayElimArr_2) .cse0) .cse3 .cse2) .cse4) (= .cse0 (select v_arrayElimArr_2 |v_ULTIMATE.start_dll_circular_create_~last~0#1.offset_6|)))) (= (store |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_6| .cse1 (select |c_#memory_$Pointer$#2.base| .cse1)) |c_#memory_$Pointer$#2.base|) (not (= .cse2 .cse0)) (not (= |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base| .cse2)))))) (exists ((|v_old(#memory_$Pointer$#2.base)_AFTER_CALL_6| (Array Int (Array Int Int)))) (let ((.cse5 (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_6| .cse0)) (.cse6 (@diff |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_6| |c_#memory_$Pointer$#2.base|))) (and (exists ((v_prenex_3 Int)) (= (select .cse5 v_prenex_3) .cse0)) (= |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base| .cse6) (= (select .cse5 .cse3) .cse0) (= (store |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_6| .cse6 (select |c_#memory_$Pointer$#2.base| .cse6)) |c_#memory_$Pointer$#2.base|)))) (let ((.cse8 (select |c_#memory_$Pointer$#2.base| .cse0))) (let ((.cse9 (select .cse8 .cse3))) (and (let ((.cse7 (= .cse0 .cse9))) (or (and .cse7 (exists ((v_prenex_3 Int)) (= (select .cse8 v_prenex_3) .cse0))) (and (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_arrayElimArr_2 (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.offset_6| Int)) (and (= .cse0 (select v_arrayElimArr_2 |v_ULTIMATE.start_dll_circular_create_~last~0#1.offset_6|)) (= .cse8 (store (select (store (store |c_#memory_$Pointer$#2.base| .cse0 v_DerPreprocessor_1) .cse9 v_arrayElimArr_2) .cse0) .cse3 .cse9)))) (not .cse7)))) (not (= |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base| .cse9))))))))) is different from true [2024-11-18 13:08:41,891 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (and (let ((.cse2 (+ (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (or (exists ((|v_old(#memory_$Pointer$#2.base)_AFTER_CALL_6| (Array Int (Array Int Int)))) (let ((.cse0 (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_6| .cse1)) (.cse3 (@diff |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_6| |c_#memory_$Pointer$#2.base|))) (and (exists ((v_prenex_3 Int)) (= (select .cse0 v_prenex_3) .cse1)) (= (select .cse0 .cse2) .cse1) (= .cse3 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) (= (store |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_6| .cse3 (select |c_#memory_$Pointer$#2.base| .cse3)) |c_#memory_$Pointer$#2.base|)))) (let ((.cse5 (select |c_#memory_$Pointer$#2.base| .cse1))) (let ((.cse6 (select .cse5 .cse2))) (and (let ((.cse4 (= .cse1 .cse6))) (or (and .cse4 (exists ((v_prenex_3 Int)) (= (select .cse5 v_prenex_3) .cse1))) (and (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_arrayElimArr_2 (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.offset_6| Int)) (and (= .cse1 (select v_arrayElimArr_2 |v_ULTIMATE.start_dll_circular_create_~last~0#1.offset_6|)) (= .cse5 (store (select (store (store |c_#memory_$Pointer$#2.base| .cse1 v_DerPreprocessor_1) .cse6 v_arrayElimArr_2) .cse1) .cse2 .cse6)))) (not .cse4)))) (not (= |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| .cse6))))) (exists ((|v_old(#memory_$Pointer$#2.base)_AFTER_CALL_6| (Array Int (Array Int Int)))) (let ((.cse9 (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_6| .cse1))) (let ((.cse7 (@diff |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_6| |c_#memory_$Pointer$#2.base|)) (.cse8 (select .cse9 .cse2))) (and (= .cse7 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_arrayElimArr_2 (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.offset_6| Int)) (and (= (store (select (store (store |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_6| .cse1 v_DerPreprocessor_1) .cse8 v_arrayElimArr_2) .cse1) .cse2 .cse8) .cse9) (= .cse1 (select v_arrayElimArr_2 |v_ULTIMATE.start_dll_circular_create_~last~0#1.offset_6|)))) (= (store |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_6| .cse7 (select |c_#memory_$Pointer$#2.base| .cse7)) |c_#memory_$Pointer$#2.base|) (not (= .cse8 .cse1)) (not (= .cse8 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|)))))))) (not (= .cse1 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|)) (= |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int#2| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) 8)) (= |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) is different from false [2024-11-18 13:08:41,898 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (and (let ((.cse2 (+ (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (or (exists ((|v_old(#memory_$Pointer$#2.base)_AFTER_CALL_6| (Array Int (Array Int Int)))) (let ((.cse0 (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_6| .cse1)) (.cse3 (@diff |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_6| |c_#memory_$Pointer$#2.base|))) (and (exists ((v_prenex_3 Int)) (= (select .cse0 v_prenex_3) .cse1)) (= (select .cse0 .cse2) .cse1) (= .cse3 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) (= (store |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_6| .cse3 (select |c_#memory_$Pointer$#2.base| .cse3)) |c_#memory_$Pointer$#2.base|)))) (let ((.cse5 (select |c_#memory_$Pointer$#2.base| .cse1))) (let ((.cse6 (select .cse5 .cse2))) (and (let ((.cse4 (= .cse1 .cse6))) (or (and .cse4 (exists ((v_prenex_3 Int)) (= (select .cse5 v_prenex_3) .cse1))) (and (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_arrayElimArr_2 (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.offset_6| Int)) (and (= .cse1 (select v_arrayElimArr_2 |v_ULTIMATE.start_dll_circular_create_~last~0#1.offset_6|)) (= .cse5 (store (select (store (store |c_#memory_$Pointer$#2.base| .cse1 v_DerPreprocessor_1) .cse6 v_arrayElimArr_2) .cse1) .cse2 .cse6)))) (not .cse4)))) (not (= |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| .cse6))))) (exists ((|v_old(#memory_$Pointer$#2.base)_AFTER_CALL_6| (Array Int (Array Int Int)))) (let ((.cse9 (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_6| .cse1))) (let ((.cse7 (@diff |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_6| |c_#memory_$Pointer$#2.base|)) (.cse8 (select .cse9 .cse2))) (and (= .cse7 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_arrayElimArr_2 (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.offset_6| Int)) (and (= (store (select (store (store |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_6| .cse1 v_DerPreprocessor_1) .cse8 v_arrayElimArr_2) .cse1) .cse2 .cse8) .cse9) (= .cse1 (select v_arrayElimArr_2 |v_ULTIMATE.start_dll_circular_create_~last~0#1.offset_6|)))) (= (store |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_6| .cse7 (select |c_#memory_$Pointer$#2.base| .cse7)) |c_#memory_$Pointer$#2.base|) (not (= .cse8 .cse1)) (not (= .cse8 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|)))))))) (not (= .cse1 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|)) (= |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int#2| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) 8)) (= |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) is different from true [2024-11-18 13:08:41,967 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-18 13:08:41,969 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-18 13:08:41,972 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 93 treesize of output 34 [2024-11-18 13:08:41,995 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 340 treesize of output 233 [2024-11-18 13:08:42,005 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 236 treesize of output 188 [2024-11-18 13:08:42,068 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 79 treesize of output 63 [2024-11-18 13:08:42,075 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-18 13:08:42,084 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 15 [2024-11-18 13:08:42,092 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-18 13:08:42,093 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-18 13:08:42,096 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 60 treesize of output 34 [2024-11-18 13:08:42,104 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 267 treesize of output 184 [2024-11-18 13:08:42,111 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 187 treesize of output 151 [2024-11-18 13:08:42,135 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-18 13:08:42,137 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-18 13:08:42,141 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 80 treesize of output 34 [2024-11-18 13:08:42,148 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 282 treesize of output 191 [2024-11-18 13:08:42,155 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 194 treesize of output 158 [2024-11-18 13:08:42,188 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2024-11-18 13:08:42,189 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 15 [2024-11-18 13:08:42,204 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 15 [2024-11-18 13:08:42,211 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-18 13:08:42,212 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-18 13:08:42,214 WARN L214 Elim1Store]: Array PQE input equivalent to false [2024-11-18 13:08:42,219 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 23 treesize of output 15 [2024-11-18 13:08:42,223 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 15 treesize of output 7 [2024-11-18 13:08:42,225 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 13:08:42,225 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-18 13:08:42,292 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_528 (Array Int Int)) (v_ArrVal_529 (Array Int Int)) (v_ArrVal_531 (Array Int Int)) (v_ArrVal_533 (Array Int Int))) (let ((.cse2 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|))) (let ((.cse0 (select .cse2 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset|)) (.cse3 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| .cse0) (+ (select .cse3 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset|) 4)))) (or (= (select (select (store (store (store |c_#memory_int#2| .cse0 v_ArrVal_528) .cse1 v_ArrVal_529) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| v_ArrVal_533) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| (store .cse2 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| (store .cse3 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 8)) |c_ULTIMATE.start_main_~uneq~0#1|) (not (= v_ArrVal_533 (let ((.cse4 (+ |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| 4))) (store (select (store (store (store |c_#memory_int#2| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| v_ArrVal_531) .cse0 v_ArrVal_528) .cse1 v_ArrVal_529) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) .cse4 (select v_ArrVal_533 .cse4))))) (not (= (store (select |c_#memory_int#2| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| (select v_ArrVal_531 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset|)) v_ArrVal_531))))))) is different from false [2024-11-18 13:08:42,321 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_528 (Array Int Int)) (v_ArrVal_529 (Array Int Int)) (v_ArrVal_531 (Array Int Int)) (v_ArrVal_533 (Array Int Int))) (let ((.cse2 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|))) (let ((.cse0 (select .cse2 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset|)) (.cse3 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| .cse0) (+ (select .cse3 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset|) 4)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (store (store |c_#memory_int#2| .cse0 v_ArrVal_528) .cse1 v_ArrVal_529) |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base| v_ArrVal_533) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| (store .cse2 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| (store .cse3 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 8))) (not (= v_ArrVal_531 (store (select |c_#memory_int#2| |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base|) |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.offset| (select v_ArrVal_531 |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.offset|)))) (not (= v_ArrVal_533 (let ((.cse4 (+ |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.offset| 4))) (store (select (store (store (store |c_#memory_int#2| |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base| v_ArrVal_531) .cse0 v_ArrVal_528) .cse1 v_ArrVal_529) |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base|) .cse4 (select v_ArrVal_533 .cse4)))))))))) is different from false [2024-11-18 13:08:42,419 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-18 13:08:42,420 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 9136 treesize of output 8930 [2024-11-18 13:08:42,469 INFO L349 Elim1Store]: treesize reduction 40, result has 54.5 percent of original size [2024-11-18 13:08:42,469 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 362 treesize of output 388 [2024-11-18 13:08:42,515 INFO L349 Elim1Store]: treesize reduction 40, result has 54.5 percent of original size [2024-11-18 13:08:42,515 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 341 treesize of output 346 [2024-11-18 13:08:42,807 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-18 13:08:42,808 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 6 [2024-11-18 13:08:43,006 INFO L349 Elim1Store]: treesize reduction 98, result has 39.5 percent of original size [2024-11-18 13:08:43,007 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 348 treesize of output 390 [2024-11-18 13:08:43,367 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-18 13:08:43,368 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 251 treesize of output 277 [2024-11-18 13:08:43,643 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-18 13:08:43,643 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 251 treesize of output 277 [2024-11-18 13:08:43,963 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-18 13:08:43,969 INFO L349 Elim1Store]: treesize reduction 26, result has 3.7 percent of original size [2024-11-18 13:08:43,970 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 235 treesize of output 221 [2024-11-18 13:08:44,038 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 6 [2024-11-18 13:08:44,097 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-18 13:08:44,097 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 352 treesize of output 348 [2024-11-18 13:08:44,308 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 6 [2024-11-18 13:08:44,335 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-18 13:08:44,336 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 62 treesize of output 52 [2024-11-18 13:08:44,363 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 6 [2024-11-18 13:08:44,388 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-18 13:08:44,388 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 62 [2024-11-18 13:08:44,405 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-18 13:08:44,406 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 281 treesize of output 235 [2024-11-18 13:08:44,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1547742187] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 13:08:44,644 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-18 13:08:44,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 31 [2024-11-18 13:08:44,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1012197103] [2024-11-18 13:08:44,644 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-18 13:08:44,644 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2024-11-18 13:08:44,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 13:08:44,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2024-11-18 13:08:44,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=850, Unknown=8, NotChecked=244, Total=1190 [2024-11-18 13:08:44,646 INFO L87 Difference]: Start difference. First operand 37 states and 43 transitions. Second operand has 31 states, 29 states have (on average 1.4482758620689655) internal successors, (42), 24 states have internal predecessors, (42), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2024-11-18 13:08:49,262 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset|))) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| .cse0) 4)) (.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (and (= (select |c_#valid| .cse0) 1) (not (= .cse0 |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base|)) (= |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int#2| |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base|) 8)) (not (= |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base| .cse1)) (= |c_ULTIMATE.start_main_~uneq~0#1| |c_ULTIMATE.start_dll_circular_prepend_~data#1|) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset|) 0) (= |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.offset| 0) (not (= .cse2 |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base|)) (= (select |c_#valid| .cse2) 1) (let ((.cse5 (+ (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (or (exists ((|v_old(#memory_$Pointer$#2.base)_AFTER_CALL_6| (Array Int (Array Int Int)))) (let ((.cse6 (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_6| .cse1))) (let ((.cse3 (@diff |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_6| |c_#memory_$Pointer$#2.base|)) (.cse4 (select .cse6 .cse5))) (and (= |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base| .cse3) (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_arrayElimArr_2 (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.offset_6| Int)) (and (= (store (select (store (store |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_6| .cse1 v_DerPreprocessor_1) .cse4 v_arrayElimArr_2) .cse1) .cse5 .cse4) .cse6) (= .cse1 (select v_arrayElimArr_2 |v_ULTIMATE.start_dll_circular_create_~last~0#1.offset_6|)))) (= (store |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_6| .cse3 (select |c_#memory_$Pointer$#2.base| .cse3)) |c_#memory_$Pointer$#2.base|) (not (= .cse4 .cse1)) (not (= |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base| .cse4)))))) (exists ((|v_old(#memory_$Pointer$#2.base)_AFTER_CALL_6| (Array Int (Array Int Int)))) (let ((.cse7 (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_6| .cse1)) (.cse8 (@diff |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_6| |c_#memory_$Pointer$#2.base|))) (and (exists ((v_prenex_3 Int)) (= (select .cse7 v_prenex_3) .cse1)) (= |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base| .cse8) (= (select .cse7 .cse5) .cse1) (= (store |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_6| .cse8 (select |c_#memory_$Pointer$#2.base| .cse8)) |c_#memory_$Pointer$#2.base|)))) (let ((.cse10 (select |c_#memory_$Pointer$#2.base| .cse1))) (let ((.cse11 (select .cse10 .cse5))) (and (let ((.cse9 (= .cse1 .cse11))) (or (and .cse9 (exists ((v_prenex_3 Int)) (= (select .cse10 v_prenex_3) .cse1))) (and (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_arrayElimArr_2 (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.offset_6| Int)) (and (= .cse1 (select v_arrayElimArr_2 |v_ULTIMATE.start_dll_circular_create_~last~0#1.offset_6|)) (= .cse10 (store (select (store (store |c_#memory_$Pointer$#2.base| .cse1 v_DerPreprocessor_1) .cse11 v_arrayElimArr_2) .cse1) .cse5 .cse11)))) (not .cse9)))) (not (= |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base| .cse11)))))))))) is different from false [2024-11-18 13:08:49,266 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset|))) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| .cse0) 4)) (.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (and (= (select |c_#valid| .cse0) 1) (not (= .cse0 |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base|)) (= |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int#2| |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base|) 8)) (not (= |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base| .cse1)) (= |c_ULTIMATE.start_main_~uneq~0#1| |c_ULTIMATE.start_dll_circular_prepend_~data#1|) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset|) 0) (= |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.offset| 0) (not (= .cse2 |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base|)) (= (select |c_#valid| .cse2) 1) (let ((.cse5 (+ (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (or (exists ((|v_old(#memory_$Pointer$#2.base)_AFTER_CALL_6| (Array Int (Array Int Int)))) (let ((.cse6 (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_6| .cse1))) (let ((.cse3 (@diff |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_6| |c_#memory_$Pointer$#2.base|)) (.cse4 (select .cse6 .cse5))) (and (= |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base| .cse3) (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_arrayElimArr_2 (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.offset_6| Int)) (and (= (store (select (store (store |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_6| .cse1 v_DerPreprocessor_1) .cse4 v_arrayElimArr_2) .cse1) .cse5 .cse4) .cse6) (= .cse1 (select v_arrayElimArr_2 |v_ULTIMATE.start_dll_circular_create_~last~0#1.offset_6|)))) (= (store |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_6| .cse3 (select |c_#memory_$Pointer$#2.base| .cse3)) |c_#memory_$Pointer$#2.base|) (not (= .cse4 .cse1)) (not (= |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base| .cse4)))))) (exists ((|v_old(#memory_$Pointer$#2.base)_AFTER_CALL_6| (Array Int (Array Int Int)))) (let ((.cse7 (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_6| .cse1)) (.cse8 (@diff |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_6| |c_#memory_$Pointer$#2.base|))) (and (exists ((v_prenex_3 Int)) (= (select .cse7 v_prenex_3) .cse1)) (= |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base| .cse8) (= (select .cse7 .cse5) .cse1) (= (store |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_6| .cse8 (select |c_#memory_$Pointer$#2.base| .cse8)) |c_#memory_$Pointer$#2.base|)))) (let ((.cse10 (select |c_#memory_$Pointer$#2.base| .cse1))) (let ((.cse11 (select .cse10 .cse5))) (and (let ((.cse9 (= .cse1 .cse11))) (or (and .cse9 (exists ((v_prenex_3 Int)) (= (select .cse10 v_prenex_3) .cse1))) (and (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_arrayElimArr_2 (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.offset_6| Int)) (and (= .cse1 (select v_arrayElimArr_2 |v_ULTIMATE.start_dll_circular_create_~last~0#1.offset_6|)) (= .cse10 (store (select (store (store |c_#memory_$Pointer$#2.base| .cse1 v_DerPreprocessor_1) .cse11 v_arrayElimArr_2) .cse1) .cse5 .cse11)))) (not .cse9)))) (not (= |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base| .cse11)))))))))) is different from true [2024-11-18 13:08:53,272 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse10 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset|))) (and (let ((.cse2 (+ (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (or (exists ((|v_old(#memory_$Pointer$#2.base)_AFTER_CALL_6| (Array Int (Array Int Int)))) (let ((.cse0 (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_6| .cse1)) (.cse3 (@diff |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_6| |c_#memory_$Pointer$#2.base|))) (and (exists ((v_prenex_3 Int)) (= (select .cse0 v_prenex_3) .cse1)) (= (select .cse0 .cse2) .cse1) (= .cse3 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) (= (store |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_6| .cse3 (select |c_#memory_$Pointer$#2.base| .cse3)) |c_#memory_$Pointer$#2.base|)))) (let ((.cse5 (select |c_#memory_$Pointer$#2.base| .cse1))) (let ((.cse6 (select .cse5 .cse2))) (and (let ((.cse4 (= .cse1 .cse6))) (or (and .cse4 (exists ((v_prenex_3 Int)) (= (select .cse5 v_prenex_3) .cse1))) (and (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_arrayElimArr_2 (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.offset_6| Int)) (and (= .cse1 (select v_arrayElimArr_2 |v_ULTIMATE.start_dll_circular_create_~last~0#1.offset_6|)) (= .cse5 (store (select (store (store |c_#memory_$Pointer$#2.base| .cse1 v_DerPreprocessor_1) .cse6 v_arrayElimArr_2) .cse1) .cse2 .cse6)))) (not .cse4)))) (not (= |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| .cse6))))) (exists ((|v_old(#memory_$Pointer$#2.base)_AFTER_CALL_6| (Array Int (Array Int Int)))) (let ((.cse9 (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_6| .cse1))) (let ((.cse7 (@diff |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_6| |c_#memory_$Pointer$#2.base|)) (.cse8 (select .cse9 .cse2))) (and (= .cse7 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_arrayElimArr_2 (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.offset_6| Int)) (and (= (store (select (store (store |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_6| .cse1 v_DerPreprocessor_1) .cse8 v_arrayElimArr_2) .cse1) .cse2 .cse8) .cse9) (= .cse1 (select v_arrayElimArr_2 |v_ULTIMATE.start_dll_circular_create_~last~0#1.offset_6|)))) (= (store |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_6| .cse7 (select |c_#memory_$Pointer$#2.base| .cse7)) |c_#memory_$Pointer$#2.base|) (not (= .cse8 .cse1)) (not (= .cse8 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|)))))))) (not (= .cse1 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|)) (= |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (not (= .cse10 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|)) (not (= (select (select |c_#memory_$Pointer$#2.base| .cse10) (+ (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset|) 4)) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int#2| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) 8)) (= |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) is different from false [2024-11-18 13:08:53,277 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse10 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset|))) (and (let ((.cse2 (+ (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (or (exists ((|v_old(#memory_$Pointer$#2.base)_AFTER_CALL_6| (Array Int (Array Int Int)))) (let ((.cse0 (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_6| .cse1)) (.cse3 (@diff |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_6| |c_#memory_$Pointer$#2.base|))) (and (exists ((v_prenex_3 Int)) (= (select .cse0 v_prenex_3) .cse1)) (= (select .cse0 .cse2) .cse1) (= .cse3 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) (= (store |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_6| .cse3 (select |c_#memory_$Pointer$#2.base| .cse3)) |c_#memory_$Pointer$#2.base|)))) (let ((.cse5 (select |c_#memory_$Pointer$#2.base| .cse1))) (let ((.cse6 (select .cse5 .cse2))) (and (let ((.cse4 (= .cse1 .cse6))) (or (and .cse4 (exists ((v_prenex_3 Int)) (= (select .cse5 v_prenex_3) .cse1))) (and (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_arrayElimArr_2 (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.offset_6| Int)) (and (= .cse1 (select v_arrayElimArr_2 |v_ULTIMATE.start_dll_circular_create_~last~0#1.offset_6|)) (= .cse5 (store (select (store (store |c_#memory_$Pointer$#2.base| .cse1 v_DerPreprocessor_1) .cse6 v_arrayElimArr_2) .cse1) .cse2 .cse6)))) (not .cse4)))) (not (= |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| .cse6))))) (exists ((|v_old(#memory_$Pointer$#2.base)_AFTER_CALL_6| (Array Int (Array Int Int)))) (let ((.cse9 (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_6| .cse1))) (let ((.cse7 (@diff |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_6| |c_#memory_$Pointer$#2.base|)) (.cse8 (select .cse9 .cse2))) (and (= .cse7 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_arrayElimArr_2 (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.offset_6| Int)) (and (= (store (select (store (store |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_6| .cse1 v_DerPreprocessor_1) .cse8 v_arrayElimArr_2) .cse1) .cse2 .cse8) .cse9) (= .cse1 (select v_arrayElimArr_2 |v_ULTIMATE.start_dll_circular_create_~last~0#1.offset_6|)))) (= (store |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_6| .cse7 (select |c_#memory_$Pointer$#2.base| .cse7)) |c_#memory_$Pointer$#2.base|) (not (= .cse8 .cse1)) (not (= .cse8 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|)))))))) (not (= .cse1 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|)) (= |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (not (= .cse10 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|)) (not (= (select (select |c_#memory_$Pointer$#2.base| .cse10) (+ (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset|) 4)) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int#2| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) 8)) (= |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) is different from true [2024-11-18 13:08:53,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 13:08:53,444 INFO L93 Difference]: Finished difference Result 39 states and 44 transitions. [2024-11-18 13:08:53,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-18 13:08:53,445 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 29 states have (on average 1.4482758620689655) internal successors, (42), 24 states have internal predecessors, (42), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) Word has length 33 [2024-11-18 13:08:53,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 13:08:53,446 INFO L225 Difference]: With dead ends: 39 [2024-11-18 13:08:53,446 INFO L226 Difference]: Without dead ends: 37 [2024-11-18 13:08:53,447 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 297 ImplicationChecksByTransitivity, 21.2s TimeCoverageRelationStatistics Valid=147, Invalid=1425, Unknown=12, NotChecked=486, Total=2070 [2024-11-18 13:08:53,447 INFO L432 NwaCegarLoop]: 18 mSDtfsCounter, 7 mSDsluCounter, 282 mSDsCounter, 0 mSdLazyCounter, 506 mSolverCounterSat, 6 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 300 SdHoareTripleChecker+Invalid, 641 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 506 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 128 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-18 13:08:53,448 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 300 Invalid, 641 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 506 Invalid, 1 Unknown, 128 Unchecked, 0.5s Time] [2024-11-18 13:08:53,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2024-11-18 13:08:53,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2024-11-18 13:08:53,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 30 states have (on average 1.1333333333333333) internal successors, (34), 30 states have internal predecessors, (34), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-18 13:08:53,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 42 transitions. [2024-11-18 13:08:53,454 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 42 transitions. Word has length 33 [2024-11-18 13:08:53,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 13:08:53,456 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 42 transitions. [2024-11-18 13:08:53,456 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 29 states have (on average 1.4482758620689655) internal successors, (42), 24 states have internal predecessors, (42), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2024-11-18 13:08:53,456 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 42 transitions. [2024-11-18 13:08:53,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-18 13:08:53,457 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 13:08:53,458 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 13:08:53,476 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-18 13:08:53,661 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-18 13:08:53,662 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 13:08:53,662 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 13:08:53,662 INFO L85 PathProgramCache]: Analyzing trace with hash 1872551959, now seen corresponding path program 1 times [2024-11-18 13:08:53,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 13:08:53,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1356473853] [2024-11-18 13:08:53,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 13:08:53,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 13:08:53,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 13:08:56,726 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 13:08:56,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 13:08:56,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1356473853] [2024-11-18 13:08:56,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1356473853] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 13:08:56,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1493572649] [2024-11-18 13:08:56,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 13:08:56,726 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 13:08:56,727 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 13:08:56,728 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-18 13:08:56,729 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-18 13:08:56,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 13:08:56,885 INFO L255 TraceCheckSpWp]: Trace formula consists of 407 conjuncts, 125 conjuncts are in the unsatisfiable core [2024-11-18 13:08:56,891 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 13:08:56,937 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-18 13:08:57,142 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-18 13:08:57,218 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-18 13:08:57,218 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-18 13:08:57,274 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 25 treesize of output 13 [2024-11-18 13:08:57,366 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 18 treesize of output 13 [2024-11-18 13:08:57,520 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-18 13:08:57,523 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 32 treesize of output 29 [2024-11-18 13:08:57,527 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 13 [2024-11-18 13:08:57,536 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 34 [2024-11-18 13:08:57,543 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 23 [2024-11-18 13:08:57,547 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2024-11-18 13:08:57,687 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 42 treesize of output 14 [2024-11-18 13:08:57,695 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 17 treesize of output 3 [2024-11-18 13:08:57,699 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-18 13:08:57,797 INFO L349 Elim1Store]: treesize reduction 8, result has 77.1 percent of original size [2024-11-18 13:08:57,798 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-18 13:09:01,814 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse3 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse4 (select (select |c_#memory_$Pointer$#2.base| .cse0) (+ .cse3 4)))) (and (let ((.cse1 (+ .cse3 8))) (or (= (select (select |c_#memory_int#2| .cse0) .cse1) 1) (exists ((|v_#memory_int#2_BEFORE_CALL_2| (Array Int (Array Int Int)))) (let ((.cse2 (@diff |v_#memory_int#2_BEFORE_CALL_2| |c_#memory_int#2|))) (and (= |c_#memory_int#2| (store |v_#memory_int#2_BEFORE_CALL_2| .cse2 (select |c_#memory_int#2| .cse2))) (= (select (select |v_#memory_int#2_BEFORE_CALL_2| .cse0) .cse1) 1) (= .cse2 |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base|)))))) (= |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (not (= |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base| .cse0)) (not (= .cse0 .cse4)) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base| .cse4))))) is different from false [2024-11-18 13:09:01,817 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse3 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse4 (select (select |c_#memory_$Pointer$#2.base| .cse0) (+ .cse3 4)))) (and (let ((.cse1 (+ .cse3 8))) (or (= (select (select |c_#memory_int#2| .cse0) .cse1) 1) (exists ((|v_#memory_int#2_BEFORE_CALL_2| (Array Int (Array Int Int)))) (let ((.cse2 (@diff |v_#memory_int#2_BEFORE_CALL_2| |c_#memory_int#2|))) (and (= |c_#memory_int#2| (store |v_#memory_int#2_BEFORE_CALL_2| .cse2 (select |c_#memory_int#2| .cse2))) (= (select (select |v_#memory_int#2_BEFORE_CALL_2| .cse0) .cse1) 1) (= .cse2 |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base|)))))) (= |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (not (= |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base| .cse0)) (not (= .cse0 .cse4)) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base| .cse4))))) is different from true [2024-11-18 13:09:01,937 INFO L349 Elim1Store]: treesize reduction 98, result has 1.0 percent of original size [2024-11-18 13:09:01,938 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 500 treesize of output 465 [2024-11-18 13:09:01,948 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 622 treesize of output 491 [2024-11-18 13:09:01,967 INFO L349 Elim1Store]: treesize reduction 126, result has 0.8 percent of original size [2024-11-18 13:09:01,967 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 1061 treesize of output 705 [2024-11-18 13:09:01,982 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-18 13:09:01,988 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 72 treesize of output 57 [2024-11-18 13:09:02,010 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 327 treesize of output 256 [2024-11-18 13:09:02,021 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 673 treesize of output 542 [2024-11-18 13:09:02,028 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 495 treesize of output 439 [2024-11-18 13:09:02,035 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 394 treesize of output 347 [2024-11-18 13:09:02,046 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 66 treesize of output 31 [2024-11-18 13:09:02,056 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 49 treesize of output 31 [2024-11-18 13:09:02,087 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 1 [2024-11-18 13:09:02,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 368 treesize of output 272 [2024-11-18 13:09:02,232 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 272 treesize of output 180 [2024-11-18 13:09:02,350 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 184 treesize of output 128 [2024-11-18 13:09:02,355 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-18 13:09:02,356 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-18 13:09:02,357 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-18 13:09:02,360 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 20 [2024-11-18 13:09:02,366 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2024-11-18 13:09:02,471 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 13:09:02,472 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-18 13:09:02,971 INFO L349 Elim1Store]: treesize reduction 514, result has 36.6 percent of original size [2024-11-18 13:09:02,972 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 8966 treesize of output 6658 [2024-11-18 13:09:03,084 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-18 13:09:03,084 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 2648 treesize of output 2036 [2024-11-18 13:09:03,106 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 791 treesize of output 759 [2024-11-18 13:09:03,128 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 759 treesize of output 743 [2024-11-18 13:09:03,215 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 6 [2024-11-18 13:09:03,668 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 4 [2024-11-18 13:09:03,737 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 4 [2024-11-18 13:09:03,776 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-18 13:09:03,777 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 101 treesize of output 105 [2024-11-18 13:09:03,932 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-18 13:09:03,932 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 53 [2024-11-18 13:09:04,000 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2024-11-18 13:09:04,089 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-18 13:09:04,090 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 139 treesize of output 143 [2024-11-18 13:09:04,501 INFO L349 Elim1Store]: treesize reduction 14, result has 78.5 percent of original size [2024-11-18 13:09:04,502 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 861 treesize of output 869 [2024-11-18 13:09:05,358 INFO L349 Elim1Store]: treesize reduction 32, result has 74.8 percent of original size [2024-11-18 13:09:05,358 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 897 treesize of output 941