./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/list-simple/sll2c_insert_unequal.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version da043454 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../../../trunk/examples/svcomp/list-simple/sll2c_insert_unequal.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b44481c7fe044c12e334c3847749eeb412a8351ea29169330245383f0a8a46fd --- Real Ultimate output --- This is Ultimate 0.3.0-wip.fs.system-includes-da04345-m [2025-04-29 10:56:01,631 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-29 10:56:01,687 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-04-29 10:56:01,691 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-29 10:56:01,692 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-29 10:56:01,716 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-29 10:56:01,716 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-29 10:56:01,716 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-29 10:56:01,718 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-29 10:56:01,718 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-29 10:56:01,718 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-29 10:56:01,719 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-29 10:56:01,719 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-29 10:56:01,719 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-29 10:56:01,719 INFO L153 SettingsManager]: * Use SBE=true [2025-04-29 10:56:01,719 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-29 10:56:01,719 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-29 10:56:01,719 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-29 10:56:01,720 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-29 10:56:01,720 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-29 10:56:01,720 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-29 10:56:01,720 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-29 10:56:01,720 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-29 10:56:01,720 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-29 10:56:01,720 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-29 10:56:01,720 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-29 10:56:01,720 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-29 10:56:01,720 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-29 10:56:01,720 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-29 10:56:01,721 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-29 10:56:01,721 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-29 10:56:01,721 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-29 10:56:01,721 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 10:56:01,721 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-29 10:56:01,721 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-29 10:56:01,721 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-29 10:56:01,721 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-29 10:56:01,721 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 10:56:01,721 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-29 10:56:01,721 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-29 10:56:01,721 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-29 10:56:01,721 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-29 10:56:01,721 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-29 10:56:01,721 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-29 10:56:01,721 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-29 10:56:01,721 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-29 10:56:01,721 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-29 10:56:01,721 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/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 -> b44481c7fe044c12e334c3847749eeb412a8351ea29169330245383f0a8a46fd [2025-04-29 10:56:01,917 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-29 10:56:01,925 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-29 10:56:01,926 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-29 10:56:01,928 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-29 10:56:01,928 INFO L274 PluginConnector]: CDTParser initialized [2025-04-29 10:56:01,929 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-simple/sll2c_insert_unequal.c [2025-04-29 10:56:03,154 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/738d5c57a/9f4a98f2ca624806b2a24cb2846c1524/FLAG792013878 [2025-04-29 10:56:03,373 INFO L389 CDTParser]: Found 1 translation units. [2025-04-29 10:56:03,373 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-simple/sll2c_insert_unequal.c [2025-04-29 10:56:03,374 WARN L117 ultiparseSymbolTable]: System include assert.h could not be resolved by CDT -- only built-in system includes are available. [2025-04-29 10:56:03,374 WARN L117 ultiparseSymbolTable]: System include stdlib.h could not be resolved by CDT -- only built-in system includes are available. [2025-04-29 10:56:03,382 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/738d5c57a/9f4a98f2ca624806b2a24cb2846c1524/FLAG792013878 [2025-04-29 10:56:04,205 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/738d5c57a/9f4a98f2ca624806b2a24cb2846c1524 [2025-04-29 10:56:04,207 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-29 10:56:04,208 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-04-29 10:56:04,208 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-29 10:56:04,208 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-29 10:56:04,211 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-29 10:56:04,212 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.04 10:56:04" (1/1) ... [2025-04-29 10:56:04,212 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@124db818 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:56:04, skipping insertion in model container [2025-04-29 10:56:04,213 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.04 10:56:04" (1/1) ... [2025-04-29 10:56:04,223 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-29 10:56:04,350 WARN L117 LibraryModelHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/list-simple/sll2c_insert_unequal.c[2100,2113] [2025-04-29 10:56:04,353 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-29 10:56:04,359 INFO L200 MainTranslator]: Completed pre-run [2025-04-29 10:56:04,400 WARN L117 LibraryModelHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/list-simple/sll2c_insert_unequal.c[2100,2113] [2025-04-29 10:56:04,401 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-29 10:56:04,412 INFO L204 MainTranslator]: Completed translation [2025-04-29 10:56:04,413 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:56:04 WrapperNode [2025-04-29 10:56:04,413 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-29 10:56:04,414 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-29 10:56:04,414 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-29 10:56:04,414 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-29 10:56:04,419 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:56:04" (1/1) ... [2025-04-29 10:56:04,428 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:56:04" (1/1) ... [2025-04-29 10:56:04,445 INFO L138 Inliner]: procedures = 18, calls = 44, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 159 [2025-04-29 10:56:04,445 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-29 10:56:04,446 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-29 10:56:04,447 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-29 10:56:04,447 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-29 10:56:04,452 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:56:04" (1/1) ... [2025-04-29 10:56:04,453 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:56:04" (1/1) ... [2025-04-29 10:56:04,455 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:56:04" (1/1) ... [2025-04-29 10:56:04,476 INFO L175 MemorySlicer]: Split 28 memory accesses to 2 slices as follows [18, 10]. 64 percent of accesses are in the largest equivalence class. The 1 initializations are split as follows [0, 1]. The 10 writes are split as follows [9, 1]. [2025-04-29 10:56:04,477 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:56:04" (1/1) ... [2025-04-29 10:56:04,477 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:56:04" (1/1) ... [2025-04-29 10:56:04,482 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:56:04" (1/1) ... [2025-04-29 10:56:04,482 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:56:04" (1/1) ... [2025-04-29 10:56:04,485 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:56:04" (1/1) ... [2025-04-29 10:56:04,487 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:56:04" (1/1) ... [2025-04-29 10:56:04,487 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:56:04" (1/1) ... [2025-04-29 10:56:04,490 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-29 10:56:04,491 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-29 10:56:04,491 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-29 10:56:04,491 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-29 10:56:04,492 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:56:04" (1/1) ... [2025-04-29 10:56:04,496 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 10:56:04,505 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 10:56:04,514 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-29 10:56:04,516 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-29 10:56:04,530 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-04-29 10:56:04,530 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-04-29 10:56:04,530 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-04-29 10:56:04,530 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-04-29 10:56:04,530 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-04-29 10:56:04,530 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-04-29 10:56:04,531 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-04-29 10:56:04,531 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-04-29 10:56:04,531 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-04-29 10:56:04,531 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-04-29 10:56:04,531 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-29 10:56:04,531 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-29 10:56:04,531 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-04-29 10:56:04,531 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-04-29 10:56:04,531 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2025-04-29 10:56:04,531 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2025-04-29 10:56:04,531 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-04-29 10:56:04,593 INFO L234 CfgBuilder]: Building ICFG [2025-04-29 10:56:04,594 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-29 10:56:04,799 INFO L? ?]: Removed 55 outVars from TransFormulas that were not future-live. [2025-04-29 10:56:04,799 INFO L283 CfgBuilder]: Performing block encoding [2025-04-29 10:56:04,806 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-29 10:56:04,806 INFO L312 CfgBuilder]: Removed 2 assume(true) statements. [2025-04-29 10:56:04,806 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 10:56:04 BoogieIcfgContainer [2025-04-29 10:56:04,806 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-29 10:56:04,810 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-29 10:56:04,810 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-29 10:56:04,813 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-29 10:56:04,813 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.04 10:56:04" (1/3) ... [2025-04-29 10:56:04,814 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b8d08c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.04 10:56:04, skipping insertion in model container [2025-04-29 10:56:04,814 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:56:04" (2/3) ... [2025-04-29 10:56:04,814 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b8d08c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.04 10:56:04, skipping insertion in model container [2025-04-29 10:56:04,814 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 10:56:04" (3/3) ... [2025-04-29 10:56:04,815 INFO L128 eAbstractionObserver]: Analyzing ICFG sll2c_insert_unequal.c [2025-04-29 10:56:04,824 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-29 10:56:04,825 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG sll2c_insert_unequal.c that has 2 procedures, 38 locations, 57 edges, 1 initial locations, 5 loop locations, and 1 error locations. [2025-04-29 10:56:04,857 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-29 10:56:04,864 INFO L340 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;@57394af1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-29 10:56:04,865 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-04-29 10:56:04,867 INFO L278 IsEmpty]: Start isEmpty. Operand has 38 states, 32 states have (on average 1.5) internal successors, (48), 33 states have internal predecessors, (48), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-04-29 10:56:04,872 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-04-29 10:56:04,872 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 10:56:04,872 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 10:56:04,873 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-29 10:56:04,876 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 10:56:04,876 INFO L85 PathProgramCache]: Analyzing trace with hash 676978539, now seen corresponding path program 1 times [2025-04-29 10:56:04,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 10:56:04,881 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027967309] [2025-04-29 10:56:04,881 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:56:04,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 10:56:04,952 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-04-29 10:56:04,993 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-04-29 10:56:04,993 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:56:04,993 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:56:05,119 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-04-29 10:56:05,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 10:56:05,122 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2027967309] [2025-04-29 10:56:05,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2027967309] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 10:56:05,122 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 10:56:05,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-29 10:56:05,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1819888810] [2025-04-29 10:56:05,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 10:56:05,126 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 10:56:05,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 10:56:05,139 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 10:56:05,140 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 10:56:05,142 INFO L87 Difference]: Start difference. First operand has 38 states, 32 states have (on average 1.5) internal successors, (48), 33 states have internal predecessors, (48), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-04-29 10:56:05,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 10:56:05,177 INFO L93 Difference]: Finished difference Result 58 states and 85 transitions. [2025-04-29 10:56:05,178 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 10:56:05,179 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 24 [2025-04-29 10:56:05,179 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 10:56:05,183 INFO L225 Difference]: With dead ends: 58 [2025-04-29 10:56:05,183 INFO L226 Difference]: Without dead ends: 33 [2025-04-29 10:56:05,184 INFO L436 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 [2025-04-29 10:56:05,186 INFO L437 NwaCegarLoop]: 50 mSDtfsCounter, 0 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 10:56:05,186 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 95 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 10:56:05,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2025-04-29 10:56:05,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2025-04-29 10:56:05,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 28 states have (on average 1.3571428571428572) internal successors, (38), 28 states have internal predecessors, (38), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-04-29 10:56:05,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 44 transitions. [2025-04-29 10:56:05,208 INFO L79 Accepts]: Start accepts. Automaton has 33 states and 44 transitions. Word has length 24 [2025-04-29 10:56:05,208 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 10:56:05,209 INFO L485 AbstractCegarLoop]: Abstraction has 33 states and 44 transitions. [2025-04-29 10:56:05,209 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-04-29 10:56:05,209 INFO L278 IsEmpty]: Start isEmpty. Operand 33 states and 44 transitions. [2025-04-29 10:56:05,210 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-29 10:56:05,210 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 10:56:05,210 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 10:56:05,210 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-29 10:56:05,210 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-29 10:56:05,211 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 10:56:05,211 INFO L85 PathProgramCache]: Analyzing trace with hash 1935288325, now seen corresponding path program 1 times [2025-04-29 10:56:05,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 10:56:05,211 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1564256645] [2025-04-29 10:56:05,211 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:56:05,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 10:56:05,248 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-29 10:56:05,261 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-29 10:56:05,261 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:56:05,261 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:56:05,359 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-29 10:56:05,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 10:56:05,359 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1564256645] [2025-04-29 10:56:05,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1564256645] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 10:56:05,360 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 10:56:05,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-29 10:56:05,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [191555434] [2025-04-29 10:56:05,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 10:56:05,361 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 10:56:05,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 10:56:05,361 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 10:56:05,361 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 10:56:05,361 INFO L87 Difference]: Start difference. First operand 33 states and 44 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-04-29 10:56:05,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 10:56:05,382 INFO L93 Difference]: Finished difference Result 62 states and 83 transitions. [2025-04-29 10:56:05,382 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 10:56:05,382 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 25 [2025-04-29 10:56:05,383 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 10:56:05,383 INFO L225 Difference]: With dead ends: 62 [2025-04-29 10:56:05,383 INFO L226 Difference]: Without dead ends: 36 [2025-04-29 10:56:05,383 INFO L436 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 [2025-04-29 10:56:05,384 INFO L437 NwaCegarLoop]: 39 mSDtfsCounter, 1 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 10:56:05,384 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 72 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 10:56:05,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2025-04-29 10:56:05,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 34. [2025-04-29 10:56:05,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 29 states have (on average 1.3448275862068966) internal successors, (39), 29 states have internal predecessors, (39), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-04-29 10:56:05,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 45 transitions. [2025-04-29 10:56:05,389 INFO L79 Accepts]: Start accepts. Automaton has 34 states and 45 transitions. Word has length 25 [2025-04-29 10:56:05,389 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 10:56:05,390 INFO L485 AbstractCegarLoop]: Abstraction has 34 states and 45 transitions. [2025-04-29 10:56:05,390 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-04-29 10:56:05,390 INFO L278 IsEmpty]: Start isEmpty. Operand 34 states and 45 transitions. [2025-04-29 10:56:05,390 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-04-29 10:56:05,390 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 10:56:05,390 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 10:56:05,391 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-29 10:56:05,391 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-29 10:56:05,391 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 10:56:05,391 INFO L85 PathProgramCache]: Analyzing trace with hash 942551853, now seen corresponding path program 1 times [2025-04-29 10:56:05,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 10:56:05,391 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1731451935] [2025-04-29 10:56:05,391 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:56:05,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 10:56:05,409 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-04-29 10:56:05,460 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-04-29 10:56:05,463 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:56:05,463 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:56:07,184 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 10:56:07,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 10:56:07,184 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1731451935] [2025-04-29 10:56:07,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1731451935] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 10:56:07,185 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1046932535] [2025-04-29 10:56:07,185 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:56:07,185 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 10:56:07,185 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 10:56:07,187 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 10:56:07,188 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-04-29 10:56:07,256 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-04-29 10:56:07,388 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-04-29 10:56:07,388 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:56:07,388 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:56:07,392 INFO L256 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 105 conjuncts are in the unsatisfiable core [2025-04-29 10:56:07,398 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 10:56:07,471 INFO L354 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 [2025-04-29 10:56:07,696 INFO L354 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 [2025-04-29 10:56:07,704 INFO L354 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 22 treesize of output 1 [2025-04-29 10:56:07,775 INFO L325 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-04-29 10:56:07,776 INFO L354 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 [2025-04-29 10:56:07,831 INFO L354 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 15 treesize of output 1 [2025-04-29 10:56:07,835 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-04-29 10:56:07,904 INFO L354 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 8 treesize of output 1 [2025-04-29 10:56:07,908 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-04-29 10:56:08,093 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-04-29 10:56:08,099 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2025-04-29 10:56:08,300 INFO L325 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2025-04-29 10:56:08,300 INFO L354 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 20 treesize of output 23 [2025-04-29 10:56:08,332 INFO L325 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2025-04-29 10:56:08,333 INFO L354 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 20 treesize of output 22 [2025-04-29 10:56:08,558 INFO L354 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 0 case distinctions, treesize of input 28 treesize of output 30 [2025-04-29 10:56:08,562 INFO L354 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 [2025-04-29 10:56:08,620 INFO L354 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 [2025-04-29 10:56:08,685 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 10:56:08,685 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 10:56:10,367 WARN L849 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_227 (Array Int Int)) (v_ArrVal_229 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#0| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| (store (select |c_#memory_int#0| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset| v_ArrVal_229)) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_227) (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)))) is different from false [2025-04-29 10:56:11,940 WARN L849 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_227 (Array Int Int)) (|ULTIMATE.start_sll_circular_insert_~last~1#1.base| Int) (v_ArrVal_229 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#0| |ULTIMATE.start_sll_circular_insert_~last~1#1.base| (store (select |c_#memory_int#0| |ULTIMATE.start_sll_circular_insert_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_insert_~last~1#1.offset| v_ArrVal_229)) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_227) (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)))) is different from false [2025-04-29 10:56:13,675 WARN L849 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_227 (Array Int Int)) (|ULTIMATE.start_sll_circular_insert_~last~1#1.base| Int) (v_ArrVal_229 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#0| |ULTIMATE.start_sll_circular_insert_~last~1#1.base| (store (select |c_#memory_int#0| |ULTIMATE.start_sll_circular_insert_~last~1#1.base|) (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|) v_ArrVal_229)) |c_ULTIMATE.start_sll_circular_insert_#t~ret6#1.base| v_ArrVal_227) (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)))) is different from false [2025-04-29 10:56:13,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1046932535] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 10:56:13,785 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-04-29 10:56:13,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 43 [2025-04-29 10:56:13,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175297533] [2025-04-29 10:56:13,786 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-04-29 10:56:13,786 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2025-04-29 10:56:13,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 10:56:13,787 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2025-04-29 10:56:13,790 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=1925, Unknown=3, NotChecked=270, Total=2352 [2025-04-29 10:56:13,790 INFO L87 Difference]: Start difference. First operand 34 states and 45 transitions. Second operand has 43 states, 39 states have (on average 1.3333333333333333) internal successors, (52), 34 states have internal predecessors, (52), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-04-29 10:56:14,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 10:56:14,910 INFO L93 Difference]: Finished difference Result 61 states and 79 transitions. [2025-04-29 10:56:14,911 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-04-29 10:56:14,911 INFO L79 Accepts]: Start accepts. Automaton has has 43 states, 39 states have (on average 1.3333333333333333) internal successors, (52), 34 states have internal predecessors, (52), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 33 [2025-04-29 10:56:14,911 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 10:56:14,912 INFO L225 Difference]: With dead ends: 61 [2025-04-29 10:56:14,912 INFO L226 Difference]: Without dead ends: 59 [2025-04-29 10:56:14,913 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 840 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=287, Invalid=3382, Unknown=3, NotChecked=360, Total=4032 [2025-04-29 10:56:14,914 INFO L437 NwaCegarLoop]: 23 mSDtfsCounter, 72 mSDsluCounter, 452 mSDsCounter, 0 mSdLazyCounter, 908 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 475 SdHoareTripleChecker+Invalid, 927 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 908 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-29 10:56:14,914 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 475 Invalid, 927 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 908 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-29 10:56:14,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2025-04-29 10:56:14,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 44. [2025-04-29 10:56:14,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 38 states have (on average 1.3157894736842106) internal successors, (50), 38 states have internal predecessors, (50), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-04-29 10:56:14,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 56 transitions. [2025-04-29 10:56:14,919 INFO L79 Accepts]: Start accepts. Automaton has 44 states and 56 transitions. Word has length 33 [2025-04-29 10:56:14,921 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 10:56:14,921 INFO L485 AbstractCegarLoop]: Abstraction has 44 states and 56 transitions. [2025-04-29 10:56:14,922 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 39 states have (on average 1.3333333333333333) internal successors, (52), 34 states have internal predecessors, (52), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-04-29 10:56:14,923 INFO L278 IsEmpty]: Start isEmpty. Operand 44 states and 56 transitions. [2025-04-29 10:56:14,923 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-04-29 10:56:14,924 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 10:56:14,924 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 10:56:14,933 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-04-29 10:56:15,126 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 10:56:15,126 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-29 10:56:15,126 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 10:56:15,126 INFO L85 PathProgramCache]: Analyzing trace with hash 1578126467, now seen corresponding path program 2 times [2025-04-29 10:56:15,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 10:56:15,127 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [503353702] [2025-04-29 10:56:15,127 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-29 10:56:15,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 10:56:15,143 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 34 statements into 2 equivalence classes. [2025-04-29 10:56:15,155 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 34 of 34 statements. [2025-04-29 10:56:15,155 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-29 10:56:15,155 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:56:15,265 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-04-29 10:56:15,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 10:56:15,265 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [503353702] [2025-04-29 10:56:15,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [503353702] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 10:56:15,265 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [295811403] [2025-04-29 10:56:15,265 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-29 10:56:15,266 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 10:56:15,266 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 10:56:15,267 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 10:56:15,269 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-04-29 10:56:15,327 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 34 statements into 2 equivalence classes. [2025-04-29 10:56:15,359 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 34 of 34 statements. [2025-04-29 10:56:15,359 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-29 10:56:15,359 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:56:15,361 INFO L256 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-04-29 10:56:15,362 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 10:56:15,385 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-04-29 10:56:15,386 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-29 10:56:15,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [295811403] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 10:56:15,386 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-29 10:56:15,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 6 [2025-04-29 10:56:15,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752184637] [2025-04-29 10:56:15,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 10:56:15,386 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-29 10:56:15,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 10:56:15,386 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-29 10:56:15,386 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-04-29 10:56:15,387 INFO L87 Difference]: Start difference. First operand 44 states and 56 transitions. Second operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-04-29 10:56:15,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 10:56:15,411 INFO L93 Difference]: Finished difference Result 60 states and 76 transitions. [2025-04-29 10:56:15,411 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-29 10:56:15,411 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 34 [2025-04-29 10:56:15,412 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 10:56:15,412 INFO L225 Difference]: With dead ends: 60 [2025-04-29 10:56:15,412 INFO L226 Difference]: Without dead ends: 44 [2025-04-29 10:56:15,412 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2025-04-29 10:56:15,413 INFO L437 NwaCegarLoop]: 37 mSDtfsCounter, 24 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 10:56:15,413 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 81 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 10:56:15,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2025-04-29 10:56:15,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 42. [2025-04-29 10:56:15,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 36 states have (on average 1.25) internal successors, (45), 36 states have internal predecessors, (45), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-04-29 10:56:15,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 51 transitions. [2025-04-29 10:56:15,418 INFO L79 Accepts]: Start accepts. Automaton has 42 states and 51 transitions. Word has length 34 [2025-04-29 10:56:15,418 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 10:56:15,418 INFO L485 AbstractCegarLoop]: Abstraction has 42 states and 51 transitions. [2025-04-29 10:56:15,418 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-04-29 10:56:15,418 INFO L278 IsEmpty]: Start isEmpty. Operand 42 states and 51 transitions. [2025-04-29 10:56:15,419 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-04-29 10:56:15,419 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 10:56:15,419 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 10:56:15,425 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-04-29 10:56:15,619 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2025-04-29 10:56:15,620 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-29 10:56:15,620 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 10:56:15,621 INFO L85 PathProgramCache]: Analyzing trace with hash -1314025785, now seen corresponding path program 1 times [2025-04-29 10:56:15,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 10:56:15,621 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085923957] [2025-04-29 10:56:15,621 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:56:15,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 10:56:15,632 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-04-29 10:56:15,639 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-04-29 10:56:15,639 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:56:15,639 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:56:15,694 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-04-29 10:56:15,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 10:56:15,695 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1085923957] [2025-04-29 10:56:15,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1085923957] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 10:56:15,695 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 10:56:15,695 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-29 10:56:15,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399418798] [2025-04-29 10:56:15,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 10:56:15,696 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-29 10:56:15,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 10:56:15,696 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-29 10:56:15,696 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-29 10:56:15,696 INFO L87 Difference]: Start difference. First operand 42 states and 51 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-04-29 10:56:15,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 10:56:15,727 INFO L93 Difference]: Finished difference Result 58 states and 71 transitions. [2025-04-29 10:56:15,727 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-29 10:56:15,727 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 34 [2025-04-29 10:56:15,727 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 10:56:15,728 INFO L225 Difference]: With dead ends: 58 [2025-04-29 10:56:15,728 INFO L226 Difference]: Without dead ends: 43 [2025-04-29 10:56:15,728 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-04-29 10:56:15,728 INFO L437 NwaCegarLoop]: 38 mSDtfsCounter, 24 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 10:56:15,729 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 81 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 10:56:15,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2025-04-29 10:56:15,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 41. [2025-04-29 10:56:15,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 35 states have (on average 1.2285714285714286) internal successors, (43), 35 states have internal predecessors, (43), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-04-29 10:56:15,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 49 transitions. [2025-04-29 10:56:15,736 INFO L79 Accepts]: Start accepts. Automaton has 41 states and 49 transitions. Word has length 34 [2025-04-29 10:56:15,737 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 10:56:15,737 INFO L485 AbstractCegarLoop]: Abstraction has 41 states and 49 transitions. [2025-04-29 10:56:15,737 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-04-29 10:56:15,737 INFO L278 IsEmpty]: Start isEmpty. Operand 41 states and 49 transitions. [2025-04-29 10:56:15,737 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-04-29 10:56:15,737 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 10:56:15,738 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 10:56:15,738 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-29 10:56:15,738 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-29 10:56:15,738 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 10:56:15,738 INFO L85 PathProgramCache]: Analyzing trace with hash 1208918065, now seen corresponding path program 1 times [2025-04-29 10:56:15,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 10:56:15,738 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665021496] [2025-04-29 10:56:15,738 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:56:15,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 10:56:15,752 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-04-29 10:56:15,758 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-04-29 10:56:15,758 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:56:15,758 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:56:15,912 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-04-29 10:56:15,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 10:56:15,912 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1665021496] [2025-04-29 10:56:15,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1665021496] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 10:56:15,912 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [414863153] [2025-04-29 10:56:15,912 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:56:15,912 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 10:56:15,912 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 10:56:15,914 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 10:56:15,915 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-04-29 10:56:15,983 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-04-29 10:56:16,015 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-04-29 10:56:16,015 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:56:16,015 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:56:16,017 INFO L256 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-04-29 10:56:16,019 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 10:56:16,081 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2025-04-29 10:56:16,102 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 11 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-29 10:56:16,102 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 10:56:16,139 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-04-29 10:56:16,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [414863153] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 10:56:16,139 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 10:56:16,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 10] total 14 [2025-04-29 10:56:16,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2102765771] [2025-04-29 10:56:16,139 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 10:56:16,139 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-29 10:56:16,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 10:56:16,140 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-29 10:56:16,140 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2025-04-29 10:56:16,140 INFO L87 Difference]: Start difference. First operand 41 states and 49 transitions. Second operand has 14 states, 14 states have (on average 2.4285714285714284) internal successors, (34), 13 states have internal predecessors, (34), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2025-04-29 10:56:20,156 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-04-29 10:56:24,166 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-04-29 10:56:28,177 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-04-29 10:56:32,289 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-04-29 10:56:32,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 10:56:32,292 INFO L93 Difference]: Finished difference Result 54 states and 67 transitions. [2025-04-29 10:56:32,293 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-04-29 10:56:32,293 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.4285714285714284) internal successors, (34), 13 states have internal predecessors, (34), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) Word has length 35 [2025-04-29 10:56:32,293 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 10:56:32,293 INFO L225 Difference]: With dead ends: 54 [2025-04-29 10:56:32,293 INFO L226 Difference]: Without dead ends: 40 [2025-04-29 10:56:32,295 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 66 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=286, Unknown=0, NotChecked=0, Total=342 [2025-04-29 10:56:32,296 INFO L437 NwaCegarLoop]: 30 mSDtfsCounter, 25 mSDsluCounter, 295 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 0 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 325 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.1s IncrementalHoareTripleChecker+Time [2025-04-29 10:56:32,296 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 325 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 157 Invalid, 4 Unknown, 0 Unchecked, 16.1s Time] [2025-04-29 10:56:32,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2025-04-29 10:56:32,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 38. [2025-04-29 10:56:32,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 32 states have (on average 1.1875) internal successors, (38), 32 states have internal predecessors, (38), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-04-29 10:56:32,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 44 transitions. [2025-04-29 10:56:32,305 INFO L79 Accepts]: Start accepts. Automaton has 38 states and 44 transitions. Word has length 35 [2025-04-29 10:56:32,305 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 10:56:32,305 INFO L485 AbstractCegarLoop]: Abstraction has 38 states and 44 transitions. [2025-04-29 10:56:32,305 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.4285714285714284) internal successors, (34), 13 states have internal predecessors, (34), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2025-04-29 10:56:32,305 INFO L278 IsEmpty]: Start isEmpty. Operand 38 states and 44 transitions. [2025-04-29 10:56:32,306 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-04-29 10:56:32,306 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 10:56:32,306 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 10:56:32,314 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-04-29 10:56:32,506 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 10:56:32,506 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-29 10:56:32,507 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 10:56:32,507 INFO L85 PathProgramCache]: Analyzing trace with hash -933531162, now seen corresponding path program 1 times [2025-04-29 10:56:32,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 10:56:32,507 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [565538120] [2025-04-29 10:56:32,507 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:56:32,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 10:56:32,520 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-04-29 10:56:32,535 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-04-29 10:56:32,535 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:56:32,535 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:56:32,701 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-04-29 10:56:32,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 10:56:32,701 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [565538120] [2025-04-29 10:56:32,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [565538120] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 10:56:32,701 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [108036251] [2025-04-29 10:56:32,701 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:56:32,701 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 10:56:32,702 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 10:56:32,703 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 10:56:32,705 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-04-29 10:56:32,782 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-04-29 10:56:32,811 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-04-29 10:56:32,812 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:56:32,812 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:56:32,813 INFO L256 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-04-29 10:56:32,815 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 10:56:32,846 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-04-29 10:56:32,846 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 10:56:32,903 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-04-29 10:56:32,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [108036251] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 10:56:32,903 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 10:56:32,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 14 [2025-04-29 10:56:32,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321421720] [2025-04-29 10:56:32,904 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 10:56:32,904 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-29 10:56:32,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 10:56:32,904 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-29 10:56:32,904 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2025-04-29 10:56:32,905 INFO L87 Difference]: Start difference. First operand 38 states and 44 transitions. Second operand has 14 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 14 states have internal predecessors, (39), 5 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2025-04-29 10:56:32,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 10:56:32,989 INFO L93 Difference]: Finished difference Result 51 states and 60 transitions. [2025-04-29 10:56:32,990 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-29 10:56:32,990 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 14 states have internal predecessors, (39), 5 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) Word has length 36 [2025-04-29 10:56:32,990 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 10:56:32,990 INFO L225 Difference]: With dead ends: 51 [2025-04-29 10:56:32,990 INFO L226 Difference]: Without dead ends: 40 [2025-04-29 10:56:32,991 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=83, Invalid=259, Unknown=0, NotChecked=0, Total=342 [2025-04-29 10:56:32,991 INFO L437 NwaCegarLoop]: 27 mSDtfsCounter, 23 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 10:56:32,991 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 151 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 10:56:32,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2025-04-29 10:56:32,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 36. [2025-04-29 10:56:32,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 30 states have (on average 1.1333333333333333) internal successors, (34), 30 states have internal predecessors, (34), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-04-29 10:56:32,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 40 transitions. [2025-04-29 10:56:32,996 INFO L79 Accepts]: Start accepts. Automaton has 36 states and 40 transitions. Word has length 36 [2025-04-29 10:56:32,996 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 10:56:32,996 INFO L485 AbstractCegarLoop]: Abstraction has 36 states and 40 transitions. [2025-04-29 10:56:32,996 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 14 states have internal predecessors, (39), 5 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2025-04-29 10:56:32,996 INFO L278 IsEmpty]: Start isEmpty. Operand 36 states and 40 transitions. [2025-04-29 10:56:32,996 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-04-29 10:56:32,996 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 10:56:32,997 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 10:56:33,003 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-04-29 10:56:33,197 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 10:56:33,198 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-29 10:56:33,198 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 10:56:33,198 INFO L85 PathProgramCache]: Analyzing trace with hash -933456700, now seen corresponding path program 1 times [2025-04-29 10:56:33,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 10:56:33,198 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400589274] [2025-04-29 10:56:33,198 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:56:33,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 10:56:33,208 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-04-29 10:56:33,220 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-04-29 10:56:33,220 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:56:33,220 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:56:33,875 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 11 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-29 10:56:33,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 10:56:33,876 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1400589274] [2025-04-29 10:56:33,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1400589274] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 10:56:33,876 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1855328296] [2025-04-29 10:56:33,876 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:56:33,876 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 10:56:33,876 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 10:56:33,878 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 10:56:33,880 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-04-29 10:56:33,955 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-04-29 10:56:34,032 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-04-29 10:56:34,032 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:56:34,032 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:56:34,034 INFO L256 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 93 conjuncts are in the unsatisfiable core [2025-04-29 10:56:34,037 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 10:56:34,061 INFO L354 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 [2025-04-29 10:56:34,218 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2025-04-29 10:56:34,297 INFO L354 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 [2025-04-29 10:56:34,378 INFO L325 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2025-04-29 10:56:34,379 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2025-04-29 10:56:34,605 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-29 10:56:34,613 INFO L354 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 30 treesize of output 27 [2025-04-29 10:56:34,623 INFO L354 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 [2025-04-29 10:56:34,627 INFO L354 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 [2025-04-29 10:56:34,648 INFO L325 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2025-04-29 10:56:34,648 INFO L354 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 93 treesize of output 62 [2025-04-29 10:56:34,655 INFO L354 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 36 treesize of output 15 [2025-04-29 10:56:34,660 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 19 [2025-04-29 10:56:34,719 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 30 [2025-04-29 10:56:34,809 INFO L354 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 [2025-04-29 10:56:34,812 INFO L354 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 [2025-04-29 10:56:34,827 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-04-29 10:56:34,829 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 11 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-29 10:56:34,829 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 10:56:34,934 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 10:56:34,934 INFO L354 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 69 treesize of output 70 [2025-04-29 10:56:34,944 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 10:56:34,944 INFO L354 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 136 treesize of output 139 [2025-04-29 10:56:34,951 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 10:56:34,951 INFO L354 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 116 treesize of output 108 [2025-04-29 10:56:34,956 INFO L354 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 52 treesize of output 46 [2025-04-29 10:56:34,972 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 10:56:34,972 INFO L354 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 190 treesize of output 181 [2025-04-29 10:56:34,979 INFO L354 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 37 treesize of output 31 [2025-04-29 10:56:35,210 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse9 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (+ 4 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)) (.cse1 (= .cse9 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|))) (let ((.cse2 (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset|)) (.cse3 (and (forall ((v_ArrVal_797 Int) (v_arrayElimCell_30 Int) (v_ArrVal_801 (Array Int Int)) (v_arrayElimCell_29 Int) (v_arrayElimCell_32 Int)) (let ((.cse14 (store |c_#memory_int#0| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_801))) (let ((.cse15 (store (select .cse14 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| v_ArrVal_797))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store .cse14 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| .cse15) v_arrayElimCell_29) (+ 4 v_arrayElimCell_32))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse15 (+ 4 v_arrayElimCell_30))))))) (or (forall ((v_ArrVal_797 Int) (v_ArrVal_801 (Array Int Int)) (v_arrayElimCell_30 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (store (select (store |c_#memory_int#0| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_801) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| v_ArrVal_797) (+ 4 v_arrayElimCell_30)))) .cse1))) (.cse7 (and (or (forall ((v_ArrVal_797 Int) (v_ArrVal_801 (Array Int Int)) (v_arrayElimCell_30 Int) (v_arrayElimCell_27 Int)) (= (select (select (let ((.cse10 (store |c_#memory_int#0| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_801))) (store .cse10 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| (store (select .cse10 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| v_ArrVal_797))) v_arrayElimCell_27) (+ 4 v_arrayElimCell_30)) |c_ULTIMATE.start_main_~uneq~0#1|)) .cse1) (forall ((v_ArrVal_797 Int) (v_ArrVal_801 (Array Int Int)) (v_arrayElimCell_29 Int) (v_arrayElimCell_27 Int) (v_arrayElimCell_32 Int)) (let ((.cse11 (store |c_#memory_int#0| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_801))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store .cse11 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| (store (select .cse11 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| v_ArrVal_797)) v_arrayElimCell_29) (+ 4 v_arrayElimCell_32))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse11 v_arrayElimCell_27) .cse0))))) (forall ((v_ArrVal_797 Int) (v_arrayElimCell_30 Int) (v_ArrVal_801 (Array Int Int)) (v_arrayElimCell_29 Int) (v_arrayElimCell_27 Int) (v_arrayElimCell_32 Int)) (let ((.cse12 (let ((.cse13 (store |c_#memory_int#0| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_801))) (store .cse13 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| (store (select .cse13 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| v_ArrVal_797))))) (or (= (select (select .cse12 v_arrayElimCell_27) (+ 4 v_arrayElimCell_30)) |c_ULTIMATE.start_main_~uneq~0#1|) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse12 v_arrayElimCell_29) (+ 4 v_arrayElimCell_32)))))) (or .cse1 (forall ((v_ArrVal_801 (Array Int Int)) (v_arrayElimCell_27 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store |c_#memory_int#0| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_801) v_arrayElimCell_27) .cse0)))))) (.cse8 (= |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| .cse9))) (and (or (forall ((v_ArrVal_801 (Array Int Int))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store |c_#memory_int#0| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_801) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) .cse0))) .cse1) (or .cse2 .cse3) (forall ((v_ArrVal_797 Int) (v_ArrVal_801 (Array Int Int)) (v_arrayElimCell_29 Int) (v_arrayElimCell_32 Int)) (let ((.cse4 (store |c_#memory_int#0| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_801))) (let ((.cse5 (select .cse4 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store .cse4 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| (store .cse5 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| v_ArrVal_797)) v_arrayElimCell_29) (+ 4 v_arrayElimCell_32))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse5 .cse0)))))) (or (forall ((v_ArrVal_797 Int) (v_ArrVal_801 (Array Int Int)) (v_arrayElimCell_29 Int) (v_arrayElimCell_32 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (let ((.cse6 (store |c_#memory_int#0| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_801))) (store .cse6 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| (store (select .cse6 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| v_ArrVal_797))) v_arrayElimCell_29) (+ 4 v_arrayElimCell_32)))) (not .cse1)) (or .cse7 .cse2) (or .cse8 .cse3) (or .cse7 .cse8))))) is different from false [2025-04-29 10:56:35,450 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse15 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse2 (+ 4 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)) (.cse6 (= .cse15 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|))) (let ((.cse4 (= .cse15 |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base|)) (.cse7 (and (forall ((v_ArrVal_797 Int) (v_ArrVal_801 (Array Int Int)) (v_arrayElimCell_29 Int) (v_arrayElimCell_27 Int) (v_arrayElimCell_32 Int)) (let ((.cse11 (store |c_#memory_int#0| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base| v_ArrVal_801))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store .cse11 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| (store (select .cse11 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| v_ArrVal_797)) v_arrayElimCell_29) (+ 4 v_arrayElimCell_32))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse11 v_arrayElimCell_27) .cse2))))) (forall ((v_ArrVal_797 Int) (v_arrayElimCell_30 Int) (v_ArrVal_801 (Array Int Int)) (v_arrayElimCell_29 Int) (v_arrayElimCell_27 Int) (v_arrayElimCell_32 Int)) (let ((.cse12 (let ((.cse13 (store |c_#memory_int#0| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base| v_ArrVal_801))) (store .cse13 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| (store (select .cse13 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| v_ArrVal_797))))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse12 v_arrayElimCell_29) (+ 4 v_arrayElimCell_32))) (= (select (select .cse12 v_arrayElimCell_27) (+ 4 v_arrayElimCell_30)) |c_ULTIMATE.start_main_~uneq~0#1|)))) (or (forall ((v_ArrVal_801 (Array Int Int)) (v_arrayElimCell_27 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store |c_#memory_int#0| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base| v_ArrVal_801) v_arrayElimCell_27) .cse2))) .cse6) (or (forall ((v_ArrVal_797 Int) (v_ArrVal_801 (Array Int Int)) (v_arrayElimCell_30 Int) (v_arrayElimCell_27 Int)) (= (select (select (let ((.cse14 (store |c_#memory_int#0| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base| v_ArrVal_801))) (store .cse14 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| (store (select .cse14 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| v_ArrVal_797))) v_arrayElimCell_27) (+ 4 v_arrayElimCell_30)) |c_ULTIMATE.start_main_~uneq~0#1|)) .cse6))) (.cse3 (and (or .cse6 (forall ((v_ArrVal_797 Int) (v_ArrVal_801 (Array Int Int)) (v_arrayElimCell_30 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (store (select (store |c_#memory_int#0| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base| v_ArrVal_801) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| v_ArrVal_797) (+ 4 v_arrayElimCell_30))))) (forall ((v_ArrVal_797 Int) (v_arrayElimCell_30 Int) (v_ArrVal_801 (Array Int Int)) (v_arrayElimCell_29 Int) (v_arrayElimCell_32 Int)) (let ((.cse9 (store |c_#memory_int#0| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base| v_ArrVal_801))) (let ((.cse10 (store (select .cse9 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| v_ArrVal_797))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store .cse9 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| .cse10) v_arrayElimCell_29) (+ 4 v_arrayElimCell_32))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse10 (+ 4 v_arrayElimCell_30))))))))) (.cse8 (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) |c_ULTIMATE.start_sll_circular_insert_~last~1#1.offset|))) (and (forall ((v_ArrVal_797 Int) (v_ArrVal_801 (Array Int Int)) (v_arrayElimCell_29 Int) (v_arrayElimCell_32 Int)) (let ((.cse0 (store |c_#memory_int#0| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base| v_ArrVal_801))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store .cse0 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| (store .cse1 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| v_ArrVal_797)) v_arrayElimCell_29) (+ 4 v_arrayElimCell_32))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse1 .cse2)))))) (or .cse3 .cse4) (or (forall ((v_ArrVal_797 Int) (v_ArrVal_801 (Array Int Int)) (v_arrayElimCell_29 Int) (v_arrayElimCell_32 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (let ((.cse5 (store |c_#memory_int#0| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base| v_ArrVal_801))) (store .cse5 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| (store (select .cse5 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| v_ArrVal_797))) v_arrayElimCell_29) (+ 4 v_arrayElimCell_32)))) (not .cse6)) (or .cse6 (forall ((v_ArrVal_801 (Array Int Int))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store |c_#memory_int#0| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base| v_ArrVal_801) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) .cse2)))) (or .cse4 .cse7) (or .cse8 .cse7) (or .cse3 .cse8))))) is different from false [2025-04-29 10:56:35,581 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse12 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse4 (= |c_ULTIMATE.start_sll_circular_insert_#t~ret6#1.base| .cse12)) (.cse2 (+ 4 |c_ULTIMATE.start_sll_circular_insert_#t~ret6#1.offset|)) (.cse3 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse5 (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (.cse6 (and (or (forall ((v_ArrVal_801 (Array Int Int)) (v_arrayElimCell_27 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store |c_#memory_int#0| .cse3 v_ArrVal_801) v_arrayElimCell_27) .cse2))) .cse4) (forall ((v_ArrVal_797 Int) (v_arrayElimCell_30 Int) (v_ArrVal_801 (Array Int Int)) (v_arrayElimCell_29 Int) (v_arrayElimCell_27 Int) (v_arrayElimCell_32 Int)) (let ((.cse13 (let ((.cse14 (store |c_#memory_int#0| .cse3 v_ArrVal_801))) (store .cse14 |c_ULTIMATE.start_sll_circular_insert_#t~ret6#1.base| (store (select .cse14 |c_ULTIMATE.start_sll_circular_insert_#t~ret6#1.base|) |c_ULTIMATE.start_sll_circular_insert_#t~ret6#1.offset| v_ArrVal_797))))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse13 v_arrayElimCell_29) (+ 4 v_arrayElimCell_32))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse13 v_arrayElimCell_27) (+ 4 v_arrayElimCell_30)))))) (or (forall ((v_ArrVal_797 Int) (v_ArrVal_801 (Array Int Int)) (v_arrayElimCell_30 Int) (v_arrayElimCell_27 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (let ((.cse15 (store |c_#memory_int#0| .cse3 v_ArrVal_801))) (store .cse15 |c_ULTIMATE.start_sll_circular_insert_#t~ret6#1.base| (store (select .cse15 |c_ULTIMATE.start_sll_circular_insert_#t~ret6#1.base|) |c_ULTIMATE.start_sll_circular_insert_#t~ret6#1.offset| v_ArrVal_797))) v_arrayElimCell_27) (+ 4 v_arrayElimCell_30)))) .cse4) (forall ((v_ArrVal_797 Int) (v_ArrVal_801 (Array Int Int)) (v_arrayElimCell_29 Int) (v_arrayElimCell_27 Int) (v_arrayElimCell_32 Int)) (let ((.cse16 (store |c_#memory_int#0| .cse3 v_ArrVal_801))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store .cse16 |c_ULTIMATE.start_sll_circular_insert_#t~ret6#1.base| (store (select .cse16 |c_ULTIMATE.start_sll_circular_insert_#t~ret6#1.base|) |c_ULTIMATE.start_sll_circular_insert_#t~ret6#1.offset| v_ArrVal_797)) v_arrayElimCell_29) (+ 4 v_arrayElimCell_32))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse16 v_arrayElimCell_27) .cse2))))))) (.cse9 (= .cse12 .cse3)) (.cse7 (and (forall ((v_ArrVal_797 Int) (v_arrayElimCell_30 Int) (v_ArrVal_801 (Array Int Int)) (v_arrayElimCell_29 Int) (v_arrayElimCell_32 Int)) (let ((.cse10 (store |c_#memory_int#0| .cse3 v_ArrVal_801))) (let ((.cse11 (store (select .cse10 |c_ULTIMATE.start_sll_circular_insert_#t~ret6#1.base|) |c_ULTIMATE.start_sll_circular_insert_#t~ret6#1.offset| v_ArrVal_797))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store .cse10 |c_ULTIMATE.start_sll_circular_insert_#t~ret6#1.base| .cse11) v_arrayElimCell_29) (+ 4 v_arrayElimCell_32))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse11 (+ 4 v_arrayElimCell_30))))))) (or (forall ((v_ArrVal_797 Int) (v_ArrVal_801 (Array Int Int)) (v_arrayElimCell_30 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (store (select (store |c_#memory_int#0| .cse3 v_ArrVal_801) |c_ULTIMATE.start_sll_circular_insert_#t~ret6#1.base|) |c_ULTIMATE.start_sll_circular_insert_#t~ret6#1.offset| v_ArrVal_797) (+ 4 v_arrayElimCell_30)))) .cse4)))) (and (forall ((v_ArrVal_797 Int) (v_ArrVal_801 (Array Int Int)) (v_arrayElimCell_29 Int) (v_arrayElimCell_32 Int)) (let ((.cse0 (store |c_#memory_int#0| .cse3 v_ArrVal_801))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_sll_circular_insert_#t~ret6#1.base|))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store .cse0 |c_ULTIMATE.start_sll_circular_insert_#t~ret6#1.base| (store .cse1 |c_ULTIMATE.start_sll_circular_insert_#t~ret6#1.offset| v_ArrVal_797)) v_arrayElimCell_29) (+ 4 v_arrayElimCell_32))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse1 .cse2)))))) (or .cse4 (forall ((v_ArrVal_801 (Array Int Int))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store |c_#memory_int#0| .cse3 v_ArrVal_801) |c_ULTIMATE.start_sll_circular_insert_#t~ret6#1.base|) .cse2)))) (or .cse5 .cse6) (or .cse7 .cse5) (or (not .cse4) (forall ((v_ArrVal_797 Int) (v_ArrVal_801 (Array Int Int)) (v_arrayElimCell_29 Int) (v_arrayElimCell_32 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (let ((.cse8 (store |c_#memory_int#0| .cse3 v_ArrVal_801))) (store .cse8 |c_ULTIMATE.start_sll_circular_insert_#t~ret6#1.base| (store (select .cse8 |c_ULTIMATE.start_sll_circular_insert_#t~ret6#1.base|) |c_ULTIMATE.start_sll_circular_insert_#t~ret6#1.offset| v_ArrVal_797))) v_arrayElimCell_29) (+ 4 v_arrayElimCell_32))))) (or .cse9 .cse6) (or .cse9 .cse7))))) is different from false [2025-04-29 10:56:38,433 INFO L325 Elim1Store]: treesize reduction 204, result has 82.7 percent of original size [2025-04-29 10:56:38,434 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 12 select indices, 12 select index equivalence classes, 0 disjoint index pairs (out of 66 index pairs), introduced 13 new quantified variables, introduced 79 case distinctions, treesize of input 2185 treesize of output 2728 [2025-04-29 10:56:39,989 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 10:56:39,990 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 17 select indices, 17 select index equivalence classes, 0 disjoint index pairs (out of 136 index pairs), introduced 17 new quantified variables, introduced 136 case distinctions, treesize of input 2260 treesize of output 3254 [2025-04-29 10:56:40,417 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 10:56:40,418 INFO L354 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 1999 treesize of output 1984 [2025-04-29 10:56:40,840 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 10:56:40,840 INFO L354 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 2003 treesize of output 1998 [2025-04-29 10:56:41,195 INFO L354 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 1989 treesize of output 1987 [2025-04-29 10:56:41,552 INFO L354 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 2015 treesize of output 2003 [2025-04-29 10:56:41,976 INFO L354 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 2031 treesize of output 2019 [2025-04-29 10:56:42,370 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 10:56:42,370 INFO L354 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 2047 treesize of output 2042 [2025-04-29 10:56:42,725 INFO L354 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 2033 treesize of output 2031 [2025-04-29 10:56:43,101 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 10:56:43,102 INFO L354 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 2073 treesize of output 2066 [2025-04-29 10:56:43,452 INFO L354 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 2071 treesize of output 2067 [2025-04-29 10:56:43,836 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 10:56:43,837 INFO L354 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 2123 treesize of output 2108 [2025-04-29 10:56:44,190 INFO L354 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 2099 treesize of output 2097 [2025-04-29 10:56:44,581 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 10:56:44,581 INFO L354 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 2125 treesize of output 2120 [2025-04-29 10:56:44,961 INFO L354 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 2139 treesize of output 2127 [2025-04-29 10:56:45,369 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 10:56:45,369 INFO L354 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 2169 treesize of output 2162 [2025-04-29 10:56:45,750 INFO L354 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 2167 treesize of output 2163 Killed by 15