./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test7-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test7-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 89806bf5e92e08240ee093afcceea93b900865db28253b34ac5f2402fc0c0eb8 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 10:24:26,680 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 10:24:26,731 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-17 10:24:26,735 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 10:24:26,737 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 10:24:26,757 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 10:24:26,758 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 10:24:26,758 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 10:24:26,759 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 10:24:26,759 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 10:24:26,759 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 10:24:26,760 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 10:24:26,760 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 10:24:26,760 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 10:24:26,760 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 10:24:26,761 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 10:24:26,761 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 10:24:26,761 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 10:24:26,761 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 10:24:26,761 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 10:24:26,761 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 10:24:26,761 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 10:24:26,761 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 10:24:26,761 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 10:24:26,761 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 10:24:26,761 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 10:24:26,761 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 10:24:26,762 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 10:24:26,762 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 10:24:26,762 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 10:24:26,762 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 10:24:26,762 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 10:24:26,762 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 10:24:26,763 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 10:24:26,763 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 10:24:26,763 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 10:24:26,763 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 10:24:26,763 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 10:24:26,763 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 10:24:26,763 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 10:24:26,763 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 10:24:26,763 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 10:24:26,763 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 10:24:26,763 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 -> 89806bf5e92e08240ee093afcceea93b900865db28253b34ac5f2402fc0c0eb8 [2025-03-17 10:24:26,988 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 10:24:26,998 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 10:24:27,000 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 10:24:27,001 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 10:24:27,001 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 10:24:27,003 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test7-1.i [2025-03-17 10:24:28,163 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/04a0b8c02/7ce620fa18fe4c0a8b60a81721af09d4/FLAGab7eb29ee [2025-03-17 10:24:28,489 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 10:24:28,489 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test7-1.i [2025-03-17 10:24:28,504 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/04a0b8c02/7ce620fa18fe4c0a8b60a81721af09d4/FLAGab7eb29ee [2025-03-17 10:24:28,519 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/04a0b8c02/7ce620fa18fe4c0a8b60a81721af09d4 [2025-03-17 10:24:28,521 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 10:24:28,526 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 10:24:28,527 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 10:24:28,527 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 10:24:28,530 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 10:24:28,531 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 10:24:28" (1/1) ... [2025-03-17 10:24:28,533 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7fc7ab4f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:24:28, skipping insertion in model container [2025-03-17 10:24:28,533 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 10:24:28" (1/1) ... [2025-03-17 10:24:28,574 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 10:24:28,790 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_FNV_test7-1.i[33021,33034] [2025-03-17 10:24:28,861 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_FNV_test7-1.i[44124,44137] [2025-03-17 10:24:28,861 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_FNV_test7-1.i[44245,44258] [2025-03-17 10:24:28,869 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 10:24:28,884 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 10:24:28,922 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_FNV_test7-1.i[33021,33034] [2025-03-17 10:24:28,966 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_FNV_test7-1.i[44124,44137] [2025-03-17 10:24:28,966 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_FNV_test7-1.i[44245,44258] [2025-03-17 10:24:28,969 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 10:24:28,992 INFO L204 MainTranslator]: Completed translation [2025-03-17 10:24:28,993 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:24:28 WrapperNode [2025-03-17 10:24:28,993 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 10:24:28,993 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 10:24:28,993 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 10:24:28,993 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 10:24:28,997 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:24:28" (1/1) ... [2025-03-17 10:24:29,022 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:24:28" (1/1) ... [2025-03-17 10:24:29,082 INFO L138 Inliner]: procedures = 176, calls = 269, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 1378 [2025-03-17 10:24:29,082 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 10:24:29,083 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 10:24:29,084 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 10:24:29,084 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 10:24:29,091 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:24:28" (1/1) ... [2025-03-17 10:24:29,092 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:24:28" (1/1) ... [2025-03-17 10:24:29,102 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:24:28" (1/1) ... [2025-03-17 10:24:29,152 INFO L175 MemorySlicer]: Split 253 memory accesses to 3 slices as follows [2, 34, 217]. 86 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 54 writes are split as follows [0, 4, 50]. [2025-03-17 10:24:29,153 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:24:28" (1/1) ... [2025-03-17 10:24:29,153 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:24:28" (1/1) ... [2025-03-17 10:24:29,192 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:24:28" (1/1) ... [2025-03-17 10:24:29,194 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:24:28" (1/1) ... [2025-03-17 10:24:29,197 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:24:28" (1/1) ... [2025-03-17 10:24:29,202 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:24:28" (1/1) ... [2025-03-17 10:24:29,210 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 10:24:29,212 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 10:24:29,213 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 10:24:29,213 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 10:24:29,213 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:24:28" (1/1) ... [2025-03-17 10:24:29,217 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 10:24:29,226 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 10:24:29,238 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:24:29,244 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:24:29,257 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-17 10:24:29,258 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-17 10:24:29,258 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-17 10:24:29,258 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-17 10:24:29,258 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-17 10:24:29,258 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-17 10:24:29,258 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2025-03-17 10:24:29,258 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2025-03-17 10:24:29,258 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2025-03-17 10:24:29,258 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2025-03-17 10:24:29,258 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2025-03-17 10:24:29,258 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2025-03-17 10:24:29,258 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-17 10:24:29,258 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 10:24:29,258 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-17 10:24:29,258 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-17 10:24:29,258 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-17 10:24:29,258 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-17 10:24:29,258 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-17 10:24:29,258 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-17 10:24:29,258 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-17 10:24:29,258 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-17 10:24:29,258 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 10:24:29,258 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-17 10:24:29,259 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-17 10:24:29,259 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 10:24:29,259 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 10:24:29,398 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 10:24:29,400 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 10:24:30,332 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L713: 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:24:30,395 INFO L? ?]: Removed 311 outVars from TransFormulas that were not future-live. [2025-03-17 10:24:30,395 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 10:24:30,435 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 10:24:30,437 INFO L336 CfgBuilder]: Removed 1 assume(true) statements. [2025-03-17 10:24:30,438 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 10:24:30 BoogieIcfgContainer [2025-03-17 10:24:30,438 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 10:24:30,440 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 10:24:30,440 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 10:24:30,443 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 10:24:30,443 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 10:24:28" (1/3) ... [2025-03-17 10:24:30,443 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72eb3be2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 10:24:30, skipping insertion in model container [2025-03-17 10:24:30,443 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:24:28" (2/3) ... [2025-03-17 10:24:30,444 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72eb3be2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 10:24:30, skipping insertion in model container [2025-03-17 10:24:30,444 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 10:24:30" (3/3) ... [2025-03-17 10:24:30,445 INFO L128 eAbstractionObserver]: Analyzing ICFG uthash_FNV_test7-1.i [2025-03-17 10:24:30,457 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 10:24:30,458 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG uthash_FNV_test7-1.i that has 4 procedures, 396 locations, 1 initial locations, 36 loop locations, and 2 error locations. [2025-03-17 10:24:30,510 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 10:24:30,520 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;@7ad786ec, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 10:24:30,522 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-03-17 10:24:30,527 INFO L276 IsEmpty]: Start isEmpty. Operand has 388 states, 381 states have (on average 1.6246719160104988) internal successors, (619), 383 states have internal predecessors, (619), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-17 10:24:30,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-17 10:24:30,531 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:24:30,531 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-17 10:24:30,532 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 10:24:30,536 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:24:30,536 INFO L85 PathProgramCache]: Analyzing trace with hash -1426167181, now seen corresponding path program 1 times [2025-03-17 10:24:30,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:24:30,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [378473024] [2025-03-17 10:24:30,543 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:24:30,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:24:30,627 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-17 10:24:30,636 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-17 10:24:30,637 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:24:30,638 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:24:30,674 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:24:30,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:24:30,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [378473024] [2025-03-17 10:24:30,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [378473024] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:24:30,676 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:24:30,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 10:24:30,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272032893] [2025-03-17 10:24:30,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:24:30,679 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 10:24:30,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:24:30,690 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 10:24:30,692 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 10:24:30,695 INFO L87 Difference]: Start difference. First operand has 388 states, 381 states have (on average 1.6246719160104988) internal successors, (619), 383 states have internal predecessors, (619), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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:24:30,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:24:30,816 INFO L93 Difference]: Finished difference Result 775 states and 1249 transitions. [2025-03-17 10:24:30,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 10:24:30,819 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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 7 [2025-03-17 10:24:30,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:24:30,828 INFO L225 Difference]: With dead ends: 775 [2025-03-17 10:24:30,828 INFO L226 Difference]: Without dead ends: 385 [2025-03-17 10:24:30,831 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:24:30,833 INFO L435 NwaCegarLoop]: 519 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 519 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 10:24:30,835 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 519 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 10:24:30,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385 states. [2025-03-17 10:24:30,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385 to 385. [2025-03-17 10:24:30,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 385 states, 379 states have (on average 1.4564643799472297) internal successors, (552), 380 states have internal predecessors, (552), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-17 10:24:30,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 558 transitions. [2025-03-17 10:24:30,883 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 558 transitions. Word has length 7 [2025-03-17 10:24:30,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:24:30,883 INFO L471 AbstractCegarLoop]: Abstraction has 385 states and 558 transitions. [2025-03-17 10:24:30,884 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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:24:30,884 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 558 transitions. [2025-03-17 10:24:30,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-03-17 10:24:30,884 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:24:30,884 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 10:24:30,885 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-17 10:24:30,885 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 10:24:30,885 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:24:30,885 INFO L85 PathProgramCache]: Analyzing trace with hash 731280288, now seen corresponding path program 1 times [2025-03-17 10:24:30,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:24:30,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122993612] [2025-03-17 10:24:30,886 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:24:30,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:24:30,902 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-17 10:24:30,917 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-17 10:24:30,917 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:24:30,917 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:24:31,026 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:24:31,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:24:31,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2122993612] [2025-03-17 10:24:31,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2122993612] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:24:31,027 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:24:31,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 10:24:31,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [122679703] [2025-03-17 10:24:31,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:24:31,028 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 10:24:31,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:24:31,029 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 10:24:31,029 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 10:24:31,029 INFO L87 Difference]: Start difference. First operand 385 states and 558 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 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:24:31,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:24:31,261 INFO L93 Difference]: Finished difference Result 952 states and 1383 transitions. [2025-03-17 10:24:31,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 10:24:31,261 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 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 9 [2025-03-17 10:24:31,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:24:31,264 INFO L225 Difference]: With dead ends: 952 [2025-03-17 10:24:31,264 INFO L226 Difference]: Without dead ends: 764 [2025-03-17 10:24:31,265 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:24:31,266 INFO L435 NwaCegarLoop]: 497 mSDtfsCounter, 543 mSDsluCounter, 988 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 546 SdHoareTripleChecker+Valid, 1485 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 10:24:31,266 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [546 Valid, 1485 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 10:24:31,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 764 states. [2025-03-17 10:24:31,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 764 to 387. [2025-03-17 10:24:31,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 387 states, 381 states have (on average 1.4540682414698163) internal successors, (554), 382 states have internal predecessors, (554), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-17 10:24:31,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 560 transitions. [2025-03-17 10:24:31,287 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 560 transitions. Word has length 9 [2025-03-17 10:24:31,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:24:31,287 INFO L471 AbstractCegarLoop]: Abstraction has 387 states and 560 transitions. [2025-03-17 10:24:31,287 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 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:24:31,287 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 560 transitions. [2025-03-17 10:24:31,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-03-17 10:24:31,289 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:24:31,289 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] [2025-03-17 10:24:31,289 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 10:24:31,289 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 10:24:31,290 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:24:31,290 INFO L85 PathProgramCache]: Analyzing trace with hash -512132827, now seen corresponding path program 1 times [2025-03-17 10:24:31,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:24:31,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172177311] [2025-03-17 10:24:31,290 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:24:31,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:24:31,342 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-03-17 10:24:31,357 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-03-17 10:24:31,357 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:24:31,357 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:24:31,643 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:24:31,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:24:31,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1172177311] [2025-03-17 10:24:31,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1172177311] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:24:31,644 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:24:31,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 10:24:31,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [460492866] [2025-03-17 10:24:31,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:24:31,644 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 10:24:31,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:24:31,645 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 10:24:31,645 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 10:24:31,645 INFO L87 Difference]: Start difference. First operand 387 states and 560 transitions. Second operand has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 states have internal predecessors, (83), 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:24:31,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:24:31,777 INFO L93 Difference]: Finished difference Result 729 states and 1051 transitions. [2025-03-17 10:24:31,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 10:24:31,777 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 states have internal predecessors, (83), 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 83 [2025-03-17 10:24:31,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:24:31,779 INFO L225 Difference]: With dead ends: 729 [2025-03-17 10:24:31,779 INFO L226 Difference]: Without dead ends: 345 [2025-03-17 10:24:31,780 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:24:31,780 INFO L435 NwaCegarLoop]: 424 mSDtfsCounter, 30 mSDsluCounter, 829 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 1253 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:24:31,780 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 1253 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 10:24:31,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2025-03-17 10:24:31,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 345. [2025-03-17 10:24:31,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 345 states, 339 states have (on average 1.407079646017699) internal successors, (477), 340 states have internal predecessors, (477), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-17 10:24:31,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 483 transitions. [2025-03-17 10:24:31,789 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 483 transitions. Word has length 83 [2025-03-17 10:24:31,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:24:31,789 INFO L471 AbstractCegarLoop]: Abstraction has 345 states and 483 transitions. [2025-03-17 10:24:31,789 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 states have internal predecessors, (83), 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:24:31,789 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 483 transitions. [2025-03-17 10:24:31,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-03-17 10:24:31,792 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:24:31,792 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] [2025-03-17 10:24:31,792 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 10:24:31,792 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 10:24:31,792 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:24:31,792 INFO L85 PathProgramCache]: Analyzing trace with hash -842971732, now seen corresponding path program 1 times [2025-03-17 10:24:31,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:24:31,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145913952] [2025-03-17 10:24:31,793 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:24:31,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:24:31,839 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-03-17 10:24:31,863 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-03-17 10:24:31,863 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:24:31,863 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:24:31,999 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:24:31,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:24:31,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [145913952] [2025-03-17 10:24:31,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [145913952] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:24:31,999 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:24:31,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 10:24:31,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770615296] [2025-03-17 10:24:31,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:24:32,000 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 10:24:32,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:24:32,000 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 10:24:32,000 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 10:24:32,000 INFO L87 Difference]: Start difference. First operand 345 states and 483 transitions. Second operand has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 2 states have internal predecessors, (83), 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:24:32,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:24:32,168 INFO L93 Difference]: Finished difference Result 934 states and 1320 transitions. [2025-03-17 10:24:32,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 10:24:32,169 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 2 states have internal predecessors, (83), 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 83 [2025-03-17 10:24:32,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:24:32,171 INFO L225 Difference]: With dead ends: 934 [2025-03-17 10:24:32,172 INFO L226 Difference]: Without dead ends: 592 [2025-03-17 10:24:32,172 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:24:32,174 INFO L435 NwaCegarLoop]: 608 mSDtfsCounter, 293 mSDsluCounter, 418 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 293 SdHoareTripleChecker+Valid, 1026 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 10:24:32,175 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [293 Valid, 1026 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 10:24:32,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 592 states. [2025-03-17 10:24:32,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 592 to 588. [2025-03-17 10:24:32,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 588 states, 582 states have (on average 1.4243986254295533) internal successors, (829), 583 states have internal predecessors, (829), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-17 10:24:32,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 588 states to 588 states and 835 transitions. [2025-03-17 10:24:32,190 INFO L78 Accepts]: Start accepts. Automaton has 588 states and 835 transitions. Word has length 83 [2025-03-17 10:24:32,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:24:32,191 INFO L471 AbstractCegarLoop]: Abstraction has 588 states and 835 transitions. [2025-03-17 10:24:32,191 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 2 states have internal predecessors, (83), 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:24:32,191 INFO L276 IsEmpty]: Start isEmpty. Operand 588 states and 835 transitions. [2025-03-17 10:24:32,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-03-17 10:24:32,193 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:24:32,193 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] [2025-03-17 10:24:32,193 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 10:24:32,194 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 10:24:32,194 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:24:32,195 INFO L85 PathProgramCache]: Analyzing trace with hash -1079405653, now seen corresponding path program 1 times [2025-03-17 10:24:32,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:24:32,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249778439] [2025-03-17 10:24:32,195 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:24:32,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:24:32,236 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-17 10:24:32,287 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-17 10:24:32,288 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:24:32,288 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:24:32,610 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:24:32,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:24:32,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [249778439] [2025-03-17 10:24:32,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [249778439] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:24:32,611 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:24:32,611 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 10:24:32,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [207903399] [2025-03-17 10:24:32,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:24:32,612 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 10:24:32,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:24:32,613 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 10:24:32,613 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 10:24:32,613 INFO L87 Difference]: Start difference. First operand 588 states and 835 transitions. Second operand has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 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:24:32,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:24:32,796 INFO L93 Difference]: Finished difference Result 867 states and 1230 transitions. [2025-03-17 10:24:32,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 10:24:32,796 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 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 98 [2025-03-17 10:24:32,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:24:32,804 INFO L225 Difference]: With dead ends: 867 [2025-03-17 10:24:32,804 INFO L226 Difference]: Without dead ends: 863 [2025-03-17 10:24:32,804 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:24:32,805 INFO L435 NwaCegarLoop]: 462 mSDtfsCounter, 453 mSDsluCounter, 879 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 456 SdHoareTripleChecker+Valid, 1341 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 10:24:32,805 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [456 Valid, 1341 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 10:24:32,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 863 states. [2025-03-17 10:24:32,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 863 to 590. [2025-03-17 10:24:32,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 590 states, 584 states have (on average 1.422945205479452) internal successors, (831), 585 states have internal predecessors, (831), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-17 10:24:32,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 590 states to 590 states and 837 transitions. [2025-03-17 10:24:32,834 INFO L78 Accepts]: Start accepts. Automaton has 590 states and 837 transitions. Word has length 98 [2025-03-17 10:24:32,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:24:32,835 INFO L471 AbstractCegarLoop]: Abstraction has 590 states and 837 transitions. [2025-03-17 10:24:32,835 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 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:24:32,837 INFO L276 IsEmpty]: Start isEmpty. Operand 590 states and 837 transitions. [2025-03-17 10:24:32,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-03-17 10:24:32,844 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:24:32,845 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:24:32,845 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 10:24:32,845 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 10:24:32,845 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:24:32,846 INFO L85 PathProgramCache]: Analyzing trace with hash 254543019, now seen corresponding path program 1 times [2025-03-17 10:24:32,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:24:32,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416255361] [2025-03-17 10:24:32,846 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:24:32,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:24:32,891 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-03-17 10:24:32,913 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-03-17 10:24:32,913 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:24:32,913 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:24:33,105 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:24:33,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:24:33,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1416255361] [2025-03-17 10:24:33,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1416255361] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:24:33,106 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:24:33,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 10:24:33,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717478586] [2025-03-17 10:24:33,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:24:33,106 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 10:24:33,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:24:33,106 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 10:24:33,107 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 10:24:33,107 INFO L87 Difference]: Start difference. First operand 590 states and 837 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:24:33,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:24:33,215 INFO L93 Difference]: Finished difference Result 851 states and 1213 transitions. [2025-03-17 10:24:33,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 10:24:33,215 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:24:33,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:24:33,218 INFO L225 Difference]: With dead ends: 851 [2025-03-17 10:24:33,218 INFO L226 Difference]: Without dead ends: 506 [2025-03-17 10:24:33,219 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:24:33,219 INFO L435 NwaCegarLoop]: 350 mSDtfsCounter, 30 mSDsluCounter, 681 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 1031 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:24:33,220 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 1031 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 10:24:33,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 506 states. [2025-03-17 10:24:33,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 506 to 506. [2025-03-17 10:24:33,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 506 states, 500 states have (on average 1.354) internal successors, (677), 501 states have internal predecessors, (677), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-17 10:24:33,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 506 states to 506 states and 683 transitions. [2025-03-17 10:24:33,243 INFO L78 Accepts]: Start accepts. Automaton has 506 states and 683 transitions. Word has length 150 [2025-03-17 10:24:33,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:24:33,244 INFO L471 AbstractCegarLoop]: Abstraction has 506 states and 683 transitions. [2025-03-17 10:24:33,244 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:24:33,244 INFO L276 IsEmpty]: Start isEmpty. Operand 506 states and 683 transitions. [2025-03-17 10:24:33,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-03-17 10:24:33,247 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:24:33,247 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:24:33,247 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 10:24:33,247 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 10:24:33,248 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:24:33,248 INFO L85 PathProgramCache]: Analyzing trace with hash -331214043, now seen corresponding path program 1 times [2025-03-17 10:24:33,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:24:33,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729180456] [2025-03-17 10:24:33,248 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:24:33,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:24:33,289 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-03-17 10:24:33,321 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-03-17 10:24:33,322 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:24:33,322 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:24:33,498 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:24:33,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:24:33,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [729180456] [2025-03-17 10:24:33,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [729180456] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:24:33,498 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:24:33,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 10:24:33,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766008407] [2025-03-17 10:24:33,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:24:33,499 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 10:24:33,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:24:33,500 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 10:24:33,500 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 10:24:33,500 INFO L87 Difference]: Start difference. First operand 506 states and 683 transitions. Second operand has 5 states, 5 states have (on average 28.6) internal successors, (143), 5 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:24:34,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:24:34,050 INFO L93 Difference]: Finished difference Result 1264 states and 1708 transitions. [2025-03-17 10:24:34,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 10:24:34,051 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 28.6) internal successors, (143), 5 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:24:34,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:24:34,054 INFO L225 Difference]: With dead ends: 1264 [2025-03-17 10:24:34,054 INFO L226 Difference]: Without dead ends: 846 [2025-03-17 10:24:34,054 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-03-17 10:24:34,055 INFO L435 NwaCegarLoop]: 453 mSDtfsCounter, 1098 mSDsluCounter, 817 mSDsCounter, 0 mSdLazyCounter, 257 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1099 SdHoareTripleChecker+Valid, 1270 SdHoareTripleChecker+Invalid, 262 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 257 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-17 10:24:34,055 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1099 Valid, 1270 Invalid, 262 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 257 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-17 10:24:34,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 846 states. [2025-03-17 10:24:34,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 846 to 643. [2025-03-17 10:24:34,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 643 states, 637 states have (on average 1.3563579277864992) internal successors, (864), 638 states have internal predecessors, (864), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-17 10:24:34,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 643 states to 643 states and 870 transitions. [2025-03-17 10:24:34,072 INFO L78 Accepts]: Start accepts. Automaton has 643 states and 870 transitions. Word has length 150 [2025-03-17 10:24:34,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:24:34,073 INFO L471 AbstractCegarLoop]: Abstraction has 643 states and 870 transitions. [2025-03-17 10:24:34,073 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 28.6) internal successors, (143), 5 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:24:34,073 INFO L276 IsEmpty]: Start isEmpty. Operand 643 states and 870 transitions. [2025-03-17 10:24:34,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-03-17 10:24:34,074 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:24:34,074 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:24:34,074 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 10:24:34,074 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 10:24:34,075 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:24:34,075 INFO L85 PathProgramCache]: Analyzing trace with hash -1061179497, now seen corresponding path program 1 times [2025-03-17 10:24:34,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:24:34,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848152823] [2025-03-17 10:24:34,075 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:24:34,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:24:34,109 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-03-17 10:24:34,136 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-03-17 10:24:34,137 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:24:34,137 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:24:34,635 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:24:34,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:24:34,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1848152823] [2025-03-17 10:24:34,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1848152823] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 10:24:34,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [134517366] [2025-03-17 10:24:34,636 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:24:34,636 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 10:24:34,636 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 10:24:34,640 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:24:34,642 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:24:34,826 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-03-17 10:24:34,906 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-03-17 10:24:34,906 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:24:34,906 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:24:34,911 INFO L256 TraceCheckSpWp]: Trace formula consists of 763 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-17 10:24:34,919 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 10:24:34,940 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:24:35,136 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 23 treesize of output 3 [2025-03-17 10:24:35,143 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-03-17 10:24:35,149 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:24:35,150 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 10:24:35,309 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:24:35,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [134517366] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 10:24:35,310 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 10:24:35,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 11 [2025-03-17 10:24:35,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1269982799] [2025-03-17 10:24:35,310 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 10:24:35,311 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-17 10:24:35,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:24:35,311 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-17 10:24:35,311 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2025-03-17 10:24:35,312 INFO L87 Difference]: Start difference. First operand 643 states and 870 transitions. Second operand has 11 states, 11 states have (on average 28.818181818181817) internal successors, (317), 11 states have internal predecessors, (317), 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:24:35,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:24:35,771 INFO L93 Difference]: Finished difference Result 2881 states and 3907 transitions. [2025-03-17 10:24:35,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-17 10:24:35,771 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 28.818181818181817) internal successors, (317), 11 states have internal predecessors, (317), 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:24:35,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:24:35,779 INFO L225 Difference]: With dead ends: 2881 [2025-03-17 10:24:35,780 INFO L226 Difference]: Without dead ends: 2480 [2025-03-17 10:24:35,781 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 328 GetRequests, 313 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2025-03-17 10:24:35,782 INFO L435 NwaCegarLoop]: 393 mSDtfsCounter, 2226 mSDsluCounter, 3201 mSDsCounter, 0 mSdLazyCounter, 396 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2230 SdHoareTripleChecker+Valid, 3594 SdHoareTripleChecker+Invalid, 408 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 396 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 10:24:35,782 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2230 Valid, 3594 Invalid, 408 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 396 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 10:24:35,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2480 states. [2025-03-17 10:24:35,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2480 to 983. [2025-03-17 10:24:35,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 983 states, 973 states have (on average 1.3504624871531345) internal successors, (1314), 974 states have internal predecessors, (1314), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-17 10:24:35,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 983 states to 983 states and 1326 transitions. [2025-03-17 10:24:35,830 INFO L78 Accepts]: Start accepts. Automaton has 983 states and 1326 transitions. Word has length 160 [2025-03-17 10:24:35,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:24:35,831 INFO L471 AbstractCegarLoop]: Abstraction has 983 states and 1326 transitions. [2025-03-17 10:24:35,831 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 28.818181818181817) internal successors, (317), 11 states have internal predecessors, (317), 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:24:35,831 INFO L276 IsEmpty]: Start isEmpty. Operand 983 states and 1326 transitions. [2025-03-17 10:24:35,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 383 [2025-03-17 10:24:35,835 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:24:35,835 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:24:35,846 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-17 10:24:36,041 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:24:36,041 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 10:24:36,042 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:24:36,042 INFO L85 PathProgramCache]: Analyzing trace with hash 931333243, now seen corresponding path program 1 times [2025-03-17 10:24:36,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:24:36,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084738010] [2025-03-17 10:24:36,042 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:24:36,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:24:36,154 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 382 statements into 1 equivalence classes. [2025-03-17 10:24:36,279 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 382 of 382 statements. [2025-03-17 10:24:36,280 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:24:36,280 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:24:38,775 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:24:38,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:24:38,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1084738010] [2025-03-17 10:24:38,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1084738010] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 10:24:38,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1658537849] [2025-03-17 10:24:38,777 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:24:38,777 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 10:24:38,777 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 10:24:38,779 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:24:38,781 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:24:39,061 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 382 statements into 1 equivalence classes. [2025-03-17 10:24:39,275 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 382 of 382 statements. [2025-03-17 10:24:39,276 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:24:39,276 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:24:39,286 INFO L256 TraceCheckSpWp]: Trace formula consists of 1891 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-17 10:24:39,294 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 10:24:39,301 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:24:39,461 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 23 treesize of output 3 [2025-03-17 10:24:39,551 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 36 treesize of output 13 [2025-03-17 10:24:39,637 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 36 treesize of output 13 [2025-03-17 10:24:39,720 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 36 treesize of output 13 [2025-03-17 10:24:39,724 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-03-17 10:24:39,727 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:24:39,728 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 10:24:40,150 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:24:40,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1658537849] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 10:24:40,151 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 10:24:40,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 8, 8] total 20 [2025-03-17 10:24:40,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [606756722] [2025-03-17 10:24:40,151 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 10:24:40,152 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-17 10:24:40,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:24:40,153 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-17 10:24:40,153 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=236, Unknown=0, NotChecked=0, Total=380 [2025-03-17 10:24:40,154 INFO L87 Difference]: Start difference. First operand 983 states and 1326 transitions. Second operand has 20 states, 20 states have (on average 38.35) internal successors, (767), 20 states have internal predecessors, (767), 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:24:41,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:24:41,001 INFO L93 Difference]: Finished difference Result 6115 states and 8302 transitions. [2025-03-17 10:24:41,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-03-17 10:24:41,002 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 38.35) internal successors, (767), 20 states have internal predecessors, (767), 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:24:41,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:24:41,020 INFO L225 Difference]: With dead ends: 6115 [2025-03-17 10:24:41,020 INFO L226 Difference]: Without dead ends: 5714 [2025-03-17 10:24:41,023 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 783 GetRequests, 756 SyntacticMatches, 3 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=223, Invalid=427, Unknown=0, NotChecked=0, Total=650 [2025-03-17 10:24:41,023 INFO L435 NwaCegarLoop]: 393 mSDtfsCounter, 7920 mSDsluCounter, 5024 mSDsCounter, 0 mSdLazyCounter, 594 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7930 SdHoareTripleChecker+Valid, 5417 SdHoareTripleChecker+Invalid, 629 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 594 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-17 10:24:41,023 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7930 Valid, 5417 Invalid, 629 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 594 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-17 10:24:41,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5714 states. [2025-03-17 10:24:41,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5714 to 1829. [2025-03-17 10:24:41,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1829 states, 1813 states have (on average 1.346938775510204) internal successors, (2442), 1814 states have internal predecessors, (2442), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-17 10:24:41,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1829 states to 1829 states and 2466 transitions. [2025-03-17 10:24:41,104 INFO L78 Accepts]: Start accepts. Automaton has 1829 states and 2466 transitions. Word has length 382 [2025-03-17 10:24:41,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:24:41,105 INFO L471 AbstractCegarLoop]: Abstraction has 1829 states and 2466 transitions. [2025-03-17 10:24:41,105 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 38.35) internal successors, (767), 20 states have internal predecessors, (767), 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:24:41,105 INFO L276 IsEmpty]: Start isEmpty. Operand 1829 states and 2466 transitions. [2025-03-17 10:24:41,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 827 [2025-03-17 10:24:41,116 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:24:41,116 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:24:41,128 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-17 10:24:41,317 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:24:41,317 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 10:24:41,318 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:24:41,318 INFO L85 PathProgramCache]: Analyzing trace with hash 732158275, now seen corresponding path program 2 times [2025-03-17 10:24:41,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:24:41,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430835657] [2025-03-17 10:24:41,318 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 10:24:41,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:24:41,522 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 826 statements into 2 equivalence classes. [2025-03-17 10:24:41,541 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 71 of 826 statements. [2025-03-17 10:24:41,545 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 10:24:41,546 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:24:41,640 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:24:41,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:24:41,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1430835657] [2025-03-17 10:24:41,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1430835657] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:24:41,641 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:24:41,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 10:24:41,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115136277] [2025-03-17 10:24:41,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:24:41,642 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 10:24:41,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:24:41,643 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 10:24:41,643 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 10:24:41,643 INFO L87 Difference]: Start difference. First operand 1829 states and 2466 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:24:41,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:24:41,966 INFO L93 Difference]: Finished difference Result 2328 states and 3151 transitions. [2025-03-17 10:24:41,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 10:24:41,967 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:24:41,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:24:41,975 INFO L225 Difference]: With dead ends: 2328 [2025-03-17 10:24:41,975 INFO L226 Difference]: Without dead ends: 1930 [2025-03-17 10:24:41,977 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:24:41,977 INFO L435 NwaCegarLoop]: 376 mSDtfsCounter, 80 mSDsluCounter, 1251 mSDsCounter, 0 mSdLazyCounter, 469 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 1627 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:24:41,977 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 1627 Invalid, 479 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 469 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 10:24:41,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1930 states. [2025-03-17 10:24:42,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1930 to 1835. [2025-03-17 10:24:42,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1835 states, 1819 states have (on average 1.3457943925233644) internal successors, (2448), 1820 states have internal predecessors, (2448), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-17 10:24:42,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1835 states to 1835 states and 2472 transitions. [2025-03-17 10:24:42,022 INFO L78 Accepts]: Start accepts. Automaton has 1835 states and 2472 transitions. Word has length 826 [2025-03-17 10:24:42,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:24:42,023 INFO L471 AbstractCegarLoop]: Abstraction has 1835 states and 2472 transitions. [2025-03-17 10:24:42,023 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:24:42,024 INFO L276 IsEmpty]: Start isEmpty. Operand 1835 states and 2472 transitions. [2025-03-17 10:24:42,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 828 [2025-03-17 10:24:42,037 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:24:42,037 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:24:42,037 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-17 10:24:42,038 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 10:24:42,039 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:24:42,039 INFO L85 PathProgramCache]: Analyzing trace with hash -1640093585, now seen corresponding path program 1 times [2025-03-17 10:24:42,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:24:42,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1815021297] [2025-03-17 10:24:42,039 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:24:42,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:24:42,250 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 827 statements into 1 equivalence classes. [2025-03-17 10:24:42,474 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 827 of 827 statements. [2025-03-17 10:24:42,474 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:24:42,474 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:24:44,194 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:24:44,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:24:44,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1815021297] [2025-03-17 10:24:44,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1815021297] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:24:44,195 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:24:44,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 10:24:44,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1807304890] [2025-03-17 10:24:44,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:24:44,196 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 10:24:44,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:24:44,196 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 10:24:44,196 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 10:24:44,196 INFO L87 Difference]: Start difference. First operand 1835 states and 2472 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:24:44,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:24:44,508 INFO L93 Difference]: Finished difference Result 2254 states and 3044 transitions. [2025-03-17 10:24:44,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 10:24:44,509 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:24:44,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:24:44,515 INFO L225 Difference]: With dead ends: 2254 [2025-03-17 10:24:44,515 INFO L226 Difference]: Without dead ends: 1850 [2025-03-17 10:24:44,516 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:24:44,516 INFO L435 NwaCegarLoop]: 356 mSDtfsCounter, 14 mSDsluCounter, 1156 mSDsCounter, 0 mSdLazyCounter, 411 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 1512 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:24:44,516 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 1512 Invalid, 412 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 411 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 10:24:44,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1850 states. [2025-03-17 10:24:44,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1850 to 1847. [2025-03-17 10:24:44,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1847 states, 1831 states have (on average 1.345166575641726) internal successors, (2463), 1832 states have internal predecessors, (2463), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-17 10:24:44,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1847 states to 1847 states and 2487 transitions. [2025-03-17 10:24:44,563 INFO L78 Accepts]: Start accepts. Automaton has 1847 states and 2487 transitions. Word has length 827 [2025-03-17 10:24:44,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:24:44,564 INFO L471 AbstractCegarLoop]: Abstraction has 1847 states and 2487 transitions. [2025-03-17 10:24:44,564 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:24:44,564 INFO L276 IsEmpty]: Start isEmpty. Operand 1847 states and 2487 transitions. [2025-03-17 10:24:44,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 829 [2025-03-17 10:24:44,569 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:24:44,569 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:24:44,569 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-17 10:24:44,570 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 10:24:44,570 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:24:44,570 INFO L85 PathProgramCache]: Analyzing trace with hash 1610765802, now seen corresponding path program 1 times [2025-03-17 10:24:44,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:24:44,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181021144] [2025-03-17 10:24:44,571 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:24:44,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:24:44,754 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 828 statements into 1 equivalence classes. [2025-03-17 10:24:44,967 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 828 of 828 statements. [2025-03-17 10:24:44,968 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:24:44,968 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:24:46,347 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:24:46,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:24:46,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1181021144] [2025-03-17 10:24:46,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1181021144] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:24:46,348 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:24:46,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-17 10:24:46,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510747444] [2025-03-17 10:24:46,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:24:46,349 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 10:24:46,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:24:46,349 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 10:24:46,349 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-17 10:24:46,350 INFO L87 Difference]: Start difference. First operand 1847 states and 2487 transitions. Second operand has 9 states, 9 states have (on average 17.444444444444443) internal successors, (157), 9 states have internal predecessors, (157), 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:24:46,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:24:46,821 INFO L93 Difference]: Finished difference Result 2296 states and 3101 transitions. [2025-03-17 10:24:46,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 10:24:46,822 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 17.444444444444443) internal successors, (157), 9 states have internal predecessors, (157), 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 828 [2025-03-17 10:24:46,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:24:46,827 INFO L225 Difference]: With dead ends: 2296 [2025-03-17 10:24:46,827 INFO L226 Difference]: Without dead ends: 1880 [2025-03-17 10:24:46,828 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2025-03-17 10:24:46,828 INFO L435 NwaCegarLoop]: 357 mSDtfsCounter, 31 mSDsluCounter, 2123 mSDsCounter, 0 mSdLazyCounter, 698 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 2480 SdHoareTripleChecker+Invalid, 702 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 698 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 10:24:46,829 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 2480 Invalid, 702 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 698 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 10:24:46,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1880 states. [2025-03-17 10:24:46,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1880 to 1871. [2025-03-17 10:24:46,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1871 states, 1855 states have (on average 1.3423180592991915) internal successors, (2490), 1856 states have internal predecessors, (2490), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-17 10:24:46,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1871 states to 1871 states and 2514 transitions. [2025-03-17 10:24:46,865 INFO L78 Accepts]: Start accepts. Automaton has 1871 states and 2514 transitions. Word has length 828 [2025-03-17 10:24:46,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:24:46,866 INFO L471 AbstractCegarLoop]: Abstraction has 1871 states and 2514 transitions. [2025-03-17 10:24:46,866 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 17.444444444444443) internal successors, (157), 9 states have internal predecessors, (157), 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:24:46,866 INFO L276 IsEmpty]: Start isEmpty. Operand 1871 states and 2514 transitions. [2025-03-17 10:24:46,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 830 [2025-03-17 10:24:46,872 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:24:46,872 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, 1] [2025-03-17 10:24:46,872 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-17 10:24:46,872 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 10:24:46,872 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:24:46,873 INFO L85 PathProgramCache]: Analyzing trace with hash 1637289591, now seen corresponding path program 1 times [2025-03-17 10:24:46,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:24:46,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1497185183] [2025-03-17 10:24:46,873 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:24:46,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:24:47,047 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 829 statements into 1 equivalence classes. [2025-03-17 10:24:47,240 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 829 of 829 statements. [2025-03-17 10:24:47,241 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:24:47,241 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:24:55,299 INFO L134 CoverageAnalysis]: Checked inductivity of 3336 backedges. 0 proven. 3332 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-17 10:24:55,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:24:55,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1497185183] [2025-03-17 10:24:55,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1497185183] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 10:24:55,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1929743116] [2025-03-17 10:24:55,299 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:24:55,299 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 10:24:55,300 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 10:24:55,301 INFO L229 MonitoredProcess]: Starting monitored process 4 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:24:55,303 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-17 10:24:55,913 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 829 statements into 1 equivalence classes. [2025-03-17 10:24:56,372 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 829 of 829 statements. [2025-03-17 10:24:56,372 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:24:56,372 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:24:56,398 INFO L256 TraceCheckSpWp]: Trace formula consists of 4147 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-03-17 10:24:56,415 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 10:24:56,422 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:24:56,560 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 23 treesize of output 3 [2025-03-17 10:24:56,644 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 36 treesize of output 13 [2025-03-17 10:24:56,721 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 36 treesize of output 13 [2025-03-17 10:24:56,789 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 36 treesize of output 13 [2025-03-17 10:24:56,863 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 36 treesize of output 13 [2025-03-17 10:24:56,934 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 36 treesize of output 13 [2025-03-17 10:24:57,000 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 36 treesize of output 13 [2025-03-17 10:24:57,063 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 36 treesize of output 13 [2025-03-17 10:24:57,133 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 36 treesize of output 13 [2025-03-17 10:24:57,198 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-03-17 10:24:57,201 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-03-17 10:24:57,206 INFO L134 CoverageAnalysis]: Checked inductivity of 3336 backedges. 0 proven. 3332 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-17 10:24:57,207 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 10:24:58,049 INFO L134 CoverageAnalysis]: Checked inductivity of 3336 backedges. 0 proven. 3332 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-17 10:24:58,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1929743116] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 10:24:58,049 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 10:24:58,049 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 14, 14] total 38 [2025-03-17 10:24:58,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454457940] [2025-03-17 10:24:58,049 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 10:24:58,051 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2025-03-17 10:24:58,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:24:58,052 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2025-03-17 10:24:58,053 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=570, Invalid=836, Unknown=0, NotChecked=0, Total=1406 [2025-03-17 10:24:58,053 INFO L87 Difference]: Start difference. First operand 1871 states and 2514 transitions. Second operand has 38 states, 38 states have (on average 43.94736842105263) internal successors, (1670), 38 states have internal predecessors, (1670), 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:24:59,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:24:59,883 INFO L93 Difference]: Finished difference Result 13563 states and 18212 transitions. [2025-03-17 10:24:59,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2025-03-17 10:24:59,884 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 43.94736842105263) internal successors, (1670), 38 states have internal predecessors, (1670), 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 829 [2025-03-17 10:24:59,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:24:59,918 INFO L225 Difference]: With dead ends: 13563 [2025-03-17 10:24:59,918 INFO L226 Difference]: Without dead ends: 13120 [2025-03-17 10:24:59,925 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1698 GetRequests, 1647 SyntacticMatches, 3 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 802 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=871, Invalid=1579, Unknown=0, NotChecked=0, Total=2450 [2025-03-17 10:24:59,926 INFO L435 NwaCegarLoop]: 392 mSDtfsCounter, 24539 mSDsluCounter, 9178 mSDsCounter, 0 mSdLazyCounter, 1043 mSolverCounterSat, 107 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24561 SdHoareTripleChecker+Valid, 9570 SdHoareTripleChecker+Invalid, 1150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 107 IncrementalHoareTripleChecker+Valid, 1043 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-17 10:24:59,926 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [24561 Valid, 9570 Invalid, 1150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [107 Valid, 1043 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-17 10:24:59,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13120 states. [2025-03-17 10:25:00,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13120 to 3563. [2025-03-17 10:25:00,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3563 states, 3535 states have (on average 1.3425742574257427) internal successors, (4746), 3536 states have internal predecessors, (4746), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-03-17 10:25:00,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3563 states to 3563 states and 4794 transitions. [2025-03-17 10:25:00,129 INFO L78 Accepts]: Start accepts. Automaton has 3563 states and 4794 transitions. Word has length 829 [2025-03-17 10:25:00,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:25:00,130 INFO L471 AbstractCegarLoop]: Abstraction has 3563 states and 4794 transitions. [2025-03-17 10:25:00,131 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 43.94736842105263) internal successors, (1670), 38 states have internal predecessors, (1670), 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:25:00,131 INFO L276 IsEmpty]: Start isEmpty. Operand 3563 states and 4794 transitions. [2025-03-17 10:25:00,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1718 [2025-03-17 10:25:00,147 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:25:00,147 INFO L218 NwaCegarLoop]: trace histogram [23, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 21, 21, 21, 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] [2025-03-17 10:25:00,164 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-17 10:25:00,352 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 10:25:00,352 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 10:25:00,353 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:25:00,353 INFO L85 PathProgramCache]: Analyzing trace with hash -2123165977, now seen corresponding path program 2 times [2025-03-17 10:25:00,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:25:00,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1655657899] [2025-03-17 10:25:00,353 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 10:25:00,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:25:00,844 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 1717 statements into 2 equivalence classes. [2025-03-17 10:25:01,008 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 74 of 1717 statements. [2025-03-17 10:25:01,009 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 10:25:01,009 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:25:01,352 INFO L134 CoverageAnalysis]: Checked inductivity of 17100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17100 trivial. 0 not checked. [2025-03-17 10:25:01,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:25:01,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1655657899] [2025-03-17 10:25:01,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1655657899] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:25:01,352 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:25:01,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2025-03-17 10:25:01,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319041186] [2025-03-17 10:25:01,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:25:01,353 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-17 10:25:01,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:25:01,354 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-17 10:25:01,354 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=239, Unknown=0, NotChecked=0, Total=272 [2025-03-17 10:25:01,354 INFO L87 Difference]: Start difference. First operand 3563 states and 4794 transitions. Second operand has 17 states, 17 states have (on average 9.294117647058824) internal successors, (158), 17 states have internal predecessors, (158), 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:25:02,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:25:02,270 INFO L93 Difference]: Finished difference Result 4111 states and 5555 transitions. [2025-03-17 10:25:02,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-17 10:25:02,271 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 9.294117647058824) internal successors, (158), 17 states have internal predecessors, (158), 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 1717 [2025-03-17 10:25:02,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:25:02,277 INFO L225 Difference]: With dead ends: 4111 [2025-03-17 10:25:02,278 INFO L226 Difference]: Without dead ends: 3671 [2025-03-17 10:25:02,278 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=37, Invalid=269, Unknown=0, NotChecked=0, Total=306 [2025-03-17 10:25:02,279 INFO L435 NwaCegarLoop]: 319 mSDtfsCounter, 59 mSDsluCounter, 3820 mSDsCounter, 0 mSdLazyCounter, 1476 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 4139 SdHoareTripleChecker+Invalid, 1478 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1476 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-17 10:25:02,280 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 4139 Invalid, 1478 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1476 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-17 10:25:02,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3671 states. [2025-03-17 10:25:02,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3671 to 3599. [2025-03-17 10:25:02,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3599 states, 3571 states have (on average 1.3433211985438254) internal successors, (4797), 3572 states have internal predecessors, (4797), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-03-17 10:25:02,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3599 states to 3599 states and 4845 transitions. [2025-03-17 10:25:02,347 INFO L78 Accepts]: Start accepts. Automaton has 3599 states and 4845 transitions. Word has length 1717 [2025-03-17 10:25:02,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:25:02,348 INFO L471 AbstractCegarLoop]: Abstraction has 3599 states and 4845 transitions. [2025-03-17 10:25:02,348 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 9.294117647058824) internal successors, (158), 17 states have internal predecessors, (158), 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:25:02,349 INFO L276 IsEmpty]: Start isEmpty. Operand 3599 states and 4845 transitions. [2025-03-17 10:25:02,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1718 [2025-03-17 10:25:02,365 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:25:02,365 INFO L218 NwaCegarLoop]: trace histogram [23, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 21, 21, 21, 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] [2025-03-17 10:25:02,365 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-17 10:25:02,365 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 10:25:02,366 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:25:02,367 INFO L85 PathProgramCache]: Analyzing trace with hash -34955268, now seen corresponding path program 1 times [2025-03-17 10:25:02,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:25:02,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [370658223] [2025-03-17 10:25:02,368 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:25:02,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:25:02,743 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1717 statements into 1 equivalence classes. [2025-03-17 10:25:03,439 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1717 of 1717 statements. [2025-03-17 10:25:03,439 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:25:03,439 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:25:05,854 INFO L134 CoverageAnalysis]: Checked inductivity of 17100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17100 trivial. 0 not checked. [2025-03-17 10:25:05,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:25:05,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [370658223] [2025-03-17 10:25:05,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [370658223] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:25:05,855 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:25:05,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 10:25:05,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61880921] [2025-03-17 10:25:05,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:25:05,856 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 10:25:05,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:25:05,857 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 10:25:05,857 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-17 10:25:05,857 INFO L87 Difference]: Start difference. First operand 3599 states and 4845 transitions. Second operand has 6 states, 6 states have (on average 26.333333333333332) internal successors, (158), 6 states have internal predecessors, (158), 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:25:06,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:25:06,055 INFO L93 Difference]: Finished difference Result 4084 states and 5501 transitions. [2025-03-17 10:25:06,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 10:25:06,056 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 26.333333333333332) internal successors, (158), 6 states have internal predecessors, (158), 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 1717 [2025-03-17 10:25:06,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:25:06,062 INFO L225 Difference]: With dead ends: 4084 [2025-03-17 10:25:06,063 INFO L226 Difference]: Without dead ends: 3608 [2025-03-17 10:25:06,064 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-17 10:25:06,064 INFO L435 NwaCegarLoop]: 359 mSDtfsCounter, 8 mSDsluCounter, 900 mSDsCounter, 0 mSdLazyCounter, 309 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 1259 SdHoareTripleChecker+Invalid, 310 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 309 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 10:25:06,064 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 1259 Invalid, 310 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 309 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 10:25:06,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3608 states. [2025-03-17 10:25:06,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3608 to 3608. [2025-03-17 10:25:06,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3608 states, 3580 states have (on average 1.3424581005586593) internal successors, (4806), 3581 states have internal predecessors, (4806), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-03-17 10:25:06,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3608 states to 3608 states and 4854 transitions. [2025-03-17 10:25:06,124 INFO L78 Accepts]: Start accepts. Automaton has 3608 states and 4854 transitions. Word has length 1717 [2025-03-17 10:25:06,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:25:06,125 INFO L471 AbstractCegarLoop]: Abstraction has 3608 states and 4854 transitions. [2025-03-17 10:25:06,125 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.333333333333332) internal successors, (158), 6 states have internal predecessors, (158), 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:25:06,126 INFO L276 IsEmpty]: Start isEmpty. Operand 3608 states and 4854 transitions. [2025-03-17 10:25:06,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1719 [2025-03-17 10:25:06,141 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:25:06,141 INFO L218 NwaCegarLoop]: trace histogram [23, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 21, 21, 21, 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] [2025-03-17 10:25:06,141 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-17 10:25:06,142 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 10:25:06,142 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:25:06,143 INFO L85 PathProgramCache]: Analyzing trace with hash 1201771794, now seen corresponding path program 1 times [2025-03-17 10:25:06,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:25:06,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097535685] [2025-03-17 10:25:06,143 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:25:06,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:25:06,493 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1718 statements into 1 equivalence classes. [2025-03-17 10:25:07,071 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1718 of 1718 statements. [2025-03-17 10:25:07,071 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:25:07,071 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:25:46,286 INFO L134 CoverageAnalysis]: Checked inductivity of 17100 backedges. 0 proven. 17096 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-17 10:25:46,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:25:46,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1097535685] [2025-03-17 10:25:46,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1097535685] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 10:25:46,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1170185394] [2025-03-17 10:25:46,286 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:25:46,286 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 10:25:46,286 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 10:25:46,288 INFO L229 MonitoredProcess]: Starting monitored process 5 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:25:46,290 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-17 10:25:47,459 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1718 statements into 1 equivalence classes. [2025-03-17 10:25:48,334 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1718 of 1718 statements. [2025-03-17 10:25:48,335 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:25:48,335 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:25:48,386 INFO L256 TraceCheckSpWp]: Trace formula consists of 8660 conjuncts, 70 conjuncts are in the unsatisfiable core [2025-03-17 10:25:48,408 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 10:25:48,411 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:25:48,537 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 23 treesize of output 3 [2025-03-17 10:25:48,601 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 36 treesize of output 13 [2025-03-17 10:25:48,676 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 36 treesize of output 13 [2025-03-17 10:25:48,743 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 36 treesize of output 13 [2025-03-17 10:25:48,809 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 36 treesize of output 13 [2025-03-17 10:25:48,930 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 36 treesize of output 13 [2025-03-17 10:25:48,993 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 36 treesize of output 13 [2025-03-17 10:25:49,061 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 36 treesize of output 13 [2025-03-17 10:25:49,125 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 36 treesize of output 13 [2025-03-17 10:25:49,187 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 36 treesize of output 13 [2025-03-17 10:25:49,246 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 36 treesize of output 13 [2025-03-17 10:25:49,309 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 36 treesize of output 13 [2025-03-17 10:25:49,374 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 36 treesize of output 13 [2025-03-17 10:25:49,436 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 36 treesize of output 13 [2025-03-17 10:25:49,501 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 36 treesize of output 13 [2025-03-17 10:25:49,560 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 36 treesize of output 13 [2025-03-17 10:25:49,620 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 36 treesize of output 13 [2025-03-17 10:25:49,680 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 36 treesize of output 13 [2025-03-17 10:25:49,740 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 36 treesize of output 13 [2025-03-17 10:25:49,802 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 36 treesize of output 13 [2025-03-17 10:25:49,867 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 36 treesize of output 13 [2025-03-17 10:25:49,930 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 36 treesize of output 13 [2025-03-17 10:25:49,933 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-03-17 10:25:49,938 INFO L134 CoverageAnalysis]: Checked inductivity of 17100 backedges. 0 proven. 17096 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-17 10:25:49,938 INFO L312 TraceCheckSpWp]: Computing backward predicates...