./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test3-2.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/uthash-2.0.2/uthash_SAX_test3-2.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 2f1036b64b29bd922a31935b87e7c90d1acbba8f8044f40e2525bb03d5de1e7f --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 10:34:16,850 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 10:34:16,905 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-17 10:34:16,914 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 10:34:16,914 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 10:34:16,930 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 10:34:16,932 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 10:34:16,932 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 10:34:16,932 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 10:34:16,933 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 10:34:16,933 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 10:34:16,933 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 10:34:16,933 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 10:34:16,934 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 10:34:16,934 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 10:34:16,934 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 10:34:16,934 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 10:34:16,934 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 10:34:16,935 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 10:34:16,935 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 10:34:16,935 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 10:34:16,935 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 10:34:16,935 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 10:34:16,935 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 10:34:16,935 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 10:34:16,935 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 10:34:16,935 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 10:34:16,935 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 10:34:16,935 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 10:34:16,935 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 10:34:16,936 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 10:34:16,936 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 10:34:16,936 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 10:34:16,936 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 10:34:16,936 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 10:34:16,936 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 10:34:16,936 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 10:34:16,936 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 10:34:16,936 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 10:34:16,937 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 10:34:16,937 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 10:34:16,937 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 10:34:16,937 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 10:34:16,937 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 -> 2f1036b64b29bd922a31935b87e7c90d1acbba8f8044f40e2525bb03d5de1e7f [2025-03-17 10:34:17,147 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 10:34:17,156 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 10:34:17,158 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 10:34:17,158 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 10:34:17,159 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 10:34:17,159 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test3-2.i [2025-03-17 10:34:18,245 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/573658053/1dff1173ba724e30a0d7ad33f78d817e/FLAG716772837 [2025-03-17 10:34:18,548 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 10:34:18,549 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test3-2.i [2025-03-17 10:34:18,564 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/573658053/1dff1173ba724e30a0d7ad33f78d817e/FLAG716772837 [2025-03-17 10:34:18,581 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/573658053/1dff1173ba724e30a0d7ad33f78d817e [2025-03-17 10:34:18,583 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 10:34:18,584 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 10:34:18,585 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 10:34:18,585 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 10:34:18,588 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 10:34:18,589 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 10:34:18" (1/1) ... [2025-03-17 10:34:18,589 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@a85b5a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:34:18, skipping insertion in model container [2025-03-17 10:34:18,590 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 10:34:18" (1/1) ... [2025-03-17 10:34:18,624 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 10:34:18,871 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/uthash-2.0.2/uthash_SAX_test3-2.i[33021,33034] [2025-03-17 10:34:18,952 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/uthash-2.0.2/uthash_SAX_test3-2.i[44590,44603] [2025-03-17 10:34:18,962 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 10:34:18,970 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 10:34:18,998 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/uthash-2.0.2/uthash_SAX_test3-2.i[33021,33034] [2025-03-17 10:34:19,043 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/uthash-2.0.2/uthash_SAX_test3-2.i[44590,44603] [2025-03-17 10:34:19,049 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 10:34:19,077 INFO L204 MainTranslator]: Completed translation [2025-03-17 10:34:19,078 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:34:19 WrapperNode [2025-03-17 10:34:19,078 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 10:34:19,078 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 10:34:19,078 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 10:34:19,078 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 10:34:19,082 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:34:19" (1/1) ... [2025-03-17 10:34:19,108 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:34:19" (1/1) ... [2025-03-17 10:34:19,163 INFO L138 Inliner]: procedures = 177, calls = 328, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1569 [2025-03-17 10:34:19,163 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 10:34:19,164 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 10:34:19,164 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 10:34:19,164 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 10:34:19,170 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:34:19" (1/1) ... [2025-03-17 10:34:19,171 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:34:19" (1/1) ... [2025-03-17 10:34:19,179 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:34:19" (1/1) ... [2025-03-17 10:34:19,258 INFO L175 MemorySlicer]: Split 303 memory accesses to 3 slices as follows [2, 267, 34]. 88 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 62 writes are split as follows [0, 58, 4]. [2025-03-17 10:34:19,259 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:34:19" (1/1) ... [2025-03-17 10:34:19,259 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:34:19" (1/1) ... [2025-03-17 10:34:19,287 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:34:19" (1/1) ... [2025-03-17 10:34:19,294 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:34:19" (1/1) ... [2025-03-17 10:34:19,297 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:34:19" (1/1) ... [2025-03-17 10:34:19,299 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:34:19" (1/1) ... [2025-03-17 10:34:19,308 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 10:34:19,309 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 10:34:19,309 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 10:34:19,309 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 10:34:19,310 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:34:19" (1/1) ... [2025-03-17 10:34:19,314 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 10:34:19,323 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 10:34:19,334 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-17 10:34:19,343 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-17 10:34:19,358 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-17 10:34:19,359 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-17 10:34:19,359 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-17 10:34:19,359 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-03-17 10:34:19,359 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-03-17 10:34:19,359 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-17 10:34:19,359 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-17 10:34:19,359 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-17 10:34:19,359 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2025-03-17 10:34:19,360 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2025-03-17 10:34:19,360 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2025-03-17 10:34:19,360 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2025-03-17 10:34:19,360 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2025-03-17 10:34:19,360 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2025-03-17 10:34:19,360 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-17 10:34:19,360 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 10:34:19,360 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-17 10:34:19,360 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-17 10:34:19,360 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-17 10:34:19,361 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-17 10:34:19,361 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-17 10:34:19,361 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-17 10:34:19,361 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-17 10:34:19,361 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-17 10:34:19,361 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 10:34:19,361 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-17 10:34:19,361 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-17 10:34:19,361 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 10:34:19,362 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 10:34:19,575 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 10:34:19,577 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 10:34:20,775 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L733: call ULTIMATE.dealloc(main_~#i~0#1.base, main_~#i~0#1.offset);havoc main_~#i~0#1.base, main_~#i~0#1.offset; [2025-03-17 10:34:20,873 INFO L? ?]: Removed 344 outVars from TransFormulas that were not future-live. [2025-03-17 10:34:20,874 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 10:34:20,922 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 10:34:20,925 INFO L336 CfgBuilder]: Removed 1 assume(true) statements. [2025-03-17 10:34:20,925 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 10:34:20 BoogieIcfgContainer [2025-03-17 10:34:20,925 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 10:34:20,926 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 10:34:20,927 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 10:34:20,931 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 10:34:20,931 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 10:34:18" (1/3) ... [2025-03-17 10:34:20,931 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@348a01ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 10:34:20, skipping insertion in model container [2025-03-17 10:34:20,931 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:34:19" (2/3) ... [2025-03-17 10:34:20,932 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@348a01ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 10:34:20, skipping insertion in model container [2025-03-17 10:34:20,932 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 10:34:20" (3/3) ... [2025-03-17 10:34:20,933 INFO L128 eAbstractionObserver]: Analyzing ICFG uthash_SAX_test3-2.i [2025-03-17 10:34:20,944 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 10:34:20,946 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG uthash_SAX_test3-2.i that has 5 procedures, 444 locations, 1 initial locations, 41 loop locations, and 2 error locations. [2025-03-17 10:34:20,999 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 10:34:21,008 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;@3e94d8db, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 10:34:21,009 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-03-17 10:34:21,016 INFO L276 IsEmpty]: Start isEmpty. Operand has 436 states, 423 states have (on average 1.6264775413711583) internal successors, (688), 430 states have internal predecessors, (688), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-17 10:34:21,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-17 10:34:21,020 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:34:21,020 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 10:34:21,021 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 10:34:21,025 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:34:21,026 INFO L85 PathProgramCache]: Analyzing trace with hash 2110544859, now seen corresponding path program 1 times [2025-03-17 10:34:21,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:34:21,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040949727] [2025-03-17 10:34:21,033 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:34:21,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:34:21,102 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-17 10:34:21,113 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-17 10:34:21,114 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:34:21,115 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:34:21,149 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-17 10:34:21,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:34:21,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1040949727] [2025-03-17 10:34:21,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1040949727] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:34:21,151 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:34:21,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 10:34:21,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [750712442] [2025-03-17 10:34:21,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:34:21,154 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 10:34:21,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:34:21,166 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 10:34:21,167 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 10:34:21,169 INFO L87 Difference]: Start difference. First operand has 436 states, 423 states have (on average 1.6264775413711583) internal successors, (688), 430 states have internal predecessors, (688), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 10:34:21,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:34:21,311 INFO L93 Difference]: Finished difference Result 871 states and 1412 transitions. [2025-03-17 10:34:21,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 10:34:21,314 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-03-17 10:34:21,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:34:21,322 INFO L225 Difference]: With dead ends: 871 [2025-03-17 10:34:21,322 INFO L226 Difference]: Without dead ends: 400 [2025-03-17 10:34:21,328 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-17 10:34:21,330 INFO L435 NwaCegarLoop]: 589 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 589 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 10:34:21,332 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 589 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 10:34:21,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 400 states. [2025-03-17 10:34:21,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 400 to 400. [2025-03-17 10:34:21,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 400 states, 388 states have (on average 1.461340206185567) internal successors, (567), 394 states have internal predecessors, (567), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-17 10:34:21,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 583 transitions. [2025-03-17 10:34:21,375 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 583 transitions. Word has length 8 [2025-03-17 10:34:21,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:34:21,376 INFO L471 AbstractCegarLoop]: Abstraction has 400 states and 583 transitions. [2025-03-17 10:34:21,376 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 10:34:21,376 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 583 transitions. [2025-03-17 10:34:21,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-03-17 10:34:21,377 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:34:21,377 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 10:34:21,377 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-17 10:34:21,377 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 10:34:21,378 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:34:21,378 INFO L85 PathProgramCache]: Analyzing trace with hash -484098715, now seen corresponding path program 1 times [2025-03-17 10:34:21,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:34:21,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714035043] [2025-03-17 10:34:21,378 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:34:21,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:34:21,394 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-17 10:34:21,406 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-17 10:34:21,406 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:34:21,406 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:34:21,533 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-17 10:34:21,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:34:21,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [714035043] [2025-03-17 10:34:21,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [714035043] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:34:21,533 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:34:21,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 10:34:21,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [633528454] [2025-03-17 10:34:21,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:34:21,534 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 10:34:21,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:34:21,534 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 10:34:21,535 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 10:34:21,535 INFO L87 Difference]: Start difference. First operand 400 states and 583 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 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-17 10:34:21,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:34:21,808 INFO L93 Difference]: Finished difference Result 991 states and 1453 transitions. [2025-03-17 10:34:21,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 10:34:21,809 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 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-17 10:34:21,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:34:21,815 INFO L225 Difference]: With dead ends: 991 [2025-03-17 10:34:21,815 INFO L226 Difference]: Without dead ends: 788 [2025-03-17 10:34:21,816 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 10:34:21,816 INFO L435 NwaCegarLoop]: 562 mSDtfsCounter, 553 mSDsluCounter, 1073 mSDsCounter, 0 mSdLazyCounter, 198 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 561 SdHoareTripleChecker+Valid, 1635 SdHoareTripleChecker+Invalid, 199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 10:34:21,817 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [561 Valid, 1635 Invalid, 199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 198 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 10:34:21,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 788 states. [2025-03-17 10:34:21,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 788 to 402. [2025-03-17 10:34:21,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 402 states, 390 states have (on average 1.458974358974359) internal successors, (569), 396 states have internal predecessors, (569), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-17 10:34:21,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 402 states to 402 states and 585 transitions. [2025-03-17 10:34:21,846 INFO L78 Accepts]: Start accepts. Automaton has 402 states and 585 transitions. Word has length 13 [2025-03-17 10:34:21,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:34:21,846 INFO L471 AbstractCegarLoop]: Abstraction has 402 states and 585 transitions. [2025-03-17 10:34:21,846 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 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-17 10:34:21,846 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 585 transitions. [2025-03-17 10:34:21,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-03-17 10:34:21,848 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:34:21,848 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 10:34:21,848 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 10:34:21,849 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 10:34:21,849 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:34:21,849 INFO L85 PathProgramCache]: Analyzing trace with hash -1696038006, now seen corresponding path program 1 times [2025-03-17 10:34:21,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:34:21,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [952107734] [2025-03-17 10:34:21,849 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:34:21,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:34:21,900 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-03-17 10:34:21,912 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-03-17 10:34:21,912 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:34:21,912 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:34:22,202 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-17 10:34:22,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:34:22,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [952107734] [2025-03-17 10:34:22,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [952107734] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:34:22,203 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:34:22,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 10:34:22,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1985527782] [2025-03-17 10:34:22,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:34:22,204 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 10:34:22,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:34:22,205 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 10:34:22,205 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 10:34:22,206 INFO L87 Difference]: Start difference. First operand 402 states and 585 transitions. Second operand has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 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-17 10:34:22,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:34:22,353 INFO L93 Difference]: Finished difference Result 759 states and 1101 transitions. [2025-03-17 10:34:22,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 10:34:22,354 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 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 87 [2025-03-17 10:34:22,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:34:22,356 INFO L225 Difference]: With dead ends: 759 [2025-03-17 10:34:22,357 INFO L226 Difference]: Without dead ends: 360 [2025-03-17 10:34:22,358 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 10:34:22,359 INFO L435 NwaCegarLoop]: 449 mSDtfsCounter, 30 mSDsluCounter, 879 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 1328 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 10:34:22,360 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 1328 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 10:34:22,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2025-03-17 10:34:22,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 360. [2025-03-17 10:34:22,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 360 states, 348 states have (on average 1.4137931034482758) internal successors, (492), 354 states have internal predecessors, (492), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-17 10:34:22,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 508 transitions. [2025-03-17 10:34:22,378 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 508 transitions. Word has length 87 [2025-03-17 10:34:22,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:34:22,378 INFO L471 AbstractCegarLoop]: Abstraction has 360 states and 508 transitions. [2025-03-17 10:34:22,379 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 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-17 10:34:22,379 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 508 transitions. [2025-03-17 10:34:22,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-03-17 10:34:22,381 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:34:22,381 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 10:34:22,381 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 10:34:22,381 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 10:34:22,382 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:34:22,382 INFO L85 PathProgramCache]: Analyzing trace with hash 1552360720, now seen corresponding path program 1 times [2025-03-17 10:34:22,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:34:22,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [252853287] [2025-03-17 10:34:22,382 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:34:22,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:34:22,429 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-03-17 10:34:22,455 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-03-17 10:34:22,458 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:34:22,458 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:34:22,609 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-17 10:34:22,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:34:22,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [252853287] [2025-03-17 10:34:22,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [252853287] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:34:22,611 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:34:22,611 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 10:34:22,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1059039998] [2025-03-17 10:34:22,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:34:22,612 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 10:34:22,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:34:22,612 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 10:34:22,612 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 10:34:22,612 INFO L87 Difference]: Start difference. First operand 360 states and 508 transitions. Second operand has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 2 states have internal predecessors, (86), 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-17 10:34:22,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:34:22,786 INFO L93 Difference]: Finished difference Result 976 states and 1392 transitions. [2025-03-17 10:34:22,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 10:34:22,787 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 2 states have internal predecessors, (86), 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 87 [2025-03-17 10:34:22,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:34:22,790 INFO L225 Difference]: With dead ends: 976 [2025-03-17 10:34:22,791 INFO L226 Difference]: Without dead ends: 619 [2025-03-17 10:34:22,791 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-17 10:34:22,793 INFO L435 NwaCegarLoop]: 654 mSDtfsCounter, 306 mSDsluCounter, 448 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 311 SdHoareTripleChecker+Valid, 1102 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 10:34:22,794 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [311 Valid, 1102 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 10:34:22,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 619 states. [2025-03-17 10:34:22,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 619 to 603. [2025-03-17 10:34:22,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 603 states, 591 states have (on average 1.428087986463621) internal successors, (844), 597 states have internal predecessors, (844), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-17 10:34:22,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 603 states to 603 states and 860 transitions. [2025-03-17 10:34:22,819 INFO L78 Accepts]: Start accepts. Automaton has 603 states and 860 transitions. Word has length 87 [2025-03-17 10:34:22,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:34:22,820 INFO L471 AbstractCegarLoop]: Abstraction has 603 states and 860 transitions. [2025-03-17 10:34:22,820 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 2 states have internal predecessors, (86), 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-17 10:34:22,820 INFO L276 IsEmpty]: Start isEmpty. Operand 603 states and 860 transitions. [2025-03-17 10:34:22,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-03-17 10:34:22,822 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:34:22,822 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 10:34:22,822 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 10:34:22,822 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 10:34:22,825 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:34:22,825 INFO L85 PathProgramCache]: Analyzing trace with hash 122063869, now seen corresponding path program 1 times [2025-03-17 10:34:22,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:34:22,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143461507] [2025-03-17 10:34:22,826 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:34:22,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:34:22,894 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-17 10:34:22,949 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-17 10:34:22,949 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:34:22,949 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:34:23,207 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-17 10:34:23,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:34:23,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1143461507] [2025-03-17 10:34:23,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1143461507] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:34:23,208 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:34:23,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 10:34:23,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [224339005] [2025-03-17 10:34:23,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:34:23,209 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 10:34:23,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:34:23,210 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 10:34:23,211 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 10:34:23,211 INFO L87 Difference]: Start difference. First operand 603 states and 860 transitions. Second operand has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 10:34:23,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:34:23,371 INFO L93 Difference]: Finished difference Result 897 states and 1280 transitions. [2025-03-17 10:34:23,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 10:34:23,372 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 102 [2025-03-17 10:34:23,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:34:23,375 INFO L225 Difference]: With dead ends: 897 [2025-03-17 10:34:23,375 INFO L226 Difference]: Without dead ends: 878 [2025-03-17 10:34:23,375 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 10:34:23,376 INFO L435 NwaCegarLoop]: 448 mSDtfsCounter, 453 mSDsluCounter, 890 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 456 SdHoareTripleChecker+Valid, 1338 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 10:34:23,376 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [456 Valid, 1338 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 10:34:23,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 878 states. [2025-03-17 10:34:23,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 878 to 605. [2025-03-17 10:34:23,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 605 states, 593 states have (on average 1.4266441821247893) internal successors, (846), 599 states have internal predecessors, (846), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-17 10:34:23,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 605 states to 605 states and 862 transitions. [2025-03-17 10:34:23,394 INFO L78 Accepts]: Start accepts. Automaton has 605 states and 862 transitions. Word has length 102 [2025-03-17 10:34:23,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:34:23,394 INFO L471 AbstractCegarLoop]: Abstraction has 605 states and 862 transitions. [2025-03-17 10:34:23,395 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 10:34:23,395 INFO L276 IsEmpty]: Start isEmpty. Operand 605 states and 862 transitions. [2025-03-17 10:34:23,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-03-17 10:34:23,398 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:34:23,398 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 10:34:23,398 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 10:34:23,398 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 10:34:23,401 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:34:23,401 INFO L85 PathProgramCache]: Analyzing trace with hash -2055930197, now seen corresponding path program 1 times [2025-03-17 10:34:23,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:34:23,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [628142316] [2025-03-17 10:34:23,402 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:34:23,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:34:23,441 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-03-17 10:34:23,469 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-03-17 10:34:23,469 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:34:23,469 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:34:23,646 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-17 10:34:23,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:34:23,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [628142316] [2025-03-17 10:34:23,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [628142316] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:34:23,646 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:34:23,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 10:34:23,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1380403016] [2025-03-17 10:34:23,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:34:23,647 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 10:34:23,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:34:23,648 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 10:34:23,648 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 10:34:23,648 INFO L87 Difference]: Start difference. First operand 605 states and 862 transitions. Second operand has 4 states, 4 states have (on average 35.5) internal successors, (142), 4 states have internal predecessors, (142), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 10:34:23,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:34:23,756 INFO L93 Difference]: Finished difference Result 881 states and 1263 transitions. [2025-03-17 10:34:23,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 10:34:23,757 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 35.5) internal successors, (142), 4 states have internal predecessors, (142), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 150 [2025-03-17 10:34:23,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:34:23,761 INFO L225 Difference]: With dead ends: 881 [2025-03-17 10:34:23,762 INFO L226 Difference]: Without dead ends: 521 [2025-03-17 10:34:23,762 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 10:34:23,763 INFO L435 NwaCegarLoop]: 375 mSDtfsCounter, 30 mSDsluCounter, 731 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 1106 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 10:34:23,763 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 1106 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 10:34:23,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 521 states. [2025-03-17 10:34:23,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 521 to 521. [2025-03-17 10:34:23,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 521 states, 509 states have (on average 1.3595284872298625) internal successors, (692), 515 states have internal predecessors, (692), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-17 10:34:23,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 521 states to 521 states and 708 transitions. [2025-03-17 10:34:23,780 INFO L78 Accepts]: Start accepts. Automaton has 521 states and 708 transitions. Word has length 150 [2025-03-17 10:34:23,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:34:23,780 INFO L471 AbstractCegarLoop]: Abstraction has 521 states and 708 transitions. [2025-03-17 10:34:23,780 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 35.5) internal successors, (142), 4 states have internal predecessors, (142), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 10:34:23,781 INFO L276 IsEmpty]: Start isEmpty. Operand 521 states and 708 transitions. [2025-03-17 10:34:23,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-03-17 10:34:23,784 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:34:23,784 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 10:34:23,785 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 10:34:23,785 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 10:34:23,786 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:34:23,786 INFO L85 PathProgramCache]: Analyzing trace with hash -1180107260, now seen corresponding path program 1 times [2025-03-17 10:34:23,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:34:23,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1018576260] [2025-03-17 10:34:23,786 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:34:23,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:34:23,823 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-03-17 10:34:23,848 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-03-17 10:34:23,849 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:34:23,849 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:34:23,965 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-17 10:34:23,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:34:23,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1018576260] [2025-03-17 10:34:23,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1018576260] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:34:23,966 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:34:23,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 10:34:23,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [859483470] [2025-03-17 10:34:23,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:34:23,967 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 10:34:23,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:34:23,967 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 10:34:23,967 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 10:34:23,967 INFO L87 Difference]: Start difference. First operand 521 states and 708 transitions. Second operand has 4 states, 4 states have (on average 35.75) internal successors, (143), 4 states have internal predecessors, (143), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 10:34:24,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:34:24,355 INFO L93 Difference]: Finished difference Result 1119 states and 1533 transitions. [2025-03-17 10:34:24,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 10:34:24,355 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 35.75) internal successors, (143), 4 states have internal predecessors, (143), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 150 [2025-03-17 10:34:24,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:34:24,359 INFO L225 Difference]: With dead ends: 1119 [2025-03-17 10:34:24,359 INFO L226 Difference]: Without dead ends: 686 [2025-03-17 10:34:24,359 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 10:34:24,360 INFO L435 NwaCegarLoop]: 470 mSDtfsCounter, 828 mSDsluCounter, 352 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 833 SdHoareTripleChecker+Valid, 822 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 10:34:24,360 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [833 Valid, 822 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 10:34:24,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 686 states. [2025-03-17 10:34:24,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 686 to 658. [2025-03-17 10:34:24,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 658 states, 646 states have (on average 1.3606811145510835) internal successors, (879), 652 states have internal predecessors, (879), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-17 10:34:24,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 658 states to 658 states and 895 transitions. [2025-03-17 10:34:24,375 INFO L78 Accepts]: Start accepts. Automaton has 658 states and 895 transitions. Word has length 150 [2025-03-17 10:34:24,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:34:24,376 INFO L471 AbstractCegarLoop]: Abstraction has 658 states and 895 transitions. [2025-03-17 10:34:24,376 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 35.75) internal successors, (143), 4 states have internal predecessors, (143), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 10:34:24,376 INFO L276 IsEmpty]: Start isEmpty. Operand 658 states and 895 transitions. [2025-03-17 10:34:24,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-03-17 10:34:24,377 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:34:24,377 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 10:34:24,377 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 10:34:24,377 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 10:34:24,378 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:34:24,378 INFO L85 PathProgramCache]: Analyzing trace with hash -886414602, now seen corresponding path program 1 times [2025-03-17 10:34:24,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:34:24,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1475357537] [2025-03-17 10:34:24,378 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:34:24,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:34:24,413 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-03-17 10:34:24,441 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-03-17 10:34:24,441 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:34:24,441 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:34:24,968 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-17 10:34:24,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:34:24,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1475357537] [2025-03-17 10:34:24,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1475357537] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 10:34:24,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1675695735] [2025-03-17 10:34:24,969 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:34:24,969 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 10:34:24,969 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 10:34:24,974 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-17 10:34:24,976 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-17 10:34:25,158 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-03-17 10:34:25,239 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-03-17 10:34:25,239 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:34:25,239 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:34:25,246 INFO L256 TraceCheckSpWp]: Trace formula consists of 756 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-17 10:34:25,257 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 10:34:25,286 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-17 10:34:25,478 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-03-17 10:34:25,492 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-17 10:34:25,492 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 10:34:25,650 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-17 10:34:25,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1675695735] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 10:34:25,651 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 10:34:25,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 12 [2025-03-17 10:34:25,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947380691] [2025-03-17 10:34:25,651 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 10:34:25,652 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-17 10:34:25,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:34:25,652 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-17 10:34:25,653 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2025-03-17 10:34:25,653 INFO L87 Difference]: Start difference. First operand 658 states and 895 transitions. Second operand has 12 states, 12 states have (on average 26.5) internal successors, (318), 12 states have internal predecessors, (318), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-17 10:34:26,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:34:26,024 INFO L93 Difference]: Finished difference Result 2124 states and 2893 transitions. [2025-03-17 10:34:26,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-17 10:34:26,025 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 26.5) internal successors, (318), 12 states have internal predecessors, (318), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 160 [2025-03-17 10:34:26,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:34:26,031 INFO L225 Difference]: With dead ends: 2124 [2025-03-17 10:34:26,031 INFO L226 Difference]: Without dead ends: 1708 [2025-03-17 10:34:26,032 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 328 GetRequests, 312 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=144, Unknown=0, NotChecked=0, Total=210 [2025-03-17 10:34:26,033 INFO L435 NwaCegarLoop]: 545 mSDtfsCounter, 1837 mSDsluCounter, 2692 mSDsCounter, 0 mSdLazyCounter, 372 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1846 SdHoareTripleChecker+Valid, 3237 SdHoareTripleChecker+Invalid, 382 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 372 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 10:34:26,033 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1846 Valid, 3237 Invalid, 382 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 372 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 10:34:26,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1708 states. [2025-03-17 10:34:26,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1708 to 998. [2025-03-17 10:34:26,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 998 states, 982 states have (on average 1.3533604887983706) internal successors, (1329), 988 states have internal predecessors, (1329), 11 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-17 10:34:26,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 998 states to 998 states and 1351 transitions. [2025-03-17 10:34:26,096 INFO L78 Accepts]: Start accepts. Automaton has 998 states and 1351 transitions. Word has length 160 [2025-03-17 10:34:26,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:34:26,096 INFO L471 AbstractCegarLoop]: Abstraction has 998 states and 1351 transitions. [2025-03-17 10:34:26,096 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 26.5) internal successors, (318), 12 states have internal predecessors, (318), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-17 10:34:26,096 INFO L276 IsEmpty]: Start isEmpty. Operand 998 states and 1351 transitions. [2025-03-17 10:34:26,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 383 [2025-03-17 10:34:26,100 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:34:26,100 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 10:34:26,109 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-17 10:34:26,304 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-17 10:34:26,304 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 10:34:26,305 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:34:26,305 INFO L85 PathProgramCache]: Analyzing trace with hash -605849737, now seen corresponding path program 1 times [2025-03-17 10:34:26,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:34:26,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1589721896] [2025-03-17 10:34:26,305 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:34:26,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:34:26,397 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 382 statements into 1 equivalence classes. [2025-03-17 10:34:26,537 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 382 of 382 statements. [2025-03-17 10:34:26,540 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:34:26,540 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:34:28,998 INFO L134 CoverageAnalysis]: Checked inductivity of 450 backedges. 0 proven. 446 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-17 10:34:28,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:34:28,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1589721896] [2025-03-17 10:34:29,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1589721896] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 10:34:29,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [870340771] [2025-03-17 10:34:29,000 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:34:29,000 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 10:34:29,000 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 10:34:29,003 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 10:34:29,004 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-17 10:34:29,283 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 382 statements into 1 equivalence classes. [2025-03-17 10:34:29,500 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 382 of 382 statements. [2025-03-17 10:34:29,500 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:34:29,500 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:34:29,510 INFO L256 TraceCheckSpWp]: Trace formula consists of 1857 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-17 10:34:29,545 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 10:34:29,552 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-17 10:34:29,710 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-03-17 10:34:29,814 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-03-17 10:34:29,906 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-03-17 10:34:29,998 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-03-17 10:34:30,014 INFO L134 CoverageAnalysis]: Checked inductivity of 450 backedges. 0 proven. 446 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-17 10:34:30,014 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 10:34:30,445 INFO L134 CoverageAnalysis]: Checked inductivity of 450 backedges. 0 proven. 446 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-17 10:34:30,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [870340771] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 10:34:30,445 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 10:34:30,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8, 8] total 23 [2025-03-17 10:34:30,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1672753475] [2025-03-17 10:34:30,445 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 10:34:30,446 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-17 10:34:30,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:34:30,447 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-17 10:34:30,447 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=167, Invalid=339, Unknown=0, NotChecked=0, Total=506 [2025-03-17 10:34:30,449 INFO L87 Difference]: Start difference. First operand 998 states and 1351 transitions. Second operand has 23 states, 23 states have (on average 42.78260869565217) internal successors, (984), 23 states have internal predecessors, (984), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-17 10:34:31,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:34:31,557 INFO L93 Difference]: Finished difference Result 4191 states and 5722 transitions. [2025-03-17 10:34:31,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-03-17 10:34:31,557 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 42.78260869565217) internal successors, (984), 23 states have internal predecessors, (984), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 382 [2025-03-17 10:34:31,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:34:31,572 INFO L225 Difference]: With dead ends: 4191 [2025-03-17 10:34:31,572 INFO L226 Difference]: Without dead ends: 3775 [2025-03-17 10:34:31,574 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 785 GetRequests, 752 SyntacticMatches, 3 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 319 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=296, Invalid=696, Unknown=0, NotChecked=0, Total=992 [2025-03-17 10:34:31,576 INFO L435 NwaCegarLoop]: 1403 mSDtfsCounter, 5040 mSDsluCounter, 11389 mSDsCounter, 0 mSdLazyCounter, 1493 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5070 SdHoareTripleChecker+Valid, 12792 SdHoareTripleChecker+Invalid, 1541 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 1493 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-17 10:34:31,576 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5070 Valid, 12792 Invalid, 1541 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 1493 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-17 10:34:31,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3775 states. [2025-03-17 10:34:31,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3775 to 1844. [2025-03-17 10:34:31,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1844 states, 1822 states have (on average 1.3485181119648737) internal successors, (2457), 1828 states have internal predecessors, (2457), 17 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (17), 13 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-17 10:34:31,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1844 states to 1844 states and 2491 transitions. [2025-03-17 10:34:31,640 INFO L78 Accepts]: Start accepts. Automaton has 1844 states and 2491 transitions. Word has length 382 [2025-03-17 10:34:31,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:34:31,641 INFO L471 AbstractCegarLoop]: Abstraction has 1844 states and 2491 transitions. [2025-03-17 10:34:31,641 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 42.78260869565217) internal successors, (984), 23 states have internal predecessors, (984), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-17 10:34:31,641 INFO L276 IsEmpty]: Start isEmpty. Operand 1844 states and 2491 transitions. [2025-03-17 10:34:31,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 827 [2025-03-17 10:34:31,655 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:34:31,655 INFO L218 NwaCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 10:34:31,666 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-17 10:34:31,860 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2025-03-17 10:34:31,860 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 10:34:31,860 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:34:31,861 INFO L85 PathProgramCache]: Analyzing trace with hash 256942393, now seen corresponding path program 2 times [2025-03-17 10:34:31,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:34:31,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [985157199] [2025-03-17 10:34:31,861 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 10:34:31,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:34:32,114 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 826 statements into 2 equivalence classes. [2025-03-17 10:34:32,141 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 71 of 826 statements. [2025-03-17 10:34:32,141 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 10:34:32,141 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:34:32,240 INFO L134 CoverageAnalysis]: Checked inductivity of 3336 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3336 trivial. 0 not checked. [2025-03-17 10:34:32,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:34:32,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [985157199] [2025-03-17 10:34:32,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [985157199] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:34:32,242 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:34:32,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 10:34:32,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105667419] [2025-03-17 10:34:32,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:34:32,243 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 10:34:32,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:34:32,244 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 10:34:32,244 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 10:34:32,244 INFO L87 Difference]: Start difference. First operand 1844 states and 2491 transitions. Second operand has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 6 states have internal predecessors, (155), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 10:34:32,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:34:32,564 INFO L93 Difference]: Finished difference Result 2358 states and 3201 transitions. [2025-03-17 10:34:32,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 10:34:32,565 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 6 states have internal predecessors, (155), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 826 [2025-03-17 10:34:32,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:34:32,574 INFO L225 Difference]: With dead ends: 2358 [2025-03-17 10:34:32,574 INFO L226 Difference]: Without dead ends: 1945 [2025-03-17 10:34:32,576 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-03-17 10:34:32,576 INFO L435 NwaCegarLoop]: 401 mSDtfsCounter, 80 mSDsluCounter, 1351 mSDsCounter, 0 mSdLazyCounter, 469 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 1752 SdHoareTripleChecker+Invalid, 479 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 469 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 10:34:32,577 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 1752 Invalid, 479 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 469 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 10:34:32,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1945 states. [2025-03-17 10:34:32,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1945 to 1850. [2025-03-17 10:34:32,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1850 states, 1828 states have (on average 1.3473741794310723) internal successors, (2463), 1834 states have internal predecessors, (2463), 17 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (17), 13 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-17 10:34:32,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1850 states to 1850 states and 2497 transitions. [2025-03-17 10:34:32,624 INFO L78 Accepts]: Start accepts. Automaton has 1850 states and 2497 transitions. Word has length 826 [2025-03-17 10:34:32,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:34:32,625 INFO L471 AbstractCegarLoop]: Abstraction has 1850 states and 2497 transitions. [2025-03-17 10:34:32,626 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 6 states have internal predecessors, (155), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 10:34:32,626 INFO L276 IsEmpty]: Start isEmpty. Operand 1850 states and 2497 transitions. [2025-03-17 10:34:32,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 828 [2025-03-17 10:34:32,639 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:34:32,639 INFO L218 NwaCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 10:34:32,640 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-17 10:34:32,640 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 10:34:32,641 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:34:32,641 INFO L85 PathProgramCache]: Analyzing trace with hash 808083339, now seen corresponding path program 1 times [2025-03-17 10:34:32,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:34:32,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267760692] [2025-03-17 10:34:32,641 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:34:32,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:34:32,817 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 827 statements into 1 equivalence classes. [2025-03-17 10:34:33,113 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 827 of 827 statements. [2025-03-17 10:34:33,114 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:34:33,114 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:34:34,463 INFO L134 CoverageAnalysis]: Checked inductivity of 3336 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3336 trivial. 0 not checked. [2025-03-17 10:34:34,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:34:34,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [267760692] [2025-03-17 10:34:34,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [267760692] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:34:34,464 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:34:34,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 10:34:34,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246164220] [2025-03-17 10:34:34,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:34:34,465 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 10:34:34,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:34:34,465 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 10:34:34,465 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 10:34:34,465 INFO L87 Difference]: Start difference. First operand 1850 states and 2497 transitions. Second operand has 6 states, 6 states have (on average 26.0) internal successors, (156), 6 states have internal predecessors, (156), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 10:34:34,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:34:34,785 INFO L93 Difference]: Finished difference Result 2284 states and 3094 transitions. [2025-03-17 10:34:34,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 10:34:34,785 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 26.0) internal successors, (156), 6 states have internal predecessors, (156), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 827 [2025-03-17 10:34:34,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:34:34,792 INFO L225 Difference]: With dead ends: 2284 [2025-03-17 10:34:34,792 INFO L226 Difference]: Without dead ends: 1865 [2025-03-17 10:34:34,793 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-17 10:34:34,793 INFO L435 NwaCegarLoop]: 381 mSDtfsCounter, 14 mSDsluCounter, 1256 mSDsCounter, 0 mSdLazyCounter, 411 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 1637 SdHoareTripleChecker+Invalid, 412 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 411 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 10:34:34,793 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 1637 Invalid, 412 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 411 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 10:34:34,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1865 states. [2025-03-17 10:34:34,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1865 to 1862. [2025-03-17 10:34:34,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1862 states, 1840 states have (on average 1.3467391304347827) internal successors, (2478), 1846 states have internal predecessors, (2478), 17 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (17), 13 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-17 10:34:34,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1862 states to 1862 states and 2512 transitions. [2025-03-17 10:34:34,836 INFO L78 Accepts]: Start accepts. Automaton has 1862 states and 2512 transitions. Word has length 827 [2025-03-17 10:34:34,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:34:34,837 INFO L471 AbstractCegarLoop]: Abstraction has 1862 states and 2512 transitions. [2025-03-17 10:34:34,837 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.0) internal successors, (156), 6 states have internal predecessors, (156), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 10:34:34,837 INFO L276 IsEmpty]: Start isEmpty. Operand 1862 states and 2512 transitions. [2025-03-17 10:34:34,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 829 [2025-03-17 10:34:34,842 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:34:34,843 INFO L218 NwaCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 10:34:34,843 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-17 10:34:34,843 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 10:34:34,843 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:34:34,844 INFO L85 PathProgramCache]: Analyzing trace with hash -102208505, now seen corresponding path program 1 times [2025-03-17 10:34:34,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:34:34,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640421072] [2025-03-17 10:34:34,844 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:34:34,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:34:35,021 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 828 statements into 1 equivalence classes.