./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/heap-manipulation/bubble_sort_linux-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc 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-2.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 3b13662719be51a1d3330a7f40f7706daa8c7b2d4044bc92f854095c09c7c129 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 14:32:16,344 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 14:32:16,405 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 14:32:16,409 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 14:32:16,412 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 14:32:16,438 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 14:32:16,439 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 14:32:16,439 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 14:32:16,439 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 14:32:16,440 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 14:32:16,440 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 14:32:16,440 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 14:32:16,440 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 14:32:16,441 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 14:32:16,441 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 14:32:16,441 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 14:32:16,441 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 14:32:16,441 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 14:32:16,441 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 14:32:16,442 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 14:32:16,442 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 14:32:16,442 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 14:32:16,442 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 14:32:16,442 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 14:32:16,442 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 14:32:16,442 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 14:32:16,442 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 14:32:16,442 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 14:32:16,442 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 14:32:16,442 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 14:32:16,442 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 14:32:16,442 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 14:32:16,443 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 14:32:16,443 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 14:32:16,443 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 14:32:16,443 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 14:32:16,443 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 14:32:16,443 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 14:32:16,443 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 14:32:16,443 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 14:32:16,443 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 14:32:16,443 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 14:32:16,443 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 14:32:16,443 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 -> 3b13662719be51a1d3330a7f40f7706daa8c7b2d4044bc92f854095c09c7c129 [2025-02-05 14:32:16,638 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 14:32:16,653 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 14:32:16,655 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 14:32:16,657 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 14:32:16,657 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 14:32:16,659 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-2.i [2025-02-05 14:32:17,891 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/977d9f4a3/c0ae9f42a69542b8a4514cccc9c27c51/FLAG2f83a698d [2025-02-05 14:32:18,204 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 14:32:18,205 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/heap-manipulation/bubble_sort_linux-2.i [2025-02-05 14:32:18,213 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/977d9f4a3/c0ae9f42a69542b8a4514cccc9c27c51/FLAG2f83a698d [2025-02-05 14:32:18,223 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/977d9f4a3/c0ae9f42a69542b8a4514cccc9c27c51 [2025-02-05 14:32:18,224 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 14:32:18,225 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 14:32:18,226 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 14:32:18,226 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 14:32:18,228 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 14:32:18,229 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 02:32:18" (1/1) ... [2025-02-05 14:32:18,229 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3db718ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:32:18, skipping insertion in model container [2025-02-05 14:32:18,230 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 02:32:18" (1/1) ... [2025-02-05 14:32:18,247 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 14:32:18,477 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-2.i[33822,33835] [2025-02-05 14:32:18,518 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 14:32:18,526 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 14:32:18,561 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-2.i[33822,33835] [2025-02-05 14:32:18,571 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 14:32:18,597 INFO L204 MainTranslator]: Completed translation [2025-02-05 14:32:18,598 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:32:18 WrapperNode [2025-02-05 14:32:18,598 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 14:32:18,599 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 14:32:18,599 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 14:32:18,599 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 14:32:18,603 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:32:18" (1/1) ... [2025-02-05 14:32:18,610 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:32:18" (1/1) ... [2025-02-05 14:32:18,622 INFO L138 Inliner]: procedures = 232, calls = 75, calls flagged for inlining = 10, calls inlined = 10, statements flattened = 114 [2025-02-05 14:32:18,622 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 14:32:18,623 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 14:32:18,623 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 14:32:18,623 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 14:32:18,628 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:32:18" (1/1) ... [2025-02-05 14:32:18,628 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:32:18" (1/1) ... [2025-02-05 14:32:18,631 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:32:18" (1/1) ... [2025-02-05 14:32:18,651 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-02-05 14:32:18,651 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:32:18" (1/1) ... [2025-02-05 14:32:18,651 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:32:18" (1/1) ... [2025-02-05 14:32:18,657 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:32:18" (1/1) ... [2025-02-05 14:32:18,661 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:32:18" (1/1) ... [2025-02-05 14:32:18,662 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:32:18" (1/1) ... [2025-02-05 14:32:18,663 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:32:18" (1/1) ... [2025-02-05 14:32:18,665 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 14:32:18,665 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 14:32:18,666 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 14:32:18,666 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 14:32:18,666 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:32:18" (1/1) ... [2025-02-05 14:32:18,669 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 14:32:18,678 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 14:32:18,691 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-02-05 14:32:18,699 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-02-05 14:32:18,720 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-02-05 14:32:18,720 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-02-05 14:32:18,720 INFO L130 BoogieDeclarations]: Found specification of procedure inspect [2025-02-05 14:32:18,720 INFO L138 BoogieDeclarations]: Found implementation of procedure inspect [2025-02-05 14:32:18,720 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-05 14:32:18,720 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-02-05 14:32:18,720 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-02-05 14:32:18,720 INFO L130 BoogieDeclarations]: Found specification of procedure val_from_node [2025-02-05 14:32:18,720 INFO L138 BoogieDeclarations]: Found implementation of procedure val_from_node [2025-02-05 14:32:18,720 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-05 14:32:18,720 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-05 14:32:18,720 INFO L130 BoogieDeclarations]: Found specification of procedure fail [2025-02-05 14:32:18,720 INFO L138 BoogieDeclarations]: Found implementation of procedure fail [2025-02-05 14:32:18,720 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-05 14:32:18,720 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-05 14:32:18,721 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-05 14:32:18,721 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 14:32:18,721 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-02-05 14:32:18,721 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-02-05 14:32:18,721 INFO L130 BoogieDeclarations]: Found specification of procedure list_add [2025-02-05 14:32:18,721 INFO L138 BoogieDeclarations]: Found implementation of procedure list_add [2025-02-05 14:32:18,721 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 14:32:18,721 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-05 14:32:18,721 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 14:32:18,721 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 14:32:18,816 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 14:32:18,817 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 14:32:18,834 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L923: havoc #t~mem54; [2025-02-05 14:32:19,033 INFO L? ?]: Removed 67 outVars from TransFormulas that were not future-live. [2025-02-05 14:32:19,033 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 14:32:19,040 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 14:32:19,040 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 14:32:19,041 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 02:32:19 BoogieIcfgContainer [2025-02-05 14:32:19,041 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 14:32:19,043 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 14:32:19,043 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 14:32:19,046 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 14:32:19,046 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 02:32:18" (1/3) ... [2025-02-05 14:32:19,046 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@535d2ad0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 02:32:19, skipping insertion in model container [2025-02-05 14:32:19,046 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:32:18" (2/3) ... [2025-02-05 14:32:19,047 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@535d2ad0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 02:32:19, skipping insertion in model container [2025-02-05 14:32:19,047 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 02:32:19" (3/3) ... [2025-02-05 14:32:19,048 INFO L128 eAbstractionObserver]: Analyzing ICFG bubble_sort_linux-2.i [2025-02-05 14:32:19,057 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 14:32:19,058 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG bubble_sort_linux-2.i that has 5 procedures, 123 locations, 1 initial locations, 23 loop locations, and 1 error locations. [2025-02-05 14:32:19,091 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 14:32:19,098 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;@448157a8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 14:32:19,098 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 14:32:19,100 INFO L276 IsEmpty]: Start isEmpty. Operand has 123 states, 94 states have (on average 1.6914893617021276) internal successors, (159), 113 states have internal predecessors, (159), 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-02-05 14:32:19,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-02-05 14:32:19,104 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 14:32:19,104 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 14:32:19,105 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 14:32:19,108 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 14:32:19,108 INFO L85 PathProgramCache]: Analyzing trace with hash 357163825, now seen corresponding path program 1 times [2025-02-05 14:32:19,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 14:32:19,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [102265877] [2025-02-05 14:32:19,113 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 14:32:19,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 14:32:19,162 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-05 14:32:19,166 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-05 14:32:19,166 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 14:32:19,167 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:32:19,214 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 14:32:19,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 14:32:19,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [102265877] [2025-02-05 14:32:19,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [102265877] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 14:32:19,215 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 14:32:19,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 14:32:19,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109528325] [2025-02-05 14:32:19,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 14:32:19,219 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-05 14:32:19,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 14:32:19,228 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-05 14:32:19,229 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 14:32:19,230 INFO L87 Difference]: Start difference. First operand has 123 states, 94 states have (on average 1.6914893617021276) internal successors, (159), 113 states have internal predecessors, (159), 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 4.0) internal successors, (8), 2 states have internal predecessors, (8), 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-02-05 14:32:19,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 14:32:19,251 INFO L93 Difference]: Finished difference Result 240 states and 405 transitions. [2025-02-05 14:32:19,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-05 14:32:19,252 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 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 10 [2025-02-05 14:32:19,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 14:32:19,256 INFO L225 Difference]: With dead ends: 240 [2025-02-05 14:32:19,256 INFO L226 Difference]: Without dead ends: 112 [2025-02-05 14:32:19,258 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-02-05 14:32:19,259 INFO L435 NwaCegarLoop]: 141 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, 141 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-02-05 14:32:19,260 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 14:32:19,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2025-02-05 14:32:19,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2025-02-05 14:32:19,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 87 states have (on average 1.2298850574712643) internal successors, (107), 102 states have internal predecessors, (107), 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-02-05 14:32:19,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 133 transitions. [2025-02-05 14:32:19,285 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 133 transitions. Word has length 10 [2025-02-05 14:32:19,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 14:32:19,285 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 133 transitions. [2025-02-05 14:32:19,285 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 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-02-05 14:32:19,285 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 133 transitions. [2025-02-05 14:32:19,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-02-05 14:32:19,286 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 14:32:19,286 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] [2025-02-05 14:32:19,286 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 14:32:19,286 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 14:32:19,287 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 14:32:19,287 INFO L85 PathProgramCache]: Analyzing trace with hash -1258694378, now seen corresponding path program 1 times [2025-02-05 14:32:19,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 14:32:19,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016800113] [2025-02-05 14:32:19,287 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 14:32:19,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 14:32:19,310 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-02-05 14:32:19,332 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-02-05 14:32:19,332 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 14:32:19,332 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:32:19,532 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 14:32:19,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 14:32:19,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1016800113] [2025-02-05 14:32:19,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1016800113] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 14:32:19,532 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 14:32:19,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 14:32:19,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25833109] [2025-02-05 14:32:19,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 14:32:19,533 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 14:32:19,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 14:32:19,534 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 14:32:19,534 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 14:32:19,534 INFO L87 Difference]: Start difference. First operand 112 states and 133 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 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-02-05 14:32:19,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 14:32:19,625 INFO L93 Difference]: Finished difference Result 114 states and 134 transitions. [2025-02-05 14:32:19,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 14:32:19,625 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 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 21 [2025-02-05 14:32:19,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 14:32:19,626 INFO L225 Difference]: With dead ends: 114 [2025-02-05 14:32:19,626 INFO L226 Difference]: Without dead ends: 111 [2025-02-05 14:32:19,627 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-02-05 14:32:19,627 INFO L435 NwaCegarLoop]: 117 mSDtfsCounter, 187 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 258 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-02-05 14:32:19,627 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [188 Valid, 258 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 14:32:19,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2025-02-05 14:32:19,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2025-02-05 14:32:19,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 87 states have (on average 1.2183908045977012) internal successors, (106), 101 states have internal predecessors, (106), 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-02-05 14:32:19,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 131 transitions. [2025-02-05 14:32:19,639 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 131 transitions. Word has length 21 [2025-02-05 14:32:19,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 14:32:19,640 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 131 transitions. [2025-02-05 14:32:19,640 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 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-02-05 14:32:19,640 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 131 transitions. [2025-02-05 14:32:19,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-02-05 14:32:19,640 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 14:32:19,640 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] [2025-02-05 14:32:19,641 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 14:32:19,641 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 14:32:19,641 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 14:32:19,641 INFO L85 PathProgramCache]: Analyzing trace with hash 1536977201, now seen corresponding path program 1 times [2025-02-05 14:32:19,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 14:32:19,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115723231] [2025-02-05 14:32:19,641 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 14:32:19,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 14:32:19,657 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-05 14:32:19,678 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-05 14:32:19,678 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 14:32:19,678 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:32:20,209 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 14:32:20,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 14:32:20,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2115723231] [2025-02-05 14:32:20,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2115723231] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 14:32:20,210 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 14:32:20,210 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-05 14:32:20,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905217441] [2025-02-05 14:32:20,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 14:32:20,210 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-05 14:32:20,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 14:32:20,211 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-05 14:32:20,211 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-02-05 14:32:20,211 INFO L87 Difference]: Start difference. First operand 111 states and 131 transitions. Second operand has 10 states, 10 states have (on average 2.0) internal successors, (20), 7 states have internal predecessors, (20), 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-02-05 14:32:20,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 14:32:20,664 INFO L93 Difference]: Finished difference Result 209 states and 246 transitions. [2025-02-05 14:32:20,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-05 14:32:20,665 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.0) internal successors, (20), 7 states have internal predecessors, (20), 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 24 [2025-02-05 14:32:20,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 14:32:20,667 INFO L225 Difference]: With dead ends: 209 [2025-02-05 14:32:20,667 INFO L226 Difference]: Without dead ends: 203 [2025-02-05 14:32:20,668 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-02-05 14:32:20,668 INFO L435 NwaCegarLoop]: 102 mSDtfsCounter, 384 mSDsluCounter, 523 mSDsCounter, 0 mSdLazyCounter, 417 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 385 SdHoareTripleChecker+Valid, 625 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-02-05 14:32:20,668 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [385 Valid, 625 Invalid, 467 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 417 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 14:32:20,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2025-02-05 14:32:20,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 183. [2025-02-05 14:32:20,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 155 states have (on average 1.2258064516129032) internal successors, (190), 169 states have internal predecessors, (190), 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-02-05 14:32:20,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 220 transitions. [2025-02-05 14:32:20,689 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 220 transitions. Word has length 24 [2025-02-05 14:32:20,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 14:32:20,690 INFO L471 AbstractCegarLoop]: Abstraction has 183 states and 220 transitions. [2025-02-05 14:32:20,690 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.0) internal successors, (20), 7 states have internal predecessors, (20), 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-02-05 14:32:20,690 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 220 transitions. [2025-02-05 14:32:20,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-02-05 14:32:20,690 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 14:32:20,690 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] [2025-02-05 14:32:20,690 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 14:32:20,691 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 14:32:20,691 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 14:32:20,691 INFO L85 PathProgramCache]: Analyzing trace with hash -621649773, now seen corresponding path program 1 times [2025-02-05 14:32:20,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 14:32:20,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218475561] [2025-02-05 14:32:20,691 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 14:32:20,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 14:32:20,712 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-02-05 14:32:20,746 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-02-05 14:32:20,747 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 14:32:20,747 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:32:21,456 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 14:32:21,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 14:32:21,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1218475561] [2025-02-05 14:32:21,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1218475561] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 14:32:21,457 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 14:32:21,457 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-05 14:32:21,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1206357055] [2025-02-05 14:32:21,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 14:32:21,458 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-05 14:32:21,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 14:32:21,458 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-05 14:32:21,458 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2025-02-05 14:32:21,459 INFO L87 Difference]: Start difference. First operand 183 states and 220 transitions. Second operand has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 7 states have internal predecessors, (23), 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-02-05 14:32:22,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 14:32:22,158 INFO L93 Difference]: Finished difference Result 290 states and 345 transitions. [2025-02-05 14:32:22,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-05 14:32:22,159 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 7 states have internal predecessors, (23), 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 27 [2025-02-05 14:32:22,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 14:32:22,161 INFO L225 Difference]: With dead ends: 290 [2025-02-05 14:32:22,161 INFO L226 Difference]: Without dead ends: 287 [2025-02-05 14:32:22,161 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-02-05 14:32:22,162 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 331 mSDsluCounter, 198 mSDsCounter, 0 mSdLazyCounter, 1005 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 334 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 1044 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 1005 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 14:32:22,162 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [334 Valid, 227 Invalid, 1044 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 1005 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 14:32:22,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2025-02-05 14:32:22,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 269. [2025-02-05 14:32:22,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 269 states, 234 states have (on average 1.2222222222222223) internal successors, (286), 249 states have internal predecessors, (286), 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-02-05 14:32:22,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 325 transitions. [2025-02-05 14:32:22,204 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 325 transitions. Word has length 27 [2025-02-05 14:32:22,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 14:32:22,204 INFO L471 AbstractCegarLoop]: Abstraction has 269 states and 325 transitions. [2025-02-05 14:32:22,205 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 7 states have internal predecessors, (23), 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-02-05 14:32:22,205 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 325 transitions. [2025-02-05 14:32:22,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-02-05 14:32:22,205 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 14:32:22,205 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] [2025-02-05 14:32:22,206 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 14:32:22,206 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 14:32:22,206 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 14:32:22,207 INFO L85 PathProgramCache]: Analyzing trace with hash -446688366, now seen corresponding path program 1 times [2025-02-05 14:32:22,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 14:32:22,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [281015718] [2025-02-05 14:32:22,207 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 14:32:22,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 14:32:22,222 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-02-05 14:32:22,242 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-02-05 14:32:22,242 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 14:32:22,242 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:32:22,695 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 14:32:22,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 14:32:22,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [281015718] [2025-02-05 14:32:22,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [281015718] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 14:32:22,696 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 14:32:22,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-05 14:32:22,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91169523] [2025-02-05 14:32:22,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 14:32:22,697 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-05 14:32:22,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 14:32:22,697 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-05 14:32:22,698 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2025-02-05 14:32:22,698 INFO L87 Difference]: Start difference. First operand 269 states and 325 transitions. Second operand has 11 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 7 states have internal predecessors, (27), 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-02-05 14:32:23,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 14:32:23,496 INFO L93 Difference]: Finished difference Result 289 states and 343 transitions. [2025-02-05 14:32:23,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-05 14:32:23,497 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 7 states have internal predecessors, (27), 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 31 [2025-02-05 14:32:23,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 14:32:23,498 INFO L225 Difference]: With dead ends: 289 [2025-02-05 14:32:23,498 INFO L226 Difference]: Without dead ends: 286 [2025-02-05 14:32:23,498 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-02-05 14:32:23,499 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 374 mSDsluCounter, 198 mSDsCounter, 0 mSdLazyCounter, 1005 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 377 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 1042 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 1005 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-05 14:32:23,499 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [377 Valid, 227 Invalid, 1042 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 1005 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-05 14:32:23,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2025-02-05 14:32:23,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 269. [2025-02-05 14:32:23,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 269 states, 234 states have (on average 1.2179487179487178) internal successors, (285), 249 states have internal predecessors, (285), 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-02-05 14:32:23,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 324 transitions. [2025-02-05 14:32:23,532 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 324 transitions. Word has length 31 [2025-02-05 14:32:23,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 14:32:23,532 INFO L471 AbstractCegarLoop]: Abstraction has 269 states and 324 transitions. [2025-02-05 14:32:23,532 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 7 states have internal predecessors, (27), 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-02-05 14:32:23,532 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 324 transitions. [2025-02-05 14:32:23,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-02-05 14:32:23,533 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 14:32:23,533 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] [2025-02-05 14:32:23,533 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 14:32:23,533 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 14:32:23,534 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 14:32:23,534 INFO L85 PathProgramCache]: Analyzing trace with hash -1558150741, now seen corresponding path program 1 times [2025-02-05 14:32:23,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 14:32:23,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [59165965] [2025-02-05 14:32:23,534 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 14:32:23,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 14:32:23,550 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-02-05 14:32:23,572 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-02-05 14:32:23,574 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 14:32:23,574 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:32:24,138 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 14:32:24,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 14:32:24,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [59165965] [2025-02-05 14:32:24,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [59165965] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 14:32:24,138 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 14:32:24,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-02-05 14:32:24,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536451120] [2025-02-05 14:32:24,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 14:32:24,139 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-05 14:32:24,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 14:32:24,139 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-05 14:32:24,140 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2025-02-05 14:32:24,140 INFO L87 Difference]: Start difference. First operand 269 states and 324 transitions. Second operand has 12 states, 12 states have (on average 2.5) internal successors, (30), 8 states have internal predecessors, (30), 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-02-05 14:32:24,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 14:32:24,884 INFO L93 Difference]: Finished difference Result 288 states and 341 transitions. [2025-02-05 14:32:24,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-05 14:32:24,884 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.5) internal successors, (30), 8 states have internal predecessors, (30), 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 34 [2025-02-05 14:32:24,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 14:32:24,886 INFO L225 Difference]: With dead ends: 288 [2025-02-05 14:32:24,886 INFO L226 Difference]: Without dead ends: 285 [2025-02-05 14:32:24,886 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-02-05 14:32:24,887 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 368 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 1097 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 371 SdHoareTripleChecker+Valid, 243 SdHoareTripleChecker+Invalid, 1132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 1097 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 14:32:24,887 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [371 Valid, 243 Invalid, 1132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 1097 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 14:32:24,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2025-02-05 14:32:24,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 269. [2025-02-05 14:32:24,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 269 states, 234 states have (on average 1.2136752136752136) internal successors, (284), 249 states have internal predecessors, (284), 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-02-05 14:32:24,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 323 transitions. [2025-02-05 14:32:24,909 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 323 transitions. Word has length 34 [2025-02-05 14:32:24,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 14:32:24,909 INFO L471 AbstractCegarLoop]: Abstraction has 269 states and 323 transitions. [2025-02-05 14:32:24,909 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.5) internal successors, (30), 8 states have internal predecessors, (30), 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-02-05 14:32:24,910 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 323 transitions. [2025-02-05 14:32:24,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-02-05 14:32:24,910 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 14:32:24,910 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] [2025-02-05 14:32:24,910 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 14:32:24,910 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 14:32:24,911 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 14:32:24,911 INFO L85 PathProgramCache]: Analyzing trace with hash 1059254863, now seen corresponding path program 1 times [2025-02-05 14:32:24,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 14:32:24,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [239785094] [2025-02-05 14:32:24,911 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 14:32:24,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 14:32:24,932 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-02-05 14:32:24,944 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-02-05 14:32:24,944 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 14:32:24,944 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:32:25,775 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 14:32:25,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 14:32:25,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [239785094] [2025-02-05 14:32:25,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [239785094] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 14:32:25,780 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 14:32:25,780 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-02-05 14:32:25,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1435894059] [2025-02-05 14:32:25,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 14:32:25,780 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-05 14:32:25,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 14:32:25,780 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-05 14:32:25,780 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2025-02-05 14:32:25,781 INFO L87 Difference]: Start difference. First operand 269 states and 323 transitions. Second operand has 12 states, 12 states have (on average 2.75) internal successors, (33), 8 states have internal predecessors, (33), 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-02-05 14:32:26,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 14:32:26,683 INFO L93 Difference]: Finished difference Result 287 states and 339 transitions. [2025-02-05 14:32:26,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-05 14:32:26,683 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.75) internal successors, (33), 8 states have internal predecessors, (33), 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 37 [2025-02-05 14:32:26,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 14:32:26,684 INFO L225 Difference]: With dead ends: 287 [2025-02-05 14:32:26,684 INFO L226 Difference]: Without dead ends: 284 [2025-02-05 14:32:26,685 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=66, Invalid=276, Unknown=0, NotChecked=0, Total=342 [2025-02-05 14:32:26,685 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 361 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 1095 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 364 SdHoareTripleChecker+Valid, 243 SdHoareTripleChecker+Invalid, 1128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 1095 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-05 14:32:26,685 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [364 Valid, 243 Invalid, 1128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 1095 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-05 14:32:26,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2025-02-05 14:32:26,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 269. [2025-02-05 14:32:26,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 269 states, 234 states have (on average 1.2094017094017093) internal successors, (283), 249 states have internal predecessors, (283), 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-02-05 14:32:26,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 322 transitions. [2025-02-05 14:32:26,704 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 322 transitions. Word has length 37 [2025-02-05 14:32:26,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 14:32:26,704 INFO L471 AbstractCegarLoop]: Abstraction has 269 states and 322 transitions. [2025-02-05 14:32:26,704 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.75) internal successors, (33), 8 states have internal predecessors, (33), 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-02-05 14:32:26,704 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 322 transitions. [2025-02-05 14:32:26,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-02-05 14:32:26,705 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 14:32:26,705 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] [2025-02-05 14:32:26,705 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 14:32:26,705 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 14:32:26,708 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 14:32:26,708 INFO L85 PathProgramCache]: Analyzing trace with hash 1792349983, now seen corresponding path program 1 times [2025-02-05 14:32:26,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 14:32:26,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1527552230] [2025-02-05 14:32:26,709 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 14:32:26,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 14:32:26,730 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-02-05 14:32:26,747 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-02-05 14:32:26,747 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 14:32:26,748 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:32:27,740 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-05 14:32:27,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 14:32:27,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1527552230] [2025-02-05 14:32:27,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1527552230] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 14:32:27,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [956865736] [2025-02-05 14:32:27,741 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 14:32:27,741 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 14:32:27,741 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 14:32:27,743 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-02-05 14:32:27,745 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-02-05 14:32:27,819 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-02-05 14:32:27,866 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-02-05 14:32:27,866 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 14:32:27,867 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:32:27,870 INFO L256 TraceCheckSpWp]: Trace formula consists of 355 conjuncts, 116 conjuncts are in the unsatisfiable core [2025-02-05 14:32:27,877 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 14:32:27,939 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-02-05 14:32:27,940 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-02-05 14:32:27,987 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-02-05 14:32:27,993 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-02-05 14:32:28,113 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 37 treesize of output 42 [2025-02-05 14:32:28,121 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 43 [2025-02-05 14:32:28,179 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 14:32:28,181 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 14 [2025-02-05 14:32:28,183 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 22 [2025-02-05 14:32:28,248 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-05 14:32:28,249 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-02-05 14:32:28,292 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 28 treesize of output 19 [2025-02-05 14:32:28,531 INFO L349 Elim1Store]: treesize reduction 172, result has 15.7 percent of original size [2025-02-05 14:32:28,532 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 107 treesize of output 96 [2025-02-05 14:32:28,542 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 14:32:28,543 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 14:32:28,555 INFO L349 Elim1Store]: treesize reduction 17, result has 43.3 percent of original size [2025-02-05 14:32:28,555 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 99 treesize of output 96 [2025-02-05 14:32:28,562 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 25 [2025-02-05 14:32:28,575 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-02-05 14:32:28,584 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-02-05 14:32:28,617 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-05 14:32:28,617 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 70 treesize of output 68 [2025-02-05 14:32:28,762 INFO L349 Elim1Store]: treesize reduction 40, result has 27.3 percent of original size [2025-02-05 14:32:28,762 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 96 treesize of output 81 [2025-02-05 14:32:29,255 INFO L349 Elim1Store]: treesize reduction 78, result has 24.3 percent of original size [2025-02-05 14:32:29,256 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 9 case distinctions, treesize of input 87 treesize of output 52 [2025-02-05 14:32:29,302 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 14:32:29,302 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 14:32:29,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [956865736] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 14:32:29,682 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-05 14:32:29,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15] total 29 [2025-02-05 14:32:29,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1805551709] [2025-02-05 14:32:29,682 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-05 14:32:29,683 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-02-05 14:32:29,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 14:32:29,683 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-02-05 14:32:29,684 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=1144, Unknown=14, NotChecked=0, Total=1260 [2025-02-05 14:32:29,684 INFO L87 Difference]: Start difference. First operand 269 states and 322 transitions. Second operand has 30 states, 30 states have (on average 2.1) internal successors, (63), 20 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-02-05 14:32:29,919 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse9 (select |c_old(#memory_$Pointer$#1.offset)| |c_list_add_#in~head#1.base|)) (.cse2 (select (select |c_old(#memory_$Pointer$#1.base)| |c_list_add_#in~head#1.base|) |c_list_add_#in~head#1.offset|))) (let ((.cse5 (select |c_old(#memory_$Pointer$#1.base)| .cse2)) (.cse1 (+ (select .cse9 |c_list_add_#in~head#1.offset|) 4)) (.cse3 (= |c_list_add_#in~head#1.base| .cse2)) (.cse0 (select |c_#memory_$Pointer$#1.offset| |c_list_add_#in~head#1.base|)) (.cse6 (= |c_list_add_#in~head#1.base| |c_list_add_#in~new#1.base|))) (and (or (and (or (= |c_list_add_#in~new#1.offset| (select .cse0 .cse1)) (= .cse1 |c_list_add_#in~head#1.offset|)) (= (select (select |c_#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|)) (= .cse2 |c_list_add_#in~new#1.base|) (not .cse3)) (= (select |c_#valid| 3) 1) (= |c_~#gl_list~0.offset| 0) (= 3 |c_~#gl_list~0.base|) (or (and (exists ((|v_list_add___list_add_~new#1.offset_15| Int) (|v_list_add___list_add_~next#1.offset_16| Int)) (= (let ((.cse4 (store |c_old(#memory_$Pointer$#1.base)| .cse2 (store .cse5 (+ |v_list_add___list_add_~next#1.offset_16| 4) |c_list_add_#in~new#1.base|)))) (store .cse4 |c_list_add_#in~head#1.base| (store (select (store .cse4 |c_list_add_#in~new#1.base| (store (store (select .cse4 |c_list_add_#in~new#1.base|) |v_list_add___list_add_~new#1.offset_15| .cse2) (+ |v_list_add___list_add_~new#1.offset_15| 4) |c_list_add_#in~head#1.base|)) |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|)) .cse6) (and (exists ((|v_list_add___list_add_~new#1.offset_15| Int) (|v_list_add___list_add_~next#1.offset_16| Int)) (= (let ((.cse7 (store |c_old(#memory_$Pointer$#1.base)| .cse2 (store .cse5 (+ |v_list_add___list_add_~next#1.offset_16| 4) |c_list_add_#in~new#1.base|)))) (store (store .cse7 |c_list_add_#in~new#1.base| (select |c_#memory_$Pointer$#1.base| |c_list_add_#in~new#1.base|)) |c_list_add_#in~head#1.base| (store (select (store .cse7 |c_list_add_#in~new#1.base| (store (store (select .cse7 |c_list_add_#in~new#1.base|) |v_list_add___list_add_~new#1.offset_15| .cse2) (+ |v_list_add___list_add_~new#1.offset_15| 4) |c_list_add_#in~head#1.base|)) |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 .cse6))) (exists ((v_ArrVal_386 (Array Int Int))) (= |c_#memory_$Pointer$#1.base| (let ((.cse8 (store (store |c_old(#memory_$Pointer$#1.base)| .cse2 (store .cse5 .cse1 |c_list_add_#in~new#1.base|)) |c_list_add_#in~new#1.base| v_ArrVal_386))) (store .cse8 |c_list_add_#in~head#1.base| (store (select .cse8 |c_list_add_#in~head#1.base|) |c_list_add_#in~head#1.offset| |c_list_add_#in~new#1.base|))))) (or (and (or (let ((.cse10 (@diff .cse9 .cse0))) (and (= .cse0 (store .cse9 .cse10 (select .cse0 .cse10))) (or (= .cse10 |c_list_add_#in~head#1.offset|) (= .cse0 .cse9)))) .cse3) (= |c_list_add_#in~new#1.offset| (select .cse0 |c_list_add_#in~head#1.offset|))) .cse6)))) is different from true [2025-02-05 14:32:33,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 14:32:33,229 INFO L93 Difference]: Finished difference Result 391 states and 460 transitions. [2025-02-05 14:32:33,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-02-05 14:32:33,230 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 2.1) internal successors, (63), 20 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 39 [2025-02-05 14:32:33,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 14:32:33,231 INFO L225 Difference]: With dead ends: 391 [2025-02-05 14:32:33,232 INFO L226 Difference]: Without dead ends: 388 [2025-02-05 14:32:33,232 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 415 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=312, Invalid=2431, Unknown=17, NotChecked=102, Total=2862 [2025-02-05 14:32:33,233 INFO L435 NwaCegarLoop]: 51 mSDtfsCounter, 1119 mSDsluCounter, 750 mSDsCounter, 0 mSdLazyCounter, 4167 mSolverCounterSat, 183 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1119 SdHoareTripleChecker+Valid, 801 SdHoareTripleChecker+Invalid, 4452 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 183 IncrementalHoareTripleChecker+Valid, 4167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 102 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2025-02-05 14:32:33,233 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1119 Valid, 801 Invalid, 4452 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [183 Valid, 4167 Invalid, 0 Unknown, 102 Unchecked, 2.7s Time] [2025-02-05 14:32:33,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2025-02-05 14:32:33,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 359. [2025-02-05 14:32:33,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 359 states, 316 states have (on average 1.2088607594936709) internal successors, (382), 332 states have internal predecessors, (382), 33 states have call successors, (33), 11 states have call predecessors, (33), 9 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-02-05 14:32:33,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 430 transitions. [2025-02-05 14:32:33,265 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 430 transitions. Word has length 39 [2025-02-05 14:32:33,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 14:32:33,266 INFO L471 AbstractCegarLoop]: Abstraction has 359 states and 430 transitions. [2025-02-05 14:32:33,266 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 2.1) internal successors, (63), 20 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-02-05 14:32:33,266 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 430 transitions. [2025-02-05 14:32:33,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-02-05 14:32:33,266 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 14:32:33,266 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, 1, 1, 1] [2025-02-05 14:32:33,274 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-05 14:32:33,470 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-02-05 14:32:33,471 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 14:32:33,471 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 14:32:33,471 INFO L85 PathProgramCache]: Analyzing trace with hash -1700035378, now seen corresponding path program 1 times [2025-02-05 14:32:33,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 14:32:33,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [628369401] [2025-02-05 14:32:33,472 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 14:32:33,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 14:32:33,482 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-02-05 14:32:33,494 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-02-05 14:32:33,494 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 14:32:33,494 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:32:33,959 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 14:32:33,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 14:32:33,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [628369401] [2025-02-05 14:32:33,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [628369401] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 14:32:33,961 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 14:32:33,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-02-05 14:32:33,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516891301] [2025-02-05 14:32:33,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 14:32:33,962 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-05 14:32:33,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 14:32:33,962 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-05 14:32:33,962 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2025-02-05 14:32:33,962 INFO L87 Difference]: Start difference. First operand 359 states and 430 transitions. Second operand has 13 states, 13 states have (on average 2.8461538461538463) internal successors, (37), 9 states have internal predecessors, (37), 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-02-05 14:32:34,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 14:32:34,779 INFO L93 Difference]: Finished difference Result 373 states and 442 transitions. [2025-02-05 14:32:34,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-02-05 14:32:34,780 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.8461538461538463) internal successors, (37), 9 states have internal predecessors, (37), 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 41 [2025-02-05 14:32:34,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 14:32:34,782 INFO L225 Difference]: With dead ends: 373 [2025-02-05 14:32:34,783 INFO L226 Difference]: Without dead ends: 370 [2025-02-05 14:32:34,783 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=131, Invalid=469, Unknown=0, NotChecked=0, Total=600 [2025-02-05 14:32:34,784 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 602 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 958 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 605 SdHoareTripleChecker+Valid, 211 SdHoareTripleChecker+Invalid, 1035 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 958 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 14:32:34,784 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [605 Valid, 211 Invalid, 1035 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 958 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 14:32:34,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2025-02-05 14:32:34,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 359. [2025-02-05 14:32:34,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 359 states, 316 states have (on average 1.2056962025316456) internal successors, (381), 332 states have internal predecessors, (381), 33 states have call successors, (33), 11 states have call predecessors, (33), 9 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-02-05 14:32:34,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 429 transitions. [2025-02-05 14:32:34,831 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 429 transitions. Word has length 41 [2025-02-05 14:32:34,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 14:32:34,831 INFO L471 AbstractCegarLoop]: Abstraction has 359 states and 429 transitions. [2025-02-05 14:32:34,831 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.8461538461538463) internal successors, (37), 9 states have internal predecessors, (37), 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-02-05 14:32:34,831 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 429 transitions. [2025-02-05 14:32:34,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-02-05 14:32:34,832 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 14:32:34,832 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, 1, 1] [2025-02-05 14:32:34,832 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 14:32:34,832 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 14:32:34,832 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 14:32:34,832 INFO L85 PathProgramCache]: Analyzing trace with hash -1062427618, now seen corresponding path program 1 times [2025-02-05 14:32:34,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 14:32:34,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1691718699] [2025-02-05 14:32:34,833 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 14:32:34,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 14:32:34,848 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-02-05 14:32:34,868 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-02-05 14:32:34,868 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 14:32:34,868 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:32:35,641 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-05 14:32:35,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 14:32:35,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1691718699] [2025-02-05 14:32:35,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1691718699] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 14:32:35,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [802930904] [2025-02-05 14:32:35,641 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 14:32:35,642 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 14:32:35,642 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 14:32:35,643 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-02-05 14:32:35,647 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-02-05 14:32:35,736 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-02-05 14:32:35,769 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-02-05 14:32:35,769 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 14:32:35,770 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:32:35,773 INFO L256 TraceCheckSpWp]: Trace formula consists of 362 conjuncts, 120 conjuncts are in the unsatisfiable core [2025-02-05 14:32:35,777 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 14:32:35,832 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-02-05 14:32:35,832 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-02-05 14:32:35,885 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-02-05 14:32:35,890 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-02-05 14:32:36,379 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 61 treesize of output 58 [2025-02-05 14:32:36,382 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 56 [2025-02-05 14:32:36,394 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 30 [2025-02-05 14:32:36,401 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 1 [2025-02-05 14:32:36,416 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 41 treesize of output 46 [2025-02-05 14:32:36,419 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 14:32:36,421 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 51 treesize of output 30 [2025-02-05 14:32:36,429 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 3 [2025-02-05 14:32:36,493 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-02-05 14:32:36,494 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 147 treesize of output 120 [2025-02-05 14:32:36,502 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 18 [2025-02-05 14:32:36,508 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 35 treesize of output 18 [2025-02-05 14:32:36,593 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-05 14:32:36,593 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-02-05 14:32:36,651 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 28 treesize of output 19 [2025-02-05 14:32:36,656 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 27 treesize of output 18 [2025-02-05 14:32:55,371 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 14:32:55,383 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 14:33:01,842 WARN L286 SmtUtils]: Spent 6.39s on a formula simplification. DAG size of input: 80 DAG size of output: 35 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2025-02-05 14:33:01,843 INFO L349 Elim1Store]: treesize reduction 312, result has 24.8 percent of original size [2025-02-05 14:33:01,843 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 6 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 8 new quantified variables, introduced 6 case distinctions, treesize of input 472 treesize of output 922 [2025-02-05 14:33:01,892 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 623 treesize of output 419 [2025-02-05 14:33:03,676 INFO L224 Elim1Store]: Index analysis took 1658 ms [2025-02-05 14:33:04,208 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 3 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 118 treesize of output 352 [2025-02-05 14:33:04,878 INFO L224 Elim1Store]: Index analysis took 583 ms [2025-02-05 14:33:09,813 INFO L349 Elim1Store]: treesize reduction 122, result has 25.2 percent of original size [2025-02-05 14:33:09,813 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 3 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 6 case distinctions, treesize of input 85 treesize of output 164 [2025-02-05 14:33:10,881 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 14:33:10,961 INFO L224 Elim1Store]: Index analysis took 111 ms [2025-02-05 14:33:11,214 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 43 [2025-02-05 14:33:11,435 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 14:33:11,518 INFO L224 Elim1Store]: Index analysis took 150 ms [2025-02-05 14:33:11,852 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 43 [2025-02-05 14:33:13,035 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 14:33:13,140 INFO L224 Elim1Store]: Index analysis took 168 ms [2025-02-05 14:33:13,425 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 43 [2025-02-05 14:33:19,555 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-05 14:33:21,278 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-05 14:33:23,271 INFO L224 Elim1Store]: Index analysis took 7041 ms [2025-02-05 14:33:24,067 INFO L349 Elim1Store]: treesize reduction 61, result has 11.6 percent of original size [2025-02-05 14:33:24,068 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 5 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 11 case distinctions, treesize of input 301 treesize of output 371 [2025-02-05 14:33:27,270 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-05 14:33:28,346 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-05 14:33:28,478 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-05 14:33:28,960 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-05 14:33:29,190 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-05 14:33:29,393 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-05 14:33:29,508 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-05 14:33:29,547 INFO L224 Elim1Store]: Index analysis took 2277 ms [2025-02-05 14:33:29,550 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 5 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 290 treesize of output 354 [2025-02-05 14:33:33,504 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-05 14:33:35,120 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-05 14:33:37,557 INFO L224 Elim1Store]: Index analysis took 7180 ms [2025-02-05 14:33:38,942 INFO L349 Elim1Store]: treesize reduction 61, result has 11.6 percent of original size [2025-02-05 14:33:38,943 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 5 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 11 case distinctions, treesize of input 301 treesize of output 371 [2025-02-05 14:33:41,476 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-05 14:33:42,089 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-05 14:33:42,090 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-05 14:33:42,458 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-05 14:33:42,630 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-05 14:33:42,630 INFO L224 Elim1Store]: Index analysis took 1155 ms [2025-02-05 14:33:42,635 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 4 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 515 treesize of output 539 [2025-02-05 14:33:42,812 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 14:33:43,147 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 14:33:43,313 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 14:33:44,679 INFO L224 Elim1Store]: Index analysis took 1888 ms [2025-02-05 14:33:44,902 INFO L349 Elim1Store]: treesize reduction 528, result has 0.2 percent of original size [2025-02-05 14:33:44,902 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 8 case distinctions, treesize of input 335 treesize of output 134 [2025-02-05 14:33:47,262 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-05 14:33:48,209 INFO L224 Elim1Store]: Index analysis took 1988 ms [2025-02-05 14:33:48,858 INFO L349 Elim1Store]: treesize reduction 49, result has 14.0 percent of original size [2025-02-05 14:33:48,858 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 4 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 9 case distinctions, treesize of input 837 treesize of output 867 [2025-02-05 14:33:49,698 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 14:33:49,974 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 14:33:50,120 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 14:33:50,977 INFO L224 Elim1Store]: Index analysis took 1294 ms [2025-02-05 14:33:53,129 INFO L349 Elim1Store]: treesize reduction 576, result has 23.5 percent of original size [2025-02-05 14:33:53,129 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 3 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 12 case distinctions, treesize of input 652 treesize of output 846