./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/heap-manipulation/bubble_sort_linux-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/heap-manipulation/bubble_sort_linux-1.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 a38de44f112a10364737c35b840e673503a211a020b9f494a50e4a32c8fe31c0 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 02:40:25,413 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 02:40:25,464 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 02:40:25,468 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 02:40:25,468 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 02:40:25,484 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 02:40:25,484 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 02:40:25,485 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 02:40:25,485 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 02:40:25,485 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 02:40:25,485 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 02:40:25,485 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 02:40:25,486 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 02:40:25,486 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 02:40:25,486 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 02:40:25,486 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 02:40:25,486 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 02:40:25,486 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 02:40:25,486 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 02:40:25,486 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 02:40:25,486 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 02:40:25,486 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 02:40:25,486 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 02:40:25,486 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 02:40:25,486 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 02:40:25,486 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 02:40:25,486 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 02:40:25,486 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 02:40:25,486 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 02:40:25,486 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 02:40:25,487 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 02:40:25,487 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 02:40:25,487 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 02:40:25,487 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 02:40:25,487 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 02:40:25,487 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 02:40:25,487 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 02:40:25,487 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 02:40:25,487 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 02:40:25,487 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 02:40:25,487 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 02:40:25,487 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 02:40:25,487 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 02:40:25,487 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 02:40:25,487 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 02:40:25,487 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 02:40:25,489 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 02:40:25,489 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 02:40:25,489 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-jdk21/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 -> a38de44f112a10364737c35b840e673503a211a020b9f494a50e4a32c8fe31c0 [2025-01-09 02:40:25,768 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 02:40:25,776 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 02:40:25,778 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 02:40:25,779 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 02:40:25,779 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 02:40:25,781 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/heap-manipulation/bubble_sort_linux-1.i [2025-01-09 02:40:26,993 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c61872e17/effff1c19f0746469674fc3baddeff4e/FLAG5cb368eb6 [2025-01-09 02:40:27,249 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 02:40:27,249 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/heap-manipulation/bubble_sort_linux-1.i [2025-01-09 02:40:27,268 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c61872e17/effff1c19f0746469674fc3baddeff4e/FLAG5cb368eb6 [2025-01-09 02:40:27,546 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c61872e17/effff1c19f0746469674fc3baddeff4e [2025-01-09 02:40:27,548 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 02:40:27,549 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 02:40:27,550 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 02:40:27,550 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 02:40:27,556 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 02:40:27,556 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 02:40:27" (1/1) ... [2025-01-09 02:40:27,558 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3f220eb8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:40:27, skipping insertion in model container [2025-01-09 02:40:27,558 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 02:40:27" (1/1) ... [2025-01-09 02:40:27,588 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 02:40:27,818 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/heap-manipulation/bubble_sort_linux-1.i[33822,33835] [2025-01-09 02:40:27,854 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 02:40:27,862 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 02:40:27,897 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/heap-manipulation/bubble_sort_linux-1.i[33822,33835] [2025-01-09 02:40:27,916 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 02:40:27,952 INFO L204 MainTranslator]: Completed translation [2025-01-09 02:40:27,954 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:40:27 WrapperNode [2025-01-09 02:40:27,955 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 02:40:27,958 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 02:40:27,958 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 02:40:27,958 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 02:40:27,964 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:40:27" (1/1) ... [2025-01-09 02:40:27,976 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:40:27" (1/1) ... [2025-01-09 02:40:27,997 INFO L138 Inliner]: procedures = 232, calls = 75, calls flagged for inlining = 10, calls inlined = 10, statements flattened = 114 [2025-01-09 02:40:27,998 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 02:40:27,998 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 02:40:27,998 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 02:40:27,998 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 02:40:28,005 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:40:27" (1/1) ... [2025-01-09 02:40:28,005 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:40:27" (1/1) ... [2025-01-09 02:40:28,008 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:40:27" (1/1) ... [2025-01-09 02:40:28,028 INFO L175 MemorySlicer]: Split 37 memory accesses to 2 slices as follows [2, 35]. 95 percent of accesses are in the largest equivalence class. The 4 initializations are split as follows [2, 2]. The 10 writes are split as follows [0, 10]. [2025-01-09 02:40:28,028 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:40:27" (1/1) ... [2025-01-09 02:40:28,028 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:40:27" (1/1) ... [2025-01-09 02:40:28,035 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:40:27" (1/1) ... [2025-01-09 02:40:28,035 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:40:27" (1/1) ... [2025-01-09 02:40:28,039 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:40:27" (1/1) ... [2025-01-09 02:40:28,040 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:40:27" (1/1) ... [2025-01-09 02:40:28,041 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:40:27" (1/1) ... [2025-01-09 02:40:28,043 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 02:40:28,046 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 02:40:28,046 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 02:40:28,046 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 02:40:28,047 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:40:27" (1/1) ... [2025-01-09 02:40:28,051 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 02:40:28,061 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 02:40:28,071 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 02:40:28,073 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 02:40:28,088 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-01-09 02:40:28,089 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-01-09 02:40:28,089 INFO L130 BoogieDeclarations]: Found specification of procedure inspect [2025-01-09 02:40:28,089 INFO L138 BoogieDeclarations]: Found implementation of procedure inspect [2025-01-09 02:40:28,089 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-09 02:40:28,089 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-01-09 02:40:28,089 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-01-09 02:40:28,089 INFO L130 BoogieDeclarations]: Found specification of procedure val_from_node [2025-01-09 02:40:28,089 INFO L138 BoogieDeclarations]: Found implementation of procedure val_from_node [2025-01-09 02:40:28,089 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-09 02:40:28,089 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-09 02:40:28,089 INFO L130 BoogieDeclarations]: Found specification of procedure fail [2025-01-09 02:40:28,089 INFO L138 BoogieDeclarations]: Found implementation of procedure fail [2025-01-09 02:40:28,089 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-09 02:40:28,089 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-09 02:40:28,089 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-09 02:40:28,089 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 02:40:28,089 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-01-09 02:40:28,089 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-01-09 02:40:28,089 INFO L130 BoogieDeclarations]: Found specification of procedure list_add [2025-01-09 02:40:28,089 INFO L138 BoogieDeclarations]: Found implementation of procedure list_add [2025-01-09 02:40:28,089 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 02:40:28,089 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-09 02:40:28,089 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 02:40:28,090 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 02:40:28,231 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 02:40:28,232 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 02:40:28,521 INFO L? ?]: Removed 67 outVars from TransFormulas that were not future-live. [2025-01-09 02:40:28,521 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 02:40:28,532 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 02:40:28,533 INFO L312 CfgBuilder]: Removed 22 assume(true) statements. [2025-01-09 02:40:28,533 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:40:28 BoogieIcfgContainer [2025-01-09 02:40:28,533 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 02:40:28,535 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 02:40:28,535 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 02:40:28,542 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 02:40:28,542 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 02:40:27" (1/3) ... [2025-01-09 02:40:28,543 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@647de768 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 02:40:28, skipping insertion in model container [2025-01-09 02:40:28,543 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:40:27" (2/3) ... [2025-01-09 02:40:28,544 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@647de768 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 02:40:28, skipping insertion in model container [2025-01-09 02:40:28,545 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:40:28" (3/3) ... [2025-01-09 02:40:28,546 INFO L128 eAbstractionObserver]: Analyzing ICFG bubble_sort_linux-1.i [2025-01-09 02:40:28,558 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 02:40:28,559 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG bubble_sort_linux-1.i that has 5 procedures, 117 locations, 1 initial locations, 23 loop locations, and 1 error locations. [2025-01-09 02:40:28,601 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 02:40:28,608 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@1af6e4cf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 02:40:28,609 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 02:40:28,612 INFO L276 IsEmpty]: Start isEmpty. Operand has 117 states, 88 states have (on average 1.7386363636363635) internal successors, (153), 107 states have internal predecessors, (153), 23 states have call successors, (23), 4 states have call predecessors, (23), 4 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-01-09 02:40:28,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-01-09 02:40:28,615 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:40:28,616 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 02:40:28,616 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 02:40:28,619 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:40:28,619 INFO L85 PathProgramCache]: Analyzing trace with hash -138897241, now seen corresponding path program 1 times [2025-01-09 02:40:28,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:40:28,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464745730] [2025-01-09 02:40:28,625 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:40:28,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:40:28,684 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-09 02:40:28,690 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-09 02:40:28,691 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:40:28,691 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:40:28,751 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 02:40:28,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 02:40:28,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [464745730] [2025-01-09 02:40:28,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [464745730] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 02:40:28,753 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 02:40:28,753 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 02:40:28,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870253166] [2025-01-09 02:40:28,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 02:40:28,757 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 02:40:28,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 02:40:28,771 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 02:40:28,771 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 02:40:28,774 INFO L87 Difference]: Start difference. First operand has 117 states, 88 states have (on average 1.7386363636363635) internal successors, (153), 107 states have internal predecessors, (153), 23 states have call successors, (23), 4 states have call predecessors, (23), 4 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 02:40:28,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 02:40:28,805 INFO L93 Difference]: Finished difference Result 228 states and 393 transitions. [2025-01-09 02:40:28,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 02:40:28,807 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2025-01-09 02:40:28,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 02:40:28,811 INFO L225 Difference]: With dead ends: 228 [2025-01-09 02:40:28,811 INFO L226 Difference]: Without dead ends: 105 [2025-01-09 02:40:28,814 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 02:40:28,816 INFO L435 NwaCegarLoop]: 135 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 02:40:28,816 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 02:40:28,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2025-01-09 02:40:28,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2025-01-09 02:40:28,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 80 states have (on average 1.25) internal successors, (100), 95 states have internal predecessors, (100), 21 states have call successors, (21), 4 states have call predecessors, (21), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-01-09 02:40:28,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 126 transitions. [2025-01-09 02:40:28,847 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 126 transitions. Word has length 9 [2025-01-09 02:40:28,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 02:40:28,847 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 126 transitions. [2025-01-09 02:40:28,847 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 02:40:28,847 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 126 transitions. [2025-01-09 02:40:28,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-01-09 02:40:28,851 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:40:28,851 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 02:40:28,851 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 02:40:28,852 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 02:40:28,852 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:40:28,852 INFO L85 PathProgramCache]: Analyzing trace with hash 1833152115, now seen corresponding path program 1 times [2025-01-09 02:40:28,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:40:28,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841771857] [2025-01-09 02:40:28,852 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:40:28,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:40:28,887 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-01-09 02:40:28,931 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-01-09 02:40:28,931 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:40:28,931 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:40:29,160 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 02:40:29,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 02:40:29,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [841771857] [2025-01-09 02:40:29,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [841771857] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 02:40:29,161 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 02:40:29,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 02:40:29,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58769373] [2025-01-09 02:40:29,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 02:40:29,162 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 02:40:29,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 02:40:29,162 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 02:40:29,162 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 02:40:29,163 INFO L87 Difference]: Start difference. First operand 105 states and 126 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 02:40:29,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 02:40:29,310 INFO L93 Difference]: Finished difference Result 107 states and 127 transitions. [2025-01-09 02:40:29,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 02:40:29,310 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2025-01-09 02:40:29,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 02:40:29,311 INFO L225 Difference]: With dead ends: 107 [2025-01-09 02:40:29,311 INFO L226 Difference]: Without dead ends: 104 [2025-01-09 02:40:29,311 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-01-09 02:40:29,312 INFO L435 NwaCegarLoop]: 110 mSDtfsCounter, 173 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 245 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 02:40:29,312 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [174 Valid, 245 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 02:40:29,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2025-01-09 02:40:29,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2025-01-09 02:40:29,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 80 states have (on average 1.2375) internal successors, (99), 94 states have internal predecessors, (99), 20 states have call successors, (20), 4 states have call predecessors, (20), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-01-09 02:40:29,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 124 transitions. [2025-01-09 02:40:29,328 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 124 transitions. Word has length 20 [2025-01-09 02:40:29,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 02:40:29,333 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 124 transitions. [2025-01-09 02:40:29,334 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 02:40:29,334 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 124 transitions. [2025-01-09 02:40:29,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-01-09 02:40:29,334 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:40:29,334 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 02:40:29,334 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 02:40:29,335 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 02:40:29,335 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:40:29,335 INFO L85 PathProgramCache]: Analyzing trace with hash 618744327, now seen corresponding path program 1 times [2025-01-09 02:40:29,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:40:29,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [121763892] [2025-01-09 02:40:29,335 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:40:29,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:40:29,352 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-01-09 02:40:29,379 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-01-09 02:40:29,380 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:40:29,380 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:40:29,896 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 02:40:29,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 02:40:29,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [121763892] [2025-01-09 02:40:29,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [121763892] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 02:40:29,897 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 02:40:29,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 02:40:29,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [41552648] [2025-01-09 02:40:29,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 02:40:29,898 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 02:40:29,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 02:40:29,898 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 02:40:29,899 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-01-09 02:40:29,899 INFO L87 Difference]: Start difference. First operand 104 states and 124 transitions. Second operand has 10 states, 10 states have (on average 1.9) internal successors, (19), 7 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 02:40:30,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 02:40:30,422 INFO L93 Difference]: Finished difference Result 195 states and 232 transitions. [2025-01-09 02:40:30,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 02:40:30,423 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.9) internal successors, (19), 7 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2025-01-09 02:40:30,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 02:40:30,425 INFO L225 Difference]: With dead ends: 195 [2025-01-09 02:40:30,425 INFO L226 Difference]: Without dead ends: 189 [2025-01-09 02:40:30,426 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=210, Unknown=0, NotChecked=0, Total=272 [2025-01-09 02:40:30,426 INFO L435 NwaCegarLoop]: 95 mSDtfsCounter, 356 mSDsluCounter, 474 mSDsCounter, 0 mSdLazyCounter, 417 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 357 SdHoareTripleChecker+Valid, 569 SdHoareTripleChecker+Invalid, 467 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 417 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 02:40:30,427 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [357 Valid, 569 Invalid, 467 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 417 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 02:40:30,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2025-01-09 02:40:30,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 169. [2025-01-09 02:40:30,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 141 states have (on average 1.24822695035461) internal successors, (176), 155 states have internal predecessors, (176), 23 states have call successors, (23), 6 states have call predecessors, (23), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-01-09 02:40:30,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 206 transitions. [2025-01-09 02:40:30,453 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 206 transitions. Word has length 23 [2025-01-09 02:40:30,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 02:40:30,453 INFO L471 AbstractCegarLoop]: Abstraction has 169 states and 206 transitions. [2025-01-09 02:40:30,454 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.9) internal successors, (19), 7 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 02:40:30,454 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 206 transitions. [2025-01-09 02:40:30,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-01-09 02:40:30,454 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:40:30,454 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 02:40:30,454 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 02:40:30,455 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 02:40:30,455 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:40:30,455 INFO L85 PathProgramCache]: Analyzing trace with hash -1277849566, now seen corresponding path program 1 times [2025-01-09 02:40:30,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:40:30,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [507515427] [2025-01-09 02:40:30,455 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:40:30,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:40:30,472 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-01-09 02:40:30,495 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-01-09 02:40:30,496 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:40:30,496 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:40:31,279 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 02:40:31,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 02:40:31,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [507515427] [2025-01-09 02:40:31,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [507515427] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 02:40:31,280 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 02:40:31,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 02:40:31,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113447198] [2025-01-09 02:40:31,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 02:40:31,280 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 02:40:31,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 02:40:31,281 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 02:40:31,281 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2025-01-09 02:40:31,281 INFO L87 Difference]: Start difference. First operand 169 states and 206 transitions. Second operand has 11 states, 11 states have (on average 2.0) internal successors, (22), 7 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 02:40:32,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 02:40:32,056 INFO L93 Difference]: Finished difference Result 269 states and 324 transitions. [2025-01-09 02:40:32,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 02:40:32,057 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.0) internal successors, (22), 7 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2025-01-09 02:40:32,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 02:40:32,060 INFO L225 Difference]: With dead ends: 269 [2025-01-09 02:40:32,060 INFO L226 Difference]: Without dead ends: 266 [2025-01-09 02:40:32,061 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=56, Invalid=216, Unknown=0, NotChecked=0, Total=272 [2025-01-09 02:40:32,061 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 303 mSDsluCounter, 198 mSDsCounter, 0 mSdLazyCounter, 942 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 306 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 981 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 942 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 02:40:32,063 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [306 Valid, 227 Invalid, 981 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 942 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 02:40:32,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2025-01-09 02:40:32,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 248. [2025-01-09 02:40:32,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 248 states, 213 states have (on average 1.244131455399061) internal successors, (265), 228 states have internal predecessors, (265), 28 states have call successors, (28), 8 states have call predecessors, (28), 6 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-01-09 02:40:32,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 304 transitions. [2025-01-09 02:40:32,094 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 304 transitions. Word has length 26 [2025-01-09 02:40:32,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 02:40:32,094 INFO L471 AbstractCegarLoop]: Abstraction has 248 states and 304 transitions. [2025-01-09 02:40:32,094 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.0) internal successors, (22), 7 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 02:40:32,094 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 304 transitions. [2025-01-09 02:40:32,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-01-09 02:40:32,095 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:40:32,095 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 02:40:32,095 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 02:40:32,095 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 02:40:32,095 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:40:32,096 INFO L85 PathProgramCache]: Analyzing trace with hash 1899455833, now seen corresponding path program 1 times [2025-01-09 02:40:32,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:40:32,096 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474806682] [2025-01-09 02:40:32,096 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:40:32,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:40:32,111 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-01-09 02:40:32,128 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-01-09 02:40:32,128 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:40:32,128 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:40:32,595 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 02:40:32,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 02:40:32,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1474806682] [2025-01-09 02:40:32,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1474806682] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 02:40:32,596 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 02:40:32,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 02:40:32,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14823637] [2025-01-09 02:40:32,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 02:40:32,597 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 02:40:32,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 02:40:32,597 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 02:40:32,598 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2025-01-09 02:40:32,598 INFO L87 Difference]: Start difference. First operand 248 states and 304 transitions. Second operand has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 7 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 02:40:33,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 02:40:33,289 INFO L93 Difference]: Finished difference Result 268 states and 322 transitions. [2025-01-09 02:40:33,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 02:40:33,294 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 7 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29 [2025-01-09 02:40:33,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 02:40:33,296 INFO L225 Difference]: With dead ends: 268 [2025-01-09 02:40:33,296 INFO L226 Difference]: Without dead ends: 265 [2025-01-09 02:40:33,296 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=218, Unknown=0, NotChecked=0, Total=272 [2025-01-09 02:40:33,297 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 342 mSDsluCounter, 191 mSDsCounter, 0 mSdLazyCounter, 925 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 345 SdHoareTripleChecker+Valid, 220 SdHoareTripleChecker+Invalid, 962 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 925 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 02:40:33,297 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [345 Valid, 220 Invalid, 962 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 925 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 02:40:33,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2025-01-09 02:40:33,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 248. [2025-01-09 02:40:33,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 248 states, 213 states have (on average 1.2394366197183098) internal successors, (264), 228 states have internal predecessors, (264), 28 states have call successors, (28), 8 states have call predecessors, (28), 6 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-01-09 02:40:33,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 303 transitions. [2025-01-09 02:40:33,337 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 303 transitions. Word has length 29 [2025-01-09 02:40:33,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 02:40:33,339 INFO L471 AbstractCegarLoop]: Abstraction has 248 states and 303 transitions. [2025-01-09 02:40:33,339 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 7 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 02:40:33,339 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 303 transitions. [2025-01-09 02:40:33,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-01-09 02:40:33,340 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:40:33,340 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 02:40:33,340 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 02:40:33,340 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 02:40:33,340 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:40:33,340 INFO L85 PathProgramCache]: Analyzing trace with hash 237657999, now seen corresponding path program 1 times [2025-01-09 02:40:33,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:40:33,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1381629224] [2025-01-09 02:40:33,341 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:40:33,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:40:33,360 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-01-09 02:40:33,384 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-01-09 02:40:33,388 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:40:33,389 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:40:34,034 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 02:40:34,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 02:40:34,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1381629224] [2025-01-09 02:40:34,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1381629224] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 02:40:34,034 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 02:40:34,034 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-01-09 02:40:34,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1367922518] [2025-01-09 02:40:34,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 02:40:34,034 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-09 02:40:34,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 02:40:34,035 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-09 02:40:34,035 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2025-01-09 02:40:34,035 INFO L87 Difference]: Start difference. First operand 248 states and 303 transitions. Second operand has 12 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 8 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 02:40:34,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 02:40:34,805 INFO L93 Difference]: Finished difference Result 267 states and 320 transitions. [2025-01-09 02:40:34,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-09 02:40:34,806 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 8 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 32 [2025-01-09 02:40:34,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 02:40:34,807 INFO L225 Difference]: With dead ends: 267 [2025-01-09 02:40:34,808 INFO L226 Difference]: Without dead ends: 264 [2025-01-09 02:40:34,809 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=276, Unknown=0, NotChecked=0, Total=342 [2025-01-09 02:40:34,809 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 336 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 1027 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 339 SdHoareTripleChecker+Valid, 243 SdHoareTripleChecker+Invalid, 1062 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 1027 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 02:40:34,810 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [339 Valid, 243 Invalid, 1062 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 1027 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 02:40:34,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2025-01-09 02:40:34,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 248. [2025-01-09 02:40:34,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 248 states, 213 states have (on average 1.2347417840375587) internal successors, (263), 228 states have internal predecessors, (263), 28 states have call successors, (28), 8 states have call predecessors, (28), 6 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-01-09 02:40:34,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 302 transitions. [2025-01-09 02:40:34,834 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 302 transitions. Word has length 32 [2025-01-09 02:40:34,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 02:40:34,834 INFO L471 AbstractCegarLoop]: Abstraction has 248 states and 302 transitions. [2025-01-09 02:40:34,834 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 8 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 02:40:34,834 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 302 transitions. [2025-01-09 02:40:34,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-01-09 02:40:34,835 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:40:34,835 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 02:40:34,835 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 02:40:34,835 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 02:40:34,836 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:40:34,836 INFO L85 PathProgramCache]: Analyzing trace with hash 1722690504, now seen corresponding path program 1 times [2025-01-09 02:40:34,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:40:34,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064093601] [2025-01-09 02:40:34,836 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:40:34,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:40:34,855 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-01-09 02:40:34,870 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-01-09 02:40:34,871 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:40:34,871 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:40:35,566 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 02:40:35,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 02:40:35,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1064093601] [2025-01-09 02:40:35,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1064093601] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 02:40:35,567 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 02:40:35,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-01-09 02:40:35,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1687133874] [2025-01-09 02:40:35,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 02:40:35,568 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-09 02:40:35,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 02:40:35,568 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-09 02:40:35,568 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2025-01-09 02:40:35,569 INFO L87 Difference]: Start difference. First operand 248 states and 302 transitions. Second operand has 12 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 8 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 02:40:36,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 02:40:36,456 INFO L93 Difference]: Finished difference Result 266 states and 318 transitions. [2025-01-09 02:40:36,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-09 02:40:36,456 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 8 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 35 [2025-01-09 02:40:36,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 02:40:36,458 INFO L225 Difference]: With dead ends: 266 [2025-01-09 02:40:36,458 INFO L226 Difference]: Without dead ends: 263 [2025-01-09 02:40:36,458 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=276, Unknown=0, NotChecked=0, Total=342 [2025-01-09 02:40:36,459 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 329 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 1025 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 332 SdHoareTripleChecker+Valid, 243 SdHoareTripleChecker+Invalid, 1058 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 1025 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 02:40:36,459 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [332 Valid, 243 Invalid, 1058 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 1025 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 02:40:36,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2025-01-09 02:40:36,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 248. [2025-01-09 02:40:36,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 248 states, 213 states have (on average 1.2300469483568075) internal successors, (262), 228 states have internal predecessors, (262), 28 states have call successors, (28), 8 states have call predecessors, (28), 6 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-01-09 02:40:36,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 301 transitions. [2025-01-09 02:40:36,488 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 301 transitions. Word has length 35 [2025-01-09 02:40:36,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 02:40:36,488 INFO L471 AbstractCegarLoop]: Abstraction has 248 states and 301 transitions. [2025-01-09 02:40:36,489 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 8 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 02:40:36,489 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 301 transitions. [2025-01-09 02:40:36,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-01-09 02:40:36,490 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:40:36,490 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 02:40:36,490 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 02:40:36,490 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 02:40:36,491 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:40:36,491 INFO L85 PathProgramCache]: Analyzing trace with hash 995215422, now seen corresponding path program 1 times [2025-01-09 02:40:36,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:40:36,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [225170127] [2025-01-09 02:40:36,492 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:40:36,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:40:36,512 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-01-09 02:40:36,556 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-01-09 02:40:36,556 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:40:36,556 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:40:37,715 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 02:40:37,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 02:40:37,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [225170127] [2025-01-09 02:40:37,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [225170127] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 02:40:37,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [308325627] [2025-01-09 02:40:37,716 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:40:37,716 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 02:40:37,716 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 02:40:37,721 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 02:40:37,723 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 02:40:37,803 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-01-09 02:40:37,866 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-01-09 02:40:37,866 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:40:37,866 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:40:37,879 INFO L256 TraceCheckSpWp]: Trace formula consists of 362 conjuncts, 112 conjuncts are in the unsatisfiable core [2025-01-09 02:40:37,891 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 02:40:37,979 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-01-09 02:40:37,981 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2025-01-09 02:40:38,056 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-01-09 02:40:38,067 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-01-09 02:40:38,081 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2025-01-09 02:40:38,084 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2025-01-09 02:40:38,187 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 35 [2025-01-09 02:40:38,191 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44 [2025-01-09 02:40:38,199 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 45 [2025-01-09 02:40:38,258 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 02:40:38,261 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 16 [2025-01-09 02:40:38,265 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 02:40:38,266 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 24 [2025-01-09 02:40:38,337 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-09 02:40:38,337 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-01-09 02:40:38,378 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2025-01-09 02:40:38,387 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 02:40:38,387 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 8 [2025-01-09 02:40:38,785 INFO L349 Elim1Store]: treesize reduction 178, result has 16.0 percent of original size [2025-01-09 02:40:38,785 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 109 treesize of output 98 [2025-01-09 02:40:38,807 INFO L349 Elim1Store]: treesize reduction 54, result has 5.3 percent of original size [2025-01-09 02:40:38,807 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 102 treesize of output 78 [2025-01-09 02:40:38,816 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 02:40:38,823 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2025-01-09 02:40:38,824 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 34 [2025-01-09 02:40:38,835 INFO L349 Elim1Store]: treesize reduction 11, result has 42.1 percent of original size [2025-01-09 02:40:38,835 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 50 treesize of output 42 [2025-01-09 02:40:38,839 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2025-01-09 02:40:38,863 INFO L349 Elim1Store]: treesize reduction 60, result has 1.6 percent of original size [2025-01-09 02:40:38,863 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 131 treesize of output 87 [2025-01-09 02:40:38,870 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 02:40:38,870 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 33 [2025-01-09 02:40:38,874 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 02:40:38,883 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2025-01-09 02:40:38,884 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 48 [2025-01-09 02:40:38,897 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2025-01-09 02:40:38,999 INFO L349 Elim1Store]: treesize reduction 21, result has 30.0 percent of original size [2025-01-09 02:40:38,999 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 109 treesize of output 94 [2025-01-09 02:40:39,986 INFO L349 Elim1Store]: treesize reduction 136, result has 39.0 percent of original size [2025-01-09 02:40:39,987 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 8 new quantified variables, introduced 21 case distinctions, treesize of input 231 treesize of output 158 [2025-01-09 02:40:40,130 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 02:40:40,130 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 02:40:40,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [308325627] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 02:40:40,588 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 02:40:40,588 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15] total 30 [2025-01-09 02:40:40,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394066111] [2025-01-09 02:40:40,588 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 02:40:40,588 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-01-09 02:40:40,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 02:40:40,589 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-01-09 02:40:40,589 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=1209, Unknown=6, NotChecked=0, Total=1332 [2025-01-09 02:40:40,589 INFO L87 Difference]: Start difference. First operand 248 states and 301 transitions. Second operand has 31 states, 31 states have (on average 2.032258064516129) internal successors, (63), 21 states have internal predecessors, (63), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-01-09 02:40:46,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 02:40:46,455 INFO L93 Difference]: Finished difference Result 381 states and 448 transitions. [2025-01-09 02:40:46,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-01-09 02:40:46,456 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 2.032258064516129) internal successors, (63), 21 states have internal predecessors, (63), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 38 [2025-01-09 02:40:46,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 02:40:46,458 INFO L225 Difference]: With dead ends: 381 [2025-01-09 02:40:46,458 INFO L226 Difference]: Without dead ends: 378 [2025-01-09 02:40:46,459 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 682 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=463, Invalid=3191, Unknown=6, NotChecked=0, Total=3660 [2025-01-09 02:40:46,459 INFO L435 NwaCegarLoop]: 28 mSDtfsCounter, 1226 mSDsluCounter, 444 mSDsCounter, 0 mSdLazyCounter, 2423 mSolverCounterSat, 215 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1229 SdHoareTripleChecker+Valid, 472 SdHoareTripleChecker+Invalid, 2638 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 215 IncrementalHoareTripleChecker+Valid, 2423 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2025-01-09 02:40:46,459 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1229 Valid, 472 Invalid, 2638 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [215 Valid, 2423 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2025-01-09 02:40:46,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378 states. [2025-01-09 02:40:46,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378 to 260. [2025-01-09 02:40:46,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 260 states, 222 states have (on average 1.2162162162162162) internal successors, (270), 238 states have internal predecessors, (270), 29 states have call successors, (29), 10 states have call predecessors, (29), 8 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2025-01-09 02:40:46,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 311 transitions. [2025-01-09 02:40:46,510 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 311 transitions. Word has length 38 [2025-01-09 02:40:46,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 02:40:46,512 INFO L471 AbstractCegarLoop]: Abstraction has 260 states and 311 transitions. [2025-01-09 02:40:46,512 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 2.032258064516129) internal successors, (63), 21 states have internal predecessors, (63), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-01-09 02:40:46,512 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 311 transitions. [2025-01-09 02:40:46,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-01-09 02:40:46,512 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:40:46,512 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 02:40:46,519 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 02:40:46,713 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 02:40:46,713 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 02:40:46,713 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:40:46,713 INFO L85 PathProgramCache]: Analyzing trace with hash -115843551, now seen corresponding path program 1 times [2025-01-09 02:40:46,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:40:46,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1335035790] [2025-01-09 02:40:46,714 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:40:46,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:40:46,724 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-01-09 02:40:46,734 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-01-09 02:40:46,735 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:40:46,735 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:40:47,127 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 02:40:47,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 02:40:47,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1335035790] [2025-01-09 02:40:47,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1335035790] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 02:40:47,128 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 02:40:47,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-01-09 02:40:47,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129777389] [2025-01-09 02:40:47,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 02:40:47,128 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-09 02:40:47,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 02:40:47,128 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-09 02:40:47,128 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2025-01-09 02:40:47,128 INFO L87 Difference]: Start difference. First operand 260 states and 311 transitions. Second operand has 12 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 8 states have internal predecessors, (34), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 02:40:47,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 02:40:47,840 INFO L93 Difference]: Finished difference Result 274 states and 323 transitions. [2025-01-09 02:40:47,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-01-09 02:40:47,840 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 8 states have internal predecessors, (34), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 38 [2025-01-09 02:40:47,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 02:40:47,841 INFO L225 Difference]: With dead ends: 274 [2025-01-09 02:40:47,841 INFO L226 Difference]: Without dead ends: 271 [2025-01-09 02:40:47,842 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=105, Invalid=447, Unknown=0, NotChecked=0, Total=552 [2025-01-09 02:40:47,842 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 404 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 965 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 407 SdHoareTripleChecker+Valid, 234 SdHoareTripleChecker+Invalid, 1014 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 965 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 02:40:47,842 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [407 Valid, 234 Invalid, 1014 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 965 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 02:40:47,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2025-01-09 02:40:47,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 260. [2025-01-09 02:40:47,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 260 states, 222 states have (on average 1.2117117117117118) internal successors, (269), 238 states have internal predecessors, (269), 29 states have call successors, (29), 10 states have call predecessors, (29), 8 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2025-01-09 02:40:47,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 310 transitions. [2025-01-09 02:40:47,899 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 310 transitions. Word has length 38 [2025-01-09 02:40:47,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 02:40:47,899 INFO L471 AbstractCegarLoop]: Abstraction has 260 states and 310 transitions. [2025-01-09 02:40:47,899 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 8 states have internal predecessors, (34), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 02:40:47,899 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 310 transitions. [2025-01-09 02:40:47,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-01-09 02:40:47,900 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:40:47,900 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 02:40:47,900 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 02:40:47,900 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 02:40:47,900 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:40:47,903 INFO L85 PathProgramCache]: Analyzing trace with hash 29157309, now seen corresponding path program 1 times [2025-01-09 02:40:47,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:40:47,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809768308] [2025-01-09 02:40:47,904 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:40:47,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:40:47,921 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-01-09 02:40:47,936 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-01-09 02:40:47,937 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:40:47,937 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:40:48,919 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 02:40:48,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 02:40:48,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [809768308] [2025-01-09 02:40:48,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [809768308] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 02:40:48,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1435803484] [2025-01-09 02:40:48,920 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:40:48,920 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 02:40:48,920 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 02:40:48,921 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 02:40:48,922 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-09 02:40:49,002 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-01-09 02:40:49,058 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-01-09 02:40:49,058 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:40:49,058 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:40:49,062 INFO L256 TraceCheckSpWp]: Trace formula consists of 368 conjuncts, 122 conjuncts are in the unsatisfiable core [2025-01-09 02:40:49,067 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 02:40:49,107 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-01-09 02:40:49,108 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2025-01-09 02:40:49,139 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-01-09 02:40:49,185 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 31 [2025-01-09 02:40:49,187 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 02:40:49,198 INFO L349 Elim1Store]: treesize reduction 18, result has 33.3 percent of original size [2025-01-09 02:40:49,198 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 31 [2025-01-09 02:40:49,206 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2025-01-09 02:40:49,219 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2025-01-09 02:40:49,225 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 31 [2025-01-09 02:40:49,300 INFO L349 Elim1Store]: treesize reduction 106, result has 26.9 percent of original size [2025-01-09 02:40:49,300 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 54 treesize of output 99 [2025-01-09 02:40:49,321 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2025-01-09 02:40:49,336 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 02:40:49,337 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1 [2025-01-09 02:40:49,373 INFO L349 Elim1Store]: treesize reduction 19, result has 40.6 percent of original size [2025-01-09 02:40:49,374 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 48 [2025-01-09 02:40:49,405 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 02:40:49,405 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2025-01-09 02:40:49,460 INFO L349 Elim1Store]: treesize reduction 31, result has 13.9 percent of original size [2025-01-09 02:40:49,460 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 20 [2025-01-09 02:40:49,477 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 16 [2025-01-09 02:40:49,880 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 31 [2025-01-09 02:40:49,882 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 02:40:49,896 INFO L349 Elim1Store]: treesize reduction 18, result has 33.3 percent of original size [2025-01-09 02:40:49,896 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 29 [2025-01-09 02:40:49,905 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2025-01-09 02:40:49,913 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2025-01-09 02:40:53,950 WARN L851 $PredicateComparison]: unable to prove that (and (= (select |c_#valid| 3) 1) (= |c_~#gl_list~0.offset| 0) (= 3 |c_~#gl_list~0.base|) (let ((.cse23 (store |c_old(#memory_$Pointer$#1.base)| |c_list_add_#in~head#1.base| (store (select |c_old(#memory_$Pointer$#1.base)| |c_list_add_#in~head#1.base|) |c_list_add_#in~head#1.offset| |c_list_add_#in~new#1.base|)))) (let ((.cse21 (= |c_list_add_#in~head#1.base| |c_list_add_#in~new#1.base|)) (.cse24 (select .cse23 |c_list_add_#in~new#1.base|)) (.cse7 (select |c_#memory_$Pointer$#1.base| |c_list_add_#in~new#1.base|))) (let ((.cse1 (exists ((|v_list_add___list_add_~new#1.offset_27| Int)) (let ((.cse59 (+ |v_list_add___list_add_~new#1.offset_27| 4))) (and (not (= |v_list_add___list_add_~new#1.offset_27| |c_list_add_#in~head#1.offset|)) (not (= |c_list_add_#in~head#1.offset| .cse59)) (<= |c_list_add_#in~new#1.offset| |v_list_add___list_add_~new#1.offset_27|) (= |c_#memory_$Pointer$#1.base| (let ((.cse60 (store (store .cse24 |v_list_add___list_add_~new#1.offset_27| (select .cse7 |v_list_add___list_add_~new#1.offset_27|)) .cse59 (select .cse7 .cse59)))) (store (store |c_old(#memory_$Pointer$#1.base)| |c_list_add_#in~new#1.base| .cse60) |c_list_add_#in~head#1.base| (store (select (store .cse23 |c_list_add_#in~new#1.base| .cse60) |c_list_add_#in~head#1.base|) |c_list_add_#in~head#1.offset| |c_list_add_#in~new#1.base|)))))))) (.cse32 (not .cse21)) (.cse11 (select |c_old(#memory_$Pointer$#1.base)| |c_list_add_#in~new#1.base|))) (or (and (let ((.cse2 (select (select |c_#memory_$Pointer$#1.offset| |c_list_add_#in~head#1.base|) |c_list_add_#in~head#1.offset|))) (let ((.cse0 (exists ((v_DerPreprocessor_5 (Array Int Int)) (v_DerPreprocessor_6 (Array Int Int))) (and (= (select v_DerPreprocessor_6 |c_list_add_#in~head#1.offset|) .cse2) (= (select (store (store |c_#memory_$Pointer$#1.offset| |c_list_add_#in~new#1.base| v_DerPreprocessor_5) |c_list_add_#in~head#1.base| v_DerPreprocessor_6) |c_list_add_#in~new#1.base|) v_DerPreprocessor_5))))) (or (and .cse0 .cse1) (exists ((|v_list_add___list_add_~new#1.offset_27| Int)) (let ((.cse8 (+ |v_list_add___list_add_~new#1.offset_27| 4))) (and (not (= |v_list_add___list_add_~new#1.offset_27| |c_list_add_#in~head#1.offset|)) (exists ((|v_list_add___list_add_~next#1.base_26| Int) (|v_list_add___list_add_~next#1.offset_28| Int)) (let ((.cse4 (+ |v_list_add___list_add_~next#1.offset_28| 4))) (and (exists ((v_DerPreprocessor_5 (Array Int Int)) (v_DerPreprocessor_6 (Array Int Int))) (let ((.cse3 (store (store |c_#memory_$Pointer$#1.offset| |c_list_add_#in~new#1.base| v_DerPreprocessor_5) |c_list_add_#in~head#1.base| v_DerPreprocessor_6))) (and (= (select v_DerPreprocessor_6 |c_list_add_#in~head#1.offset|) .cse2) (<= |v_list_add___list_add_~new#1.offset_27| (select (select .cse3 |v_list_add___list_add_~next#1.base_26|) .cse4)) (= (select .cse3 |c_list_add_#in~new#1.base|) v_DerPreprocessor_5)))) (= |c_#memory_$Pointer$#1.base| (let ((.cse5 (let ((.cse6 (store |c_old(#memory_$Pointer$#1.base)| |v_list_add___list_add_~next#1.base_26| (store (select |c_old(#memory_$Pointer$#1.base)| |v_list_add___list_add_~next#1.base_26|) .cse4 |c_list_add_#in~new#1.base|)))) (store .cse6 |c_list_add_#in~new#1.base| (store (store (select .cse6 |c_list_add_#in~new#1.base|) |v_list_add___list_add_~new#1.offset_27| (select .cse7 |v_list_add___list_add_~new#1.offset_27|)) .cse8 (select .cse7 .cse8)))))) (store .cse5 |c_list_add_#in~head#1.base| (store (select .cse5 |c_list_add_#in~head#1.base|) |c_list_add_#in~head#1.offset| |c_list_add_#in~new#1.base|))))))) (not (= |c_list_add_#in~head#1.offset| .cse8)) (<= |c_list_add_#in~new#1.offset| |v_list_add___list_add_~new#1.offset_27|)))) (exists ((|v_list_add___list_add_~new#1.offset_27| Int)) (let ((.cse9 (+ |v_list_add___list_add_~new#1.offset_27| 4))) (and (not (= |v_list_add___list_add_~new#1.offset_27| |c_list_add_#in~head#1.offset|)) (not (= |c_list_add_#in~head#1.offset| .cse9)) (<= |c_list_add_#in~new#1.offset| |v_list_add___list_add_~new#1.offset_27|) (exists ((|v_list_add___list_add_~next#1.offset_28| Int)) (let ((.cse12 (+ |v_list_add___list_add_~next#1.offset_28| 4))) (and (= |c_#memory_$Pointer$#1.base| (let ((.cse10 (store |c_old(#memory_$Pointer$#1.base)| |c_list_add_#in~new#1.base| (store (store (store .cse11 .cse12 |c_list_add_#in~new#1.base|) |v_list_add___list_add_~new#1.offset_27| (select .cse7 |v_list_add___list_add_~new#1.offset_27|)) .cse9 (select .cse7 .cse9))))) (store .cse10 |c_list_add_#in~head#1.base| (store (select .cse10 |c_list_add_#in~head#1.base|) |c_list_add_#in~head#1.offset| |c_list_add_#in~new#1.base|)))) (exists ((v_DerPreprocessor_5 (Array Int Int)) (v_DerPreprocessor_6 (Array Int Int))) (and (= (select v_DerPreprocessor_6 |c_list_add_#in~head#1.offset|) .cse2) (<= |v_list_add___list_add_~new#1.offset_27| (select v_DerPreprocessor_6 .cse12)) (= (select (store (store |c_#memory_$Pointer$#1.offset| |c_list_add_#in~new#1.base| v_DerPreprocessor_5) |c_list_add_#in~head#1.base| v_DerPreprocessor_6) |c_list_add_#in~new#1.base|) v_DerPreprocessor_5))))))))) (and (exists ((|v_list_add___list_add_~new#1.offset_27| Int)) (let ((.cse14 (+ |v_list_add___list_add_~new#1.offset_27| 4))) (and (not (= |v_list_add___list_add_~new#1.offset_27| |c_list_add_#in~head#1.offset|)) (= (let ((.cse13 (store |c_old(#memory_$Pointer$#1.base)| |c_list_add_#in~new#1.base| (store (store (store .cse11 |c_list_add_#in~head#1.offset| |c_list_add_#in~new#1.base|) |v_list_add___list_add_~new#1.offset_27| (select .cse7 |v_list_add___list_add_~new#1.offset_27|)) .cse14 (select .cse7 .cse14))))) (store .cse13 |c_list_add_#in~head#1.base| (store (select .cse13 |c_list_add_#in~head#1.base|) |c_list_add_#in~head#1.offset| |c_list_add_#in~new#1.base|))) |c_#memory_$Pointer$#1.base|) (not (= |c_list_add_#in~head#1.offset| .cse14)) (<= |c_list_add_#in~new#1.offset| |v_list_add___list_add_~new#1.offset_27|)))) .cse0) (exists ((|v_list_add___list_add_~new#1.offset_27| Int)) (let ((.cse17 (+ |v_list_add___list_add_~new#1.offset_27| 4))) (and (exists ((|v_list_add___list_add_~next#1.base_26| Int) (|v_list_add___list_add_~next#1.offset_28| Int)) (let ((.cse18 (+ |v_list_add___list_add_~next#1.offset_28| 4))) (and (= |c_#memory_$Pointer$#1.base| (let ((.cse15 (let ((.cse16 (store |c_old(#memory_$Pointer$#1.base)| |v_list_add___list_add_~next#1.base_26| (store (select |c_old(#memory_$Pointer$#1.base)| |v_list_add___list_add_~next#1.base_26|) .cse18 |c_list_add_#in~new#1.base|)))) (store .cse16 |c_list_add_#in~new#1.base| (store (store (select .cse16 |c_list_add_#in~new#1.base|) |v_list_add___list_add_~new#1.offset_27| (select .cse7 |v_list_add___list_add_~new#1.offset_27|)) .cse17 (select .cse7 .cse17)))))) (store .cse15 |c_list_add_#in~head#1.base| (store (select .cse15 |c_list_add_#in~head#1.base|) |c_list_add_#in~head#1.offset| |c_list_add_#in~new#1.base|)))) (exists ((v_DerPreprocessor_5 (Array Int Int)) (v_DerPreprocessor_6 (Array Int Int))) (let ((.cse20 (store (store |c_#memory_$Pointer$#1.offset| |c_list_add_#in~new#1.base| v_DerPreprocessor_5) |c_list_add_#in~head#1.base| v_DerPreprocessor_6))) (let ((.cse19 (select .cse20 |v_list_add___list_add_~next#1.base_26|))) (and (<= |v_list_add___list_add_~new#1.offset_27| (select .cse19 .cse18)) (= v_DerPreprocessor_6 (store .cse19 |c_list_add_#in~head#1.offset| .cse2)) (= (select .cse20 |c_list_add_#in~new#1.base|) v_DerPreprocessor_5)))))))) (not (= |v_list_add___list_add_~new#1.offset_27| |c_list_add_#in~head#1.offset|)) (not (= |c_list_add_#in~head#1.offset| .cse17)) (<= |c_list_add_#in~new#1.offset| |v_list_add___list_add_~new#1.offset_27|))))))) .cse21) (and (or (exists ((|v_list_add___list_add_~new#1.offset_27| Int)) (and (<= |c_list_add_#in~new#1.offset| |v_list_add___list_add_~new#1.offset_27|) (= |c_#memory_$Pointer$#1.base| (let ((.cse22 (let ((.cse25 (+ |v_list_add___list_add_~new#1.offset_27| 4))) (store (store .cse24 |v_list_add___list_add_~new#1.offset_27| (select .cse7 |v_list_add___list_add_~new#1.offset_27|)) .cse25 (select .cse7 .cse25))))) (store (store |c_old(#memory_$Pointer$#1.base)| |c_list_add_#in~new#1.base| .cse22) |c_list_add_#in~head#1.base| (store (select (store .cse23 |c_list_add_#in~new#1.base| .cse22) |c_list_add_#in~head#1.base|) |c_list_add_#in~head#1.offset| |c_list_add_#in~new#1.base|)))))) (exists ((|v_list_add___list_add_~new#1.offset_27| Int)) (and (<= |c_list_add_#in~new#1.offset| |v_list_add___list_add_~new#1.offset_27|) (exists ((|v_list_add___list_add_~next#1.offset_28| Int)) (= |c_#memory_$Pointer$#1.base| (let ((.cse26 (store |c_old(#memory_$Pointer$#1.base)| |c_list_add_#in~new#1.base| (let ((.cse27 (+ |v_list_add___list_add_~new#1.offset_27| 4))) (store (store (store .cse11 (+ |v_list_add___list_add_~next#1.offset_28| 4) |c_list_add_#in~new#1.base|) |v_list_add___list_add_~new#1.offset_27| (select .cse7 |v_list_add___list_add_~new#1.offset_27|)) .cse27 (select .cse7 .cse27)))))) (store .cse26 |c_list_add_#in~head#1.base| (store (select .cse26 |c_list_add_#in~head#1.base|) |c_list_add_#in~head#1.offset| |c_list_add_#in~new#1.base|))))))) (exists ((|v_list_add___list_add_~new#1.offset_27| Int)) (and (exists ((|v_list_add___list_add_~next#1.base_26| Int) (|v_list_add___list_add_~next#1.offset_28| Int)) (let ((.cse31 (+ |v_list_add___list_add_~next#1.offset_28| 4))) (and (= |c_#memory_$Pointer$#1.base| (let ((.cse28 (let ((.cse29 (store |c_old(#memory_$Pointer$#1.base)| |v_list_add___list_add_~next#1.base_26| (store (select |c_old(#memory_$Pointer$#1.base)| |v_list_add___list_add_~next#1.base_26|) .cse31 |c_list_add_#in~new#1.base|)))) (store .cse29 |c_list_add_#in~new#1.base| (let ((.cse30 (+ |v_list_add___list_add_~new#1.offset_27| 4))) (store (store (select .cse29 |c_list_add_#in~new#1.base|) |v_list_add___list_add_~new#1.offset_27| (select .cse7 |v_list_add___list_add_~new#1.offset_27|)) .cse30 (select .cse7 .cse30))))))) (store .cse28 |c_list_add_#in~head#1.base| (store (select .cse28 |c_list_add_#in~head#1.base|) |c_list_add_#in~head#1.offset| |c_list_add_#in~new#1.base|)))) (<= |v_list_add___list_add_~new#1.offset_27| (select (select |c_#memory_$Pointer$#1.offset| |v_list_add___list_add_~next#1.base_26|) .cse31))))) (<= |c_list_add_#in~new#1.offset| |v_list_add___list_add_~new#1.offset_27|)))) .cse32) (and (or (exists ((|v_list_add___list_add_~new#1.offset_27| Int)) (and (not (= |v_list_add___list_add_~new#1.offset_27| |c_list_add_#in~head#1.offset|)) (<= |c_list_add_#in~new#1.offset| |v_list_add___list_add_~new#1.offset_27|) (exists ((|v_list_add___list_add_~next#1.offset_28| Int)) (= |c_#memory_$Pointer$#1.base| (let ((.cse33 (store |c_old(#memory_$Pointer$#1.base)| |c_list_add_#in~new#1.base| (let ((.cse34 (+ |v_list_add___list_add_~new#1.offset_27| 4))) (store (store (store .cse11 (+ |v_list_add___list_add_~next#1.offset_28| 4) |c_list_add_#in~new#1.base|) |v_list_add___list_add_~new#1.offset_27| (select .cse7 |v_list_add___list_add_~new#1.offset_27|)) .cse34 (select .cse7 .cse34)))))) (store .cse33 |c_list_add_#in~head#1.base| (store (select .cse33 |c_list_add_#in~head#1.base|) |c_list_add_#in~head#1.offset| |c_list_add_#in~new#1.base|))))))) (exists ((|v_list_add___list_add_~new#1.offset_27| Int)) (and (not (= |v_list_add___list_add_~new#1.offset_27| |c_list_add_#in~head#1.offset|)) (exists ((|v_list_add___list_add_~next#1.base_26| Int) (|v_list_add___list_add_~next#1.offset_28| Int)) (let ((.cse38 (+ |v_list_add___list_add_~next#1.offset_28| 4))) (and (= |c_#memory_$Pointer$#1.base| (let ((.cse35 (let ((.cse36 (store |c_old(#memory_$Pointer$#1.base)| |v_list_add___list_add_~next#1.base_26| (store (select |c_old(#memory_$Pointer$#1.base)| |v_list_add___list_add_~next#1.base_26|) .cse38 |c_list_add_#in~new#1.base|)))) (store .cse36 |c_list_add_#in~new#1.base| (let ((.cse37 (+ |v_list_add___list_add_~new#1.offset_27| 4))) (store (store (select .cse36 |c_list_add_#in~new#1.base|) |v_list_add___list_add_~new#1.offset_27| (select .cse7 |v_list_add___list_add_~new#1.offset_27|)) .cse37 (select .cse7 .cse37))))))) (store .cse35 |c_list_add_#in~head#1.base| (store (select .cse35 |c_list_add_#in~head#1.base|) |c_list_add_#in~head#1.offset| |c_list_add_#in~new#1.base|)))) (<= |v_list_add___list_add_~new#1.offset_27| (select (select |c_#memory_$Pointer$#1.offset| |v_list_add___list_add_~next#1.base_26|) .cse38))))) (<= |c_list_add_#in~new#1.offset| |v_list_add___list_add_~new#1.offset_27|))) (exists ((|v_list_add___list_add_~new#1.offset_27| Int)) (and (not (= |v_list_add___list_add_~new#1.offset_27| |c_list_add_#in~head#1.offset|)) (<= |c_list_add_#in~new#1.offset| |v_list_add___list_add_~new#1.offset_27|) (= |c_#memory_$Pointer$#1.base| (let ((.cse39 (let ((.cse40 (+ |v_list_add___list_add_~new#1.offset_27| 4))) (store (store .cse24 |v_list_add___list_add_~new#1.offset_27| (select .cse7 |v_list_add___list_add_~new#1.offset_27|)) .cse40 (select .cse7 .cse40))))) (store (store |c_old(#memory_$Pointer$#1.base)| |c_list_add_#in~new#1.base| .cse39) |c_list_add_#in~head#1.base| (store (select (store .cse23 |c_list_add_#in~new#1.base| .cse39) |c_list_add_#in~head#1.base|) |c_list_add_#in~head#1.offset| |c_list_add_#in~new#1.base|))))))) .cse32) (and (let ((.cse42 (+ (- 4) |c_list_add_#in~head#1.offset|))) (let ((.cse43 (select .cse7 .cse42))) (or (exists ((|v_list_add___list_add_~next#1.offset_28| Int)) (= |c_#memory_$Pointer$#1.base| (let ((.cse41 (store |c_old(#memory_$Pointer$#1.base)| |c_list_add_#in~new#1.base| (store (store .cse11 (+ |v_list_add___list_add_~next#1.offset_28| 4) |c_list_add_#in~new#1.base|) .cse42 .cse43)))) (store .cse41 |c_list_add_#in~head#1.base| (store (select .cse41 |c_list_add_#in~head#1.base|) |c_list_add_#in~head#1.offset| |c_list_add_#in~new#1.base|))))) (exists ((|v_list_add___list_add_~next#1.base_26| Int) (|v_list_add___list_add_~next#1.offset_28| Int)) (let ((.cse44 (+ |v_list_add___list_add_~next#1.offset_28| 4))) (and (<= |c_list_add_#in~head#1.offset| (+ (select (select |c_#memory_$Pointer$#1.offset| |v_list_add___list_add_~next#1.base_26|) .cse44) 4)) (= (let ((.cse45 (let ((.cse46 (store |c_old(#memory_$Pointer$#1.base)| |v_list_add___list_add_~next#1.base_26| (store (select |c_old(#memory_$Pointer$#1.base)| |v_list_add___list_add_~next#1.base_26|) .cse44 |c_list_add_#in~new#1.base|)))) (store .cse46 |c_list_add_#in~new#1.base| (store (select .cse46 |c_list_add_#in~new#1.base|) .cse42 .cse43))))) (store .cse45 |c_list_add_#in~head#1.base| (store (select .cse45 |c_list_add_#in~head#1.base|) |c_list_add_#in~head#1.offset| |c_list_add_#in~new#1.base|))) |c_#memory_$Pointer$#1.base|))))))) (<= (+ |c_list_add_#in~new#1.offset| 4) |c_list_add_#in~head#1.offset|) .cse21) (and (or (exists ((|v_list_add___list_add_~new#1.offset_27| Int)) (let ((.cse47 (+ |v_list_add___list_add_~new#1.offset_27| 4))) (and (not (= |v_list_add___list_add_~new#1.offset_27| |c_list_add_#in~head#1.offset|)) (not (= |c_list_add_#in~head#1.offset| .cse47)) (<= |c_list_add_#in~new#1.offset| |v_list_add___list_add_~new#1.offset_27|) (exists ((|v_list_add___list_add_~next#1.offset_28| Int)) (= |c_#memory_$Pointer$#1.base| (let ((.cse48 (store |c_old(#memory_$Pointer$#1.base)| |c_list_add_#in~new#1.base| (store (store (store .cse11 (+ |v_list_add___list_add_~next#1.offset_28| 4) |c_list_add_#in~new#1.base|) |v_list_add___list_add_~new#1.offset_27| (select .cse7 |v_list_add___list_add_~new#1.offset_27|)) .cse47 (select .cse7 .cse47))))) (store .cse48 |c_list_add_#in~head#1.base| (store (select .cse48 |c_list_add_#in~head#1.base|) |c_list_add_#in~head#1.offset| |c_list_add_#in~new#1.base|)))))))) (exists ((|v_list_add___list_add_~new#1.offset_27| Int)) (let ((.cse51 (+ |v_list_add___list_add_~new#1.offset_27| 4))) (and (not (= |v_list_add___list_add_~new#1.offset_27| |c_list_add_#in~head#1.offset|)) (exists ((|v_list_add___list_add_~next#1.base_26| Int) (|v_list_add___list_add_~next#1.offset_28| Int)) (let ((.cse52 (+ |v_list_add___list_add_~next#1.offset_28| 4))) (and (= |c_#memory_$Pointer$#1.base| (let ((.cse49 (let ((.cse50 (store |c_old(#memory_$Pointer$#1.base)| |v_list_add___list_add_~next#1.base_26| (store (select |c_old(#memory_$Pointer$#1.base)| |v_list_add___list_add_~next#1.base_26|) .cse52 |c_list_add_#in~new#1.base|)))) (store .cse50 |c_list_add_#in~new#1.base| (store (store (select .cse50 |c_list_add_#in~new#1.base|) |v_list_add___list_add_~new#1.offset_27| (select .cse7 |v_list_add___list_add_~new#1.offset_27|)) .cse51 (select .cse7 .cse51)))))) (store .cse49 |c_list_add_#in~head#1.base| (store (select .cse49 |c_list_add_#in~head#1.base|) |c_list_add_#in~head#1.offset| |c_list_add_#in~new#1.base|)))) (<= |v_list_add___list_add_~new#1.offset_27| (select (select |c_#memory_$Pointer$#1.offset| |v_list_add___list_add_~next#1.base_26|) .cse52))))) (not (= |c_list_add_#in~head#1.offset| .cse51)) (<= |c_list_add_#in~new#1.offset| |v_list_add___list_add_~new#1.offset_27|)))) .cse1) .cse32) (and (<= |c_list_add_#in~new#1.offset| |c_list_add_#in~head#1.offset|) (let ((.cse54 (+ |c_list_add_#in~head#1.offset| 4))) (let ((.cse55 (select .cse7 .cse54))) (or (exists ((|v_list_add___list_add_~next#1.offset_28| Int)) (= (let ((.cse53 (store |c_old(#memory_$Pointer$#1.base)| |c_list_add_#in~new#1.base| (store (store .cse11 (+ |v_list_add___list_add_~next#1.offset_28| 4) |c_list_add_#in~new#1.base|) .cse54 .cse55)))) (store .cse53 |c_list_add_#in~head#1.base| (store (select .cse53 |c_list_add_#in~head#1.base|) |c_list_add_#in~head#1.offset| |c_list_add_#in~new#1.base|))) |c_#memory_$Pointer$#1.base|)) (exists ((|v_list_add___list_add_~next#1.base_26| Int) (|v_list_add___list_add_~next#1.offset_28| Int)) (let ((.cse58 (+ |v_list_add___list_add_~next#1.offset_28| 4))) (and (= |c_#memory_$Pointer$#1.base| (let ((.cse56 (let ((.cse57 (store |c_old(#memory_$Pointer$#1.base)| |v_list_add___list_add_~next#1.base_26| (store (select |c_old(#memory_$Pointer$#1.base)| |v_list_add___list_add_~next#1.base_26|) .cse58 |c_list_add_#in~new#1.base|)))) (store .cse57 |c_list_add_#in~new#1.base| (store (select .cse57 |c_list_add_#in~new#1.base|) .cse54 .cse55))))) (store .cse56 |c_list_add_#in~head#1.base| (store (select .cse56 |c_list_add_#in~head#1.base|) |c_list_add_#in~head#1.offset| |c_list_add_#in~new#1.base|)))) (<= |c_list_add_#in~head#1.offset| (select (select |c_#memory_$Pointer$#1.offset| |v_list_add___list_add_~next#1.base_26|) .cse58)))))))) .cse21)))))) is different from false