./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/heap-manipulation/merge_sort-1.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/merge_sort-1.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 15d1d7d49ed223522c6431664b8ff836ebc81296f5e11773e2197361bd8b13cf --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 14:32:30,590 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 14:32:30,647 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:30,653 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 14:32:30,653 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 14:32:30,674 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 14:32:30,676 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 14:32:30,676 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 14:32:30,677 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 14:32:30,677 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 14:32:30,677 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 14:32:30,678 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 14:32:30,678 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 14:32:30,678 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 14:32:30,678 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 14:32:30,678 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 14:32:30,678 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 14:32:30,678 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 14:32:30,678 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 14:32:30,678 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 14:32:30,679 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 14:32:30,679 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 14:32:30,679 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 14:32:30,679 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 14:32:30,679 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 14:32:30,679 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 14:32:30,679 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 14:32:30,679 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 14:32:30,679 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 14:32:30,680 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 14:32:30,680 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 14:32:30,680 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 14:32:30,680 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 14:32:30,680 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 14:32:30,680 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 14:32:30,680 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 14:32:30,680 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 14:32:30,681 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 14:32:30,681 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 14:32:30,681 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 14:32:30,681 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 14:32:30,681 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 14:32:30,681 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 14:32:30,681 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 -> 15d1d7d49ed223522c6431664b8ff836ebc81296f5e11773e2197361bd8b13cf [2025-02-05 14:32:30,879 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 14:32:30,885 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 14:32:30,888 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 14:32:30,889 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 14:32:30,889 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 14:32:30,890 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/heap-manipulation/merge_sort-1.i [2025-02-05 14:32:32,110 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9fdf70d61/0596af5638144b5bb8fad5e280a2a23c/FLAGf247fbede [2025-02-05 14:32:32,435 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 14:32:32,435 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/heap-manipulation/merge_sort-1.i [2025-02-05 14:32:32,454 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9fdf70d61/0596af5638144b5bb8fad5e280a2a23c/FLAGf247fbede [2025-02-05 14:32:32,473 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9fdf70d61/0596af5638144b5bb8fad5e280a2a23c [2025-02-05 14:32:32,477 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 14:32:32,482 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 14:32:32,483 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 14:32:32,483 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 14:32:32,490 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 14:32:32,490 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 02:32:32" (1/1) ... [2025-02-05 14:32:32,491 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6ccd5bc0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:32:32, skipping insertion in model container [2025-02-05 14:32:32,491 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 02:32:32" (1/1) ... [2025-02-05 14:32:32,526 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 14:32:32,767 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/merge_sort-1.i[22632,22645] [2025-02-05 14:32:32,799 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 14:32:32,810 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 14:32:32,839 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/merge_sort-1.i[22632,22645] [2025-02-05 14:32:32,859 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 14:32:32,882 INFO L204 MainTranslator]: Completed translation [2025-02-05 14:32:32,883 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:32:32 WrapperNode [2025-02-05 14:32:32,883 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 14:32:32,884 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 14:32:32,884 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 14:32:32,884 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 14:32:32,888 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:32" (1/1) ... [2025-02-05 14:32:32,899 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:32" (1/1) ... [2025-02-05 14:32:32,917 INFO L138 Inliner]: procedures = 125, calls = 83, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 264 [2025-02-05 14:32:32,918 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 14:32:32,918 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 14:32:32,918 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 14:32:32,918 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 14:32:32,925 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:32" (1/1) ... [2025-02-05 14:32:32,925 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:32" (1/1) ... [2025-02-05 14:32:32,932 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:32" (1/1) ... [2025-02-05 14:32:32,961 INFO L175 MemorySlicer]: Split 49 memory accesses to 4 slices as follows [2, 10, 3, 34]. 69 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0]. The 13 writes are split as follows [0, 3, 2, 8]. [2025-02-05 14:32:32,965 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:32" (1/1) ... [2025-02-05 14:32:32,965 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:32" (1/1) ... [2025-02-05 14:32:32,974 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:32" (1/1) ... [2025-02-05 14:32:32,974 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:32" (1/1) ... [2025-02-05 14:32:32,976 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:32" (1/1) ... [2025-02-05 14:32:32,976 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:32" (1/1) ... [2025-02-05 14:32:32,978 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 14:32:32,979 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 14:32:32,979 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 14:32:32,979 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 14:32:32,980 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:32:32" (1/1) ... [2025-02-05 14:32:32,989 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 14:32:32,999 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 14:32:33,017 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:33,021 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:33,039 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-05 14:32:33,039 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-05 14:32:33,039 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-05 14:32:33,039 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-02-05 14:32:33,039 INFO L130 BoogieDeclarations]: Found specification of procedure merge_single_node [2025-02-05 14:32:33,039 INFO L138 BoogieDeclarations]: Found implementation of procedure merge_single_node [2025-02-05 14:32:33,039 INFO L130 BoogieDeclarations]: Found specification of procedure fail [2025-02-05 14:32:33,039 INFO L138 BoogieDeclarations]: Found implementation of procedure fail [2025-02-05 14:32:33,039 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-05 14:32:33,039 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-05 14:32:33,039 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-05 14:32:33,039 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-02-05 14:32:33,040 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-05 14:32:33,040 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 14:32:33,040 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-05 14:32:33,040 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-02-05 14:32:33,040 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-02-05 14:32:33,040 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-02-05 14:32:33,040 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-02-05 14:32:33,040 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-02-05 14:32:33,040 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-02-05 14:32:33,040 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-02-05 14:32:33,040 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-02-05 14:32:33,040 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-05 14:32:33,040 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 14:32:33,040 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-05 14:32:33,040 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-05 14:32:33,040 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-02-05 14:32:33,040 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 14:32:33,040 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 14:32:33,178 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 14:32:33,179 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 14:32:33,508 INFO L? ?]: Removed 66 outVars from TransFormulas that were not future-live. [2025-02-05 14:32:33,509 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 14:32:33,520 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 14:32:33,521 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 14:32:33,521 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 02:32:33 BoogieIcfgContainer [2025-02-05 14:32:33,521 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 14:32:33,524 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 14:32:33,524 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 14:32:33,528 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 14:32:33,528 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 02:32:32" (1/3) ... [2025-02-05 14:32:33,529 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@387646c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 02:32:33, skipping insertion in model container [2025-02-05 14:32:33,530 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:32:32" (2/3) ... [2025-02-05 14:32:33,530 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@387646c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 02:32:33, skipping insertion in model container [2025-02-05 14:32:33,531 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 02:32:33" (3/3) ... [2025-02-05 14:32:33,531 INFO L128 eAbstractionObserver]: Analyzing ICFG merge_sort-1.i [2025-02-05 14:32:33,542 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 14:32:33,544 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG merge_sort-1.i that has 3 procedures, 98 locations, 1 initial locations, 20 loop locations, and 1 error locations. [2025-02-05 14:32:33,588 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 14:32:33,596 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;@4d45ceab, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 14:32:33,596 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 14:32:33,599 INFO L276 IsEmpty]: Start isEmpty. Operand has 98 states, 79 states have (on average 1.759493670886076) internal successors, (139), 95 states have internal predecessors, (139), 15 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2025-02-05 14:32:33,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-02-05 14:32:33,602 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 14:32:33,603 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 14:32:33,603 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 14:32:33,606 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 14:32:33,606 INFO L85 PathProgramCache]: Analyzing trace with hash -944515600, now seen corresponding path program 1 times [2025-02-05 14:32:33,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 14:32:33,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1964562981] [2025-02-05 14:32:33,611 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 14:32:33,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 14:32:33,658 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-05 14:32:33,661 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-05 14:32:33,661 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 14:32:33,661 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:32:33,708 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,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 14:32:33,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1964562981] [2025-02-05 14:32:33,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1964562981] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 14:32:33,709 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 14:32:33,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 14:32:33,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [887452175] [2025-02-05 14:32:33,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 14:32:33,716 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-05 14:32:33,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 14:32:33,738 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-05 14:32:33,738 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 14:32:33,741 INFO L87 Difference]: Start difference. First operand has 98 states, 79 states have (on average 1.759493670886076) internal successors, (139), 95 states have internal predecessors, (139), 15 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 14:32:33,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 14:32:33,772 INFO L93 Difference]: Finished difference Result 192 states and 335 transitions. [2025-02-05 14:32:33,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-05 14:32:33,773 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-02-05 14:32:33,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 14:32:33,782 INFO L225 Difference]: With dead ends: 192 [2025-02-05 14:32:33,782 INFO L226 Difference]: Without dead ends: 90 [2025-02-05 14:32:33,788 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:33,790 INFO L435 NwaCegarLoop]: 121 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, 121 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:33,792 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 121 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:33,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2025-02-05 14:32:33,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2025-02-05 14:32:33,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 73 states have (on average 1.3150684931506849) internal successors, (96), 87 states have internal predecessors, (96), 15 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-05 14:32:33,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 113 transitions. [2025-02-05 14:32:33,857 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 113 transitions. Word has length 8 [2025-02-05 14:32:33,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 14:32:33,857 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 113 transitions. [2025-02-05 14:32:33,857 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 14:32:33,857 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 113 transitions. [2025-02-05 14:32:33,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-02-05 14:32:33,857 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 14:32:33,858 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 14:32:33,858 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 14:32:33,858 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 14:32:33,858 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 14:32:33,858 INFO L85 PathProgramCache]: Analyzing trace with hash 160502903, now seen corresponding path program 1 times [2025-02-05 14:32:33,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 14:32:33,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1063370994] [2025-02-05 14:32:33,859 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 14:32:33,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 14:32:33,864 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-05 14:32:33,867 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-05 14:32:33,867 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 14:32:33,867 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:32:33,928 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,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 14:32:33,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1063370994] [2025-02-05 14:32:33,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1063370994] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 14:32:33,933 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 14:32:33,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 14:32:33,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951951527] [2025-02-05 14:32:33,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 14:32:33,933 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 14:32:33,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 14:32:33,934 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 14:32:33,934 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 14:32:33,934 INFO L87 Difference]: Start difference. First operand 90 states and 113 transitions. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 14:32:33,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 14:32:33,956 INFO L93 Difference]: Finished difference Result 178 states and 224 transitions. [2025-02-05 14:32:33,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 14:32:33,957 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2025-02-05 14:32:33,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 14:32:33,958 INFO L225 Difference]: With dead ends: 178 [2025-02-05 14:32:33,959 INFO L226 Difference]: Without dead ends: 96 [2025-02-05 14:32:33,960 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 14:32:33,960 INFO L435 NwaCegarLoop]: 112 mSDtfsCounter, 4 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 218 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 14:32:33,961 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 218 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 14:32:33,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2025-02-05 14:32:33,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 92. [2025-02-05 14:32:33,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 75 states have (on average 1.3066666666666666) internal successors, (98), 89 states have internal predecessors, (98), 15 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-05 14:32:33,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 115 transitions. [2025-02-05 14:32:33,968 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 115 transitions. Word has length 9 [2025-02-05 14:32:33,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 14:32:33,969 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 115 transitions. [2025-02-05 14:32:33,970 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 14:32:33,970 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 115 transitions. [2025-02-05 14:32:33,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-02-05 14:32:33,970 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 14:32:33,970 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 14:32:33,970 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 14:32:33,970 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 14:32:33,971 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 14:32:33,971 INFO L85 PathProgramCache]: Analyzing trace with hash -898659524, now seen corresponding path program 1 times [2025-02-05 14:32:33,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 14:32:33,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1144979535] [2025-02-05 14:32:33,971 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 14:32:33,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 14:32:33,981 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-05 14:32:33,994 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-05 14:32:33,994 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 14:32:33,994 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:32:34,125 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 14:32:34,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 14:32:34,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1144979535] [2025-02-05 14:32:34,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1144979535] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 14:32:34,126 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 14:32:34,126 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 14:32:34,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032894042] [2025-02-05 14:32:34,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 14:32:34,126 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 14:32:34,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 14:32:34,127 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 14:32:34,127 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 14:32:34,127 INFO L87 Difference]: Start difference. First operand 92 states and 115 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 14:32:34,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 14:32:34,238 INFO L93 Difference]: Finished difference Result 151 states and 187 transitions. [2025-02-05 14:32:34,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 14:32:34,238 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2025-02-05 14:32:34,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 14:32:34,239 INFO L225 Difference]: With dead ends: 151 [2025-02-05 14:32:34,239 INFO L226 Difference]: Without dead ends: 146 [2025-02-05 14:32:34,240 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-05 14:32:34,240 INFO L435 NwaCegarLoop]: 94 mSDtfsCounter, 136 mSDsluCounter, 239 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 333 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 14:32:34,240 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 333 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 14:32:34,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2025-02-05 14:32:34,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 97. [2025-02-05 14:32:34,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 81 states have (on average 1.2839506172839505) internal successors, (104), 94 states have internal predecessors, (104), 14 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-05 14:32:34,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 120 transitions. [2025-02-05 14:32:34,249 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 120 transitions. Word has length 15 [2025-02-05 14:32:34,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 14:32:34,249 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 120 transitions. [2025-02-05 14:32:34,249 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 14:32:34,249 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 120 transitions. [2025-02-05 14:32:34,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-02-05 14:32:34,249 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 14:32:34,250 INFO L218 NwaCegarLoop]: trace histogram [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,250 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 14:32:34,250 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 14:32:34,250 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 14:32:34,250 INFO L85 PathProgramCache]: Analyzing trace with hash 1096116759, now seen corresponding path program 1 times [2025-02-05 14:32:34,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 14:32:34,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [238129973] [2025-02-05 14:32:34,251 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 14:32:34,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 14:32:34,264 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-02-05 14:32:34,275 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-02-05 14:32:34,275 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 14:32:34,276 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:32:34,402 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-05 14:32:34,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 14:32:34,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [238129973] [2025-02-05 14:32:34,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [238129973] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 14:32:34,403 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 14:32:34,403 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 14:32:34,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [489071049] [2025-02-05 14:32:34,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 14:32:34,404 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 14:32:34,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 14:32:34,404 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 14:32:34,405 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 14:32:34,405 INFO L87 Difference]: Start difference. First operand 97 states and 120 transitions. Second operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 14:32:34,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 14:32:34,620 INFO L93 Difference]: Finished difference Result 99 states and 121 transitions. [2025-02-05 14:32:34,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 14:32:34,621 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2025-02-05 14:32:34,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 14:32:34,622 INFO L225 Difference]: With dead ends: 99 [2025-02-05 14:32:34,622 INFO L226 Difference]: Without dead ends: 96 [2025-02-05 14:32:34,622 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-05 14:32:34,622 INFO L435 NwaCegarLoop]: 100 mSDtfsCounter, 12 mSDsluCounter, 237 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 337 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 14:32:34,622 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 337 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 14:32:34,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2025-02-05 14:32:34,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2025-02-05 14:32:34,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 81 states have (on average 1.271604938271605) internal successors, (103), 93 states have internal predecessors, (103), 13 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-05 14:32:34,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 118 transitions. [2025-02-05 14:32:34,638 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 118 transitions. Word has length 23 [2025-02-05 14:32:34,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 14:32:34,638 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 118 transitions. [2025-02-05 14:32:34,638 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 14:32:34,638 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 118 transitions. [2025-02-05 14:32:34,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-02-05 14:32:34,639 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 14:32:34,639 INFO L218 NwaCegarLoop]: trace histogram [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,639 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 14:32:34,639 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 14:32:34,639 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 14:32:34,639 INFO L85 PathProgramCache]: Analyzing trace with hash 2013204577, now seen corresponding path program 1 times [2025-02-05 14:32:34,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 14:32:34,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457199350] [2025-02-05 14:32:34,639 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 14:32:34,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 14:32:34,654 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-02-05 14:32:34,661 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-02-05 14:32:34,664 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 14:32:34,664 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:32:34,807 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-05 14:32:34,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 14:32:34,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [457199350] [2025-02-05 14:32:34,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [457199350] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 14:32:34,807 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 14:32:34,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 14:32:34,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831201059] [2025-02-05 14:32:34,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 14:32:34,808 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 14:32:34,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 14:32:34,808 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 14:32:34,808 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 14:32:34,808 INFO L87 Difference]: Start difference. First operand 96 states and 118 transitions. Second operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 14:32:34,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 14:32:34,902 INFO L93 Difference]: Finished difference Result 98 states and 119 transitions. [2025-02-05 14:32:34,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 14:32:34,902 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2025-02-05 14:32:34,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 14:32:34,903 INFO L225 Difference]: With dead ends: 98 [2025-02-05 14:32:34,903 INFO L226 Difference]: Without dead ends: 95 [2025-02-05 14:32:34,903 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-05 14:32:34,904 INFO L435 NwaCegarLoop]: 99 mSDtfsCounter, 12 mSDsluCounter, 232 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 331 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 14:32:34,904 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 331 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 14:32:34,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2025-02-05 14:32:34,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2025-02-05 14:32:34,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 81 states have (on average 1.2592592592592593) internal successors, (102), 92 states have internal predecessors, (102), 12 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-05 14:32:34,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 116 transitions. [2025-02-05 14:32:34,910 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 116 transitions. Word has length 23 [2025-02-05 14:32:34,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 14:32:34,910 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 116 transitions. [2025-02-05 14:32:34,910 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 14:32:34,910 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 116 transitions. [2025-02-05 14:32:34,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-02-05 14:32:34,911 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 14:32:34,911 INFO L218 NwaCegarLoop]: trace histogram [2, 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:34,911 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 14:32:34,911 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 14:32:34,911 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 14:32:34,911 INFO L85 PathProgramCache]: Analyzing trace with hash -252488023, now seen corresponding path program 1 times [2025-02-05 14:32:34,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 14:32:34,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [752378861] [2025-02-05 14:32:34,912 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 14:32:34,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 14:32:34,920 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-02-05 14:32:34,925 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-02-05 14:32:34,925 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 14:32:34,925 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:32:35,015 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 14:32:35,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 14:32:35,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [752378861] [2025-02-05 14:32:35,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [752378861] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 14:32:35,016 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 14:32:35,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 14:32:35,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1589970270] [2025-02-05 14:32:35,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 14:32:35,016 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 14:32:35,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 14:32:35,017 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 14:32:35,017 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 14:32:35,017 INFO L87 Difference]: Start difference. First operand 95 states and 116 transitions. Second operand has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 14:32:35,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 14:32:35,183 INFO L93 Difference]: Finished difference Result 146 states and 175 transitions. [2025-02-05 14:32:35,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 14:32:35,184 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2025-02-05 14:32:35,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 14:32:35,185 INFO L225 Difference]: With dead ends: 146 [2025-02-05 14:32:35,185 INFO L226 Difference]: Without dead ends: 143 [2025-02-05 14:32:35,185 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-02-05 14:32:35,186 INFO L435 NwaCegarLoop]: 84 mSDtfsCounter, 116 mSDsluCounter, 265 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 349 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 14:32:35,187 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 349 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 14:32:35,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2025-02-05 14:32:35,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 101. [2025-02-05 14:32:35,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 87 states have (on average 1.2413793103448276) internal successors, (108), 98 states have internal predecessors, (108), 12 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-05 14:32:35,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 122 transitions. [2025-02-05 14:32:35,196 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 122 transitions. Word has length 26 [2025-02-05 14:32:35,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 14:32:35,196 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 122 transitions. [2025-02-05 14:32:35,197 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 14:32:35,197 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 122 transitions. [2025-02-05 14:32:35,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-02-05 14:32:35,197 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 14:32:35,197 INFO L218 NwaCegarLoop]: trace histogram [2, 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:35,197 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 14:32:35,197 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 14:32:35,198 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 14:32:35,198 INFO L85 PathProgramCache]: Analyzing trace with hash 403442162, now seen corresponding path program 1 times [2025-02-05 14:32:35,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 14:32:35,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6715422] [2025-02-05 14:32:35,198 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 14:32:35,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 14:32:35,206 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-02-05 14:32:35,209 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-02-05 14:32:35,209 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 14:32:35,209 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:32:35,302 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 14:32:35,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 14:32:35,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [6715422] [2025-02-05 14:32:35,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [6715422] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 14:32:35,302 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 14:32:35,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 14:32:35,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372783237] [2025-02-05 14:32:35,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 14:32:35,303 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 14:32:35,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 14:32:35,303 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 14:32:35,303 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 14:32:35,303 INFO L87 Difference]: Start difference. First operand 101 states and 122 transitions. Second operand has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 14:32:35,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 14:32:35,467 INFO L93 Difference]: Finished difference Result 145 states and 173 transitions. [2025-02-05 14:32:35,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 14:32:35,468 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2025-02-05 14:32:35,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 14:32:35,468 INFO L225 Difference]: With dead ends: 145 [2025-02-05 14:32:35,469 INFO L226 Difference]: Without dead ends: 142 [2025-02-05 14:32:35,469 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-02-05 14:32:35,469 INFO L435 NwaCegarLoop]: 84 mSDtfsCounter, 114 mSDsluCounter, 265 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 349 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 14:32:35,469 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 349 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 14:32:35,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2025-02-05 14:32:35,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 107. [2025-02-05 14:32:35,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 93 states have (on average 1.2258064516129032) internal successors, (114), 104 states have internal predecessors, (114), 12 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-05 14:32:35,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 128 transitions. [2025-02-05 14:32:35,485 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 128 transitions. Word has length 26 [2025-02-05 14:32:35,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 14:32:35,486 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 128 transitions. [2025-02-05 14:32:35,486 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 14:32:35,486 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 128 transitions. [2025-02-05 14:32:35,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-02-05 14:32:35,487 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 14:32:35,487 INFO L218 NwaCegarLoop]: trace histogram [2, 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:35,487 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 14:32:35,487 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 14:32:35,488 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 14:32:35,488 INFO L85 PathProgramCache]: Analyzing trace with hash -1418294732, now seen corresponding path program 1 times [2025-02-05 14:32:35,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 14:32:35,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [592926461] [2025-02-05 14:32:35,488 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 14:32:35,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 14:32:35,496 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-02-05 14:32:35,504 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-02-05 14:32:35,505 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 14:32:35,505 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:32:35,786 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 14:32:35,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 14:32:35,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [592926461] [2025-02-05 14:32:35,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [592926461] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 14:32:35,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1223240049] [2025-02-05 14:32:35,786 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 14:32:35,786 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 14:32:35,787 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 14:32:35,788 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:35,790 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:35,857 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-02-05 14:32:35,875 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-02-05 14:32:35,875 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 14:32:35,875 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:32:35,877 INFO L256 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-02-05 14:32:35,880 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 14:32:35,942 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 7 [2025-02-05 14:32:35,946 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 7 [2025-02-05 14:32:36,015 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 14:32:36,016 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 14:32:36,105 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 14:32:36,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1223240049] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 14:32:36,106 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 14:32:36,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 6] total 13 [2025-02-05 14:32:36,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [97668068] [2025-02-05 14:32:36,106 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 14:32:36,107 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-05 14:32:36,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 14:32:36,107 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-05 14:32:36,107 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2025-02-05 14:32:36,107 INFO L87 Difference]: Start difference. First operand 107 states and 128 transitions. Second operand has 13 states, 13 states have (on average 3.5384615384615383) internal successors, (46), 13 states have internal predecessors, (46), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 14:32:36,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 14:32:36,403 INFO L93 Difference]: Finished difference Result 239 states and 287 transitions. [2025-02-05 14:32:36,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 14:32:36,403 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.5384615384615383) internal successors, (46), 13 states have internal predecessors, (46), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2025-02-05 14:32:36,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 14:32:36,404 INFO L225 Difference]: With dead ends: 239 [2025-02-05 14:32:36,404 INFO L226 Difference]: Without dead ends: 156 [2025-02-05 14:32:36,405 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2025-02-05 14:32:36,405 INFO L435 NwaCegarLoop]: 89 mSDtfsCounter, 57 mSDsluCounter, 635 mSDsCounter, 0 mSdLazyCounter, 260 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 724 SdHoareTripleChecker+Invalid, 260 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 260 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 14:32:36,405 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 724 Invalid, 260 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 260 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 14:32:36,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2025-02-05 14:32:36,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 119. [2025-02-05 14:32:36,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 105 states have (on average 1.2095238095238094) internal successors, (127), 116 states have internal predecessors, (127), 12 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-05 14:32:36,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 141 transitions. [2025-02-05 14:32:36,416 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 141 transitions. Word has length 29 [2025-02-05 14:32:36,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 14:32:36,416 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 141 transitions. [2025-02-05 14:32:36,416 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.5384615384615383) internal successors, (46), 13 states have internal predecessors, (46), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 14:32:36,417 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 141 transitions. [2025-02-05 14:32:36,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-02-05 14:32:36,417 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 14:32:36,417 INFO L218 NwaCegarLoop]: trace histogram [2, 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:36,425 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-05 14:32:36,622 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:36,622 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 14:32:36,623 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 14:32:36,623 INFO L85 PathProgramCache]: Analyzing trace with hash 1571331102, now seen corresponding path program 1 times [2025-02-05 14:32:36,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 14:32:36,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164311088] [2025-02-05 14:32:36,623 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 14:32:36,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 14:32:36,632 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-02-05 14:32:36,638 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-02-05 14:32:36,638 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 14:32:36,638 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-05 14:32:36,638 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-05 14:32:36,640 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-02-05 14:32:36,645 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-02-05 14:32:36,646 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 14:32:36,646 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-05 14:32:36,658 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-05 14:32:36,658 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-05 14:32:36,659 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location failErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-05 14:32:36,661 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 14:32:36,663 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 14:32:36,682 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-05 14:32:36,686 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.02 02:32:36 BoogieIcfgContainer [2025-02-05 14:32:36,688 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-05 14:32:36,688 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-05 14:32:36,688 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-05 14:32:36,689 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-05 14:32:36,689 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 02:32:33" (3/4) ... [2025-02-05 14:32:36,690 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-02-05 14:32:36,722 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 26. [2025-02-05 14:32:36,765 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-05 14:32:36,765 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-05 14:32:36,765 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-05 14:32:36,766 INFO L158 Benchmark]: Toolchain (without parser) took 4287.76ms. Allocated memory was 142.6MB in the beginning and 318.8MB in the end (delta: 176.2MB). Free memory was 105.0MB in the beginning and 135.2MB in the end (delta: -30.2MB). Peak memory consumption was 146.7MB. Max. memory is 16.1GB. [2025-02-05 14:32:36,766 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 201.3MB. Free memory is still 126.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 14:32:36,766 INFO L158 Benchmark]: CACSL2BoogieTranslator took 401.00ms. Allocated memory is still 142.6MB. Free memory was 105.0MB in the beginning and 86.7MB in the end (delta: 18.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-05 14:32:36,766 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.59ms. Allocated memory is still 142.6MB. Free memory was 86.7MB in the beginning and 84.2MB in the end (delta: 2.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-05 14:32:36,767 INFO L158 Benchmark]: Boogie Preprocessor took 60.20ms. Allocated memory is still 142.6MB. Free memory was 84.2MB in the beginning and 80.2MB in the end (delta: 3.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 14:32:36,767 INFO L158 Benchmark]: IcfgBuilder took 543.16ms. Allocated memory is still 142.6MB. Free memory was 80.2MB in the beginning and 53.1MB in the end (delta: 27.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-02-05 14:32:36,767 INFO L158 Benchmark]: TraceAbstraction took 3164.02ms. Allocated memory was 142.6MB in the beginning and 318.8MB in the end (delta: 176.2MB). Free memory was 52.1MB in the beginning and 142.5MB in the end (delta: -90.4MB). Peak memory consumption was 96.4MB. Max. memory is 16.1GB. [2025-02-05 14:32:36,767 INFO L158 Benchmark]: Witness Printer took 77.06ms. Allocated memory is still 318.8MB. Free memory was 142.5MB in the beginning and 135.2MB in the end (delta: 7.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-05 14:32:36,768 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 201.3MB. Free memory is still 126.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 401.00ms. Allocated memory is still 142.6MB. Free memory was 105.0MB in the beginning and 86.7MB in the end (delta: 18.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 33.59ms. Allocated memory is still 142.6MB. Free memory was 86.7MB in the beginning and 84.2MB in the end (delta: 2.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 60.20ms. Allocated memory is still 142.6MB. Free memory was 84.2MB in the beginning and 80.2MB in the end (delta: 3.9MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 543.16ms. Allocated memory is still 142.6MB. Free memory was 80.2MB in the beginning and 53.1MB in the end (delta: 27.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 3164.02ms. Allocated memory was 142.6MB in the beginning and 318.8MB in the end (delta: 176.2MB). Free memory was 52.1MB in the beginning and 142.5MB in the end (delta: -90.4MB). Peak memory consumption was 96.4MB. Max. memory is 16.1GB. * Witness Printer took 77.06ms. Allocated memory is still 318.8MB. Free memory was 142.5MB in the beginning and 135.2MB in the end (delta: 7.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 565]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L638] struct list *data = ((void *)0); VAL [data={0:0}] [L639] COND TRUE __VERIFIER_nondet_int() [L639] COND TRUE __VERIFIER_nondet_int() [L640] struct node *node = malloc(sizeof *node); [L641] COND FALSE !(!node) VAL [data={0:0}, node={-1:0}] [L643] node->next = node [L644] node->value = __VERIFIER_nondet_int() [L645] struct list *item = malloc(sizeof *item); [L646] COND FALSE !(!item) VAL [data={0:0}, item={-2:0}, node={-1:0}] [L648] item->slist = node [L649] item->next = data [L650] data = item [L639] COND TRUE __VERIFIER_nondet_int() [L639] COND FALSE !(__VERIFIER_nondet_int()) [L652] COND FALSE !(!data) [L654] CALL inspect_before(data) [L615] COND TRUE 0 VAL [shape={-2:0}] [L615] COND FALSE !(!(shape)) VAL [shape={-2:0}] [L615] COND FALSE !(0) VAL [shape={-2:0}] [L616] COND TRUE shape->next [L616] shape->next [L616] COND FALSE !(shape->next) [L622] COND TRUE 0 VAL [shape={-2:0}] [L622] COND FALSE !(!(shape)) VAL [shape={-2:0}] [L622] COND FALSE !(0) VAL [shape={-2:0}] [L623] COND TRUE 0 [L623] EXPR shape->next [L623] COND FALSE !(!(shape->next == ((void *)0))) [L623] COND FALSE !(0) VAL [shape={-2:0}] [L624] COND TRUE 0 [L624] EXPR shape->slist [L624] COND FALSE !(!(shape->slist)) [L624] COND FALSE !(0) VAL [shape={-2:0}] [L625] COND TRUE 0 [L625] EXPR shape->slist [L625] EXPR shape->slist->next [L625] COND TRUE !(shape->slist->next == ((void *)0)) [L625] CALL fail() [L565] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 98 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.1s, OverallIterations: 9, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 451 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 451 mSDsluCounter, 2762 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1979 mSDsCounter, 3 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 785 IncrementalHoareTripleChecker+Invalid, 788 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3 mSolverCounterUnsat, 783 mSDtfsCounter, 785 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 111 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=119occurred in iteration=8, InterpolantAutomatonStates: 42, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 8 MinimizatonAttempts, 167 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 217 NumberOfCodeBlocks, 217 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 207 ConstructedInterpolants, 0 QuantifiedInterpolants, 1217 SizeOfPredicates, 2 NumberOfNonLiveVariables, 145 ConjunctsInSsa, 31 ConjunctsInUnsatCore, 10 InterpolantComputations, 7 PerfectInterpolantSequences, 10/16 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2025-02-05 14:32:36,785 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE