./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/list-simple/dll2n_insert_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/dll2n_insert_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 97351642d4f3bf3f6d868e0a3719427b4c33bd5e0f87a93a325784728b912f03 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-18 13:08:49,860 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-18 13:08:49,911 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-18 13:08:49,914 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-18 13:08:49,916 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-18 13:08:49,955 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-18 13:08:49,956 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-18 13:08:49,957 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-18 13:08:49,957 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-18 13:08:49,958 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-18 13:08:49,967 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-18 13:08:49,967 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-18 13:08:49,968 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-18 13:08:49,971 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-18 13:08:49,971 INFO L153 SettingsManager]: * Use SBE=true [2024-11-18 13:08:49,971 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-18 13:08:49,971 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-18 13:08:49,971 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-18 13:08:49,972 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-18 13:08:49,972 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-18 13:08:49,972 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-18 13:08:49,973 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-18 13:08:49,973 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-18 13:08:49,973 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-18 13:08:49,973 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-18 13:08:49,973 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-18 13:08:49,974 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-18 13:08:49,974 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-18 13:08:49,974 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-18 13:08:49,974 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-18 13:08:49,975 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-18 13:08:49,975 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-18 13:08:49,975 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-18 13:08:49,976 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-18 13:08:49,976 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-18 13:08:49,976 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-18 13:08:49,976 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-18 13:08:49,977 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-18 13:08:49,977 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-18 13:08:49,977 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-18 13:08:49,977 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-18 13:08:49,977 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-18 13:08:49,978 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 -> 97351642d4f3bf3f6d868e0a3719427b4c33bd5e0f87a93a325784728b912f03 [2024-11-18 13:08:50,240 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-18 13:08:50,260 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-18 13:08:50,263 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-18 13:08:50,264 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-18 13:08:50,265 INFO L274 PluginConnector]: CDTParser initialized [2024-11-18 13:08:50,265 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/dll2n_insert_unequal.i [2024-11-18 13:08:51,676 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-18 13:08:51,859 INFO L384 CDTParser]: Found 1 translation units. [2024-11-18 13:08:51,860 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2n_insert_unequal.i [2024-11-18 13:08:51,869 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6b0e4c886/ecdfa35e1c7a4ad6ad70b75c70b4a680/FLAGe9198807b [2024-11-18 13:08:51,879 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6b0e4c886/ecdfa35e1c7a4ad6ad70b75c70b4a680 [2024-11-18 13:08:51,882 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-18 13:08:51,883 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-18 13:08:51,889 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-18 13:08:51,889 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-18 13:08:51,893 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-18 13:08:51,894 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 01:08:51" (1/1) ... [2024-11-18 13:08:51,895 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@79670e93 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:08:51, skipping insertion in model container [2024-11-18 13:08:51,895 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 01:08:51" (1/1) ... [2024-11-18 13:08:51,926 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-18 13:08:52,273 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/dll2n_insert_unequal.i[24989,25002] [2024-11-18 13:08:52,279 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-18 13:08:52,288 INFO L200 MainTranslator]: Completed pre-run [2024-11-18 13:08:52,335 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/dll2n_insert_unequal.i[24989,25002] [2024-11-18 13:08:52,336 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-18 13:08:52,364 INFO L204 MainTranslator]: Completed translation [2024-11-18 13:08:52,364 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:08:52 WrapperNode [2024-11-18 13:08:52,364 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-18 13:08:52,365 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-18 13:08:52,366 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-18 13:08:52,366 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-18 13:08:52,372 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:08:52" (1/1) ... [2024-11-18 13:08:52,386 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:08:52" (1/1) ... [2024-11-18 13:08:52,409 INFO L138 Inliner]: procedures = 127, calls = 48, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 168 [2024-11-18 13:08:52,410 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-18 13:08:52,410 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-18 13:08:52,411 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-18 13:08:52,411 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-18 13:08:52,420 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:08:52" (1/1) ... [2024-11-18 13:08:52,421 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:08:52" (1/1) ... [2024-11-18 13:08:52,429 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:08:52" (1/1) ... [2024-11-18 13:08:52,460 INFO L175 MemorySlicer]: Split 31 memory accesses to 3 slices as follows [2, 21, 8]. 68 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 0, 1]. The 14 writes are split as follows [0, 13, 1]. [2024-11-18 13:08:52,460 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:08:52" (1/1) ... [2024-11-18 13:08:52,460 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:08:52" (1/1) ... [2024-11-18 13:08:52,468 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:08:52" (1/1) ... [2024-11-18 13:08:52,471 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:08:52" (1/1) ... [2024-11-18 13:08:52,472 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:08:52" (1/1) ... [2024-11-18 13:08:52,474 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:08:52" (1/1) ... [2024-11-18 13:08:52,479 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-18 13:08:52,480 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-18 13:08:52,480 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-18 13:08:52,480 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-18 13:08:52,481 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:08:52" (1/1) ... [2024-11-18 13:08:52,491 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-18 13:08:52,500 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 13:08:52,513 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:08:52,516 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:08:52,564 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2024-11-18 13:08:52,564 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2024-11-18 13:08:52,564 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-18 13:08:52,565 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-18 13:08:52,565 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-18 13:08:52,565 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-18 13:08:52,565 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-18 13:08:52,565 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-18 13:08:52,565 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-18 13:08:52,565 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-18 13:08:52,565 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-18 13:08:52,566 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-18 13:08:52,566 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-18 13:08:52,566 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-18 13:08:52,566 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-18 13:08:52,566 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-18 13:08:52,566 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-18 13:08:52,566 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-18 13:08:52,567 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-18 13:08:52,567 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-18 13:08:52,567 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-11-18 13:08:52,567 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-18 13:08:52,567 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-18 13:08:52,567 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-18 13:08:52,567 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-18 13:08:52,567 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-18 13:08:52,672 INFO L238 CfgBuilder]: Building ICFG [2024-11-18 13:08:52,674 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-18 13:08:52,690 INFO L735 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2024-11-18 13:08:52,864 INFO L? ?]: Removed 62 outVars from TransFormulas that were not future-live. [2024-11-18 13:08:52,865 INFO L287 CfgBuilder]: Performing block encoding [2024-11-18 13:08:52,875 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-18 13:08:52,877 INFO L316 CfgBuilder]: Removed 5 assume(true) statements. [2024-11-18 13:08:52,877 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 01:08:52 BoogieIcfgContainer [2024-11-18 13:08:52,877 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-18 13:08:52,880 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-18 13:08:52,880 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-18 13:08:52,882 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-18 13:08:52,883 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 01:08:51" (1/3) ... [2024-11-18 13:08:52,883 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f0c0759 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 01:08:52, skipping insertion in model container [2024-11-18 13:08:52,883 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:08:52" (2/3) ... [2024-11-18 13:08:52,883 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f0c0759 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 01:08:52, skipping insertion in model container [2024-11-18 13:08:52,884 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 01:08:52" (3/3) ... [2024-11-18 13:08:52,885 INFO L112 eAbstractionObserver]: Analyzing ICFG dll2n_insert_unequal.i [2024-11-18 13:08:52,897 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-18 13:08:52,898 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-18 13:08:52,939 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-18 13:08:52,944 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;@45c0594d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-18 13:08:52,944 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-18 13:08:52,950 INFO L276 IsEmpty]: Start isEmpty. Operand has 36 states, 32 states have (on average 1.65625) internal successors, (53), 34 states have internal predecessors, (53), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 13:08:52,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-18 13:08:52,955 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 13:08:52,955 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 13:08:52,956 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 13:08:52,959 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 13:08:52,959 INFO L85 PathProgramCache]: Analyzing trace with hash -504255867, now seen corresponding path program 1 times [2024-11-18 13:08:52,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 13:08:52,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1521174855] [2024-11-18 13:08:52,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 13:08:52,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 13:08:53,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 13:08:53,134 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 13:08:53,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 13:08:53,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1521174855] [2024-11-18 13:08:53,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1521174855] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 13:08:53,140 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 13:08:53,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-18 13:08:53,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855454762] [2024-11-18 13:08:53,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 13:08:53,147 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-18 13:08:53,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 13:08:53,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-18 13:08:53,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-18 13:08:53,168 INFO L87 Difference]: Start difference. First operand has 36 states, 32 states have (on average 1.65625) internal successors, (53), 34 states have internal predecessors, (53), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 13:08:53,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 13:08:53,185 INFO L93 Difference]: Finished difference Result 64 states and 98 transitions. [2024-11-18 13:08:53,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-18 13:08:53,186 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2024-11-18 13:08:53,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 13:08:53,192 INFO L225 Difference]: With dead ends: 64 [2024-11-18 13:08:53,192 INFO L226 Difference]: Without dead ends: 27 [2024-11-18 13:08:53,194 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:08:53,197 INFO L432 NwaCegarLoop]: 49 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, 49 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:08:53,198 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 13:08:53,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2024-11-18 13:08:53,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2024-11-18 13:08:53,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 26 states have (on average 1.4230769230769231) internal successors, (37), 26 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 13:08:53,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 37 transitions. [2024-11-18 13:08:53,256 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 37 transitions. Word has length 15 [2024-11-18 13:08:53,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 13:08:53,256 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 37 transitions. [2024-11-18 13:08:53,257 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 13:08:53,257 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 37 transitions. [2024-11-18 13:08:53,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-18 13:08:53,258 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 13:08:53,258 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 13:08:53,258 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-18 13:08:53,258 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 13:08:53,259 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 13:08:53,259 INFO L85 PathProgramCache]: Analyzing trace with hash 775433970, now seen corresponding path program 1 times [2024-11-18 13:08:53,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 13:08:53,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1503512901] [2024-11-18 13:08:53,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 13:08:53,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 13:08:53,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 13:08:53,455 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 13:08:53,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 13:08:53,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1503512901] [2024-11-18 13:08:53,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1503512901] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 13:08:53,456 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 13:08:53,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-18 13:08:53,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [992616284] [2024-11-18 13:08:53,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 13:08:53,458 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 13:08:53,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 13:08:53,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 13:08:53,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 13:08:53,459 INFO L87 Difference]: Start difference. First operand 27 states and 37 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 13:08:53,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 13:08:53,475 INFO L93 Difference]: Finished difference Result 52 states and 72 transitions. [2024-11-18 13:08:53,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 13:08:53,475 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2024-11-18 13:08:53,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 13:08:53,476 INFO L225 Difference]: With dead ends: 52 [2024-11-18 13:08:53,476 INFO L226 Difference]: Without dead ends: 32 [2024-11-18 13:08:53,477 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:08:53,478 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 5 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 67 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:08:53,479 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 67 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 13:08:53,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-11-18 13:08:53,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 28. [2024-11-18 13:08:53,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 27 states have (on average 1.4074074074074074) internal successors, (38), 27 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 13:08:53,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 38 transitions. [2024-11-18 13:08:53,485 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 38 transitions. Word has length 15 [2024-11-18 13:08:53,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 13:08:53,486 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 38 transitions. [2024-11-18 13:08:53,486 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 13:08:53,487 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 38 transitions. [2024-11-18 13:08:53,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-18 13:08:53,487 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 13:08:53,488 INFO L215 NwaCegarLoop]: trace histogram [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,488 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-18 13:08:53,488 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 13:08:53,488 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 13:08:53,490 INFO L85 PathProgramCache]: Analyzing trace with hash -1038406110, now seen corresponding path program 1 times [2024-11-18 13:08:53,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 13:08:53,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [833246889] [2024-11-18 13:08:53,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 13:08:53,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 13:08:53,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 13:08:53,565 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 13:08:53,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 13:08:53,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [833246889] [2024-11-18 13:08:53,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [833246889] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 13:08:53,565 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 13:08:53,566 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-18 13:08:53,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [107294256] [2024-11-18 13:08:53,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 13:08:53,566 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 13:08:53,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 13:08:53,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 13:08:53,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 13:08:53,567 INFO L87 Difference]: Start difference. First operand 28 states and 38 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 13:08:53,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 13:08:53,582 INFO L93 Difference]: Finished difference Result 56 states and 77 transitions. [2024-11-18 13:08:53,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 13:08:53,582 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2024-11-18 13:08:53,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 13:08:53,583 INFO L225 Difference]: With dead ends: 56 [2024-11-18 13:08:53,583 INFO L226 Difference]: Without dead ends: 31 [2024-11-18 13:08:53,583 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:08:53,584 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 0 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 13:08:53,584 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 65 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 13:08:53,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2024-11-18 13:08:53,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2024-11-18 13:08:53,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 30 states have (on average 1.3666666666666667) internal successors, (41), 30 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 13:08:53,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 41 transitions. [2024-11-18 13:08:53,587 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 41 transitions. Word has length 20 [2024-11-18 13:08:53,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 13:08:53,587 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 41 transitions. [2024-11-18 13:08:53,587 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 13:08:53,587 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 41 transitions. [2024-11-18 13:08:53,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-18 13:08:53,588 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 13:08:53,588 INFO L215 NwaCegarLoop]: trace histogram [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,588 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-18 13:08:53,588 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 13:08:53,589 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 13:08:53,589 INFO L85 PathProgramCache]: Analyzing trace with hash 1976697508, now seen corresponding path program 1 times [2024-11-18 13:08:53,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 13:08:53,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [368112524] [2024-11-18 13:08:53,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 13:08:53,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 13:08:53,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 13:08:53,667 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 13:08:53,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 13:08:53,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [368112524] [2024-11-18 13:08:53,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [368112524] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 13:08:53,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1552049451] [2024-11-18 13:08:53,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 13:08:53,668 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 13:08:53,669 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 13:08:53,670 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:08:53,671 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:08:53,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 13:08:53,846 INFO L255 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-18 13:08:53,855 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 13:08:53,940 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 13:08:53,940 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-18 13:08:53,960 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 13:08:53,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1552049451] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-18 13:08:53,962 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-18 13:08:53,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2024-11-18 13:08:53,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390546305] [2024-11-18 13:08:53,962 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-18 13:08:53,963 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-18 13:08:53,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 13:08:53,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-18 13:08:53,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-18 13:08:53,965 INFO L87 Difference]: Start difference. First operand 31 states and 41 transitions. Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 13:08:53,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 13:08:53,989 INFO L93 Difference]: Finished difference Result 53 states and 72 transitions. [2024-11-18 13:08:53,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-18 13:08:53,990 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2024-11-18 13:08:53,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 13:08:53,990 INFO L225 Difference]: With dead ends: 53 [2024-11-18 13:08:53,990 INFO L226 Difference]: Without dead ends: 33 [2024-11-18 13:08:53,991 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 37 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-18 13:08:53,992 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 5 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 13:08:53,993 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 95 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 13:08:53,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2024-11-18 13:08:53,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2024-11-18 13:08:53,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 32 states have (on average 1.34375) internal successors, (43), 32 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 13:08:53,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 43 transitions. [2024-11-18 13:08:53,996 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 43 transitions. Word has length 20 [2024-11-18 13:08:53,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 13:08:53,996 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 43 transitions. [2024-11-18 13:08:53,996 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 13:08:53,997 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 43 transitions. [2024-11-18 13:08:53,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-18 13:08:53,997 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 13:08:53,997 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 13:08:54,011 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:54,199 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 13:08:54,201 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 13:08:54,201 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 13:08:54,201 INFO L85 PathProgramCache]: Analyzing trace with hash -1871980112, now seen corresponding path program 1 times [2024-11-18 13:08:54,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 13:08:54,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [21424809] [2024-11-18 13:08:54,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 13:08:54,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 13:08:54,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 13:08:54,327 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-18 13:08:54,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 13:08:54,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [21424809] [2024-11-18 13:08:54,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [21424809] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 13:08:54,327 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 13:08:54,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-18 13:08:54,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [174788318] [2024-11-18 13:08:54,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 13:08:54,328 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 13:08:54,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 13:08:54,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 13:08:54,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 13:08:54,329 INFO L87 Difference]: Start difference. First operand 33 states and 43 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 13:08:54,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 13:08:54,345 INFO L93 Difference]: Finished difference Result 46 states and 63 transitions. [2024-11-18 13:08:54,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 13:08:54,346 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2024-11-18 13:08:54,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 13:08:54,346 INFO L225 Difference]: With dead ends: 46 [2024-11-18 13:08:54,347 INFO L226 Difference]: Without dead ends: 35 [2024-11-18 13:08:54,347 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:08:54,348 INFO L432 NwaCegarLoop]: 36 mSDtfsCounter, 0 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 67 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:08:54,349 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 67 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 13:08:54,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2024-11-18 13:08:54,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2024-11-18 13:08:54,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 34 states have (on average 1.3529411764705883) internal successors, (46), 34 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 13:08:54,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 46 transitions. [2024-11-18 13:08:54,355 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 46 transitions. Word has length 25 [2024-11-18 13:08:54,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 13:08:54,355 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 46 transitions. [2024-11-18 13:08:54,355 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 13:08:54,355 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 46 transitions. [2024-11-18 13:08:54,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-18 13:08:54,356 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 13:08:54,357 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 13:08:54,357 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-18 13:08:54,357 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 13:08:54,360 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 13:08:54,360 INFO L85 PathProgramCache]: Analyzing trace with hash 835167343, now seen corresponding path program 1 times [2024-11-18 13:08:54,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 13:08:54,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951543041] [2024-11-18 13:08:54,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 13:08:54,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 13:08:54,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 13:08:54,506 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-18 13:08:54,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 13:08:54,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1951543041] [2024-11-18 13:08:54,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1951543041] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 13:08:54,507 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 13:08:54,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-18 13:08:54,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819440948] [2024-11-18 13:08:54,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 13:08:54,508 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-18 13:08:54,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 13:08:54,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-18 13:08:54,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-18 13:08:54,509 INFO L87 Difference]: Start difference. First operand 35 states and 46 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 13:08:54,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 13:08:54,530 INFO L93 Difference]: Finished difference Result 49 states and 64 transitions. [2024-11-18 13:08:54,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-18 13:08:54,531 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2024-11-18 13:08:54,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 13:08:54,531 INFO L225 Difference]: With dead ends: 49 [2024-11-18 13:08:54,533 INFO L226 Difference]: Without dead ends: 36 [2024-11-18 13:08:54,533 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-18 13:08:54,533 INFO L432 NwaCegarLoop]: 34 mSDtfsCounter, 27 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 13:08:54,534 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 65 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 13:08:54,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2024-11-18 13:08:54,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 34. [2024-11-18 13:08:54,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 33 states have (on average 1.3333333333333333) internal successors, (44), 33 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 13:08:54,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 44 transitions. [2024-11-18 13:08:54,540 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 44 transitions. Word has length 26 [2024-11-18 13:08:54,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 13:08:54,541 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 44 transitions. [2024-11-18 13:08:54,541 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 13:08:54,542 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 44 transitions. [2024-11-18 13:08:54,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-18 13:08:54,542 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 13:08:54,542 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 13:08:54,542 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-18 13:08:54,543 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 13:08:54,543 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 13:08:54,543 INFO L85 PathProgramCache]: Analyzing trace with hash -1615339204, now seen corresponding path program 1 times [2024-11-18 13:08:54,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 13:08:54,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [853840907] [2024-11-18 13:08:54,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 13:08:54,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 13:08:54,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 13:08:56,013 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 13:08:56,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 13:08:56,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [853840907] [2024-11-18 13:08:56,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [853840907] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 13:08:56,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1469801226] [2024-11-18 13:08:56,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 13:08:56,015 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 13:08:56,015 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 13:08:56,017 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:56,021 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:56,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 13:08:56,342 INFO L255 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 84 conjuncts are in the unsatisfiable core [2024-11-18 13:08:56,346 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 13:08:56,419 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:56,561 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-18 13:08:56,562 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:56,625 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 7 [2024-11-18 13:08:56,631 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 7 [2024-11-18 13:08:56,699 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-18 13:08:56,699 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2024-11-18 13:08:56,712 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 24 treesize of output 11 [2024-11-18 13:08:56,978 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2024-11-18 13:08:56,979 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2024-11-18 13:08:57,069 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 37 treesize of output 26 [2024-11-18 13:08:57,087 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2024-11-18 13:08:57,200 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 16 [2024-11-18 13:08:57,279 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 34 [2024-11-18 13:08:57,284 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2024-11-18 13:08:57,328 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 20 treesize of output 15 [2024-11-18 13:08:57,367 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-11-18 13:08:57,424 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 13:08:57,425 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-18 13:08:57,819 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_588 Int) (v_ArrVal_591 (Array Int Int)) (v_ArrVal_593 (Array Int Int)) (v_ArrVal_586 (Array Int Int)) (v_ArrVal_585 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_insert_~head#1.base|) |c_ULTIMATE.start_dll_insert_~head#1.offset|)) (.cse1 (+ (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_insert_~head#1.base|) |c_ULTIMATE.start_dll_insert_~head#1.offset|) 4))) (store (store (store |c_#memory_int#1| .cse0 (store (select (store |c_#memory_int#1| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_586) .cse0) .cse1 v_ArrVal_588)) |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_591) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_585) .cse0) .cse1) v_ArrVal_593)) (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) is different from false [2024-11-18 13:08:57,862 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 72 treesize of output 52 [2024-11-18 13:08:57,866 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 56 treesize of output 40 [2024-11-18 13:08:59,412 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-18 13:08:59,412 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 324 treesize of output 316 [2024-11-18 13:08:59,422 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 108 treesize of output 100 [2024-11-18 13:08:59,430 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 63 [2024-11-18 13:08:59,435 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 63 treesize of output 61 [2024-11-18 13:08:59,443 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-18 13:08:59,444 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 113 treesize of output 103 [2024-11-18 13:08:59,450 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 185 treesize of output 167 [2024-11-18 13:08:59,458 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 143 treesize of output 127 [2024-11-18 13:08:59,463 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 127 treesize of output 119 [2024-11-18 13:08:59,469 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 53 treesize of output 49 [2024-11-18 13:08:59,745 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 13:08:59,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1469801226] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-18 13:08:59,745 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-18 13:08:59,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 46 [2024-11-18 13:08:59,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [963800260] [2024-11-18 13:08:59,746 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-18 13:08:59,746 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2024-11-18 13:08:59,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 13:08:59,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2024-11-18 13:08:59,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=1770, Unknown=67, NotChecked=86, Total=2070 [2024-11-18 13:08:59,748 INFO L87 Difference]: Start difference. First operand 34 states and 44 transitions. Second operand has 46 states, 46 states have (on average 1.5217391304347827) internal successors, (70), 46 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 13:09:01,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 13:09:01,132 INFO L93 Difference]: Finished difference Result 60 states and 80 transitions. [2024-11-18 13:09:01,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-18 13:09:01,132 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 46 states have (on average 1.5217391304347827) internal successors, (70), 46 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2024-11-18 13:09:01,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 13:09:01,133 INFO L225 Difference]: With dead ends: 60 [2024-11-18 13:09:01,133 INFO L226 Difference]: Without dead ends: 58 [2024-11-18 13:09:01,134 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 718 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=329, Invalid=3266, Unknown=69, NotChecked=118, Total=3782 [2024-11-18 13:09:01,136 INFO L432 NwaCegarLoop]: 14 mSDtfsCounter, 74 mSDsluCounter, 260 mSDsCounter, 0 mSdLazyCounter, 962 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 274 SdHoareTripleChecker+Invalid, 1042 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 962 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 68 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-18 13:09:01,138 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 274 Invalid, 1042 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 962 Invalid, 0 Unknown, 68 Unchecked, 0.7s Time] [2024-11-18 13:09:01,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2024-11-18 13:09:01,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 40. [2024-11-18 13:09:01,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 39 states have (on average 1.3846153846153846) internal successors, (54), 39 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 13:09:01,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 54 transitions. [2024-11-18 13:09:01,144 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 54 transitions. Word has length 26 [2024-11-18 13:09:01,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 13:09:01,144 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 54 transitions. [2024-11-18 13:09:01,144 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 46 states have (on average 1.5217391304347827) internal successors, (70), 46 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 13:09:01,144 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 54 transitions. [2024-11-18 13:09:01,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-18 13:09:01,145 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 13:09:01,145 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 13:09:01,159 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-18 13:09:01,345 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,SelfDestructingSolverStorable6 [2024-11-18 13:09:01,346 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 13:09:01,346 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 13:09:01,347 INFO L85 PathProgramCache]: Analyzing trace with hash 201100899, now seen corresponding path program 1 times [2024-11-18 13:09:01,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 13:09:01,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2094955135] [2024-11-18 13:09:01,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 13:09:01,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 13:09:01,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 13:09:01,430 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-18 13:09:01,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 13:09:01,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2094955135] [2024-11-18 13:09:01,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2094955135] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 13:09:01,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [30061915] [2024-11-18 13:09:01,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 13:09:01,431 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 13:09:01,431 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 13:09:01,434 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:09:01,436 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:09:01,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 13:09:01,549 INFO L255 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-18 13:09:01,551 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 13:09:01,567 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-18 13:09:01,568 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-18 13:09:01,610 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-18 13:09:01,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [30061915] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-18 13:09:01,611 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-18 13:09:01,611 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2024-11-18 13:09:01,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1916699507] [2024-11-18 13:09:01,611 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-18 13:09:01,612 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-18 13:09:01,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 13:09:01,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-18 13:09:01,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-18 13:09:01,612 INFO L87 Difference]: Start difference. First operand 40 states and 54 transitions. Second operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 13:09:01,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 13:09:01,688 INFO L93 Difference]: Finished difference Result 53 states and 72 transitions. [2024-11-18 13:09:01,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-18 13:09:01,688 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2024-11-18 13:09:01,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 13:09:01,689 INFO L225 Difference]: With dead ends: 53 [2024-11-18 13:09:01,689 INFO L226 Difference]: Without dead ends: 42 [2024-11-18 13:09:01,689 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-11-18 13:09:01,690 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 2 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 13:09:01,690 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 147 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 13:09:01,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2024-11-18 13:09:01,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 41. [2024-11-18 13:09:01,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 40 states have (on average 1.375) internal successors, (55), 40 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 13:09:01,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 55 transitions. [2024-11-18 13:09:01,693 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 55 transitions. Word has length 27 [2024-11-18 13:09:01,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 13:09:01,693 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 55 transitions. [2024-11-18 13:09:01,694 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 13:09:01,694 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 55 transitions. [2024-11-18 13:09:01,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-18 13:09:01,694 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 13:09:01,694 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 13:09:01,708 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-18 13:09:01,898 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 13:09:01,898 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 13:09:01,899 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 13:09:01,899 INFO L85 PathProgramCache]: Analyzing trace with hash 258359201, now seen corresponding path program 1 times [2024-11-18 13:09:01,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 13:09:01,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1828087370] [2024-11-18 13:09:01,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 13:09:01,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 13:09:01,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 13:09:02,049 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-18 13:09:02,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 13:09:02,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1828087370] [2024-11-18 13:09:02,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1828087370] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 13:09:02,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1019632362] [2024-11-18 13:09:02,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 13:09:02,050 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 13:09:02,050 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 13:09:02,051 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-18 13:09:02,052 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-18 13:09:02,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 13:09:02,177 INFO L255 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-18 13:09:02,178 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 13:09:02,214 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:09:02,229 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-18 13:09:02,229 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-18 13:09:02,248 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-18 13:09:02,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1019632362] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-18 13:09:02,248 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-18 13:09:02,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 11 [2024-11-18 13:09:02,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1430364719] [2024-11-18 13:09:02,249 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-18 13:09:02,249 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-18 13:09:02,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 13:09:02,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-18 13:09:02,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-11-18 13:09:02,250 INFO L87 Difference]: Start difference. First operand 41 states and 55 transitions. Second operand has 11 states, 11 states have (on average 3.090909090909091) internal successors, (34), 11 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 13:09:02,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 13:09:02,362 INFO L93 Difference]: Finished difference Result 74 states and 102 transitions. [2024-11-18 13:09:02,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-18 13:09:02,362 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.090909090909091) internal successors, (34), 11 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2024-11-18 13:09:02,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 13:09:02,363 INFO L225 Difference]: With dead ends: 74 [2024-11-18 13:09:02,363 INFO L226 Difference]: Without dead ends: 41 [2024-11-18 13:09:02,363 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2024-11-18 13:09:02,363 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 17 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 202 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-18 13:09:02,364 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 202 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-18 13:09:02,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2024-11-18 13:09:02,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 40. [2024-11-18 13:09:02,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 39 states have (on average 1.3333333333333333) internal successors, (52), 39 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 13:09:02,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 52 transitions. [2024-11-18 13:09:02,367 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 52 transitions. Word has length 27 [2024-11-18 13:09:02,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 13:09:02,367 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 52 transitions. [2024-11-18 13:09:02,368 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.090909090909091) internal successors, (34), 11 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 13:09:02,368 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 52 transitions. [2024-11-18 13:09:02,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-18 13:09:02,368 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 13:09:02,368 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 13:09:02,385 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-18 13:09:02,572 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 13:09:02,573 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 13:09:02,574 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 13:09:02,574 INFO L85 PathProgramCache]: Analyzing trace with hash 1464037342, now seen corresponding path program 1 times [2024-11-18 13:09:02,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 13:09:02,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1093601387] [2024-11-18 13:09:02,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 13:09:02,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 13:09:02,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 13:09:02,799 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-18 13:09:02,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 13:09:02,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1093601387] [2024-11-18 13:09:02,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1093601387] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 13:09:02,800 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 13:09:02,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-18 13:09:02,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [312915750] [2024-11-18 13:09:02,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 13:09:02,800 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-18 13:09:02,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 13:09:02,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-18 13:09:02,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-18 13:09:02,801 INFO L87 Difference]: Start difference. First operand 40 states and 52 transitions. Second operand has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 13:09:02,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 13:09:02,913 INFO L93 Difference]: Finished difference Result 53 states and 69 transitions. [2024-11-18 13:09:02,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-18 13:09:02,913 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2024-11-18 13:09:02,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 13:09:02,914 INFO L225 Difference]: With dead ends: 53 [2024-11-18 13:09:02,914 INFO L226 Difference]: Without dead ends: 46 [2024-11-18 13:09:02,914 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-11-18 13:09:02,914 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 14 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-18 13:09:02,915 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 139 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-18 13:09:02,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2024-11-18 13:09:02,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 42. [2024-11-18 13:09:02,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 41 states have (on average 1.2926829268292683) internal successors, (53), 41 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 13:09:02,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 53 transitions. [2024-11-18 13:09:02,919 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 53 transitions. Word has length 27 [2024-11-18 13:09:02,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 13:09:02,920 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 53 transitions. [2024-11-18 13:09:02,920 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 13:09:02,920 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 53 transitions. [2024-11-18 13:09:02,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-18 13:09:02,920 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 13:09:02,920 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 13:09:02,921 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-18 13:09:02,921 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 13:09:02,921 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 13:09:02,921 INFO L85 PathProgramCache]: Analyzing trace with hash 2045561648, now seen corresponding path program 2 times [2024-11-18 13:09:02,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 13:09:02,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [37804332] [2024-11-18 13:09:02,921 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-18 13:09:02,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 13:09:02,942 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-18 13:09:02,942 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-18 13:09:03,011 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-18 13:09:03,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 13:09:03,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [37804332] [2024-11-18 13:09:03,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [37804332] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 13:09:03,011 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 13:09:03,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-18 13:09:03,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980171320] [2024-11-18 13:09:03,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 13:09:03,012 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-18 13:09:03,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 13:09:03,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-18 13:09:03,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-18 13:09:03,013 INFO L87 Difference]: Start difference. First operand 42 states and 53 transitions. Second operand has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 13:09:03,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 13:09:03,028 INFO L93 Difference]: Finished difference Result 53 states and 67 transitions. [2024-11-18 13:09:03,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-18 13:09:03,028 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2024-11-18 13:09:03,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 13:09:03,029 INFO L225 Difference]: With dead ends: 53 [2024-11-18 13:09:03,029 INFO L226 Difference]: Without dead ends: 36 [2024-11-18 13:09:03,029 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-18 13:09:03,029 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 22 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 13:09:03,029 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 84 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 13:09:03,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2024-11-18 13:09:03,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 34. [2024-11-18 13:09:03,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 33 states have (on average 1.2121212121212122) internal successors, (40), 33 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 13:09:03,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 40 transitions. [2024-11-18 13:09:03,033 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 40 transitions. Word has length 27 [2024-11-18 13:09:03,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 13:09:03,033 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 40 transitions. [2024-11-18 13:09:03,034 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 13:09:03,034 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 40 transitions. [2024-11-18 13:09:03,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-18 13:09:03,034 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 13:09:03,034 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 13:09:03,034 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-18 13:09:03,035 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 13:09:03,035 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 13:09:03,035 INFO L85 PathProgramCache]: Analyzing trace with hash -1857767657, now seen corresponding path program 1 times [2024-11-18 13:09:03,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 13:09:03,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1744177779] [2024-11-18 13:09:03,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 13:09:03,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 13:09:03,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 13:09:03,244 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-18 13:09:03,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 13:09:03,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1744177779] [2024-11-18 13:09:03,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1744177779] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 13:09:03,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [989925109] [2024-11-18 13:09:03,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 13:09:03,245 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 13:09:03,245 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 13:09:03,248 INFO L229 MonitoredProcess]: Starting monitored process 6 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:09:03,253 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-18 13:09:03,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 13:09:03,389 INFO L255 TraceCheckSpWp]: Trace formula consists of 340 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-18 13:09:03,391 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 13:09:03,421 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-18 13:09:03,422 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-18 13:09:03,472 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-18 13:09:03,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [989925109] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-18 13:09:03,472 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-18 13:09:03,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 14 [2024-11-18 13:09:03,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1151249605] [2024-11-18 13:09:03,473 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-18 13:09:03,473 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-18 13:09:03,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 13:09:03,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-18 13:09:03,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2024-11-18 13:09:03,474 INFO L87 Difference]: Start difference. First operand 34 states and 40 transitions. Second operand has 14 states, 14 states have (on average 3.7857142857142856) internal successors, (53), 14 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 13:09:03,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 13:09:03,551 INFO L93 Difference]: Finished difference Result 44 states and 52 transitions. [2024-11-18 13:09:03,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-18 13:09:03,551 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.7857142857142856) internal successors, (53), 14 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2024-11-18 13:09:03,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 13:09:03,551 INFO L225 Difference]: With dead ends: 44 [2024-11-18 13:09:03,551 INFO L226 Difference]: Without dead ends: 35 [2024-11-18 13:09:03,552 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=83, Invalid=259, Unknown=0, NotChecked=0, Total=342 [2024-11-18 13:09:03,552 INFO L432 NwaCegarLoop]: 23 mSDtfsCounter, 28 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 13:09:03,552 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 170 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 13:09:03,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2024-11-18 13:09:03,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 33. [2024-11-18 13:09:03,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 32 states have (on average 1.15625) internal successors, (37), 32 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 13:09:03,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2024-11-18 13:09:03,556 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 28 [2024-11-18 13:09:03,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 13:09:03,556 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2024-11-18 13:09:03,556 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.7857142857142856) internal successors, (53), 14 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 13:09:03,556 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2024-11-18 13:09:03,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-18 13:09:03,557 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 13:09:03,557 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 13:09:03,571 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-18 13:09:03,761 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-11-18 13:09:03,762 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 13:09:03,762 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 13:09:03,762 INFO L85 PathProgramCache]: Analyzing trace with hash -1756277405, now seen corresponding path program 1 times [2024-11-18 13:09:03,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 13:09:03,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1335709377] [2024-11-18 13:09:03,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 13:09:03,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 13:09:03,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 13:09:05,415 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 13:09:05,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 13:09:05,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1335709377] [2024-11-18 13:09:05,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1335709377] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 13:09:05,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [826375083] [2024-11-18 13:09:05,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 13:09:05,417 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 13:09:05,417 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 13:09:05,421 INFO L229 MonitoredProcess]: Starting monitored process 7 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:09:05,422 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-18 13:09:05,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 13:09:05,744 INFO L255 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 101 conjuncts are in the unsatisfiable core [2024-11-18 13:09:05,751 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 13:09:05,778 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:09:05,844 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-18 13:09:05,844 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:09:05,890 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 7 [2024-11-18 13:09:05,958 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-18 13:09:05,958 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 33 [2024-11-18 13:09:06,082 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2024-11-18 13:09:06,082 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2024-11-18 13:09:06,160 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 37 treesize of output 26 [2024-11-18 13:09:06,172 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-18 13:09:06,366 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-18 13:09:06,369 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 34 [2024-11-18 13:09:06,373 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 35 [2024-11-18 13:09:06,383 INFO L349 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2024-11-18 13:09:06,384 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 136 treesize of output 93 [2024-11-18 13:09:06,390 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 36 [2024-11-18 13:09:06,393 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 36 treesize of output 15 [2024-11-18 13:09:06,397 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 49 treesize of output 19 [2024-11-18 13:09:06,456 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 52 treesize of output 35 [2024-11-18 13:09:06,459 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 24 treesize of output 19 [2024-11-18 13:09:06,462 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2024-11-18 13:09:06,513 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 50 treesize of output 30 [2024-11-18 13:09:06,554 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 27 treesize of output 15 [2024-11-18 13:09:06,558 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 7 treesize of output 3 [2024-11-18 13:09:06,614 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:09:06,616 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 13:09:06,616 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-18 13:09:06,684 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1386 (Array Int Int)) (v_ArrVal_1385 (Array Int Int)) (v_ArrVal_1384 (Array Int Int))) (= |c_ULTIMATE.start_main_~uneq~0#1| (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse1 (+ (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1384) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1385) .cse0) .cse1)) (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1386) .cse0) .cse1))))) is different from false [2024-11-18 13:09:06,692 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-18 13:09:06,692 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 91 treesize of output 92 [2024-11-18 13:09:06,703 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-18 13:09:06,703 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 346 treesize of output 345 [2024-11-18 13:09:06,708 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 322 treesize of output 306 [2024-11-18 13:09:06,715 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 156 treesize of output 148 [2024-11-18 13:09:07,161 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse14 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse8 (= |c_ULTIMATE.start_dll_insert_~last~0#1.base| .cse4))) (let ((.cse6 (not .cse8)) (.cse1 (+ |c_ULTIMATE.start_dll_insert_~new_node~0#1.offset| 8)) (.cse2 (+ |c_ULTIMATE.start_dll_insert_~new_node~0#1.offset| 4)) (.cse3 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_insert_~snd_to_last~0#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_insert_~snd_to_last~0#1.base|) (+ |c_ULTIMATE.start_dll_insert_~snd_to_last~0#1.offset| 4) |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|))) (.cse5 (+ .cse14 4)) (.cse23 (= |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| .cse4))) (let ((.cse15 (or (and (forall ((v_ArrVal_1380 Int) (v_ArrVal_1383 Int) (v_ArrVal_1379 (Array Int Int)) (v_ArrVal_1385 (Array Int Int)) (v_ArrVal_1384 (Array Int Int)) (v_ArrVal_1382 (Array Int Int)) (v_arrayElimCell_44 Int)) (let ((.cse35 (select (store (let ((.cse36 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_insert_~snd_to_last~0#1.base| v_ArrVal_1379))) (store .cse36 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| (store (store (select .cse36 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|) .cse1 v_ArrVal_1380) .cse2 v_ArrVal_1383))) |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1384) (select (select (store (store .cse3 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_1382) |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1385) .cse4) .cse5)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse35 v_arrayElimCell_44)) (forall ((v_arrayElimCell_46 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse35 v_arrayElimCell_46)))))) (or (forall ((v_ArrVal_1380 Int) (v_ArrVal_1383 Int) (v_ArrVal_1379 (Array Int Int)) (v_ArrVal_1385 (Array Int Int)) (v_ArrVal_1384 (Array Int Int)) (v_ArrVal_1382 (Array Int Int)) (v_arrayElimCell_44 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (let ((.cse37 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_insert_~snd_to_last~0#1.base| v_ArrVal_1379))) (store .cse37 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| (store (store (select .cse37 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|) .cse1 v_ArrVal_1380) .cse2 v_ArrVal_1383))) |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1384) (select (select (store (store .cse3 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_1382) |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1385) .cse4) .cse5)) v_arrayElimCell_44))) .cse8)) .cse23)) (.cse16 (forall ((v_ArrVal_1380 Int) (v_ArrVal_1383 Int) (v_ArrVal_1379 (Array Int Int)) (v_arrayElimCell_47 Int) (v_ArrVal_1385 (Array Int Int)) (v_ArrVal_1384 (Array Int Int)) (v_ArrVal_1382 (Array Int Int)) (v_arrayElimCell_44 Int)) (let ((.cse33 (select (store (let ((.cse34 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_insert_~snd_to_last~0#1.base| v_ArrVal_1379))) (store .cse34 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| (store (store (select .cse34 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|) .cse1 v_ArrVal_1380) .cse2 v_ArrVal_1383))) |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1384) (select (select (store (store .cse3 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_1382) |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1385) .cse4) .cse5)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse33 v_arrayElimCell_47)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse33 v_arrayElimCell_44)) (forall ((v_arrayElimCell_46 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse33 v_arrayElimCell_46))))))) (.cse11 (not .cse23)) (.cse17 (or (forall ((v_ArrVal_1380 Int) (v_ArrVal_1383 Int) (v_ArrVal_1379 (Array Int Int)) (v_arrayElimCell_47 Int) (v_ArrVal_1385 (Array Int Int)) (v_ArrVal_1384 (Array Int Int)) (v_ArrVal_1382 (Array Int Int)) (v_arrayElimCell_44 Int)) (let ((.cse31 (select (store (let ((.cse32 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_insert_~snd_to_last~0#1.base| v_ArrVal_1379))) (store .cse32 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| (store (store (select .cse32 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|) .cse1 v_ArrVal_1380) .cse2 v_ArrVal_1383))) |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1384) (select (select (store (store .cse3 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_1382) |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1385) .cse4) .cse5)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse31 v_arrayElimCell_47)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse31 v_arrayElimCell_44))))) .cse8)) (.cse18 (or .cse6 (forall ((v_ArrVal_1380 Int) (v_ArrVal_1383 Int) (v_ArrVal_1379 (Array Int Int)) (v_arrayElimCell_46 Int) (v_ArrVal_1385 (Array Int Int)) (v_ArrVal_1384 (Array Int Int)) (v_ArrVal_1382 (Array Int Int)) (v_arrayElimCell_44 Int)) (let ((.cse29 (select (store (let ((.cse30 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_insert_~snd_to_last~0#1.base| v_ArrVal_1379))) (store .cse30 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| (store (store (select .cse30 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|) .cse1 v_ArrVal_1380) .cse2 v_ArrVal_1383))) |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1384) (select (select (store (store .cse3 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_1382) |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1385) .cse4) .cse5)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse29 v_arrayElimCell_46)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse29 v_arrayElimCell_44)))))))) (and (or (forall ((v_ArrVal_1380 Int) (v_ArrVal_1383 Int) (v_ArrVal_1379 (Array Int Int)) (v_arrayElimCell_46 Int) (v_ArrVal_1385 (Array Int Int)) (v_ArrVal_1384 (Array Int Int)) (v_ArrVal_1382 (Array Int Int))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (let ((.cse0 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_insert_~snd_to_last~0#1.base| v_ArrVal_1379))) (store .cse0 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| (store (store (select .cse0 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|) .cse1 v_ArrVal_1380) .cse2 v_ArrVal_1383))) |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1384) (select (select (store (store .cse3 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_1382) |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1385) .cse4) .cse5)) v_arrayElimCell_46))) .cse6) (or (and (or (forall ((v_ArrVal_1380 Int) (v_ArrVal_1383 Int) (v_ArrVal_1379 (Array Int Int)) (v_arrayElimCell_47 Int) (v_ArrVal_1385 (Array Int Int)) (v_ArrVal_1384 (Array Int Int)) (v_ArrVal_1382 (Array Int Int))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (let ((.cse7 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_insert_~snd_to_last~0#1.base| v_ArrVal_1379))) (store .cse7 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| (store (store (select .cse7 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|) .cse1 v_ArrVal_1380) .cse2 v_ArrVal_1383))) |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1384) (select (select (store (store .cse3 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_1382) |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1385) .cse4) .cse5)) v_arrayElimCell_47))) .cse8) (forall ((v_ArrVal_1380 Int) (v_ArrVal_1383 Int) (v_ArrVal_1379 (Array Int Int)) (v_arrayElimCell_47 Int) (v_ArrVal_1385 (Array Int Int)) (v_ArrVal_1384 (Array Int Int)) (v_ArrVal_1382 (Array Int Int))) (let ((.cse9 (select (store (let ((.cse10 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_insert_~snd_to_last~0#1.base| v_ArrVal_1379))) (store .cse10 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| (store (store (select .cse10 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|) .cse1 v_ArrVal_1380) .cse2 v_ArrVal_1383))) |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1384) (select (select (store (store .cse3 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_1382) |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1385) .cse4) .cse5)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse9 v_arrayElimCell_47)) (forall ((v_arrayElimCell_46 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse9 v_arrayElimCell_46))))))) .cse11) (or .cse6 (forall ((v_ArrVal_1380 Int) (v_ArrVal_1383 Int) (v_ArrVal_1379 (Array Int Int)) (v_arrayElimCell_46 Int) (v_ArrVal_1385 (Array Int Int)) (v_ArrVal_1384 (Array Int Int)) (v_ArrVal_1382 (Array Int Int))) (let ((.cse12 (select (store (let ((.cse13 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_insert_~snd_to_last~0#1.base| v_ArrVal_1379))) (store .cse13 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| (store (store (select .cse13 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|) .cse1 v_ArrVal_1380) .cse2 v_ArrVal_1383))) |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1384) (select (select (store (store .cse3 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_1382) |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1385) .cse4) .cse5)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse12 |c_ULTIMATE.start_dll_insert_~new_node~0#1.offset|)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse12 v_arrayElimCell_46)))))) (or (= .cse14 |c_ULTIMATE.start_dll_insert_~snd_to_last~0#1.offset|) (and .cse15 .cse16 .cse17 .cse18)) (or (and .cse15 .cse16 (or (let ((.cse19 (select |c_#memory_int#1| |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|))) (and (or (forall ((v_ArrVal_1380 Int) (v_ArrVal_1383 Int) (v_ArrVal_1379 (Array Int Int)) (v_arrayElimCell_47 Int) (v_ArrVal_1385 (Array Int Int)) (v_ArrVal_1384 (Array Int Int)) (v_ArrVal_1382 (Array Int Int))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_insert_~snd_to_last~0#1.base| v_ArrVal_1379) |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| (store (store .cse19 .cse1 v_ArrVal_1380) .cse2 v_ArrVal_1383)) |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1384) (select (select (store (store .cse3 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_1382) |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1385) .cse4) .cse5)) v_arrayElimCell_47))) .cse8) (forall ((v_ArrVal_1380 Int) (v_ArrVal_1383 Int) (v_ArrVal_1379 (Array Int Int)) (v_arrayElimCell_47 Int) (v_ArrVal_1385 (Array Int Int)) (v_ArrVal_1384 (Array Int Int)) (v_ArrVal_1382 (Array Int Int))) (let ((.cse20 (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_insert_~snd_to_last~0#1.base| v_ArrVal_1379) |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| (store (store .cse19 .cse1 v_ArrVal_1380) .cse2 v_ArrVal_1383)) |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1384) (select (select (store (store .cse3 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_1382) |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1385) .cse4) .cse5)))) (or (forall ((v_arrayElimCell_46 Int)) (= (select .cse20 v_arrayElimCell_46) |c_ULTIMATE.start_main_~uneq~0#1|)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse20 v_arrayElimCell_47))))))) .cse11) .cse17 .cse18) (= |c_ULTIMATE.start_dll_insert_~snd_to_last~0#1.base| .cse4)) (or (forall ((v_ArrVal_1380 Int) (v_ArrVal_1383 Int) (v_ArrVal_1379 (Array Int Int)) (v_arrayElimCell_47 Int) (v_ArrVal_1385 (Array Int Int)) (v_ArrVal_1384 (Array Int Int)) (v_ArrVal_1382 (Array Int Int))) (let ((.cse21 (select (store (let ((.cse22 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_insert_~snd_to_last~0#1.base| v_ArrVal_1379))) (store .cse22 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| (store (store (select .cse22 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|) .cse1 v_ArrVal_1380) .cse2 v_ArrVal_1383))) |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1384) (select (select (store (store .cse3 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_1382) |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1385) .cse4) .cse5)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse21 |c_ULTIMATE.start_dll_insert_~new_node~0#1.offset|)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse21 v_arrayElimCell_47))))) .cse8) (or .cse23 (and (or (forall ((v_ArrVal_1380 Int) (v_ArrVal_1383 Int) (v_ArrVal_1379 (Array Int Int)) (v_ArrVal_1385 (Array Int Int)) (v_ArrVal_1384 (Array Int Int)) (v_ArrVal_1382 (Array Int Int))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (let ((.cse24 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_insert_~snd_to_last~0#1.base| v_ArrVal_1379))) (store .cse24 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| (store (store (select .cse24 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|) .cse1 v_ArrVal_1380) .cse2 v_ArrVal_1383))) |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1384) (select (select (store (store .cse3 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_1382) |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1385) .cse4) .cse5)) |c_ULTIMATE.start_dll_insert_~new_node~0#1.offset|))) .cse8) (forall ((v_ArrVal_1380 Int) (v_ArrVal_1383 Int) (v_ArrVal_1379 (Array Int Int)) (v_ArrVal_1385 (Array Int Int)) (v_ArrVal_1384 (Array Int Int)) (v_ArrVal_1382 (Array Int Int))) (let ((.cse25 (select (store (let ((.cse26 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_insert_~snd_to_last~0#1.base| v_ArrVal_1379))) (store .cse26 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| (store (store (select .cse26 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|) .cse1 v_ArrVal_1380) .cse2 v_ArrVal_1383))) |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1384) (select (select (store (store .cse3 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_1382) |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1385) .cse4) .cse5)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse25 |c_ULTIMATE.start_dll_insert_~new_node~0#1.offset|)) (forall ((v_arrayElimCell_46 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse25 v_arrayElimCell_46)))))))) (forall ((v_ArrVal_1380 Int) (v_ArrVal_1383 Int) (v_ArrVal_1379 (Array Int Int)) (v_arrayElimCell_47 Int) (v_ArrVal_1385 (Array Int Int)) (v_ArrVal_1384 (Array Int Int)) (v_ArrVal_1382 (Array Int Int))) (let ((.cse27 (select (store (let ((.cse28 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_insert_~snd_to_last~0#1.base| v_ArrVal_1379))) (store .cse28 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| (store (store (select .cse28 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|) .cse1 v_ArrVal_1380) .cse2 v_ArrVal_1383))) |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1384) (select (select (store (store .cse3 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_1382) |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1385) .cse4) .cse5)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse27 |c_ULTIMATE.start_dll_insert_~new_node~0#1.offset|)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse27 v_arrayElimCell_47)) (forall ((v_arrayElimCell_46 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse27 v_arrayElimCell_46))))))))))) is different from false [2024-11-18 13:09:07,775 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse39 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_insert_~last~0#1.base|)) (.cse40 (+ |c_ULTIMATE.start_dll_insert_~last~0#1.offset| 4))) (let ((.cse5 (select .cse39 .cse40)) (.cse7 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse26 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse1 (= .cse5 .cse7))) (let ((.cse18 (not .cse1)) (.cse3 (+ |c_ULTIMATE.start_dll_insert_~new_node~0#1.offset| 8)) (.cse4 (+ |c_ULTIMATE.start_dll_insert_~new_node~0#1.offset| 4)) (.cse6 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_insert_~last~0#1.base| (store .cse39 .cse40 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|))) (.cse8 (+ .cse26 4)) (.cse0 (= |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| .cse7))) (let ((.cse12 (not .cse0)) (.cse11 (or (and (or (forall ((v_ArrVal_1380 Int) (v_ArrVal_1383 Int) (v_ArrVal_1379 (Array Int Int)) (v_ArrVal_1385 (Array Int Int)) (v_ArrVal_1384 (Array Int Int)) (v_ArrVal_1382 (Array Int Int)) (v_arrayElimCell_44 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (let ((.cse36 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1379))) (store .cse36 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| (store (store (select .cse36 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|) .cse3 v_ArrVal_1380) .cse4 v_ArrVal_1383))) .cse5 v_ArrVal_1384) (select (select (store (store .cse6 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_1382) .cse5 v_ArrVal_1385) .cse7) .cse8)) v_arrayElimCell_44))) .cse1) (forall ((v_ArrVal_1380 Int) (v_ArrVal_1383 Int) (v_ArrVal_1379 (Array Int Int)) (v_ArrVal_1385 (Array Int Int)) (v_ArrVal_1384 (Array Int Int)) (v_ArrVal_1382 (Array Int Int)) (v_arrayElimCell_44 Int)) (let ((.cse37 (select (store (let ((.cse38 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1379))) (store .cse38 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| (store (store (select .cse38 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|) .cse3 v_ArrVal_1380) .cse4 v_ArrVal_1383))) .cse5 v_ArrVal_1384) (select (select (store (store .cse6 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_1382) .cse5 v_ArrVal_1385) .cse7) .cse8)))) (or (forall ((v_arrayElimCell_46 Int)) (= (select .cse37 v_arrayElimCell_46) |c_ULTIMATE.start_main_~uneq~0#1|)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse37 v_arrayElimCell_44)))))) .cse0)) (.cse15 (or (forall ((v_ArrVal_1380 Int) (v_ArrVal_1383 Int) (v_ArrVal_1379 (Array Int Int)) (v_arrayElimCell_47 Int) (v_ArrVal_1385 (Array Int Int)) (v_ArrVal_1384 (Array Int Int)) (v_ArrVal_1382 (Array Int Int)) (v_arrayElimCell_44 Int)) (let ((.cse34 (select (store (let ((.cse35 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1379))) (store .cse35 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| (store (store (select .cse35 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|) .cse3 v_ArrVal_1380) .cse4 v_ArrVal_1383))) .cse5 v_ArrVal_1384) (select (select (store (store .cse6 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_1382) .cse5 v_ArrVal_1385) .cse7) .cse8)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse34 v_arrayElimCell_44)) (= (select .cse34 v_arrayElimCell_47) |c_ULTIMATE.start_main_~uneq~0#1|)))) .cse1)) (.cse16 (forall ((v_ArrVal_1380 Int) (v_ArrVal_1383 Int) (v_ArrVal_1379 (Array Int Int)) (v_arrayElimCell_47 Int) (v_ArrVal_1385 (Array Int Int)) (v_ArrVal_1384 (Array Int Int)) (v_ArrVal_1382 (Array Int Int)) (v_arrayElimCell_44 Int)) (let ((.cse32 (select (store (let ((.cse33 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1379))) (store .cse33 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| (store (store (select .cse33 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|) .cse3 v_ArrVal_1380) .cse4 v_ArrVal_1383))) .cse5 v_ArrVal_1384) (select (select (store (store .cse6 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_1382) .cse5 v_ArrVal_1385) .cse7) .cse8)))) (or (forall ((v_arrayElimCell_46 Int)) (= (select .cse32 v_arrayElimCell_46) |c_ULTIMATE.start_main_~uneq~0#1|)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse32 v_arrayElimCell_44)) (= (select .cse32 v_arrayElimCell_47) |c_ULTIMATE.start_main_~uneq~0#1|))))) (.cse17 (or (forall ((v_ArrVal_1380 Int) (v_ArrVal_1383 Int) (v_ArrVal_1379 (Array Int Int)) (v_arrayElimCell_46 Int) (v_ArrVal_1385 (Array Int Int)) (v_ArrVal_1384 (Array Int Int)) (v_ArrVal_1382 (Array Int Int)) (v_arrayElimCell_44 Int)) (let ((.cse30 (select (store (let ((.cse31 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1379))) (store .cse31 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| (store (store (select .cse31 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|) .cse3 v_ArrVal_1380) .cse4 v_ArrVal_1383))) .cse5 v_ArrVal_1384) (select (select (store (store .cse6 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_1382) .cse5 v_ArrVal_1385) .cse7) .cse8)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse30 v_arrayElimCell_44)) (= (select .cse30 v_arrayElimCell_46) |c_ULTIMATE.start_main_~uneq~0#1|)))) .cse18))) (and (or .cse0 (and (or .cse1 (forall ((v_ArrVal_1380 Int) (v_ArrVal_1383 Int) (v_ArrVal_1379 (Array Int Int)) (v_ArrVal_1385 (Array Int Int)) (v_ArrVal_1384 (Array Int Int)) (v_ArrVal_1382 (Array Int Int))) (= (select (select (store (let ((.cse2 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1379))) (store .cse2 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| (store (store (select .cse2 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|) .cse3 v_ArrVal_1380) .cse4 v_ArrVal_1383))) .cse5 v_ArrVal_1384) (select (select (store (store .cse6 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_1382) .cse5 v_ArrVal_1385) .cse7) .cse8)) |c_ULTIMATE.start_dll_insert_~new_node~0#1.offset|) |c_ULTIMATE.start_main_~uneq~0#1|))) (forall ((v_ArrVal_1380 Int) (v_ArrVal_1383 Int) (v_ArrVal_1379 (Array Int Int)) (v_ArrVal_1385 (Array Int Int)) (v_ArrVal_1384 (Array Int Int)) (v_ArrVal_1382 (Array Int Int))) (let ((.cse9 (select (store (let ((.cse10 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1379))) (store .cse10 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| (store (store (select .cse10 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|) .cse3 v_ArrVal_1380) .cse4 v_ArrVal_1383))) .cse5 v_ArrVal_1384) (select (select (store (store .cse6 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_1382) .cse5 v_ArrVal_1385) .cse7) .cse8)))) (or (forall ((v_arrayElimCell_46 Int)) (= (select .cse9 v_arrayElimCell_46) |c_ULTIMATE.start_main_~uneq~0#1|)) (= (select .cse9 |c_ULTIMATE.start_dll_insert_~new_node~0#1.offset|) |c_ULTIMATE.start_main_~uneq~0#1|)))))) (or (and .cse11 (or .cse12 (let ((.cse14 (select |c_#memory_int#1| |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|))) (and (forall ((v_ArrVal_1380 Int) (v_ArrVal_1383 Int) (v_ArrVal_1379 (Array Int Int)) (v_arrayElimCell_47 Int) (v_ArrVal_1385 (Array Int Int)) (v_ArrVal_1384 (Array Int Int)) (v_ArrVal_1382 (Array Int Int))) (let ((.cse13 (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1379) |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| (store (store .cse14 .cse3 v_ArrVal_1380) .cse4 v_ArrVal_1383)) .cse5 v_ArrVal_1384) (select (select (store (store .cse6 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_1382) .cse5 v_ArrVal_1385) .cse7) .cse8)))) (or (forall ((v_arrayElimCell_46 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse13 v_arrayElimCell_46))) (= (select .cse13 v_arrayElimCell_47) |c_ULTIMATE.start_main_~uneq~0#1|)))) (or .cse1 (forall ((v_ArrVal_1380 Int) (v_ArrVal_1383 Int) (v_ArrVal_1379 (Array Int Int)) (v_arrayElimCell_47 Int) (v_ArrVal_1385 (Array Int Int)) (v_ArrVal_1384 (Array Int Int)) (v_ArrVal_1382 (Array Int Int))) (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1379) |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| (store (store .cse14 .cse3 v_ArrVal_1380) .cse4 v_ArrVal_1383)) .cse5 v_ArrVal_1384) (select (select (store (store .cse6 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_1382) .cse5 v_ArrVal_1385) .cse7) .cse8)) v_arrayElimCell_47) |c_ULTIMATE.start_main_~uneq~0#1|)))))) .cse15 .cse16 .cse17) (= |c_ULTIMATE.start_dll_insert_~last~0#1.base| .cse7)) (or .cse18 (forall ((v_ArrVal_1380 Int) (v_ArrVal_1383 Int) (v_ArrVal_1379 (Array Int Int)) (v_arrayElimCell_46 Int) (v_ArrVal_1385 (Array Int Int)) (v_ArrVal_1384 (Array Int Int)) (v_ArrVal_1382 (Array Int Int))) (let ((.cse19 (select (store (let ((.cse20 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1379))) (store .cse20 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| (store (store (select .cse20 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|) .cse3 v_ArrVal_1380) .cse4 v_ArrVal_1383))) .cse5 v_ArrVal_1384) (select (select (store (store .cse6 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_1382) .cse5 v_ArrVal_1385) .cse7) .cse8)))) (or (= (select .cse19 |c_ULTIMATE.start_dll_insert_~new_node~0#1.offset|) |c_ULTIMATE.start_main_~uneq~0#1|) (= (select .cse19 v_arrayElimCell_46) |c_ULTIMATE.start_main_~uneq~0#1|))))) (or (forall ((v_ArrVal_1380 Int) (v_ArrVal_1383 Int) (v_ArrVal_1379 (Array Int Int)) (v_arrayElimCell_47 Int) (v_ArrVal_1385 (Array Int Int)) (v_ArrVal_1384 (Array Int Int)) (v_ArrVal_1382 (Array Int Int))) (let ((.cse21 (select (store (let ((.cse22 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1379))) (store .cse22 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| (store (store (select .cse22 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|) .cse3 v_ArrVal_1380) .cse4 v_ArrVal_1383))) .cse5 v_ArrVal_1384) (select (select (store (store .cse6 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_1382) .cse5 v_ArrVal_1385) .cse7) .cse8)))) (or (= (select .cse21 |c_ULTIMATE.start_dll_insert_~new_node~0#1.offset|) |c_ULTIMATE.start_main_~uneq~0#1|) (= (select .cse21 v_arrayElimCell_47) |c_ULTIMATE.start_main_~uneq~0#1|)))) .cse1) (or .cse12 (and (or (forall ((v_ArrVal_1380 Int) (v_ArrVal_1383 Int) (v_ArrVal_1379 (Array Int Int)) (v_arrayElimCell_47 Int) (v_ArrVal_1385 (Array Int Int)) (v_ArrVal_1384 (Array Int Int)) (v_ArrVal_1382 (Array Int Int))) (= (select (select (store (let ((.cse23 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1379))) (store .cse23 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| (store (store (select .cse23 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|) .cse3 v_ArrVal_1380) .cse4 v_ArrVal_1383))) .cse5 v_ArrVal_1384) (select (select (store (store .cse6 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_1382) .cse5 v_ArrVal_1385) .cse7) .cse8)) v_arrayElimCell_47) |c_ULTIMATE.start_main_~uneq~0#1|)) .cse1) (forall ((v_ArrVal_1380 Int) (v_ArrVal_1383 Int) (v_ArrVal_1379 (Array Int Int)) (v_arrayElimCell_47 Int) (v_ArrVal_1385 (Array Int Int)) (v_ArrVal_1384 (Array Int Int)) (v_ArrVal_1382 (Array Int Int))) (let ((.cse24 (select (store (let ((.cse25 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1379))) (store .cse25 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| (store (store (select .cse25 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|) .cse3 v_ArrVal_1380) .cse4 v_ArrVal_1383))) .cse5 v_ArrVal_1384) (select (select (store (store .cse6 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_1382) .cse5 v_ArrVal_1385) .cse7) .cse8)))) (or (forall ((v_arrayElimCell_46 Int)) (= (select .cse24 v_arrayElimCell_46) |c_ULTIMATE.start_main_~uneq~0#1|)) (= (select .cse24 v_arrayElimCell_47) |c_ULTIMATE.start_main_~uneq~0#1|)))))) (or (and .cse11 .cse15 .cse16 .cse17) (= |c_ULTIMATE.start_dll_insert_~last~0#1.offset| .cse26)) (forall ((v_ArrVal_1380 Int) (v_ArrVal_1383 Int) (v_ArrVal_1379 (Array Int Int)) (v_arrayElimCell_47 Int) (v_ArrVal_1385 (Array Int Int)) (v_ArrVal_1384 (Array Int Int)) (v_ArrVal_1382 (Array Int Int))) (let ((.cse27 (select (store (let ((.cse28 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1379))) (store .cse28 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| (store (store (select .cse28 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|) .cse3 v_ArrVal_1380) .cse4 v_ArrVal_1383))) .cse5 v_ArrVal_1384) (select (select (store (store .cse6 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_1382) .cse5 v_ArrVal_1385) .cse7) .cse8)))) (or (forall ((v_arrayElimCell_46 Int)) (= (select .cse27 v_arrayElimCell_46) |c_ULTIMATE.start_main_~uneq~0#1|)) (= (select .cse27 |c_ULTIMATE.start_dll_insert_~new_node~0#1.offset|) |c_ULTIMATE.start_main_~uneq~0#1|) (= (select .cse27 v_arrayElimCell_47) |c_ULTIMATE.start_main_~uneq~0#1|)))) (or .cse18 (forall ((v_ArrVal_1380 Int) (v_ArrVal_1383 Int) (v_ArrVal_1379 (Array Int Int)) (v_arrayElimCell_46 Int) (v_ArrVal_1385 (Array Int Int)) (v_ArrVal_1384 (Array Int Int)) (v_ArrVal_1382 (Array Int Int))) (= (select (select (store (let ((.cse29 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1379))) (store .cse29 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| (store (store (select .cse29 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|) .cse3 v_ArrVal_1380) .cse4 v_ArrVal_1383))) .cse5 v_ArrVal_1384) (select (select (store (store .cse6 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_1382) .cse5 v_ArrVal_1385) .cse7) .cse8)) v_arrayElimCell_46) |c_ULTIMATE.start_main_~uneq~0#1|))))))))) is different from false [2024-11-18 13:09:08,174 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse18 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_insert_~head#1.base|) |c_ULTIMATE.start_dll_insert_~head#1.offset|)) (.cse5 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_insert_~head#1.base|) |c_ULTIMATE.start_dll_insert_~head#1.offset|))) (let ((.cse41 (select |c_#memory_$Pointer$#1.base| .cse5)) (.cse42 (+ .cse18 4))) (let ((.cse6 (select .cse41 .cse42)) (.cse8 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse19 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse0 (= .cse6 .cse8))) (let ((.cse11 (not .cse0)) (.cse20 (= |c_ULTIMATE.start_node_create_#res#1.base| .cse8)) (.cse3 (+ 8 |c_ULTIMATE.start_node_create_#res#1.offset|)) (.cse4 (+ |c_ULTIMATE.start_node_create_#res#1.offset| 4)) (.cse7 (store |c_#memory_$Pointer$#1.base| .cse5 (store .cse41 .cse42 |c_ULTIMATE.start_node_create_#res#1.base|))) (.cse9 (+ .cse19 4))) (let ((.cse14 (forall ((v_ArrVal_1380 Int) (v_ArrVal_1383 Int) (v_ArrVal_1379 (Array Int Int)) (v_arrayElimCell_47 Int) (v_ArrVal_1385 (Array Int Int)) (v_ArrVal_1384 (Array Int Int)) (v_ArrVal_1382 (Array Int Int)) (v_arrayElimCell_44 Int)) (let ((.cse39 (select (store (let ((.cse40 (store |c_#memory_int#1| .cse5 v_ArrVal_1379))) (store .cse40 |c_ULTIMATE.start_node_create_#res#1.base| (store (store (select .cse40 |c_ULTIMATE.start_node_create_#res#1.base|) .cse3 v_ArrVal_1380) .cse4 v_ArrVal_1383))) .cse6 v_ArrVal_1384) (select (select (store (store .cse7 |c_ULTIMATE.start_node_create_#res#1.base| v_ArrVal_1382) .cse6 v_ArrVal_1385) .cse8) .cse9)))) (or (forall ((v_arrayElimCell_46 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse39 v_arrayElimCell_46))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse39 v_arrayElimCell_44)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse39 v_arrayElimCell_47)))))) (.cse15 (or (and (or (forall ((v_ArrVal_1380 Int) (v_ArrVal_1383 Int) (v_ArrVal_1379 (Array Int Int)) (v_ArrVal_1385 (Array Int Int)) (v_ArrVal_1384 (Array Int Int)) (v_ArrVal_1382 (Array Int Int)) (v_arrayElimCell_44 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (let ((.cse36 (store |c_#memory_int#1| .cse5 v_ArrVal_1379))) (store .cse36 |c_ULTIMATE.start_node_create_#res#1.base| (store (store (select .cse36 |c_ULTIMATE.start_node_create_#res#1.base|) .cse3 v_ArrVal_1380) .cse4 v_ArrVal_1383))) .cse6 v_ArrVal_1384) (select (select (store (store .cse7 |c_ULTIMATE.start_node_create_#res#1.base| v_ArrVal_1382) .cse6 v_ArrVal_1385) .cse8) .cse9)) v_arrayElimCell_44))) .cse0) (forall ((v_ArrVal_1380 Int) (v_ArrVal_1383 Int) (v_ArrVal_1379 (Array Int Int)) (v_ArrVal_1385 (Array Int Int)) (v_ArrVal_1384 (Array Int Int)) (v_ArrVal_1382 (Array Int Int)) (v_arrayElimCell_44 Int)) (let ((.cse37 (select (store (let ((.cse38 (store |c_#memory_int#1| .cse5 v_ArrVal_1379))) (store .cse38 |c_ULTIMATE.start_node_create_#res#1.base| (store (store (select .cse38 |c_ULTIMATE.start_node_create_#res#1.base|) .cse3 v_ArrVal_1380) .cse4 v_ArrVal_1383))) .cse6 v_ArrVal_1384) (select (select (store (store .cse7 |c_ULTIMATE.start_node_create_#res#1.base| v_ArrVal_1382) .cse6 v_ArrVal_1385) .cse8) .cse9)))) (or (forall ((v_arrayElimCell_46 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse37 v_arrayElimCell_46))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse37 v_arrayElimCell_44)))))) .cse20)) (.cse16 (or (forall ((v_ArrVal_1380 Int) (v_ArrVal_1383 Int) (v_ArrVal_1379 (Array Int Int)) (v_arrayElimCell_47 Int) (v_ArrVal_1385 (Array Int Int)) (v_ArrVal_1384 (Array Int Int)) (v_ArrVal_1382 (Array Int Int)) (v_arrayElimCell_44 Int)) (let ((.cse34 (select (store (let ((.cse35 (store |c_#memory_int#1| .cse5 v_ArrVal_1379))) (store .cse35 |c_ULTIMATE.start_node_create_#res#1.base| (store (store (select .cse35 |c_ULTIMATE.start_node_create_#res#1.base|) .cse3 v_ArrVal_1380) .cse4 v_ArrVal_1383))) .cse6 v_ArrVal_1384) (select (select (store (store .cse7 |c_ULTIMATE.start_node_create_#res#1.base| v_ArrVal_1382) .cse6 v_ArrVal_1385) .cse8) .cse9)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse34 v_arrayElimCell_44)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse34 v_arrayElimCell_47))))) .cse0)) (.cse17 (or (forall ((v_ArrVal_1380 Int) (v_ArrVal_1383 Int) (v_ArrVal_1379 (Array Int Int)) (v_arrayElimCell_46 Int) (v_ArrVal_1385 (Array Int Int)) (v_ArrVal_1384 (Array Int Int)) (v_ArrVal_1382 (Array Int Int)) (v_arrayElimCell_44 Int)) (let ((.cse32 (select (store (let ((.cse33 (store |c_#memory_int#1| .cse5 v_ArrVal_1379))) (store .cse33 |c_ULTIMATE.start_node_create_#res#1.base| (store (store (select .cse33 |c_ULTIMATE.start_node_create_#res#1.base|) .cse3 v_ArrVal_1380) .cse4 v_ArrVal_1383))) .cse6 v_ArrVal_1384) (select (select (store (store .cse7 |c_ULTIMATE.start_node_create_#res#1.base| v_ArrVal_1382) .cse6 v_ArrVal_1385) .cse8) .cse9)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse32 v_arrayElimCell_44)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse32 v_arrayElimCell_46))))) .cse11)) (.cse24 (not .cse20))) (and (or .cse0 (forall ((v_ArrVal_1380 Int) (v_ArrVal_1383 Int) (v_ArrVal_1379 (Array Int Int)) (v_arrayElimCell_47 Int) (v_ArrVal_1385 (Array Int Int)) (v_ArrVal_1384 (Array Int Int)) (v_ArrVal_1382 (Array Int Int))) (let ((.cse1 (select (store (let ((.cse2 (store |c_#memory_int#1| .cse5 v_ArrVal_1379))) (store .cse2 |c_ULTIMATE.start_node_create_#res#1.base| (store (store (select .cse2 |c_ULTIMATE.start_node_create_#res#1.base|) .cse3 v_ArrVal_1380) .cse4 v_ArrVal_1383))) .cse6 v_ArrVal_1384) (select (select (store (store .cse7 |c_ULTIMATE.start_node_create_#res#1.base| v_ArrVal_1382) .cse6 v_ArrVal_1385) .cse8) .cse9)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse1 |c_ULTIMATE.start_node_create_#res#1.offset|)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse1 v_arrayElimCell_47)))))) (or (forall ((v_ArrVal_1380 Int) (v_ArrVal_1383 Int) (v_ArrVal_1379 (Array Int Int)) (v_arrayElimCell_46 Int) (v_ArrVal_1385 (Array Int Int)) (v_ArrVal_1384 (Array Int Int)) (v_ArrVal_1382 (Array Int Int))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (let ((.cse10 (store |c_#memory_int#1| .cse5 v_ArrVal_1379))) (store .cse10 |c_ULTIMATE.start_node_create_#res#1.base| (store (store (select .cse10 |c_ULTIMATE.start_node_create_#res#1.base|) .cse3 v_ArrVal_1380) .cse4 v_ArrVal_1383))) .cse6 v_ArrVal_1384) (select (select (store (store .cse7 |c_ULTIMATE.start_node_create_#res#1.base| v_ArrVal_1382) .cse6 v_ArrVal_1385) .cse8) .cse9)) v_arrayElimCell_46))) .cse11) (forall ((v_ArrVal_1380 Int) (v_ArrVal_1383 Int) (v_ArrVal_1379 (Array Int Int)) (v_arrayElimCell_47 Int) (v_ArrVal_1385 (Array Int Int)) (v_ArrVal_1384 (Array Int Int)) (v_ArrVal_1382 (Array Int Int))) (let ((.cse12 (select (store (let ((.cse13 (store |c_#memory_int#1| .cse5 v_ArrVal_1379))) (store .cse13 |c_ULTIMATE.start_node_create_#res#1.base| (store (store (select .cse13 |c_ULTIMATE.start_node_create_#res#1.base|) .cse3 v_ArrVal_1380) .cse4 v_ArrVal_1383))) .cse6 v_ArrVal_1384) (select (select (store (store .cse7 |c_ULTIMATE.start_node_create_#res#1.base| v_ArrVal_1382) .cse6 v_ArrVal_1385) .cse8) .cse9)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse12 |c_ULTIMATE.start_node_create_#res#1.offset|)) (forall ((v_arrayElimCell_46 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse12 v_arrayElimCell_46))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse12 v_arrayElimCell_47))))) (or (and .cse14 .cse15 .cse16 .cse17) (= .cse18 .cse19)) (or .cse20 (and (or (forall ((v_ArrVal_1380 Int) (v_ArrVal_1383 Int) (v_ArrVal_1379 (Array Int Int)) (v_ArrVal_1385 (Array Int Int)) (v_ArrVal_1384 (Array Int Int)) (v_ArrVal_1382 (Array Int Int))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (let ((.cse21 (store |c_#memory_int#1| .cse5 v_ArrVal_1379))) (store .cse21 |c_ULTIMATE.start_node_create_#res#1.base| (store (store (select .cse21 |c_ULTIMATE.start_node_create_#res#1.base|) .cse3 v_ArrVal_1380) .cse4 v_ArrVal_1383))) .cse6 v_ArrVal_1384) (select (select (store (store .cse7 |c_ULTIMATE.start_node_create_#res#1.base| v_ArrVal_1382) .cse6 v_ArrVal_1385) .cse8) .cse9)) |c_ULTIMATE.start_node_create_#res#1.offset|))) .cse0) (forall ((v_ArrVal_1380 Int) (v_ArrVal_1383 Int) (v_ArrVal_1379 (Array Int Int)) (v_ArrVal_1385 (Array Int Int)) (v_ArrVal_1384 (Array Int Int)) (v_ArrVal_1382 (Array Int Int))) (let ((.cse22 (select (store (let ((.cse23 (store |c_#memory_int#1| .cse5 v_ArrVal_1379))) (store .cse23 |c_ULTIMATE.start_node_create_#res#1.base| (store (store (select .cse23 |c_ULTIMATE.start_node_create_#res#1.base|) .cse3 v_ArrVal_1380) .cse4 v_ArrVal_1383))) .cse6 v_ArrVal_1384) (select (select (store (store .cse7 |c_ULTIMATE.start_node_create_#res#1.base| v_ArrVal_1382) .cse6 v_ArrVal_1385) .cse8) .cse9)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse22 |c_ULTIMATE.start_node_create_#res#1.offset|)) (forall ((v_arrayElimCell_46 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse22 v_arrayElimCell_46)))))))) (or (and .cse14 .cse15 (or .cse24 (let ((.cse26 (select |c_#memory_int#1| |c_ULTIMATE.start_node_create_#res#1.base|))) (and (forall ((v_ArrVal_1380 Int) (v_ArrVal_1383 Int) (v_ArrVal_1379 (Array Int Int)) (v_arrayElimCell_47 Int) (v_ArrVal_1385 (Array Int Int)) (v_ArrVal_1384 (Array Int Int)) (v_ArrVal_1382 (Array Int Int))) (let ((.cse25 (select (store (store (store |c_#memory_int#1| .cse5 v_ArrVal_1379) |c_ULTIMATE.start_node_create_#res#1.base| (store (store .cse26 .cse3 v_ArrVal_1380) .cse4 v_ArrVal_1383)) .cse6 v_ArrVal_1384) (select (select (store (store .cse7 |c_ULTIMATE.start_node_create_#res#1.base| v_ArrVal_1382) .cse6 v_ArrVal_1385) .cse8) .cse9)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse25 v_arrayElimCell_47)) (forall ((v_arrayElimCell_46 Int)) (= (select .cse25 v_arrayElimCell_46) |c_ULTIMATE.start_main_~uneq~0#1|))))) (or (forall ((v_ArrVal_1380 Int) (v_ArrVal_1383 Int) (v_ArrVal_1379 (Array Int Int)) (v_arrayElimCell_47 Int) (v_ArrVal_1385 (Array Int Int)) (v_ArrVal_1384 (Array Int Int)) (v_ArrVal_1382 (Array Int Int))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (store (store |c_#memory_int#1| .cse5 v_ArrVal_1379) |c_ULTIMATE.start_node_create_#res#1.base| (store (store .cse26 .cse3 v_ArrVal_1380) .cse4 v_ArrVal_1383)) .cse6 v_ArrVal_1384) (select (select (store (store .cse7 |c_ULTIMATE.start_node_create_#res#1.base| v_ArrVal_1382) .cse6 v_ArrVal_1385) .cse8) .cse9)) v_arrayElimCell_47))) .cse0)))) .cse16 .cse17) (= .cse8 .cse5)) (or .cse24 (and (or .cse0 (forall ((v_ArrVal_1380 Int) (v_ArrVal_1383 Int) (v_ArrVal_1379 (Array Int Int)) (v_arrayElimCell_47 Int) (v_ArrVal_1385 (Array Int Int)) (v_ArrVal_1384 (Array Int Int)) (v_ArrVal_1382 (Array Int Int))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (let ((.cse27 (store |c_#memory_int#1| .cse5 v_ArrVal_1379))) (store .cse27 |c_ULTIMATE.start_node_create_#res#1.base| (store (store (select .cse27 |c_ULTIMATE.start_node_create_#res#1.base|) .cse3 v_ArrVal_1380) .cse4 v_ArrVal_1383))) .cse6 v_ArrVal_1384) (select (select (store (store .cse7 |c_ULTIMATE.start_node_create_#res#1.base| v_ArrVal_1382) .cse6 v_ArrVal_1385) .cse8) .cse9)) v_arrayElimCell_47)))) (forall ((v_ArrVal_1380 Int) (v_ArrVal_1383 Int) (v_ArrVal_1379 (Array Int Int)) (v_arrayElimCell_47 Int) (v_ArrVal_1385 (Array Int Int)) (v_ArrVal_1384 (Array Int Int)) (v_ArrVal_1382 (Array Int Int))) (let ((.cse28 (select (store (let ((.cse29 (store |c_#memory_int#1| .cse5 v_ArrVal_1379))) (store .cse29 |c_ULTIMATE.start_node_create_#res#1.base| (store (store (select .cse29 |c_ULTIMATE.start_node_create_#res#1.base|) .cse3 v_ArrVal_1380) .cse4 v_ArrVal_1383))) .cse6 v_ArrVal_1384) (select (select (store (store .cse7 |c_ULTIMATE.start_node_create_#res#1.base| v_ArrVal_1382) .cse6 v_ArrVal_1385) .cse8) .cse9)))) (or (forall ((v_arrayElimCell_46 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse28 v_arrayElimCell_46))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse28 v_arrayElimCell_47))))))) (or (forall ((v_ArrVal_1380 Int) (v_ArrVal_1383 Int) (v_ArrVal_1379 (Array Int Int)) (v_arrayElimCell_46 Int) (v_ArrVal_1385 (Array Int Int)) (v_ArrVal_1384 (Array Int Int)) (v_ArrVal_1382 (Array Int Int))) (let ((.cse30 (select (store (let ((.cse31 (store |c_#memory_int#1| .cse5 v_ArrVal_1379))) (store .cse31 |c_ULTIMATE.start_node_create_#res#1.base| (store (store (select .cse31 |c_ULTIMATE.start_node_create_#res#1.base|) .cse3 v_ArrVal_1380) .cse4 v_ArrVal_1383))) .cse6 v_ArrVal_1384) (select (select (store (store .cse7 |c_ULTIMATE.start_node_create_#res#1.base| v_ArrVal_1382) .cse6 v_ArrVal_1385) .cse8) .cse9)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse30 |c_ULTIMATE.start_node_create_#res#1.offset|)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse30 v_arrayElimCell_46))))) .cse11)))))))) is different from false [2024-11-18 13:09:08,345 INFO L349 Elim1Store]: treesize reduction 278, result has 52.0 percent of original size [2024-11-18 13:09:08,346 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 3 new quantified variables, introduced 4 case distinctions, treesize of input 5259 treesize of output 5231 [2024-11-18 13:09:08,368 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-18 13:09:08,368 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 1601 treesize of output 1533 [2024-11-18 13:09:08,396 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-18 13:09:08,396 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 2731 treesize of output 2723 [2024-11-18 13:09:08,427 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-18 13:09:08,428 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 2511 treesize of output 2503 [2024-11-18 13:09:08,746 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-18 13:09:08,747 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 11 treesize of output 15