./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 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/heap-manipulation/merge_sort-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 15d1d7d49ed223522c6431664b8ff836ebc81296f5e11773e2197361bd8b13cf --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 17:35:24,628 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 17:35:24,682 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 17:35:24,689 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 17:35:24,692 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 17:35:24,711 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 17:35:24,712 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 17:35:24,712 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 17:35:24,713 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 17:35:24,713 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 17:35:24,714 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 17:35:24,714 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 17:35:24,714 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 17:35:24,714 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 17:35:24,715 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 17:35:24,715 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 17:35:24,715 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 17:35:24,715 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 17:35:24,715 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 17:35:24,715 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 17:35:24,715 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 17:35:24,715 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 17:35:24,715 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 17:35:24,715 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 17:35:24,715 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 17:35:24,715 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 17:35:24,715 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 17:35:24,715 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 17:35:24,715 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 17:35:24,715 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 17:35:24,716 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 17:35:24,716 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 17:35:24,716 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 17:35:24,716 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 17:35:24,716 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 17:35:24,716 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 17:35:24,716 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 17:35:24,717 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 17:35:24,717 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 17:35:24,717 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 17:35:24,717 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 17:35:24,717 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 17:35:24,717 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 17:35:24,717 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 15d1d7d49ed223522c6431664b8ff836ebc81296f5e11773e2197361bd8b13cf [2025-03-16 17:35:24,939 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 17:35:24,946 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 17:35:24,947 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 17:35:24,949 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 17:35:24,949 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 17:35:24,950 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/heap-manipulation/merge_sort-1.i [2025-03-16 17:35:26,131 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/272aeed6e/ab3c5632b6274f328db80fb0ee0e5965/FLAGb4172a579 [2025-03-16 17:35:26,413 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 17:35:26,414 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-manipulation/merge_sort-1.i [2025-03-16 17:35:26,433 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/272aeed6e/ab3c5632b6274f328db80fb0ee0e5965/FLAGb4172a579 [2025-03-16 17:35:26,701 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/272aeed6e/ab3c5632b6274f328db80fb0ee0e5965 [2025-03-16 17:35:26,704 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 17:35:26,705 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 17:35:26,706 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 17:35:26,707 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 17:35:26,710 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 17:35:26,710 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 05:35:26" (1/1) ... [2025-03-16 17:35:26,711 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2663b250 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:35:26, skipping insertion in model container [2025-03-16 17:35:26,711 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 05:35:26" (1/1) ... [2025-03-16 17:35:26,734 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 17:35:26,881 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-manipulation/merge_sort-1.i[22632,22645] [2025-03-16 17:35:26,906 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 17:35:26,918 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 17:35:26,943 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-manipulation/merge_sort-1.i[22632,22645] [2025-03-16 17:35:26,959 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 17:35:26,979 INFO L204 MainTranslator]: Completed translation [2025-03-16 17:35:26,979 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:35:26 WrapperNode [2025-03-16 17:35:26,979 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 17:35:26,980 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 17:35:26,981 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 17:35:26,981 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 17:35:26,985 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:35:26" (1/1) ... [2025-03-16 17:35:27,000 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:35:26" (1/1) ... [2025-03-16 17:35:27,014 INFO L138 Inliner]: procedures = 125, calls = 83, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 264 [2025-03-16 17:35:27,014 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 17:35:27,015 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 17:35:27,015 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 17:35:27,015 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 17:35:27,020 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:35:26" (1/1) ... [2025-03-16 17:35:27,021 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:35:26" (1/1) ... [2025-03-16 17:35:27,027 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:35:26" (1/1) ... [2025-03-16 17:35:27,050 INFO L175 MemorySlicer]: Split 49 memory accesses to 4 slices as follows [2, 3, 34, 10]. 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, 2, 8, 3]. [2025-03-16 17:35:27,050 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:35:26" (1/1) ... [2025-03-16 17:35:27,050 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:35:26" (1/1) ... [2025-03-16 17:35:27,057 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:35:26" (1/1) ... [2025-03-16 17:35:27,062 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:35:26" (1/1) ... [2025-03-16 17:35:27,064 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:35:26" (1/1) ... [2025-03-16 17:35:27,068 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:35:26" (1/1) ... [2025-03-16 17:35:27,070 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 17:35:27,074 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 17:35:27,074 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 17:35:27,074 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 17:35:27,075 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:35:26" (1/1) ... [2025-03-16 17:35:27,079 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 17:35:27,089 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 17:35:27,101 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-16 17:35:27,103 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-16 17:35:27,125 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-16 17:35:27,125 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-16 17:35:27,125 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-16 17:35:27,125 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-16 17:35:27,125 INFO L130 BoogieDeclarations]: Found specification of procedure merge_single_node [2025-03-16 17:35:27,125 INFO L138 BoogieDeclarations]: Found implementation of procedure merge_single_node [2025-03-16 17:35:27,125 INFO L130 BoogieDeclarations]: Found specification of procedure fail [2025-03-16 17:35:27,125 INFO L138 BoogieDeclarations]: Found implementation of procedure fail [2025-03-16 17:35:27,125 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-16 17:35:27,126 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-16 17:35:27,126 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-16 17:35:27,126 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-16 17:35:27,126 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-16 17:35:27,126 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 17:35:27,126 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-16 17:35:27,126 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-16 17:35:27,126 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-16 17:35:27,126 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-16 17:35:27,127 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-03-16 17:35:27,127 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-16 17:35:27,127 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-16 17:35:27,127 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-16 17:35:27,127 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-03-16 17:35:27,127 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-16 17:35:27,128 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 17:35:27,128 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-16 17:35:27,128 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-16 17:35:27,128 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-16 17:35:27,128 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 17:35:27,128 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 17:35:27,239 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 17:35:27,240 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 17:35:27,536 INFO L? ?]: Removed 64 outVars from TransFormulas that were not future-live. [2025-03-16 17:35:27,536 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 17:35:27,546 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 17:35:27,548 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 17:35:27,549 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 05:35:27 BoogieIcfgContainer [2025-03-16 17:35:27,549 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 17:35:27,551 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 17:35:27,551 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 17:35:27,554 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 17:35:27,554 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 05:35:26" (1/3) ... [2025-03-16 17:35:27,555 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f8e2946 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 05:35:27, skipping insertion in model container [2025-03-16 17:35:27,555 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:35:26" (2/3) ... [2025-03-16 17:35:27,555 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f8e2946 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 05:35:27, skipping insertion in model container [2025-03-16 17:35:27,555 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 05:35:27" (3/3) ... [2025-03-16 17:35:27,556 INFO L128 eAbstractionObserver]: Analyzing ICFG merge_sort-1.i [2025-03-16 17:35:27,567 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 17:35:27,568 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG merge_sort-1.i that has 3 procedures, 91 locations, 1 initial locations, 20 loop locations, and 1 error locations. [2025-03-16 17:35:27,604 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 17:35:27,612 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;@2367c144, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 17:35:27,612 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 17:35:27,615 INFO L276 IsEmpty]: Start isEmpty. Operand has 91 states, 72 states have (on average 1.8333333333333333) internal successors, (132), 88 states have internal predecessors, (132), 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-03-16 17:35:27,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-03-16 17:35:27,619 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 17:35:27,620 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-16 17:35:27,620 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 17:35:27,624 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 17:35:27,624 INFO L85 PathProgramCache]: Analyzing trace with hash 1294976639, now seen corresponding path program 1 times [2025-03-16 17:35:27,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 17:35:27,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912511440] [2025-03-16 17:35:27,631 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 17:35:27,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 17:35:27,693 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-16 17:35:27,696 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-16 17:35:27,696 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 17:35:27,696 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:35:27,730 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 17:35:27,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 17:35:27,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [912511440] [2025-03-16 17:35:27,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [912511440] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 17:35:27,731 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 17:35:27,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 17:35:27,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2076178890] [2025-03-16 17:35:27,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 17:35:27,735 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-16 17:35:27,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 17:35:27,751 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-16 17:35:27,751 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 17:35:27,754 INFO L87 Difference]: Start difference. First operand has 91 states, 72 states have (on average 1.8333333333333333) internal successors, (132), 88 states have internal predecessors, (132), 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 2.5) internal successors, (5), 2 states have internal predecessors, (5), 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-03-16 17:35:27,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 17:35:27,780 INFO L93 Difference]: Finished difference Result 179 states and 322 transitions. [2025-03-16 17:35:27,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-16 17:35:27,782 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 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 6 [2025-03-16 17:35:27,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 17:35:27,788 INFO L225 Difference]: With dead ends: 179 [2025-03-16 17:35:27,789 INFO L226 Difference]: Without dead ends: 83 [2025-03-16 17:35:27,793 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-03-16 17:35:27,796 INFO L435 NwaCegarLoop]: 114 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, 114 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-03-16 17:35:27,797 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 17:35:27,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2025-03-16 17:35:27,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2025-03-16 17:35:27,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 66 states have (on average 1.3484848484848484) internal successors, (89), 80 states have internal predecessors, (89), 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-03-16 17:35:27,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 106 transitions. [2025-03-16 17:35:27,855 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 106 transitions. Word has length 6 [2025-03-16 17:35:27,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 17:35:27,856 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 106 transitions. [2025-03-16 17:35:27,856 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 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-03-16 17:35:27,856 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 106 transitions. [2025-03-16 17:35:27,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-16 17:35:27,856 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 17:35:27,856 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-16 17:35:27,858 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 17:35:27,858 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 17:35:27,858 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 17:35:27,859 INFO L85 PathProgramCache]: Analyzing trace with hash 1469418939, now seen corresponding path program 1 times [2025-03-16 17:35:27,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 17:35:27,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300172655] [2025-03-16 17:35:27,859 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 17:35:27,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 17:35:27,867 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-16 17:35:27,872 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-16 17:35:27,873 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 17:35:27,873 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:35:27,934 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 17:35:27,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 17:35:27,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [300172655] [2025-03-16 17:35:27,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [300172655] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 17:35:27,936 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 17:35:27,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 17:35:27,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [651281385] [2025-03-16 17:35:27,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 17:35:27,937 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 17:35:27,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 17:35:27,938 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 17:35:27,938 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 17:35:27,938 INFO L87 Difference]: Start difference. First operand 83 states and 106 transitions. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 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-03-16 17:35:27,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 17:35:27,964 INFO L93 Difference]: Finished difference Result 165 states and 211 transitions. [2025-03-16 17:35:27,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 17:35:27,966 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 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 7 [2025-03-16 17:35:27,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 17:35:27,967 INFO L225 Difference]: With dead ends: 165 [2025-03-16 17:35:27,967 INFO L226 Difference]: Without dead ends: 89 [2025-03-16 17:35:27,968 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 17:35:27,968 INFO L435 NwaCegarLoop]: 105 mSDtfsCounter, 4 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 204 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-03-16 17:35:27,968 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 204 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 17:35:27,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2025-03-16 17:35:27,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 85. [2025-03-16 17:35:27,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 68 states have (on average 1.338235294117647) internal successors, (91), 82 states have internal predecessors, (91), 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-03-16 17:35:27,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 108 transitions. [2025-03-16 17:35:27,981 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 108 transitions. Word has length 7 [2025-03-16 17:35:27,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 17:35:27,981 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 108 transitions. [2025-03-16 17:35:27,981 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 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-03-16 17:35:27,981 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 108 transitions. [2025-03-16 17:35:27,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-03-16 17:35:27,982 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 17:35:27,982 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 17:35:27,982 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 17:35:27,982 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 17:35:27,983 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 17:35:27,983 INFO L85 PathProgramCache]: Analyzing trace with hash 1329273142, now seen corresponding path program 1 times [2025-03-16 17:35:27,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 17:35:27,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [245433623] [2025-03-16 17:35:27,984 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 17:35:27,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 17:35:28,002 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-16 17:35:28,021 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-16 17:35:28,021 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 17:35:28,022 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:35:28,131 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 17:35:28,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 17:35:28,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [245433623] [2025-03-16 17:35:28,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [245433623] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 17:35:28,131 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 17:35:28,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 17:35:28,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1654536280] [2025-03-16 17:35:28,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 17:35:28,132 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 17:35:28,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 17:35:28,133 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 17:35:28,133 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 17:35:28,133 INFO L87 Difference]: Start difference. First operand 85 states and 108 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 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-03-16 17:35:28,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 17:35:28,216 INFO L93 Difference]: Finished difference Result 141 states and 177 transitions. [2025-03-16 17:35:28,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 17:35:28,216 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 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 13 [2025-03-16 17:35:28,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 17:35:28,217 INFO L225 Difference]: With dead ends: 141 [2025-03-16 17:35:28,217 INFO L226 Difference]: Without dead ends: 136 [2025-03-16 17:35:28,218 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-03-16 17:35:28,218 INFO L435 NwaCegarLoop]: 87 mSDtfsCounter, 128 mSDsluCounter, 222 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 309 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-03-16 17:35:28,218 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 309 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 17:35:28,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2025-03-16 17:35:28,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 88. [2025-03-16 17:35:28,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 72 states have (on average 1.3194444444444444) internal successors, (95), 85 states have internal predecessors, (95), 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-03-16 17:35:28,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 111 transitions. [2025-03-16 17:35:28,225 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 111 transitions. Word has length 13 [2025-03-16 17:35:28,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 17:35:28,225 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 111 transitions. [2025-03-16 17:35:28,225 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 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-03-16 17:35:28,225 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 111 transitions. [2025-03-16 17:35:28,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-03-16 17:35:28,225 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 17:35:28,225 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 17:35:28,225 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 17:35:28,226 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 17:35:28,226 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 17:35:28,226 INFO L85 PathProgramCache]: Analyzing trace with hash 967282363, now seen corresponding path program 1 times [2025-03-16 17:35:28,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 17:35:28,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2030977341] [2025-03-16 17:35:28,226 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 17:35:28,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 17:35:28,235 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-16 17:35:28,241 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-16 17:35:28,241 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 17:35:28,241 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:35:28,361 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-16 17:35:28,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 17:35:28,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2030977341] [2025-03-16 17:35:28,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2030977341] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 17:35:28,362 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 17:35:28,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 17:35:28,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1621227315] [2025-03-16 17:35:28,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 17:35:28,362 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 17:35:28,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 17:35:28,362 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 17:35:28,362 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 17:35:28,363 INFO L87 Difference]: Start difference. First operand 88 states and 111 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 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-03-16 17:35:28,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 17:35:28,510 INFO L93 Difference]: Finished difference Result 90 states and 112 transitions. [2025-03-16 17:35:28,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 17:35:28,510 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 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 20 [2025-03-16 17:35:28,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 17:35:28,511 INFO L225 Difference]: With dead ends: 90 [2025-03-16 17:35:28,511 INFO L226 Difference]: Without dead ends: 87 [2025-03-16 17:35:28,511 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-03-16 17:35:28,512 INFO L435 NwaCegarLoop]: 93 mSDtfsCounter, 12 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 310 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.1s IncrementalHoareTripleChecker+Time [2025-03-16 17:35:28,512 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 310 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 17:35:28,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2025-03-16 17:35:28,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2025-03-16 17:35:28,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 72 states have (on average 1.3055555555555556) internal successors, (94), 84 states have internal predecessors, (94), 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-03-16 17:35:28,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 109 transitions. [2025-03-16 17:35:28,518 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 109 transitions. Word has length 20 [2025-03-16 17:35:28,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 17:35:28,518 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 109 transitions. [2025-03-16 17:35:28,518 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 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-03-16 17:35:28,519 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 109 transitions. [2025-03-16 17:35:28,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-03-16 17:35:28,519 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 17:35:28,519 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 17:35:28,519 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 17:35:28,519 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 17:35:28,519 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 17:35:28,520 INFO L85 PathProgramCache]: Analyzing trace with hash 1026449924, now seen corresponding path program 1 times [2025-03-16 17:35:28,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 17:35:28,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [597555192] [2025-03-16 17:35:28,520 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 17:35:28,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 17:35:28,529 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-16 17:35:28,533 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-16 17:35:28,533 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 17:35:28,533 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:35:28,638 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-16 17:35:28,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 17:35:28,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [597555192] [2025-03-16 17:35:28,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [597555192] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 17:35:28,638 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 17:35:28,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 17:35:28,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1133473533] [2025-03-16 17:35:28,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 17:35:28,639 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 17:35:28,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 17:35:28,639 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 17:35:28,639 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 17:35:28,639 INFO L87 Difference]: Start difference. First operand 87 states and 109 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 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-03-16 17:35:28,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 17:35:28,760 INFO L93 Difference]: Finished difference Result 89 states and 110 transitions. [2025-03-16 17:35:28,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 17:35:28,762 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 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 20 [2025-03-16 17:35:28,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 17:35:28,763 INFO L225 Difference]: With dead ends: 89 [2025-03-16 17:35:28,763 INFO L226 Difference]: Without dead ends: 86 [2025-03-16 17:35:28,763 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-03-16 17:35:28,764 INFO L435 NwaCegarLoop]: 92 mSDtfsCounter, 12 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 304 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-03-16 17:35:28,764 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 304 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 17:35:28,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2025-03-16 17:35:28,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2025-03-16 17:35:28,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 72 states have (on average 1.2916666666666667) internal successors, (93), 83 states have internal predecessors, (93), 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-03-16 17:35:28,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 107 transitions. [2025-03-16 17:35:28,776 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 107 transitions. Word has length 20 [2025-03-16 17:35:28,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 17:35:28,776 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 107 transitions. [2025-03-16 17:35:28,776 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 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-03-16 17:35:28,776 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 107 transitions. [2025-03-16 17:35:28,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-03-16 17:35:28,776 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 17:35:28,776 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-03-16 17:35:28,776 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-16 17:35:28,776 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 17:35:28,777 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 17:35:28,777 INFO L85 PathProgramCache]: Analyzing trace with hash 1345399920, now seen corresponding path program 1 times [2025-03-16 17:35:28,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 17:35:28,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933008750] [2025-03-16 17:35:28,777 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 17:35:28,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 17:35:28,787 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-16 17:35:28,800 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-16 17:35:28,800 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 17:35:28,800 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:35:28,948 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 17:35:28,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 17:35:28,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [933008750] [2025-03-16 17:35:28,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [933008750] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 17:35:28,948 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 17:35:28,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 17:35:28,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1225270814] [2025-03-16 17:35:28,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 17:35:28,948 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 17:35:28,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 17:35:28,948 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 17:35:28,948 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 17:35:28,949 INFO L87 Difference]: Start difference. First operand 86 states and 107 transitions. Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 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-03-16 17:35:29,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 17:35:29,109 INFO L93 Difference]: Finished difference Result 136 states and 165 transitions. [2025-03-16 17:35:29,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-16 17:35:29,110 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 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-03-16 17:35:29,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 17:35:29,110 INFO L225 Difference]: With dead ends: 136 [2025-03-16 17:35:29,110 INFO L226 Difference]: Without dead ends: 133 [2025-03-16 17:35:29,111 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-03-16 17:35:29,111 INFO L435 NwaCegarLoop]: 77 mSDtfsCounter, 109 mSDsluCounter, 241 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 318 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-03-16 17:35:29,111 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 318 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 17:35:29,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2025-03-16 17:35:29,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 92. [2025-03-16 17:35:29,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 78 states have (on average 1.2692307692307692) internal successors, (99), 89 states have internal predecessors, (99), 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-03-16 17:35:29,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 113 transitions. [2025-03-16 17:35:29,119 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 113 transitions. Word has length 23 [2025-03-16 17:35:29,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 17:35:29,119 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 113 transitions. [2025-03-16 17:35:29,119 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 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-03-16 17:35:29,119 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 113 transitions. [2025-03-16 17:35:29,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-03-16 17:35:29,119 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 17:35:29,119 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-03-16 17:35:29,120 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-16 17:35:29,120 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 17:35:29,120 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 17:35:29,120 INFO L85 PathProgramCache]: Analyzing trace with hash -1244680709, now seen corresponding path program 1 times [2025-03-16 17:35:29,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 17:35:29,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1982437806] [2025-03-16 17:35:29,120 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 17:35:29,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 17:35:29,127 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-16 17:35:29,131 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-16 17:35:29,131 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 17:35:29,131 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:35:29,234 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 17:35:29,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 17:35:29,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1982437806] [2025-03-16 17:35:29,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1982437806] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 17:35:29,235 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 17:35:29,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 17:35:29,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1852350299] [2025-03-16 17:35:29,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 17:35:29,235 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 17:35:29,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 17:35:29,236 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 17:35:29,236 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 17:35:29,236 INFO L87 Difference]: Start difference. First operand 92 states and 113 transitions. Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 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-03-16 17:35:29,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 17:35:29,392 INFO L93 Difference]: Finished difference Result 135 states and 163 transitions. [2025-03-16 17:35:29,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-16 17:35:29,392 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 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-03-16 17:35:29,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 17:35:29,393 INFO L225 Difference]: With dead ends: 135 [2025-03-16 17:35:29,393 INFO L226 Difference]: Without dead ends: 132 [2025-03-16 17:35:29,393 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-03-16 17:35:29,394 INFO L435 NwaCegarLoop]: 77 mSDtfsCounter, 107 mSDsluCounter, 241 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 318 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-03-16 17:35:29,394 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 318 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 17:35:29,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2025-03-16 17:35:29,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 98. [2025-03-16 17:35:29,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 84 states have (on average 1.25) internal successors, (105), 95 states have internal predecessors, (105), 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-03-16 17:35:29,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 119 transitions. [2025-03-16 17:35:29,410 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 119 transitions. Word has length 23 [2025-03-16 17:35:29,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 17:35:29,410 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 119 transitions. [2025-03-16 17:35:29,410 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 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-03-16 17:35:29,410 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 119 transitions. [2025-03-16 17:35:29,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-03-16 17:35:29,412 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 17:35:29,412 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-03-16 17:35:29,412 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-16 17:35:29,412 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 17:35:29,412 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 17:35:29,412 INFO L85 PathProgramCache]: Analyzing trace with hash 141490168, now seen corresponding path program 1 times [2025-03-16 17:35:29,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 17:35:29,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535822011] [2025-03-16 17:35:29,412 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 17:35:29,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 17:35:29,421 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-16 17:35:29,430 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-16 17:35:29,430 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 17:35:29,430 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:35:29,790 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 17:35:29,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 17:35:29,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [535822011] [2025-03-16 17:35:29,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [535822011] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 17:35:29,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [44673257] [2025-03-16 17:35:29,792 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 17:35:29,792 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 17:35:29,792 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 17:35:29,796 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 17:35:29,798 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-16 17:35:29,873 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-16 17:35:29,891 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-16 17:35:29,891 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 17:35:29,891 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:35:29,893 INFO L256 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-03-16 17:35:29,899 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 17:35:29,977 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-03-16 17:35:29,984 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-03-16 17:35:30,059 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 17:35:30,059 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 17:35:30,148 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 17:35:30,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [44673257] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 17:35:30,148 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 17:35:30,148 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 5] total 12 [2025-03-16 17:35:30,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1965243156] [2025-03-16 17:35:30,149 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 17:35:30,149 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-16 17:35:30,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 17:35:30,149 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-16 17:35:30,150 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2025-03-16 17:35:30,150 INFO L87 Difference]: Start difference. First operand 98 states and 119 transitions. Second operand has 13 states, 13 states have (on average 3.230769230769231) internal successors, (42), 12 states have internal predecessors, (42), 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-03-16 17:35:30,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 17:35:30,379 INFO L93 Difference]: Finished difference Result 221 states and 269 transitions. [2025-03-16 17:35:30,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-16 17:35:30,379 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.230769230769231) internal successors, (42), 12 states have internal predecessors, (42), 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-03-16 17:35:30,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 17:35:30,380 INFO L225 Difference]: With dead ends: 221 [2025-03-16 17:35:30,380 INFO L226 Difference]: Without dead ends: 144 [2025-03-16 17:35:30,380 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 47 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-03-16 17:35:30,381 INFO L435 NwaCegarLoop]: 82 mSDtfsCounter, 93 mSDsluCounter, 509 mSDsCounter, 0 mSdLazyCounter, 234 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 591 SdHoareTripleChecker+Invalid, 234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 234 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 17:35:30,381 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 591 Invalid, 234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 234 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 17:35:30,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2025-03-16 17:35:30,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 109. [2025-03-16 17:35:30,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 95 states have (on average 1.231578947368421) internal successors, (117), 106 states have internal predecessors, (117), 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-03-16 17:35:30,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 131 transitions. [2025-03-16 17:35:30,396 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 131 transitions. Word has length 26 [2025-03-16 17:35:30,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 17:35:30,396 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 131 transitions. [2025-03-16 17:35:30,396 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.230769230769231) internal successors, (42), 12 states have internal predecessors, (42), 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-03-16 17:35:30,396 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 131 transitions. [2025-03-16 17:35:30,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-03-16 17:35:30,397 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 17:35:30,397 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-03-16 17:35:30,404 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-16 17:35:30,598 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 17:35:30,598 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 17:35:30,598 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 17:35:30,598 INFO L85 PathProgramCache]: Analyzing trace with hash -1882387455, now seen corresponding path program 1 times [2025-03-16 17:35:30,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 17:35:30,598 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6847782] [2025-03-16 17:35:30,598 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 17:35:30,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 17:35:30,609 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-16 17:35:30,617 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-16 17:35:30,617 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 17:35:30,617 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-16 17:35:30,617 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-16 17:35:30,619 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-16 17:35:30,628 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-16 17:35:30,628 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 17:35:30,628 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-16 17:35:30,646 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-16 17:35:30,646 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-16 17:35:30,647 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location failErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-16 17:35:30,648 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-16 17:35:30,651 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 17:35:30,667 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-16 17:35:30,670 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.03 05:35:30 BoogieIcfgContainer [2025-03-16 17:35:30,670 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-16 17:35:30,671 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-16 17:35:30,671 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-16 17:35:30,671 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-16 17:35:30,672 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 05:35:27" (3/4) ... [2025-03-16 17:35:30,673 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-03-16 17:35:30,709 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 24. [2025-03-16 17:35:30,756 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-16 17:35:30,756 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-16 17:35:30,756 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-16 17:35:30,757 INFO L158 Benchmark]: Toolchain (without parser) took 4051.84ms. Allocated memory was 142.6MB in the beginning and 302.0MB in the end (delta: 159.4MB). Free memory was 103.9MB in the beginning and 128.3MB in the end (delta: -24.3MB). Peak memory consumption was 138.0MB. Max. memory is 16.1GB. [2025-03-16 17:35:30,757 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 201.3MB. Free memory is still 126.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 17:35:30,757 INFO L158 Benchmark]: CACSL2BoogieTranslator took 273.78ms. Allocated memory is still 142.6MB. Free memory was 103.9MB in the beginning and 84.5MB in the end (delta: 19.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-16 17:35:30,757 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.75ms. Allocated memory is still 142.6MB. Free memory was 84.5MB in the beginning and 83.0MB in the end (delta: 1.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-16 17:35:30,758 INFO L158 Benchmark]: Boogie Preprocessor took 55.71ms. Allocated memory is still 142.6MB. Free memory was 83.0MB in the beginning and 79.1MB in the end (delta: 3.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 17:35:30,758 INFO L158 Benchmark]: IcfgBuilder took 474.99ms. Allocated memory is still 142.6MB. Free memory was 78.1MB in the beginning and 52.0MB in the end (delta: 26.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-16 17:35:30,758 INFO L158 Benchmark]: TraceAbstraction took 3119.46ms. Allocated memory was 142.6MB in the beginning and 302.0MB in the end (delta: 159.4MB). Free memory was 51.0MB in the beginning and 134.4MB in the end (delta: -83.4MB). Peak memory consumption was 79.3MB. Max. memory is 16.1GB. [2025-03-16 17:35:30,758 INFO L158 Benchmark]: Witness Printer took 85.58ms. Allocated memory is still 302.0MB. Free memory was 134.4MB in the beginning and 128.3MB in the end (delta: 6.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-16 17:35:30,760 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.18ms. Allocated memory is still 201.3MB. Free memory is still 126.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 273.78ms. Allocated memory is still 142.6MB. Free memory was 103.9MB in the beginning and 84.5MB in the end (delta: 19.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 33.75ms. Allocated memory is still 142.6MB. Free memory was 84.5MB in the beginning and 83.0MB in the end (delta: 1.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 55.71ms. Allocated memory is still 142.6MB. Free memory was 83.0MB in the beginning and 79.1MB in the end (delta: 3.9MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 474.99ms. Allocated memory is still 142.6MB. Free memory was 78.1MB in the beginning and 52.0MB in the end (delta: 26.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 3119.46ms. Allocated memory was 142.6MB in the beginning and 302.0MB in the end (delta: 159.4MB). Free memory was 51.0MB in the beginning and 134.4MB in the end (delta: -83.4MB). Peak memory consumption was 79.3MB. Max. memory is 16.1GB. * Witness Printer took 85.58ms. Allocated memory is still 302.0MB. Free memory was 134.4MB in the beginning and 128.3MB in the end (delta: 6.1MB). 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 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 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, 91 locations, 177 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.1s, OverallIterations: 9, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 465 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 465 mSDsluCounter, 2468 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1741 mSDsCounter, 3 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 759 IncrementalHoareTripleChecker+Invalid, 762 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3 mSolverCounterUnsat, 727 mSDtfsCounter, 759 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 103 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=109occurred 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, 162 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 190 NumberOfCodeBlocks, 190 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 180 ConstructedInterpolants, 0 QuantifiedInterpolants, 1069 SizeOfPredicates, 2 NumberOfNonLiveVariables, 143 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-03-16 17:35:30,776 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/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