./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2n_insert_equal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2n_insert_equal.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 93d1510274ba16ddd1276e8e93ff0a644bf6fb4a262c4c9dde32fe8591d5ce8c --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 01:42:55,309 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 01:42:55,390 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 01:42:55,397 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 01:42:55,397 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 01:42:55,417 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 01:42:55,418 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 01:42:55,418 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 01:42:55,419 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 01:42:55,421 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 01:42:55,421 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 01:42:55,422 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 01:42:55,423 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 01:42:55,423 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 01:42:55,425 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 01:42:55,426 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 01:42:55,426 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 01:42:55,426 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 01:42:55,427 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 01:42:55,427 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 01:42:55,427 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 01:42:55,428 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 01:42:55,432 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 01:42:55,432 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 01:42:55,433 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 01:42:55,433 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 01:42:55,433 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 01:42:55,433 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 01:42:55,433 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 01:42:55,434 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 01:42:55,434 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 01:42:55,434 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 01:42:55,434 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 01:42:55,434 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 01:42:55,435 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 01:42:55,435 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 01:42:55,435 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 01:42:55,436 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 01:42:55,436 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 01:42:55,436 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 01:42:55,437 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 01:42:55,438 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 01:42:55,438 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-clean/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-clean/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 -> 93d1510274ba16ddd1276e8e93ff0a644bf6fb4a262c4c9dde32fe8591d5ce8c [2024-10-11 01:42:55,745 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 01:42:55,771 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 01:42:55,775 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 01:42:55,776 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 01:42:55,777 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 01:42:55,778 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2n_insert_equal.i [2024-10-11 01:42:57,215 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 01:42:57,504 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 01:42:57,505 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2n_insert_equal.i [2024-10-11 01:42:57,517 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/e9fe6cd0a/204d305427bf4830879f13da75d2bfc5/FLAG534382a2d [2024-10-11 01:42:57,532 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/e9fe6cd0a/204d305427bf4830879f13da75d2bfc5 [2024-10-11 01:42:57,535 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 01:42:57,536 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 01:42:57,538 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 01:42:57,538 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 01:42:57,543 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 01:42:57,544 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 01:42:57" (1/1) ... [2024-10-11 01:42:57,545 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@14cc6c35 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:42:57, skipping insertion in model container [2024-10-11 01:42:57,545 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 01:42:57" (1/1) ... [2024-10-11 01:42:57,596 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 01:42:57,973 WARN L248 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_equal.i[24706,24719] [2024-10-11 01:42:57,979 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 01:42:57,989 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 01:42:58,036 WARN L248 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_equal.i[24706,24719] [2024-10-11 01:42:58,037 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 01:42:58,074 INFO L204 MainTranslator]: Completed translation [2024-10-11 01:42:58,074 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:42:58 WrapperNode [2024-10-11 01:42:58,075 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 01:42:58,076 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 01:42:58,077 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 01:42:58,077 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 01:42:58,084 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:42:58" (1/1) ... [2024-10-11 01:42:58,103 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:42:58" (1/1) ... [2024-10-11 01:42:58,133 INFO L138 Inliner]: procedures = 127, calls = 44, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 138 [2024-10-11 01:42:58,137 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 01:42:58,138 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 01:42:58,138 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 01:42:58,138 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 01:42:58,149 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:42:58" (1/1) ... [2024-10-11 01:42:58,150 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:42:58" (1/1) ... [2024-10-11 01:42:58,155 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:42:58" (1/1) ... [2024-10-11 01:42:58,188 INFO L175 MemorySlicer]: Split 27 memory accesses to 3 slices as follows [2, 8, 17]. 63 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 1, 0]. The 14 writes are split as follows [0, 1, 13]. [2024-10-11 01:42:58,189 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:42:58" (1/1) ... [2024-10-11 01:42:58,189 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:42:58" (1/1) ... [2024-10-11 01:42:58,204 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:42:58" (1/1) ... [2024-10-11 01:42:58,208 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:42:58" (1/1) ... [2024-10-11 01:42:58,211 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:42:58" (1/1) ... [2024-10-11 01:42:58,215 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:42:58" (1/1) ... [2024-10-11 01:42:58,221 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 01:42:58,226 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 01:42:58,226 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 01:42:58,226 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 01:42:58,227 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:42:58" (1/1) ... [2024-10-11 01:42:58,235 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 01:42:58,246 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 01:42:58,267 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 01:42:58,271 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 01:42:58,312 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2024-10-11 01:42:58,313 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2024-10-11 01:42:58,313 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-11 01:42:58,313 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-11 01:42:58,313 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-11 01:42:58,313 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-11 01:42:58,314 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-11 01:42:58,314 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-11 01:42:58,314 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-11 01:42:58,314 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 01:42:58,314 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-11 01:42:58,315 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-11 01:42:58,315 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-11 01:42:58,315 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-10-11 01:42:58,315 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-11 01:42:58,316 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-11 01:42:58,316 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-10-11 01:42:58,316 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-11 01:42:58,316 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-10-11 01:42:58,316 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-10-11 01:42:58,316 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-10-11 01:42:58,317 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 01:42:58,317 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-11 01:42:58,317 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-11 01:42:58,317 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 01:42:58,317 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 01:42:58,437 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 01:42:58,440 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 01:42:58,465 INFO L733 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2024-10-11 01:42:58,698 INFO L? ?]: Removed 56 outVars from TransFormulas that were not future-live. [2024-10-11 01:42:58,698 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 01:42:58,741 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 01:42:58,741 INFO L314 CfgBuilder]: Removed 4 assume(true) statements. [2024-10-11 01:42:58,741 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 01:42:58 BoogieIcfgContainer [2024-10-11 01:42:58,742 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 01:42:58,748 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 01:42:58,748 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 01:42:58,751 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 01:42:58,752 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 01:42:57" (1/3) ... [2024-10-11 01:42:58,752 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9e7c3e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 01:42:58, skipping insertion in model container [2024-10-11 01:42:58,753 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:42:58" (2/3) ... [2024-10-11 01:42:58,753 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9e7c3e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 01:42:58, skipping insertion in model container [2024-10-11 01:42:58,754 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 01:42:58" (3/3) ... [2024-10-11 01:42:58,755 INFO L112 eAbstractionObserver]: Analyzing ICFG dll2n_insert_equal.i [2024-10-11 01:42:58,781 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 01:42:58,781 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 01:42:58,863 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 01:42:58,872 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;@308c1d6b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 01:42:58,873 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 01:42:58,878 INFO L276 IsEmpty]: Start isEmpty. Operand has 28 states, 24 states have (on average 1.7083333333333333) internal successors, (41), 26 states have internal predecessors, (41), 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-10-11 01:42:58,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-10-11 01:42:58,886 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 01:42:58,887 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 01:42:58,888 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 01:42:58,893 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 01:42:58,893 INFO L85 PathProgramCache]: Analyzing trace with hash 342889473, now seen corresponding path program 1 times [2024-10-11 01:42:58,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 01:42:58,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [482273386] [2024-10-11 01:42:58,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:42:58,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 01:42:59,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:42:59,122 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 01:42:59,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 01:42:59,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [482273386] [2024-10-11 01:42:59,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [482273386] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 01:42:59,125 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 01:42:59,125 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 01:42:59,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [698978356] [2024-10-11 01:42:59,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 01:42:59,131 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 01:42:59,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 01:42:59,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 01:42:59,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 01:42:59,156 INFO L87 Difference]: Start difference. First operand has 28 states, 24 states have (on average 1.7083333333333333) internal successors, (41), 26 states have internal predecessors, (41), 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 6.0) internal successors, (12), 2 states have internal predecessors, (12), 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-10-11 01:42:59,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 01:42:59,188 INFO L93 Difference]: Finished difference Result 49 states and 75 transitions. [2024-10-11 01:42:59,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 01:42:59,190 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 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 12 [2024-10-11 01:42:59,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 01:42:59,196 INFO L225 Difference]: With dead ends: 49 [2024-10-11 01:42:59,196 INFO L226 Difference]: Without dead ends: 20 [2024-10-11 01:42:59,199 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-10-11 01:42:59,205 INFO L432 NwaCegarLoop]: 34 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 01:42:59,206 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 34 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 01:42:59,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2024-10-11 01:42:59,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2024-10-11 01:42:59,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 19 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-10-11 01:42:59,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 27 transitions. [2024-10-11 01:42:59,235 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 27 transitions. Word has length 12 [2024-10-11 01:42:59,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 01:42:59,236 INFO L471 AbstractCegarLoop]: Abstraction has 20 states and 27 transitions. [2024-10-11 01:42:59,236 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 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-10-11 01:42:59,236 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 27 transitions. [2024-10-11 01:42:59,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-10-11 01:42:59,238 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 01:42:59,238 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 01:42:59,238 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 01:42:59,238 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 01:42:59,239 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 01:42:59,239 INFO L85 PathProgramCache]: Analyzing trace with hash 125226926, now seen corresponding path program 1 times [2024-10-11 01:42:59,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 01:42:59,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1865109542] [2024-10-11 01:42:59,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:42:59,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 01:42:59,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:42:59,382 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 01:42:59,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 01:42:59,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1865109542] [2024-10-11 01:42:59,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1865109542] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 01:42:59,383 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 01:42:59,383 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 01:42:59,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616010027] [2024-10-11 01:42:59,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 01:42:59,385 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 01:42:59,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 01:42:59,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 01:42:59,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 01:42:59,386 INFO L87 Difference]: Start difference. First operand 20 states and 27 transitions. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 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-10-11 01:42:59,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 01:42:59,409 INFO L93 Difference]: Finished difference Result 39 states and 53 transitions. [2024-10-11 01:42:59,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 01:42:59,411 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 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 12 [2024-10-11 01:42:59,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 01:42:59,411 INFO L225 Difference]: With dead ends: 39 [2024-10-11 01:42:59,411 INFO L226 Difference]: Without dead ends: 25 [2024-10-11 01:42:59,412 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-10-11 01:42:59,413 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 5 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 01:42:59,413 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 43 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 01:42:59,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2024-10-11 01:42:59,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 21. [2024-10-11 01:42:59,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 20 states have (on average 1.4) internal successors, (28), 20 states have internal predecessors, (28), 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-10-11 01:42:59,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 28 transitions. [2024-10-11 01:42:59,421 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 28 transitions. Word has length 12 [2024-10-11 01:42:59,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 01:42:59,421 INFO L471 AbstractCegarLoop]: Abstraction has 21 states and 28 transitions. [2024-10-11 01:42:59,422 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 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-10-11 01:42:59,422 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 28 transitions. [2024-10-11 01:42:59,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-10-11 01:42:59,423 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 01:42:59,423 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 01:42:59,424 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 01:42:59,424 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 01:42:59,424 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 01:42:59,426 INFO L85 PathProgramCache]: Analyzing trace with hash -590731374, now seen corresponding path program 1 times [2024-10-11 01:42:59,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 01:42:59,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [772516118] [2024-10-11 01:42:59,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:42:59,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 01:42:59,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:42:59,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-10-11 01:42:59,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 01:42:59,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [772516118] [2024-10-11 01:42:59,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [772516118] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 01:42:59,566 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 01:42:59,566 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 01:42:59,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870660591] [2024-10-11 01:42:59,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 01:42:59,568 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 01:42:59,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 01:42:59,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 01:42:59,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 01:42:59,570 INFO L87 Difference]: Start difference. First operand 21 states and 28 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 2 states have internal predecessors, (17), 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-10-11 01:42:59,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 01:42:59,608 INFO L93 Difference]: Finished difference Result 43 states and 58 transitions. [2024-10-11 01:42:59,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 01:42:59,610 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 2 states have internal predecessors, (17), 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 17 [2024-10-11 01:42:59,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 01:42:59,611 INFO L225 Difference]: With dead ends: 43 [2024-10-11 01:42:59,611 INFO L226 Difference]: Without dead ends: 24 [2024-10-11 01:42:59,611 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-10-11 01:42:59,613 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 0 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 01:42:59,615 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 42 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 01:42:59,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2024-10-11 01:42:59,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2024-10-11 01:42:59,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 23 states have (on average 1.3478260869565217) internal successors, (31), 23 states have internal predecessors, (31), 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-10-11 01:42:59,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 31 transitions. [2024-10-11 01:42:59,623 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 31 transitions. Word has length 17 [2024-10-11 01:42:59,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 01:42:59,624 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 31 transitions. [2024-10-11 01:42:59,624 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 2 states have internal predecessors, (17), 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-10-11 01:42:59,624 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 31 transitions. [2024-10-11 01:42:59,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-10-11 01:42:59,625 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 01:42:59,625 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 01:42:59,625 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 01:42:59,625 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 01:42:59,626 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 01:42:59,626 INFO L85 PathProgramCache]: Analyzing trace with hash -1177537388, now seen corresponding path program 1 times [2024-10-11 01:42:59,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 01:42:59,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315052491] [2024-10-11 01:42:59,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:42:59,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 01:42:59,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:42:59,747 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 01:42:59,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 01:42:59,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [315052491] [2024-10-11 01:42:59,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [315052491] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 01:42:59,748 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 01:42:59,748 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 01:42:59,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1162828102] [2024-10-11 01:42:59,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 01:42:59,752 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 01:42:59,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 01:42:59,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 01:42:59,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 01:42:59,754 INFO L87 Difference]: Start difference. First operand 24 states and 31 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 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-10-11 01:42:59,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 01:42:59,788 INFO L93 Difference]: Finished difference Result 33 states and 44 transitions. [2024-10-11 01:42:59,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 01:42:59,789 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 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 17 [2024-10-11 01:42:59,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 01:42:59,790 INFO L225 Difference]: With dead ends: 33 [2024-10-11 01:42:59,790 INFO L226 Difference]: Without dead ends: 26 [2024-10-11 01:42:59,790 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-10-11 01:42:59,791 INFO L432 NwaCegarLoop]: 23 mSDtfsCounter, 0 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 01:42:59,791 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 43 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 01:42:59,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2024-10-11 01:42:59,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2024-10-11 01:42:59,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 25 states have (on average 1.36) internal successors, (34), 25 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-10-11 01:42:59,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 34 transitions. [2024-10-11 01:42:59,795 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 34 transitions. Word has length 17 [2024-10-11 01:42:59,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 01:42:59,795 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 34 transitions. [2024-10-11 01:42:59,796 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 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-10-11 01:42:59,796 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 34 transitions. [2024-10-11 01:42:59,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-10-11 01:42:59,796 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 01:42:59,796 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 01:42:59,797 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 01:42:59,797 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 01:42:59,797 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 01:42:59,798 INFO L85 PathProgramCache]: Analyzing trace with hash 888106217, now seen corresponding path program 1 times [2024-10-11 01:42:59,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 01:42:59,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1631661773] [2024-10-11 01:42:59,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:42:59,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 01:42:59,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:43:00,035 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 01:43:00,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 01:43:00,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1631661773] [2024-10-11 01:43:00,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1631661773] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 01:43:00,036 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 01:43:00,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 01:43:00,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499881161] [2024-10-11 01:43:00,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 01:43:00,036 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 01:43:00,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 01:43:00,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 01:43:00,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 01:43:00,037 INFO L87 Difference]: Start difference. First operand 26 states and 34 transitions. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 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-10-11 01:43:00,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 01:43:00,124 INFO L93 Difference]: Finished difference Result 37 states and 46 transitions. [2024-10-11 01:43:00,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 01:43:00,124 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 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 18 [2024-10-11 01:43:00,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 01:43:00,125 INFO L225 Difference]: With dead ends: 37 [2024-10-11 01:43:00,125 INFO L226 Difference]: Without dead ends: 34 [2024-10-11 01:43:00,125 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-11 01:43:00,126 INFO L432 NwaCegarLoop]: 18 mSDtfsCounter, 12 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 01:43:00,126 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 82 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 01:43:00,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2024-10-11 01:43:00,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 28. [2024-10-11 01:43:00,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 27 states have (on average 1.3333333333333333) internal successors, (36), 27 states have internal predecessors, (36), 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-10-11 01:43:00,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 36 transitions. [2024-10-11 01:43:00,131 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 36 transitions. Word has length 18 [2024-10-11 01:43:00,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 01:43:00,131 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 36 transitions. [2024-10-11 01:43:00,131 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 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-10-11 01:43:00,131 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 36 transitions. [2024-10-11 01:43:00,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-10-11 01:43:00,132 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 01:43:00,132 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 01:43:00,132 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 01:43:00,132 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 01:43:00,133 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 01:43:00,133 INFO L85 PathProgramCache]: Analyzing trace with hash 888107891, now seen corresponding path program 1 times [2024-10-11 01:43:00,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 01:43:00,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137509717] [2024-10-11 01:43:00,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:43:00,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 01:43:00,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:43:00,238 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 01:43:00,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 01:43:00,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2137509717] [2024-10-11 01:43:00,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2137509717] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 01:43:00,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1855468941] [2024-10-11 01:43:00,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:43:00,239 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 01:43:00,239 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 01:43:00,243 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 01:43:00,245 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 01:43:00,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:43:00,397 INFO L255 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 01:43:00,404 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 01:43:00,458 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 01:43:00,458 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 01:43:00,491 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 01:43:00,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1855468941] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 01:43:00,492 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 01:43:00,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 3 [2024-10-11 01:43:00,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [357790533] [2024-10-11 01:43:00,493 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 01:43:00,494 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 01:43:00,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 01:43:00,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 01:43:00,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 01:43:00,496 INFO L87 Difference]: Start difference. First operand 28 states and 36 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 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-10-11 01:43:00,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 01:43:00,524 INFO L93 Difference]: Finished difference Result 48 states and 63 transitions. [2024-10-11 01:43:00,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 01:43:00,526 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 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 18 [2024-10-11 01:43:00,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 01:43:00,526 INFO L225 Difference]: With dead ends: 48 [2024-10-11 01:43:00,526 INFO L226 Difference]: Without dead ends: 30 [2024-10-11 01:43:00,527 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 33 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 01:43:00,528 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 5 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 01:43:00,528 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 43 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 01:43:00,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2024-10-11 01:43:00,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2024-10-11 01:43:00,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 29 states have (on average 1.3103448275862069) internal successors, (38), 29 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-10-11 01:43:00,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 38 transitions. [2024-10-11 01:43:00,539 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 38 transitions. Word has length 18 [2024-10-11 01:43:00,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 01:43:00,539 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 38 transitions. [2024-10-11 01:43:00,539 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 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-10-11 01:43:00,539 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 38 transitions. [2024-10-11 01:43:00,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-10-11 01:43:00,540 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 01:43:00,540 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 01:43:00,560 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-11 01:43:00,741 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 01:43:00,741 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 01:43:00,742 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 01:43:00,742 INFO L85 PathProgramCache]: Analyzing trace with hash -1295286117, now seen corresponding path program 1 times [2024-10-11 01:43:00,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 01:43:00,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576369268] [2024-10-11 01:43:00,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:43:00,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 01:43:00,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:43:00,868 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-11 01:43:00,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 01:43:00,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1576369268] [2024-10-11 01:43:00,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1576369268] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 01:43:00,869 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 01:43:00,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 01:43:00,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884836251] [2024-10-11 01:43:00,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 01:43:00,869 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 01:43:00,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 01:43:00,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 01:43:00,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 01:43:00,870 INFO L87 Difference]: Start difference. First operand 30 states and 38 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 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-10-11 01:43:00,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 01:43:00,909 INFO L93 Difference]: Finished difference Result 41 states and 50 transitions. [2024-10-11 01:43:00,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 01:43:00,910 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 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 23 [2024-10-11 01:43:00,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 01:43:00,911 INFO L225 Difference]: With dead ends: 41 [2024-10-11 01:43:00,911 INFO L226 Difference]: Without dead ends: 31 [2024-10-11 01:43:00,911 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-10-11 01:43:00,912 INFO L432 NwaCegarLoop]: 23 mSDtfsCounter, 19 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 01:43:00,912 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 44 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 01:43:00,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2024-10-11 01:43:00,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 29. [2024-10-11 01:43:00,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 28 states have (on average 1.2857142857142858) internal successors, (36), 28 states have internal predecessors, (36), 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-10-11 01:43:00,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 36 transitions. [2024-10-11 01:43:00,919 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 36 transitions. Word has length 23 [2024-10-11 01:43:00,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 01:43:00,919 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 36 transitions. [2024-10-11 01:43:00,920 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 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-10-11 01:43:00,920 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 36 transitions. [2024-10-11 01:43:00,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-10-11 01:43:00,921 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 01:43:00,921 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 01:43:00,921 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 01:43:00,921 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 01:43:00,921 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 01:43:00,922 INFO L85 PathProgramCache]: Analyzing trace with hash 549172958, now seen corresponding path program 1 times [2024-10-11 01:43:00,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 01:43:00,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [251708868] [2024-10-11 01:43:00,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:43:00,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 01:43:00,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:43:01,036 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 01:43:01,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 01:43:01,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [251708868] [2024-10-11 01:43:01,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [251708868] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 01:43:01,037 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 01:43:01,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 01:43:01,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1640267229] [2024-10-11 01:43:01,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 01:43:01,037 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 01:43:01,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 01:43:01,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 01:43:01,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 01:43:01,038 INFO L87 Difference]: Start difference. First operand 29 states and 36 transitions. Second operand has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 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-10-11 01:43:01,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 01:43:01,130 INFO L93 Difference]: Finished difference Result 57 states and 73 transitions. [2024-10-11 01:43:01,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 01:43:01,130 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 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 23 [2024-10-11 01:43:01,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 01:43:01,131 INFO L225 Difference]: With dead ends: 57 [2024-10-11 01:43:01,131 INFO L226 Difference]: Without dead ends: 35 [2024-10-11 01:43:01,131 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-10-11 01:43:01,132 INFO L432 NwaCegarLoop]: 16 mSDtfsCounter, 16 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 01:43:01,132 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 66 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 01:43:01,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2024-10-11 01:43:01,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 28. [2024-10-11 01:43:01,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 27 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-10-11 01:43:01,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 34 transitions. [2024-10-11 01:43:01,139 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 34 transitions. Word has length 23 [2024-10-11 01:43:01,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 01:43:01,139 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 34 transitions. [2024-10-11 01:43:01,141 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 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-10-11 01:43:01,141 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 34 transitions. [2024-10-11 01:43:01,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-10-11 01:43:01,142 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 01:43:01,142 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 01:43:01,142 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 01:43:01,142 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 01:43:01,142 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 01:43:01,143 INFO L85 PathProgramCache]: Analyzing trace with hash 549174632, now seen corresponding path program 1 times [2024-10-11 01:43:01,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 01:43:01,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1534223453] [2024-10-11 01:43:01,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:43:01,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 01:43:01,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:43:02,365 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 01:43:02,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 01:43:02,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1534223453] [2024-10-11 01:43:02,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1534223453] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 01:43:02,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [600261099] [2024-10-11 01:43:02,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:43:02,367 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 01:43:02,367 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 01:43:02,368 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 01:43:02,370 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-11 01:43:02,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:43:02,791 INFO L255 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 74 conjuncts are in the unsatisfiable core [2024-10-11 01:43:02,796 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 01:43:02,868 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-10-11 01:43:02,997 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-10-11 01:43:02,997 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-10-11 01:43:03,129 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 14 treesize of output 15 [2024-10-11 01:43:03,156 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-10-11 01:43:03,250 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-10-11 01:43:03,251 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 57 treesize of output 50 [2024-10-11 01:43:03,264 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-10-11 01:43:03,459 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2024-10-11 01:43:03,459 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-10-11 01:43:03,598 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-10-11 01:43:03,615 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 48 treesize of output 31 [2024-10-11 01:43:03,697 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 19 [2024-10-11 01:43:03,805 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-10-11 01:43:03,817 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-10-11 01:43:03,892 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-10-11 01:43:03,938 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-10-11 01:43:04,000 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 01:43:04,000 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 01:43:04,019 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_692 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store |c_#memory_int#2| |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_692) (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) is different from false [2024-10-11 01:43:08,243 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_689 (Array Int Int)) (v_ArrVal_690 Int) (v_ArrVal_692 (Array Int Int)) (v_ArrVal_685 (Array Int Int)) (v_ArrVal_686 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_insert_~head#1.base|) |c_ULTIMATE.start_dll_insert_~head#1.offset|)) (.cse1 (+ (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_insert_~head#1.base|) |c_ULTIMATE.start_dll_insert_~head#1.offset|) 4))) (store (store (store |c_#memory_int#2| .cse0 (store (select (store |c_#memory_int#2| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_686) .cse0) .cse1 v_ArrVal_690)) |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_689) (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_685) .cse0) .cse1) v_ArrVal_692)) (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) is different from false [2024-10-11 01:43:08,271 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-10-11 01:43:08,278 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-10-11 01:43:09,901 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 380 treesize of output 378 [2024-10-11 01:43:09,923 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 67 treesize of output 65 [2024-10-11 01:43:09,938 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-10-11 01:43:09,953 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 01:43:09,953 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-10-11 01:43:09,964 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 01:43:09,966 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 195 treesize of output 171 [2024-10-11 01:43:09,980 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 135 [2024-10-11 01:43:09,986 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 135 treesize of output 119 [2024-10-11 01:43:09,993 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-10-11 01:43:10,341 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 01:43:10,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [600261099] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 01:43:10,341 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 01:43:10,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 39 [2024-10-11 01:43:10,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003925277] [2024-10-11 01:43:10,342 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 01:43:10,342 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2024-10-11 01:43:10,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 01:43:10,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2024-10-11 01:43:10,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=1246, Unknown=23, NotChecked=146, Total=1560 [2024-10-11 01:43:10,344 INFO L87 Difference]: Start difference. First operand 28 states and 34 transitions. Second operand has 40 states, 40 states have (on average 1.575) internal successors, (63), 39 states have internal predecessors, (63), 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-10-11 01:43:11,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 01:43:11,306 INFO L93 Difference]: Finished difference Result 46 states and 57 transitions. [2024-10-11 01:43:11,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-10-11 01:43:11,307 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 1.575) internal successors, (63), 39 states have internal predecessors, (63), 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 23 [2024-10-11 01:43:11,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 01:43:11,311 INFO L225 Difference]: With dead ends: 46 [2024-10-11 01:43:11,311 INFO L226 Difference]: Without dead ends: 44 [2024-10-11 01:43:11,312 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 21 SyntacticMatches, 2 SemanticMatches, 45 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 559 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=240, Invalid=1725, Unknown=23, NotChecked=174, Total=2162 [2024-10-11 01:43:11,312 INFO L432 NwaCegarLoop]: 11 mSDtfsCounter, 20 mSDsluCounter, 202 mSDsCounter, 0 mSdLazyCounter, 614 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 213 SdHoareTripleChecker+Invalid, 716 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 614 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 96 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-11 01:43:11,313 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 213 Invalid, 716 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 614 Invalid, 0 Unknown, 96 Unchecked, 0.6s Time] [2024-10-11 01:43:11,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2024-10-11 01:43:11,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 34. [2024-10-11 01:43:11,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 33 states have (on average 1.303030303030303) internal successors, (43), 33 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-10-11 01:43:11,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 43 transitions. [2024-10-11 01:43:11,318 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 43 transitions. Word has length 23 [2024-10-11 01:43:11,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 01:43:11,319 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 43 transitions. [2024-10-11 01:43:11,319 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 1.575) internal successors, (63), 39 states have internal predecessors, (63), 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-10-11 01:43:11,319 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 43 transitions. [2024-10-11 01:43:11,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-10-11 01:43:11,320 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 01:43:11,320 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 01:43:11,339 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-11 01:43:11,523 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 01:43:11,524 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 01:43:11,524 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 01:43:11,524 INFO L85 PathProgramCache]: Analyzing trace with hash -1418446231, now seen corresponding path program 1 times [2024-10-11 01:43:11,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 01:43:11,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735783328] [2024-10-11 01:43:11,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:43:11,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 01:43:11,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:43:11,693 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-11 01:43:11,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 01:43:11,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1735783328] [2024-10-11 01:43:11,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1735783328] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 01:43:11,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1195451608] [2024-10-11 01:43:11,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:43:11,693 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 01:43:11,694 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 01:43:11,695 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 01:43:11,696 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-11 01:43:11,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:43:11,851 INFO L255 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 39 conjuncts are in the unsatisfiable core [2024-10-11 01:43:11,854 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 01:43:11,923 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-11 01:43:12,036 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-10-11 01:43:12,088 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-10-11 01:43:12,089 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 15 [2024-10-11 01:43:12,143 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-11 01:43:12,158 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 3 [2024-10-11 01:43:12,186 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-10-11 01:43:12,232 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-11 01:43:12,232 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 01:43:12,296 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 104 treesize of output 96 [2024-10-11 01:43:16,495 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse7 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_insert_~head#1.base|))) (let ((.cse2 (= |c_ULTIMATE.start_dll_insert_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse0 (= |c_ULTIMATE.start_dll_insert_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse6 (select .cse7 |c_ULTIMATE.start_dll_insert_~head#1.offset|)) (.cse5 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse1 (and (forall ((v_arrayElimCell_30 Int) (v_ArrVal_849 (Array Int Int))) (or (= v_arrayElimCell_30 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store |c_#memory_int#2| .cse6 v_ArrVal_849) .cse5) v_arrayElimCell_30)))) (or (forall ((v_arrayElimCell_30 Int) (v_ArrVal_849 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store |c_#memory_int#2| .cse6 v_ArrVal_849) .cse5) v_arrayElimCell_30))) (= .cse5 0)))) (.cse3 (or (not .cse2) (forall ((v_ArrVal_849 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store |c_#memory_int#2| .cse6 v_ArrVal_849) |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|) |c_ULTIMATE.start_dll_insert_~new_node~0#1.offset|))) (not .cse0)))) (and (or .cse0 .cse1) (or (and .cse0 .cse2 (= |c_ULTIMATE.start_dll_insert_~new_node~0#1.offset| 0)) (and .cse3 (forall ((v_ArrVal_849 (Array Int Int))) (let ((.cse4 (store |c_#memory_int#2| .cse6 v_ArrVal_849))) (or (forall ((v_arrayElimCell_30 Int)) (or (= v_arrayElimCell_30 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse4 .cse5) v_arrayElimCell_30)))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse4 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|) |c_ULTIMATE.start_dll_insert_~new_node~0#1.offset|))))))) (or .cse2 .cse1) (or (= (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_insert_~head#1.base| (store .cse7 |c_ULTIMATE.start_dll_insert_~head#1.offset| |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (and .cse3 (forall ((v_ArrVal_849 (Array Int Int))) (let ((.cse8 (store |c_#memory_int#2| .cse6 v_ArrVal_849))) (or (forall ((v_arrayElimCell_30 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse8 .cse5) v_arrayElimCell_30))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse8 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|) |c_ULTIMATE.start_dll_insert_~new_node~0#1.offset|))))))))))) is different from false [2024-10-11 01:43:17,271 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 01:43:17,271 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 362 treesize of output 333 [2024-10-11 01:43:17,305 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 01:43:17,306 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 317 treesize of output 323 [2024-10-11 01:43:17,334 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 01:43:17,334 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 2 case distinctions, treesize of input 304 treesize of output 310 [2024-10-11 01:43:17,364 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 01:43:17,364 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 2 case distinctions, treesize of input 291 treesize of output 284 [2024-10-11 01:43:17,379 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 285 treesize of output 277 [2024-10-11 01:43:17,406 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 01:43:17,407 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 2 case distinctions, treesize of input 272 treesize of output 278 [2024-10-11 01:43:17,437 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 01:43:17,438 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 2 case distinctions, treesize of input 259 treesize of output 265 [2024-10-11 01:43:17,464 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 01:43:17,465 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 2 case distinctions, treesize of input 246 treesize of output 252 [2024-10-11 01:43:17,490 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 01:43:17,490 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 2 case distinctions, treesize of input 233 treesize of output 239 [2024-10-11 01:43:17,531 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 01:43:17,531 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 2 case distinctions, treesize of input 220 treesize of output 213 [2024-10-11 01:43:17,547 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 214 treesize of output 206 [2024-10-11 01:43:17,562 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 201 treesize of output 199 [2024-10-11 01:43:17,585 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 01:43:17,585 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 230 treesize of output 229 [2024-10-11 01:43:17,610 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 01:43:17,610 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 213 treesize of output 218 [2024-10-11 01:43:17,626 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 209 treesize of output 207 [2024-10-11 01:43:17,653 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 01:43:17,654 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 238 treesize of output 237 [2024-10-11 01:43:17,686 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 01:43:17,686 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 221 treesize of output 226 [2024-10-11 01:43:17,711 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 01:43:17,711 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 237 treesize of output 240 [2024-10-11 01:43:17,743 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 01:43:17,744 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 230 treesize of output 233 [2024-10-11 01:43:17,763 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 217 treesize of output 215 [2024-10-11 01:43:17,788 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 01:43:17,788 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 235 treesize of output 238 [2024-10-11 01:43:17,824 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 01:43:17,824 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 228 treesize of output 231 [2024-10-11 01:43:17,841 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 215 treesize of output 213 [2024-10-11 01:43:18,591 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-11 01:43:18,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1195451608] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 01:43:18,592 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 01:43:18,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 10, 10] total 22 [2024-10-11 01:43:18,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565522079] [2024-10-11 01:43:18,593 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 01:43:18,594 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-10-11 01:43:18,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 01:43:18,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-10-11 01:43:18,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=358, Unknown=2, NotChecked=38, Total=462 [2024-10-11 01:43:18,596 INFO L87 Difference]: Start difference. First operand 34 states and 43 transitions. Second operand has 22 states, 22 states have (on average 2.272727272727273) internal successors, (50), 22 states have internal predecessors, (50), 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-10-11 01:43:51,038 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-11 01:43:55,045 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-11 01:43:55,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 01:43:55,271 INFO L93 Difference]: Finished difference Result 54 states and 66 transitions. [2024-10-11 01:43:55,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-11 01:43:55,272 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 2.272727272727273) internal successors, (50), 22 states have internal predecessors, (50), 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 24 [2024-10-11 01:43:55,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 01:43:55,273 INFO L225 Difference]: With dead ends: 54 [2024-10-11 01:43:55,273 INFO L226 Difference]: Without dead ends: 46 [2024-10-11 01:43:55,273 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 32.9s TimeCoverageRelationStatistics Valid=126, Invalid=626, Unknown=8, NotChecked=52, Total=812 [2024-10-11 01:43:55,274 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 39 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 263 mSolverCounterSat, 2 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 225 SdHoareTripleChecker+Invalid, 309 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 263 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 42 IncrementalHoareTripleChecker+Unchecked, 8.4s IncrementalHoareTripleChecker+Time [2024-10-11 01:43:55,274 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 225 Invalid, 309 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 263 Invalid, 2 Unknown, 42 Unchecked, 8.4s Time] [2024-10-11 01:43:55,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2024-10-11 01:43:55,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 36. [2024-10-11 01:43:55,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 35 states have (on average 1.2857142857142858) internal successors, (45), 35 states have internal predecessors, (45), 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-10-11 01:43:55,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 45 transitions. [2024-10-11 01:43:55,279 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 45 transitions. Word has length 24 [2024-10-11 01:43:55,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 01:43:55,279 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 45 transitions. [2024-10-11 01:43:55,279 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 2.272727272727273) internal successors, (50), 22 states have internal predecessors, (50), 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-10-11 01:43:55,279 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 45 transitions. [2024-10-11 01:43:55,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-10-11 01:43:55,280 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 01:43:55,280 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 01:43:55,299 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-11 01:43:55,484 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 01:43:55,485 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 01:43:55,485 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 01:43:55,485 INFO L85 PathProgramCache]: Analyzing trace with hash 426014518, now seen corresponding path program 2 times [2024-10-11 01:43:55,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 01:43:55,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1508786416] [2024-10-11 01:43:55,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:43:55,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 01:43:55,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:43:55,605 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-11 01:43:55,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 01:43:55,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1508786416] [2024-10-11 01:43:55,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1508786416] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 01:43:55,606 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 01:43:55,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 01:43:55,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2085427158] [2024-10-11 01:43:55,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 01:43:55,607 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 01:43:55,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 01:43:55,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 01:43:55,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 01:43:55,608 INFO L87 Difference]: Start difference. First operand 36 states and 45 transitions. Second operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 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-10-11 01:43:55,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 01:43:55,642 INFO L93 Difference]: Finished difference Result 43 states and 52 transitions. [2024-10-11 01:43:55,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 01:43:55,642 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 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 24 [2024-10-11 01:43:55,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 01:43:55,643 INFO L225 Difference]: With dead ends: 43 [2024-10-11 01:43:55,643 INFO L226 Difference]: Without dead ends: 31 [2024-10-11 01:43:55,645 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 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-10-11 01:43:55,645 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 17 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 01:43:55,646 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 61 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 01:43:55,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2024-10-11 01:43:55,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 29. [2024-10-11 01:43:55,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 28 states have internal predecessors, (33), 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-10-11 01:43:55,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2024-10-11 01:43:55,651 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 33 transitions. Word has length 24 [2024-10-11 01:43:55,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 01:43:55,651 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 33 transitions. [2024-10-11 01:43:55,651 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 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-10-11 01:43:55,652 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2024-10-11 01:43:55,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-10-11 01:43:55,652 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 01:43:55,652 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-10-11 01:43:55,652 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-11 01:43:55,653 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 01:43:55,653 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 01:43:55,654 INFO L85 PathProgramCache]: Analyzing trace with hash -524122119, now seen corresponding path program 1 times [2024-10-11 01:43:55,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 01:43:55,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820715224] [2024-10-11 01:43:55,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:43:55,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 01:43:55,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:43:56,659 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 01:43:56,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 01:43:56,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1820715224] [2024-10-11 01:43:56,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1820715224] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 01:43:56,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1609236825] [2024-10-11 01:43:56,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:43:56,661 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 01:43:56,661 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 01:43:56,663 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 01:43:56,664 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-11 01:43:56,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:43:56,831 INFO L255 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 48 conjuncts are in the unsatisfiable core [2024-10-11 01:43:56,834 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 01:43:56,841 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-11 01:43:56,914 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-10-11 01:43:56,914 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-10-11 01:43:56,967 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 7 [2024-10-11 01:43:57,021 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-10-11 01:43:57,021 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 39 [2024-10-11 01:43:57,139 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2024-10-11 01:43:57,140 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 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-10-11 01:43:57,207 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 49 treesize of output 32 [2024-10-11 01:43:57,300 INFO L349 Elim1Store]: treesize reduction 25, result has 47.9 percent of original size [2024-10-11 01:43:57,300 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 59 treesize of output 57 [2024-10-11 01:43:57,319 INFO L349 Elim1Store]: treesize reduction 25, result has 26.5 percent of original size [2024-10-11 01:43:57,319 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 43 [2024-10-11 01:43:57,345 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 7 treesize of output 3 [2024-10-11 01:43:57,436 INFO L349 Elim1Store]: treesize reduction 33, result has 43.1 percent of original size [2024-10-11 01:43:57,437 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 1 case distinctions, treesize of input 48 treesize of output 38 [2024-10-11 01:43:57,514 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 36 treesize of output 20 [2024-10-11 01:43:57,547 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 24 treesize of output 12 [2024-10-11 01:43:57,550 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 01:43:57,551 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 01:43:57,653 WARN L851 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_dll_insert_~snd_to_last~0#1.base| Int) (|ULTIMATE.start_dll_insert_~snd_to_last~0#1.offset| Int) (v_ArrVal_1100 (Array Int Int)) (|ULTIMATE.start_dll_insert_~last~0#1.base| Int) (|ULTIMATE.start_dll_insert_~last~0#1.offset| Int)) (not (= (select (select (let ((.cse0 (store (store |c_#memory_$Pointer$#2.base| |ULTIMATE.start_dll_insert_~snd_to_last~0#1.base| (store (select |c_#memory_$Pointer$#2.base| |ULTIMATE.start_dll_insert_~snd_to_last~0#1.base|) (+ 4 |ULTIMATE.start_dll_insert_~snd_to_last~0#1.offset|) |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|)) |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_1100))) (store .cse0 |ULTIMATE.start_dll_insert_~last~0#1.base| (store (select .cse0 |ULTIMATE.start_dll_insert_~last~0#1.base|) (+ |ULTIMATE.start_dll_insert_~last~0#1.offset| 8) |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|))) (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)) 0))) is different from false [2024-10-11 01:43:57,676 WARN L851 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_dll_insert_~snd_to_last~0#1.base| Int) (|ULTIMATE.start_dll_insert_~snd_to_last~0#1.offset| Int) (v_ArrVal_1100 (Array Int Int)) (|ULTIMATE.start_dll_insert_~last~0#1.base| Int) (|ULTIMATE.start_dll_insert_~last~0#1.offset| Int) (v_ArrVal_1098 (Array Int Int))) (not (= (select (select (let ((.cse0 (store (store |c_#memory_$Pointer$#2.base| |ULTIMATE.start_dll_insert_~snd_to_last~0#1.base| (store (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_1098) |ULTIMATE.start_dll_insert_~snd_to_last~0#1.base|) (+ 4 |ULTIMATE.start_dll_insert_~snd_to_last~0#1.offset|) |c_ULTIMATE.start_node_create_~temp~0#1.base|)) |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_1100))) (store .cse0 |ULTIMATE.start_dll_insert_~last~0#1.base| (store (select .cse0 |ULTIMATE.start_dll_insert_~last~0#1.base|) (+ |ULTIMATE.start_dll_insert_~last~0#1.offset| 8) |c_ULTIMATE.start_node_create_~temp~0#1.base|))) (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)) 0))) is different from false [2024-10-11 01:43:57,699 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 69 treesize of output 61 [2024-10-11 01:43:57,703 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 65 treesize of output 57 [2024-10-11 01:43:57,719 WARN L851 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_dll_insert_~snd_to_last~0#1.base| Int) (|ULTIMATE.start_dll_insert_~snd_to_last~0#1.offset| Int) (v_ArrVal_1100 (Array Int Int)) (|ULTIMATE.start_dll_insert_~last~0#1.base| Int) (|ULTIMATE.start_dll_insert_~last~0#1.offset| Int) (v_ArrVal_1098 (Array Int Int)) (|v_ULTIMATE.start_node_create_~temp~0#1.base_19| Int)) (or (= |v_ULTIMATE.start_node_create_~temp~0#1.base_19| 0) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_19|) 0)) (not (= (select (select (let ((.cse0 (store (store |c_#memory_$Pointer$#2.base| |ULTIMATE.start_dll_insert_~snd_to_last~0#1.base| (store (select (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_19| v_ArrVal_1098) |ULTIMATE.start_dll_insert_~snd_to_last~0#1.base|) (+ 4 |ULTIMATE.start_dll_insert_~snd_to_last~0#1.offset|) |v_ULTIMATE.start_node_create_~temp~0#1.base_19|)) |v_ULTIMATE.start_node_create_~temp~0#1.base_19| v_ArrVal_1100))) (store .cse0 |ULTIMATE.start_dll_insert_~last~0#1.base| (store (select .cse0 |ULTIMATE.start_dll_insert_~last~0#1.base|) (+ |ULTIMATE.start_dll_insert_~last~0#1.offset| 8) |v_ULTIMATE.start_node_create_~temp~0#1.base_19|))) |c_ULTIMATE.start_dll_create_~head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 4)) 0)))) is different from false [2024-10-11 01:43:57,824 WARN L851 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_dll_insert_~snd_to_last~0#1.base| Int) (|ULTIMATE.start_dll_insert_~snd_to_last~0#1.offset| Int) (v_ArrVal_1100 (Array Int Int)) (|ULTIMATE.start_dll_insert_~last~0#1.base| Int) (|ULTIMATE.start_dll_insert_~last~0#1.offset| Int) (v_ArrVal_1098 (Array Int Int)) (v_ArrVal_1097 (Array Int Int)) (|v_ULTIMATE.start_node_create_~temp~0#1.base_19| Int)) (or (= |v_ULTIMATE.start_node_create_~temp~0#1.base_19| 0) (not (= (select (select (let ((.cse0 (store (let ((.cse1 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1097))) (store .cse1 |ULTIMATE.start_dll_insert_~snd_to_last~0#1.base| (store (select (store .cse1 |v_ULTIMATE.start_node_create_~temp~0#1.base_19| v_ArrVal_1098) |ULTIMATE.start_dll_insert_~snd_to_last~0#1.base|) (+ 4 |ULTIMATE.start_dll_insert_~snd_to_last~0#1.offset|) |v_ULTIMATE.start_node_create_~temp~0#1.base_19|))) |v_ULTIMATE.start_node_create_~temp~0#1.base_19| v_ArrVal_1100))) (store .cse0 |ULTIMATE.start_dll_insert_~last~0#1.base| (store (select .cse0 |ULTIMATE.start_dll_insert_~last~0#1.base|) (+ |ULTIMATE.start_dll_insert_~last~0#1.offset| 8) |v_ULTIMATE.start_node_create_~temp~0#1.base_19|))) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) 0)) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_19|) 0)))) is different from false [2024-10-11 01:43:57,840 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 01:43:57,840 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 124 treesize of output 85 [2024-10-11 01:43:57,978 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 01:43:57,981 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 597569 treesize of output 588087 [2024-10-11 01:43:58,728 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 9062 treesize of output 8806 [2024-10-11 01:43:59,164 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 8438 treesize of output 8102 [2024-10-11 01:43:59,552 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 7254 treesize of output 6806 [2024-10-11 01:44:02,013 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 123 [2024-10-11 01:44:02,296 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 2 not checked. [2024-10-11 01:44:02,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1609236825] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 01:44:02,296 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 01:44:02,296 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 15] total 38 [2024-10-11 01:44:02,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [639296177] [2024-10-11 01:44:02,297 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 01:44:02,297 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2024-10-11 01:44:02,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 01:44:02,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2024-10-11 01:44:02,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=1021, Unknown=4, NotChecked=268, Total=1406 [2024-10-11 01:44:02,299 INFO L87 Difference]: Start difference. First operand 29 states and 33 transitions. Second operand has 38 states, 38 states have (on average 1.7105263157894737) internal successors, (65), 38 states have internal predecessors, (65), 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-10-11 01:44:03,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 01:44:03,254 INFO L93 Difference]: Finished difference Result 45 states and 50 transitions. [2024-10-11 01:44:03,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-10-11 01:44:03,254 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 1.7105263157894737) internal successors, (65), 38 states have internal predecessors, (65), 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-10-11 01:44:03,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 01:44:03,255 INFO L225 Difference]: With dead ends: 45 [2024-10-11 01:44:03,255 INFO L226 Difference]: Without dead ends: 42 [2024-10-11 01:44:03,256 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 513 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=281, Invalid=2181, Unknown=4, NotChecked=396, Total=2862 [2024-10-11 01:44:03,256 INFO L432 NwaCegarLoop]: 11 mSDtfsCounter, 25 mSDsluCounter, 231 mSDsCounter, 0 mSdLazyCounter, 561 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 242 SdHoareTripleChecker+Invalid, 718 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 561 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 147 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 01:44:03,257 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 242 Invalid, 718 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 561 Invalid, 0 Unknown, 147 Unchecked, 0.4s Time] [2024-10-11 01:44:03,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2024-10-11 01:44:03,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 33. [2024-10-11 01:44:03,261 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-10-11 01:44:03,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2024-10-11 01:44:03,261 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 25 [2024-10-11 01:44:03,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 01:44:03,262 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2024-10-11 01:44:03,262 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 1.7105263157894737) internal successors, (65), 38 states have internal predecessors, (65), 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-10-11 01:44:03,262 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2024-10-11 01:44:03,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-10-11 01:44:03,262 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 01:44:03,263 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] [2024-10-11 01:44:03,276 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-10-11 01:44:03,465 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-10-11 01:44:03,465 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 01:44:03,465 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 01:44:03,465 INFO L85 PathProgramCache]: Analyzing trace with hash -524120445, now seen corresponding path program 1 times [2024-10-11 01:44:03,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 01:44:03,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908758910] [2024-10-11 01:44:03,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:44:03,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 01:44:03,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:44:04,664 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 01:44:04,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 01:44:04,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [908758910] [2024-10-11 01:44:04,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [908758910] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 01:44:04,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1691988194] [2024-10-11 01:44:04,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:44:04,665 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 01:44:04,665 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 01:44:04,667 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 01:44:04,669 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-11 01:44:05,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:44:05,076 INFO L255 TraceCheckSpWp]: Trace formula consists of 310 conjuncts, 99 conjuncts are in the unsatisfiable core [2024-10-11 01:44:05,081 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 01:44:05,104 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-10-11 01:44:05,189 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-10-11 01:44:05,189 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-10-11 01:44:05,242 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 14 treesize of output 15 [2024-10-11 01:44:05,291 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-10-11 01:44:05,291 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 38 [2024-10-11 01:44:05,416 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2024-10-11 01:44:05,416 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-10-11 01:44:05,492 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-11 01:44:05,499 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 48 treesize of output 31 [2024-10-11 01:44:05,666 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 24 treesize of output 20 [2024-10-11 01:44:05,670 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-10-11 01:44:05,675 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 49 [2024-10-11 01:44:05,686 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 31 treesize of output 20 [2024-10-11 01:44:05,698 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 01:44:05,701 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 37 treesize of output 34 [2024-10-11 01:44:05,705 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 25 treesize of output 11 [2024-10-11 01:44:05,764 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 63 treesize of output 40 [2024-10-11 01:44:05,772 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-10-11 01:44:05,775 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-10-11 01:44:05,840 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 61 treesize of output 37 [2024-10-11 01:44:05,890 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 18 [2024-10-11 01:44:05,893 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-10-11 01:44:05,971 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 01:44:05,971 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 01:44:06,116 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 01:44:06,117 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 76 treesize of output 77 [2024-10-11 01:44:06,132 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 01:44:06,133 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 580 treesize of output 565 [2024-10-11 01:44:06,143 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-10-11 01:44:06,152 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 134 treesize of output 118 [2024-10-11 01:44:10,771 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse15 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse8 (= |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| .cse4))) (let ((.cse19 (not .cse8)) (.cse3 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_insert_~snd_to_last~0#1.base| (store (select |c_#memory_$Pointer$#2.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 (+ .cse15 4)) (.cse6 (+ |c_ULTIMATE.start_dll_insert_~new_node~0#1.offset| 8)) (.cse7 (+ |c_ULTIMATE.start_dll_insert_~new_node~0#1.offset| 4))) (let ((.cse0 (or .cse19 (forall ((v_arrayElimCell_100 Int) (v_ArrVal_1278 (Array Int Int)) (v_ArrVal_1276 (Array Int Int)) (v_ArrVal_1286 (Array Int Int)) (v_ArrVal_1284 (Array Int Int)) (v_ArrVal_1281 (Array Int Int))) (let ((.cse33 (store |c_#memory_int#2| |c_ULTIMATE.start_dll_insert_~snd_to_last~0#1.base| v_ArrVal_1278))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store .cse33 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_1281) |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1286) (select (select (store (store .cse3 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_1276) |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1284) .cse4) .cse5)) v_arrayElimCell_100)) (not (= v_ArrVal_1281 (store (store (select .cse33 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|) .cse6 (select v_ArrVal_1281 .cse6)) .cse7 (select v_ArrVal_1281 .cse7))))))))) (.cse13 (or .cse8 (forall ((v_ArrVal_1278 (Array Int Int)) (v_ArrVal_1276 (Array Int Int)) (v_arrayElimCell_101 Int) (v_ArrVal_1286 (Array Int Int)) (v_ArrVal_1284 (Array Int Int)) (v_arrayElimCell_98 Int) (v_ArrVal_1281 (Array Int Int))) (let ((.cse32 (store |c_#memory_int#2| |c_ULTIMATE.start_dll_insert_~snd_to_last~0#1.base| v_ArrVal_1278))) (let ((.cse31 (select (store (store .cse32 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_1281) |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1286) (select (select (store (store .cse3 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_1276) |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1284) .cse4) .cse5)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse31 v_arrayElimCell_101)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse31 v_arrayElimCell_98)) (not (= v_ArrVal_1281 (store (store (select .cse32 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|) .cse6 (select v_ArrVal_1281 .cse6)) .cse7 (select v_ArrVal_1281 .cse7)))))))))) (.cse14 (forall ((v_ArrVal_1278 (Array Int Int)) (v_arrayElimCell_98 Int) (v_ArrVal_1281 (Array Int Int))) (let ((.cse30 (store |c_#memory_int#2| |c_ULTIMATE.start_dll_insert_~snd_to_last~0#1.base| v_ArrVal_1278))) (or (forall ((v_ArrVal_1276 (Array Int Int)) (v_arrayElimCell_101 Int) (v_ArrVal_1286 (Array Int Int)) (v_ArrVal_1284 (Array Int Int))) (let ((.cse29 (select (store (store .cse30 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_1281) |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1286) (select (select (store (store .cse3 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_1276) |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1284) .cse4) .cse5)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse29 v_arrayElimCell_101)) (forall ((v_arrayElimCell_100 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse29 v_arrayElimCell_100))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse29 v_arrayElimCell_98))))) (not (= v_ArrVal_1281 (store (store (select .cse30 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|) .cse6 (select v_ArrVal_1281 .cse6)) .cse7 (select v_ArrVal_1281 .cse7)))))))) (.cse11 (forall ((v_ArrVal_1278 (Array Int Int)) (v_arrayElimCell_98 Int) (v_ArrVal_1281 (Array Int Int))) (let ((.cse28 (store |c_#memory_int#2| |c_ULTIMATE.start_dll_insert_~snd_to_last~0#1.base| v_ArrVal_1278))) (or (forall ((v_ArrVal_1276 (Array Int Int)) (v_ArrVal_1286 (Array Int Int)) (v_ArrVal_1284 (Array Int Int))) (let ((.cse27 (select (store (store .cse28 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_1281) |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1286) (select (select (store (store .cse3 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_1276) |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1284) .cse4) .cse5)))) (or (forall ((v_arrayElimCell_100 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse27 v_arrayElimCell_100))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse27 v_arrayElimCell_98))))) (not (= v_ArrVal_1281 (store (store (select .cse28 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|) .cse6 (select v_ArrVal_1281 .cse6)) .cse7 (select v_ArrVal_1281 .cse7)))))))) (.cse12 (or .cse8 (forall ((v_ArrVal_1278 (Array Int Int)) (v_ArrVal_1276 (Array Int Int)) (v_ArrVal_1286 (Array Int Int)) (v_ArrVal_1284 (Array Int Int)) (v_arrayElimCell_98 Int) (v_ArrVal_1281 (Array Int Int))) (let ((.cse26 (store |c_#memory_int#2| |c_ULTIMATE.start_dll_insert_~snd_to_last~0#1.base| v_ArrVal_1278))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store .cse26 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_1281) |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1286) (select (select (store (store .cse3 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_1276) |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1284) .cse4) .cse5)) v_arrayElimCell_98)) (not (= v_ArrVal_1281 (store (store (select .cse26 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|) .cse6 (select v_ArrVal_1281 .cse6)) .cse7 (select v_ArrVal_1281 .cse7))))))))) (.cse10 (= .cse4 |c_ULTIMATE.start_dll_insert_~last~0#1.base|))) (and (or (and .cse0 (forall ((v_ArrVal_1278 (Array Int Int)) (v_ArrVal_1281 (Array Int Int))) (let ((.cse2 (store |c_#memory_int#2| |c_ULTIMATE.start_dll_insert_~snd_to_last~0#1.base| v_ArrVal_1278))) (or (forall ((v_ArrVal_1276 (Array Int Int)) (v_ArrVal_1286 (Array Int Int)) (v_ArrVal_1284 (Array Int Int))) (let ((.cse1 (select (store (store .cse2 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_1281) |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1286) (select (select (store (store .cse3 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_1276) |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1284) .cse4) .cse5)))) (or (forall ((v_arrayElimCell_100 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse1 v_arrayElimCell_100))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse1 |c_ULTIMATE.start_dll_insert_~new_node~0#1.offset|))))) (not (= v_ArrVal_1281 (store (store (select .cse2 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|) .cse6 (select v_ArrVal_1281 .cse6)) .cse7 (select v_ArrVal_1281 .cse7))))))) (or .cse8 (forall ((v_ArrVal_1278 (Array Int Int)) (v_ArrVal_1276 (Array Int Int)) (v_ArrVal_1286 (Array Int Int)) (v_ArrVal_1284 (Array Int Int)) (v_ArrVal_1281 (Array Int Int))) (let ((.cse9 (store |c_#memory_int#2| |c_ULTIMATE.start_dll_insert_~snd_to_last~0#1.base| v_ArrVal_1278))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store .cse9 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_1281) |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1286) (select (select (store (store .cse3 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_1276) |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1284) .cse4) .cse5)) |c_ULTIMATE.start_dll_insert_~new_node~0#1.offset|)) (not (= v_ArrVal_1281 (store (store (select .cse9 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|) .cse6 (select v_ArrVal_1281 .cse6)) .cse7 (select v_ArrVal_1281 .cse7))))))))) .cse10) (or (and (or (and .cse11 .cse12 .cse0) .cse10) .cse13 .cse14) (= .cse15 |c_ULTIMATE.start_dll_insert_~snd_to_last~0#1.offset|)) (or .cse8 (forall ((v_ArrVal_1278 (Array Int Int)) (v_ArrVal_1276 (Array Int Int)) (v_arrayElimCell_101 Int) (v_ArrVal_1286 (Array Int Int)) (v_ArrVal_1284 (Array Int Int)) (v_ArrVal_1281 (Array Int Int))) (let ((.cse17 (store |c_#memory_int#2| |c_ULTIMATE.start_dll_insert_~snd_to_last~0#1.base| v_ArrVal_1278))) (let ((.cse16 (select (store (store .cse17 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_1281) |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1286) (select (select (store (store .cse3 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_1276) |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1284) .cse4) .cse5)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse16 v_arrayElimCell_101)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse16 |c_ULTIMATE.start_dll_insert_~new_node~0#1.offset|)) (not (= v_ArrVal_1281 (store (store (select .cse17 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|) .cse6 (select v_ArrVal_1281 .cse6)) .cse7 (select v_ArrVal_1281 .cse7))))))))) (or (forall ((v_ArrVal_1278 (Array Int Int)) (v_ArrVal_1276 (Array Int Int)) (v_arrayElimCell_101 Int) (v_ArrVal_1286 (Array Int Int)) (v_ArrVal_1284 (Array Int Int)) (v_ArrVal_1281 (Array Int Int))) (let ((.cse18 (store |c_#memory_int#2| |c_ULTIMATE.start_dll_insert_~snd_to_last~0#1.base| v_ArrVal_1278))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store .cse18 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_1281) |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1286) (select (select (store (store .cse3 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_1276) |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1284) .cse4) .cse5)) v_arrayElimCell_101)) (not (= v_ArrVal_1281 (store (store (select .cse18 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|) .cse6 (select v_ArrVal_1281 .cse6)) .cse7 (select v_ArrVal_1281 .cse7))))))) (not .cse10)) (or .cse19 (forall ((v_arrayElimCell_100 Int) (v_ArrVal_1278 (Array Int Int)) (v_ArrVal_1276 (Array Int Int)) (v_arrayElimCell_101 Int) (v_ArrVal_1286 (Array Int Int)) (v_ArrVal_1284 (Array Int Int)) (v_ArrVal_1281 (Array Int Int))) (let ((.cse21 (store |c_#memory_int#2| |c_ULTIMATE.start_dll_insert_~snd_to_last~0#1.base| v_ArrVal_1278))) (let ((.cse20 (select (store (store .cse21 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_1281) |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1286) (select (select (store (store .cse3 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_1276) |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1284) .cse4) .cse5)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse20 v_arrayElimCell_101)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse20 v_arrayElimCell_100)) (not (= v_ArrVal_1281 (store (store (select .cse21 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|) .cse6 (select v_ArrVal_1281 .cse6)) .cse7 (select v_ArrVal_1281 .cse7))))))))) (or (= .cse4 |c_ULTIMATE.start_dll_insert_~snd_to_last~0#1.base|) (let ((.cse22 (select |c_#memory_int#2| |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|))) (and (or .cse19 (forall ((v_arrayElimCell_100 Int) (v_ArrVal_1278 (Array Int Int)) (v_ArrVal_1276 (Array Int Int)) (v_arrayElimCell_101 Int) (v_ArrVal_1286 (Array Int Int)) (v_ArrVal_1284 (Array Int Int)) (v_ArrVal_1281 (Array Int Int))) (let ((.cse23 (select (store (store (store |c_#memory_int#2| |c_ULTIMATE.start_dll_insert_~snd_to_last~0#1.base| v_ArrVal_1278) |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_1281) |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1286) (select (select (store (store .cse3 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_1276) |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1284) .cse4) .cse5)))) (or (not (= v_ArrVal_1281 (store (store .cse22 .cse6 (select v_ArrVal_1281 .cse6)) .cse7 (select v_ArrVal_1281 .cse7)))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse23 v_arrayElimCell_101)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse23 v_arrayElimCell_100)))))) .cse13 .cse14 (or (and .cse11 .cse12 (or .cse19 (forall ((v_arrayElimCell_100 Int) (v_ArrVal_1278 (Array Int Int)) (v_ArrVal_1276 (Array Int Int)) (v_ArrVal_1286 (Array Int Int)) (v_ArrVal_1284 (Array Int Int)) (v_ArrVal_1281 (Array Int Int))) (or (not (= v_ArrVal_1281 (store (store .cse22 .cse6 (select v_ArrVal_1281 .cse6)) .cse7 (select v_ArrVal_1281 .cse7)))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int#2| |c_ULTIMATE.start_dll_insert_~snd_to_last~0#1.base| v_ArrVal_1278) |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_1281) |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1286) (select (select (store (store .cse3 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_1276) |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1284) .cse4) .cse5)) v_arrayElimCell_100)))))) .cse10)))) (forall ((v_ArrVal_1278 (Array Int Int)) (v_ArrVal_1281 (Array Int Int))) (let ((.cse25 (store |c_#memory_int#2| |c_ULTIMATE.start_dll_insert_~snd_to_last~0#1.base| v_ArrVal_1278))) (or (forall ((v_ArrVal_1276 (Array Int Int)) (v_arrayElimCell_101 Int) (v_ArrVal_1286 (Array Int Int)) (v_ArrVal_1284 (Array Int Int))) (let ((.cse24 (select (store (store .cse25 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_1281) |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1286) (select (select (store (store .cse3 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_1276) |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1284) .cse4) .cse5)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse24 v_arrayElimCell_101)) (forall ((v_arrayElimCell_100 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse24 v_arrayElimCell_100))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse24 |c_ULTIMATE.start_dll_insert_~new_node~0#1.offset|))))) (not (= v_ArrVal_1281 (store (store (select .cse25 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|) .cse6 (select v_ArrVal_1281 .cse6)) .cse7 (select v_ArrVal_1281 .cse7)))))))))))) is different from false [2024-10-11 01:44:11,535 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse7 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse26 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse35 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_insert_~last~0#1.base|)) (.cse36 (+ |c_ULTIMATE.start_dll_insert_~last~0#1.offset| 4)) (.cse0 (= |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| .cse7))) (let ((.cse16 (not .cse0)) (.cse6 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_insert_~last~0#1.base| (store .cse35 .cse36 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|))) (.cse5 (select .cse35 .cse36)) (.cse8 (+ .cse26 4)) (.cse3 (+ |c_ULTIMATE.start_dll_insert_~new_node~0#1.offset| 8)) (.cse4 (+ |c_ULTIMATE.start_dll_insert_~new_node~0#1.offset| 4))) (let ((.cse19 (forall ((v_ArrVal_1278 (Array Int Int)) (v_arrayElimCell_98 Int) (v_ArrVal_1281 (Array Int Int))) (let ((.cse34 (store |c_#memory_int#2| |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1278))) (or (forall ((v_ArrVal_1276 (Array Int Int)) (v_arrayElimCell_101 Int) (v_ArrVal_1286 (Array Int Int)) (v_ArrVal_1284 (Array Int Int))) (let ((.cse33 (select (store (store .cse34 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_1281) .cse5 v_ArrVal_1286) (select (select (store (store .cse6 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_1276) .cse5 v_ArrVal_1284) .cse7) .cse8)))) (or (forall ((v_arrayElimCell_100 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse33 v_arrayElimCell_100))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse33 v_arrayElimCell_98)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse33 v_arrayElimCell_101))))) (not (= (store (store (select .cse34 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|) .cse3 (select v_ArrVal_1281 .cse3)) .cse4 (select v_ArrVal_1281 .cse4)) v_ArrVal_1281)))))) (.cse22 (or (forall ((v_ArrVal_1278 (Array Int Int)) (v_ArrVal_1276 (Array Int Int)) (v_ArrVal_1286 (Array Int Int)) (v_ArrVal_1284 (Array Int Int)) (v_arrayElimCell_98 Int) (v_ArrVal_1281 (Array Int Int))) (let ((.cse32 (store |c_#memory_int#2| |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1278))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store .cse32 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_1281) .cse5 v_ArrVal_1286) (select (select (store (store .cse6 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_1276) .cse5 v_ArrVal_1284) .cse7) .cse8)) v_arrayElimCell_98)) (not (= (store (store (select .cse32 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|) .cse3 (select v_ArrVal_1281 .cse3)) .cse4 (select v_ArrVal_1281 .cse4)) v_ArrVal_1281))))) .cse0)) (.cse12 (or .cse16 (forall ((v_arrayElimCell_100 Int) (v_ArrVal_1278 (Array Int Int)) (v_ArrVal_1276 (Array Int Int)) (v_ArrVal_1286 (Array Int Int)) (v_ArrVal_1284 (Array Int Int)) (v_ArrVal_1281 (Array Int Int))) (let ((.cse31 (store |c_#memory_int#2| |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1278))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store .cse31 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_1281) .cse5 v_ArrVal_1286) (select (select (store (store .cse6 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_1276) .cse5 v_ArrVal_1284) .cse7) .cse8)) v_arrayElimCell_100)) (not (= (store (store (select .cse31 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|) .cse3 (select v_ArrVal_1281 .cse3)) .cse4 (select v_ArrVal_1281 .cse4)) v_ArrVal_1281))))))) (.cse23 (forall ((v_ArrVal_1278 (Array Int Int)) (v_arrayElimCell_98 Int) (v_ArrVal_1281 (Array Int Int))) (let ((.cse29 (store |c_#memory_int#2| |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1278))) (or (not (= (store (store (select .cse29 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|) .cse3 (select v_ArrVal_1281 .cse3)) .cse4 (select v_ArrVal_1281 .cse4)) v_ArrVal_1281)) (forall ((v_ArrVal_1276 (Array Int Int)) (v_ArrVal_1286 (Array Int Int)) (v_ArrVal_1284 (Array Int Int))) (let ((.cse30 (select (store (store .cse29 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_1281) .cse5 v_ArrVal_1286) (select (select (store (store .cse6 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_1276) .cse5 v_ArrVal_1284) .cse7) .cse8)))) (or (forall ((v_arrayElimCell_100 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse30 v_arrayElimCell_100))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse30 v_arrayElimCell_98))))))))) (.cse13 (= .cse5 .cse7)) (.cse24 (or .cse0 (forall ((v_ArrVal_1278 (Array Int Int)) (v_ArrVal_1276 (Array Int Int)) (v_arrayElimCell_101 Int) (v_ArrVal_1286 (Array Int Int)) (v_ArrVal_1284 (Array Int Int)) (v_arrayElimCell_98 Int) (v_ArrVal_1281 (Array Int Int))) (let ((.cse28 (store |c_#memory_int#2| |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1278))) (let ((.cse27 (select (store (store .cse28 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_1281) .cse5 v_ArrVal_1286) (select (select (store (store .cse6 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_1276) .cse5 v_ArrVal_1284) .cse7) .cse8)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse27 v_arrayElimCell_98)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse27 v_arrayElimCell_101)) (not (= (store (store (select .cse28 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|) .cse3 (select v_ArrVal_1281 .cse3)) .cse4 (select v_ArrVal_1281 .cse4)) v_ArrVal_1281))))))))) (and (or .cse0 (forall ((v_ArrVal_1278 (Array Int Int)) (v_ArrVal_1276 (Array Int Int)) (v_arrayElimCell_101 Int) (v_ArrVal_1286 (Array Int Int)) (v_ArrVal_1284 (Array Int Int)) (v_ArrVal_1281 (Array Int Int))) (let ((.cse2 (store |c_#memory_int#2| |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1278))) (let ((.cse1 (select (store (store .cse2 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_1281) .cse5 v_ArrVal_1286) (select (select (store (store .cse6 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_1276) .cse5 v_ArrVal_1284) .cse7) .cse8)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse1 v_arrayElimCell_101)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse1 |c_ULTIMATE.start_dll_insert_~new_node~0#1.offset|)) (not (= (store (store (select .cse2 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|) .cse3 (select v_ArrVal_1281 .cse3)) .cse4 (select v_ArrVal_1281 .cse4)) v_ArrVal_1281))))))) (or (and (or .cse0 (forall ((v_ArrVal_1278 (Array Int Int)) (v_ArrVal_1276 (Array Int Int)) (v_ArrVal_1286 (Array Int Int)) (v_ArrVal_1284 (Array Int Int)) (v_ArrVal_1281 (Array Int Int))) (let ((.cse9 (store |c_#memory_int#2| |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1278))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store .cse9 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_1281) .cse5 v_ArrVal_1286) (select (select (store (store .cse6 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_1276) .cse5 v_ArrVal_1284) .cse7) .cse8)) |c_ULTIMATE.start_dll_insert_~new_node~0#1.offset|)) (not (= (store (store (select .cse9 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|) .cse3 (select v_ArrVal_1281 .cse3)) .cse4 (select v_ArrVal_1281 .cse4)) v_ArrVal_1281)))))) (forall ((v_ArrVal_1278 (Array Int Int)) (v_ArrVal_1281 (Array Int Int))) (let ((.cse11 (store |c_#memory_int#2| |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1278))) (or (forall ((v_ArrVal_1276 (Array Int Int)) (v_ArrVal_1286 (Array Int Int)) (v_ArrVal_1284 (Array Int Int))) (let ((.cse10 (select (store (store .cse11 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_1281) .cse5 v_ArrVal_1286) (select (select (store (store .cse6 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_1276) .cse5 v_ArrVal_1284) .cse7) .cse8)))) (or (forall ((v_arrayElimCell_100 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse10 v_arrayElimCell_100))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse10 |c_ULTIMATE.start_dll_insert_~new_node~0#1.offset|))))) (not (= (store (store (select .cse11 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|) .cse3 (select v_ArrVal_1281 .cse3)) .cse4 (select v_ArrVal_1281 .cse4)) v_ArrVal_1281))))) .cse12) .cse13) (forall ((v_ArrVal_1278 (Array Int Int)) (v_ArrVal_1281 (Array Int Int))) (let ((.cse15 (store |c_#memory_int#2| |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1278))) (or (forall ((v_ArrVal_1276 (Array Int Int)) (v_arrayElimCell_101 Int) (v_ArrVal_1286 (Array Int Int)) (v_ArrVal_1284 (Array Int Int))) (let ((.cse14 (select (store (store .cse15 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_1281) .cse5 v_ArrVal_1286) (select (select (store (store .cse6 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_1276) .cse5 v_ArrVal_1284) .cse7) .cse8)))) (or (forall ((v_arrayElimCell_100 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse14 v_arrayElimCell_100))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse14 v_arrayElimCell_101)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse14 |c_ULTIMATE.start_dll_insert_~new_node~0#1.offset|))))) (not (= (store (store (select .cse15 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|) .cse3 (select v_ArrVal_1281 .cse3)) .cse4 (select v_ArrVal_1281 .cse4)) v_ArrVal_1281))))) (or .cse16 (forall ((v_arrayElimCell_100 Int) (v_ArrVal_1278 (Array Int Int)) (v_ArrVal_1276 (Array Int Int)) (v_arrayElimCell_101 Int) (v_ArrVal_1286 (Array Int Int)) (v_ArrVal_1284 (Array Int Int)) (v_ArrVal_1281 (Array Int Int))) (let ((.cse18 (store |c_#memory_int#2| |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1278))) (let ((.cse17 (select (store (store .cse18 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_1281) .cse5 v_ArrVal_1286) (select (select (store (store .cse6 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_1276) .cse5 v_ArrVal_1284) .cse7) .cse8)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse17 v_arrayElimCell_101)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse17 v_arrayElimCell_100)) (not (= (store (store (select .cse18 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|) .cse3 (select v_ArrVal_1281 .cse3)) .cse4 (select v_ArrVal_1281 .cse4)) v_ArrVal_1281))))))) (or (= .cse7 |c_ULTIMATE.start_dll_insert_~last~0#1.base|) (let ((.cse21 (select |c_#memory_int#2| |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|))) (and .cse19 (or .cse16 (forall ((v_arrayElimCell_100 Int) (v_ArrVal_1278 (Array Int Int)) (v_ArrVal_1276 (Array Int Int)) (v_arrayElimCell_101 Int) (v_ArrVal_1286 (Array Int Int)) (v_ArrVal_1284 (Array Int Int)) (v_ArrVal_1281 (Array Int Int))) (let ((.cse20 (select (store (store (store |c_#memory_int#2| |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1278) |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_1281) .cse5 v_ArrVal_1286) (select (select (store (store .cse6 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_1276) .cse5 v_ArrVal_1284) .cse7) .cse8)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse20 v_arrayElimCell_101)) (not (= v_ArrVal_1281 (store (store .cse21 .cse3 (select v_ArrVal_1281 .cse3)) .cse4 (select v_ArrVal_1281 .cse4)))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse20 v_arrayElimCell_100)))))) (or (and (or .cse16 (forall ((v_arrayElimCell_100 Int) (v_ArrVal_1278 (Array Int Int)) (v_ArrVal_1276 (Array Int Int)) (v_ArrVal_1286 (Array Int Int)) (v_ArrVal_1284 (Array Int Int)) (v_ArrVal_1281 (Array Int Int))) (or (not (= v_ArrVal_1281 (store (store .cse21 .cse3 (select v_ArrVal_1281 .cse3)) .cse4 (select v_ArrVal_1281 .cse4)))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int#2| |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1278) |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_1281) .cse5 v_ArrVal_1286) (select (select (store (store .cse6 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_1276) .cse5 v_ArrVal_1284) .cse7) .cse8)) v_arrayElimCell_100))))) .cse22 .cse23) .cse13) .cse24))) (or (not .cse13) (forall ((v_ArrVal_1278 (Array Int Int)) (v_ArrVal_1276 (Array Int Int)) (v_arrayElimCell_101 Int) (v_ArrVal_1286 (Array Int Int)) (v_ArrVal_1284 (Array Int Int)) (v_ArrVal_1281 (Array Int Int))) (let ((.cse25 (store |c_#memory_int#2| |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1278))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store .cse25 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_1281) .cse5 v_ArrVal_1286) (select (select (store (store .cse6 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_1276) .cse5 v_ArrVal_1284) .cse7) .cse8)) v_arrayElimCell_101)) (not (= (store (store (select .cse25 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|) .cse3 (select v_ArrVal_1281 .cse3)) .cse4 (select v_ArrVal_1281 .cse4)) v_ArrVal_1281)))))) (or (= .cse26 |c_ULTIMATE.start_dll_insert_~last~0#1.offset|) (and .cse19 (or (and .cse22 .cse12 .cse23) .cse13) .cse24))))))) is different from false [2024-10-11 01:44:11,745 INFO L349 Elim1Store]: treesize reduction 556, result has 35.9 percent of original size [2024-10-11 01:44:11,746 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 3595 treesize of output 3700 [2024-10-11 01:44:11,797 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 01:44:11,798 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 3358 treesize of output 3358 [2024-10-11 01:44:11,852 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 01:44:11,852 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 3859 treesize of output 3723 [2024-10-11 01:44:11,901 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 01:44:11,902 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 3856 treesize of output 3858 [2024-10-11 01:44:13,760 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 01:44:13,760 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 1160 treesize of output 1172 [2024-10-11 01:44:14,123 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 01:44:14,124 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 1258 treesize of output 1272 [2024-10-11 01:44:15,938 INFO L349 Elim1Store]: treesize reduction 417, result has 52.4 percent of original size [2024-10-11 01:44:15,939 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 3595 treesize of output 3847 [2024-10-11 01:44:15,974 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 01:44:15,974 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 3358 treesize of output 3358 [2024-10-11 01:44:16,017 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 01:44:16,018 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 4038 treesize of output 3902 [2024-10-11 01:44:16,065 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 01:44:16,066 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 4258 treesize of output 4252 [2024-10-11 01:44:17,877 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 01:44:17,877 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 742 treesize of output 760