./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test7-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 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_JEN_test7-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 1f8d40fc3d39b827c494ff373d43bd116589a8fd89c6e972621bd6e0216b2f6d --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 06:09:01,397 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 06:09:01,443 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-04 06:09:01,447 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 06:09:01,448 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 06:09:01,466 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 06:09:01,467 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 06:09:01,467 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 06:09:01,467 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 06:09:01,467 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 06:09:01,467 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 06:09:01,467 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 06:09:01,468 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 06:09:01,468 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 06:09:01,468 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 06:09:01,468 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 06:09:01,468 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 06:09:01,468 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 06:09:01,468 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 06:09:01,469 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 06:09:01,469 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 06:09:01,469 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 06:09:01,469 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 06:09:01,469 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 06:09:01,469 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 06:09:01,469 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 06:09:01,469 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 06:09:01,469 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 06:09:01,470 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 06:09:01,470 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 06:09:01,470 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 06:09:01,470 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 06:09:01,470 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 06:09:01,470 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 06:09:01,470 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 06:09:01,470 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 06:09:01,470 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 06:09:01,471 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 06:09:01,471 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 06:09:01,471 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 06:09:01,471 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 06:09:01,471 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 06:09:01,471 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 06:09:01,471 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 -> 1f8d40fc3d39b827c494ff373d43bd116589a8fd89c6e972621bd6e0216b2f6d [2025-03-04 06:09:01,729 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 06:09:01,741 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 06:09:01,748 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 06:09:01,749 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 06:09:01,749 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 06:09:01,750 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test7-2.i [2025-03-04 06:09:03,073 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b37d5486b/b528985334de4da3b9b3d75a50f30f71/FLAG1fcd32fc4 [2025-03-04 06:09:03,412 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 06:09:03,413 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test7-2.i [2025-03-04 06:09:03,426 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b37d5486b/b528985334de4da3b9b3d75a50f30f71/FLAG1fcd32fc4 [2025-03-04 06:09:03,440 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b37d5486b/b528985334de4da3b9b3d75a50f30f71 [2025-03-04 06:09:03,442 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 06:09:03,443 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 06:09:03,444 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 06:09:03,444 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 06:09:03,448 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 06:09:03,448 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 06:09:03" (1/1) ... [2025-03-04 06:09:03,449 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@22f5d0e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:09:03, skipping insertion in model container [2025-03-04 06:09:03,449 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 06:09:03" (1/1) ... [2025-03-04 06:09:03,480 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 06:09:03,787 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_JEN_test7-2.i[33021,33034] [2025-03-04 06:09:03,911 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_JEN_test7-2.i[44124,44137] [2025-03-04 06:09:03,912 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_JEN_test7-2.i[44245,44258] [2025-03-04 06:09:03,925 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 06:09:03,946 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 06:09:03,989 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_JEN_test7-2.i[33021,33034] [2025-03-04 06:09:04,053 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_JEN_test7-2.i[44124,44137] [2025-03-04 06:09:04,054 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_JEN_test7-2.i[44245,44258] [2025-03-04 06:09:04,064 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 06:09:04,093 INFO L204 MainTranslator]: Completed translation [2025-03-04 06:09:04,094 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:09:04 WrapperNode [2025-03-04 06:09:04,094 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 06:09:04,096 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 06:09:04,096 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 06:09:04,096 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 06:09:04,100 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:09:04" (1/1) ... [2025-03-04 06:09:04,126 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:09:04" (1/1) ... [2025-03-04 06:09:04,191 INFO L138 Inliner]: procedures = 176, calls = 320, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 1537 [2025-03-04 06:09:04,191 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 06:09:04,192 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 06:09:04,192 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 06:09:04,194 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 06:09:04,201 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:09:04" (1/1) ... [2025-03-04 06:09:04,202 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:09:04" (1/1) ... [2025-03-04 06:09:04,219 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:09:04" (1/1) ... [2025-03-04 06:09:04,322 INFO L175 MemorySlicer]: Split 301 memory accesses to 3 slices as follows [2, 34, 265]. 88 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 62 writes are split as follows [0, 4, 58]. [2025-03-04 06:09:04,323 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:09:04" (1/1) ... [2025-03-04 06:09:04,323 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:09:04" (1/1) ... [2025-03-04 06:09:04,387 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:09:04" (1/1) ... [2025-03-04 06:09:04,395 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:09:04" (1/1) ... [2025-03-04 06:09:04,407 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:09:04" (1/1) ... [2025-03-04 06:09:04,414 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:09:04" (1/1) ... [2025-03-04 06:09:04,430 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 06:09:04,432 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 06:09:04,433 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 06:09:04,433 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 06:09:04,434 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:09:04" (1/1) ... [2025-03-04 06:09:04,440 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 06:09:04,451 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 06:09:04,475 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-04 06:09:04,485 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-04 06:09:04,503 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 06:09:04,503 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 06:09:04,504 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-04 06:09:04,504 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 06:09:04,504 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 06:09:04,504 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-04 06:09:04,505 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2025-03-04 06:09:04,505 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2025-03-04 06:09:04,505 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2025-03-04 06:09:04,505 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2025-03-04 06:09:04,505 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2025-03-04 06:09:04,505 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2025-03-04 06:09:04,505 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-04 06:09:04,505 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 06:09:04,505 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-04 06:09:04,505 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-04 06:09:04,505 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-04 06:09:04,505 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-04 06:09:04,506 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-04 06:09:04,506 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-04 06:09:04,506 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-04 06:09:04,506 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-04 06:09:04,506 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 06:09:04,506 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 06:09:04,506 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-04 06:09:04,506 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 06:09:04,506 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 06:09:04,694 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 06:09:04,696 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 06:09:05,960 INFO L1325 $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-04 06:09:06,056 INFO L? ?]: Removed 333 outVars from TransFormulas that were not future-live. [2025-03-04 06:09:06,056 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 06:09:06,164 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 06:09:06,164 INFO L336 CfgBuilder]: Removed 1 assume(true) statements. [2025-03-04 06:09:06,165 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 06:09:06 BoogieIcfgContainer [2025-03-04 06:09:06,165 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 06:09:06,167 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 06:09:06,167 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 06:09:06,174 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 06:09:06,174 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 06:09:03" (1/3) ... [2025-03-04 06:09:06,175 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75d95f0f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 06:09:06, skipping insertion in model container [2025-03-04 06:09:06,175 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:09:04" (2/3) ... [2025-03-04 06:09:06,175 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75d95f0f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 06:09:06, skipping insertion in model container [2025-03-04 06:09:06,175 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 06:09:06" (3/3) ... [2025-03-04 06:09:06,176 INFO L128 eAbstractionObserver]: Analyzing ICFG uthash_JEN_test7-2.i [2025-03-04 06:09:06,188 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 06:09:06,189 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG uthash_JEN_test7-2.i that has 4 procedures, 430 locations, 1 initial locations, 41 loop locations, and 2 error locations. [2025-03-04 06:09:06,238 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 06:09:06,246 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;@103c3fea, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 06:09:06,246 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-03-04 06:09:06,250 INFO L276 IsEmpty]: Start isEmpty. Operand has 422 states, 415 states have (on average 1.6240963855421686) internal successors, (674), 417 states have internal predecessors, (674), 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-04 06:09:06,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-04 06:09:06,256 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 06:09:06,257 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:09:06,257 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 06:09:06,264 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:09:06,265 INFO L85 PathProgramCache]: Analyzing trace with hash -1649401392, now seen corresponding path program 1 times [2025-03-04 06:09:06,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:09:06,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868978835] [2025-03-04 06:09:06,270 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:09:06,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:09:06,353 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 06:09:06,363 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 06:09:06,363 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:09:06,363 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:09:06,424 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-04 06:09:06,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:09:06,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1868978835] [2025-03-04 06:09:06,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1868978835] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:09:06,426 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:09:06,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:09:06,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2085913122] [2025-03-04 06:09:06,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:09:06,430 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 06:09:06,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:09:06,449 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 06:09:06,449 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 06:09:06,453 INFO L87 Difference]: Start difference. First operand has 422 states, 415 states have (on average 1.6240963855421686) internal successors, (674), 417 states have internal predecessors, (674), 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 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:09:06,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 06:09:06,592 INFO L93 Difference]: Finished difference Result 842 states and 1358 transitions. [2025-03-04 06:09:06,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 06:09:06,594 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-03-04 06:09:06,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 06:09:06,604 INFO L225 Difference]: With dead ends: 842 [2025-03-04 06:09:06,604 INFO L226 Difference]: Without dead ends: 386 [2025-03-04 06:09:06,610 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-04 06:09:06,614 INFO L435 NwaCegarLoop]: 565 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 565 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 06:09:06,614 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 565 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 06:09:06,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2025-03-04 06:09:06,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 386. [2025-03-04 06:09:06,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 386 states, 380 states have (on average 1.4552631578947368) internal successors, (553), 381 states have internal predecessors, (553), 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-04 06:09:06,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 559 transitions. [2025-03-04 06:09:06,665 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 559 transitions. Word has length 8 [2025-03-04 06:09:06,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 06:09:06,665 INFO L471 AbstractCegarLoop]: Abstraction has 386 states and 559 transitions. [2025-03-04 06:09:06,666 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:09:06,666 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 559 transitions. [2025-03-04 06:09:06,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-03-04 06:09:06,666 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 06:09:06,666 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:09:06,666 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 06:09:06,666 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 06:09:06,667 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:09:06,667 INFO L85 PathProgramCache]: Analyzing trace with hash 951570077, now seen corresponding path program 1 times [2025-03-04 06:09:06,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:09:06,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882076446] [2025-03-04 06:09:06,667 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:09:06,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:09:06,678 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-04 06:09:06,686 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 06:09:06,687 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:09:06,687 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:09:06,805 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-04 06:09:06,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:09:06,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1882076446] [2025-03-04 06:09:06,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1882076446] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:09:06,806 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:09:06,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 06:09:06,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1494055591] [2025-03-04 06:09:06,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:09:06,806 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 06:09:06,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:09:06,807 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 06:09:06,807 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 06:09:06,807 INFO L87 Difference]: Start difference. First operand 386 states and 559 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 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-04 06:09:07,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 06:09:07,108 INFO L93 Difference]: Finished difference Result 953 states and 1384 transitions. [2025-03-04 06:09:07,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 06:09:07,109 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 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 10 [2025-03-04 06:09:07,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 06:09:07,116 INFO L225 Difference]: With dead ends: 953 [2025-03-04 06:09:07,116 INFO L226 Difference]: Without dead ends: 765 [2025-03-04 06:09:07,117 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-04 06:09:07,118 INFO L435 NwaCegarLoop]: 537 mSDtfsCounter, 543 mSDsluCounter, 1029 mSDsCounter, 0 mSdLazyCounter, 193 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 546 SdHoareTripleChecker+Valid, 1566 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 06:09:07,118 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [546 Valid, 1566 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 193 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 06:09:07,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 765 states. [2025-03-04 06:09:07,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 765 to 388. [2025-03-04 06:09:07,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 388 states, 382 states have (on average 1.4528795811518325) internal successors, (555), 383 states have internal predecessors, (555), 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-04 06:09:07,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 561 transitions. [2025-03-04 06:09:07,140 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 561 transitions. Word has length 10 [2025-03-04 06:09:07,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 06:09:07,140 INFO L471 AbstractCegarLoop]: Abstraction has 388 states and 561 transitions. [2025-03-04 06:09:07,140 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 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-04 06:09:07,141 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 561 transitions. [2025-03-04 06:09:07,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-03-04 06:09:07,143 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 06:09:07,143 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:09:07,143 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 06:09:07,143 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 06:09:07,144 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:09:07,144 INFO L85 PathProgramCache]: Analyzing trace with hash 1581376066, now seen corresponding path program 1 times [2025-03-04 06:09:07,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:09:07,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2035082442] [2025-03-04 06:09:07,144 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:09:07,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:09:07,195 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-03-04 06:09:07,215 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-03-04 06:09:07,215 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:09:07,215 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:09:07,564 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-04 06:09:07,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:09:07,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2035082442] [2025-03-04 06:09:07,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2035082442] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:09:07,564 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:09:07,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 06:09:07,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [938873747] [2025-03-04 06:09:07,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:09:07,564 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 06:09:07,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:09:07,565 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 06:09:07,565 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 06:09:07,565 INFO L87 Difference]: Start difference. First operand 388 states and 561 transitions. Second operand has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 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-04 06:09:07,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 06:09:07,708 INFO L93 Difference]: Finished difference Result 730 states and 1052 transitions. [2025-03-04 06:09:07,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 06:09:07,708 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 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 84 [2025-03-04 06:09:07,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 06:09:07,710 INFO L225 Difference]: With dead ends: 730 [2025-03-04 06:09:07,710 INFO L226 Difference]: Without dead ends: 346 [2025-03-04 06:09:07,713 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-04 06:09:07,713 INFO L435 NwaCegarLoop]: 425 mSDtfsCounter, 30 mSDsluCounter, 831 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 1256 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-04 06:09:07,713 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 1256 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 06:09:07,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2025-03-04 06:09:07,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 346. [2025-03-04 06:09:07,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 346 states, 340 states have (on average 1.4058823529411764) internal successors, (478), 341 states have internal predecessors, (478), 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-04 06:09:07,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 484 transitions. [2025-03-04 06:09:07,735 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 484 transitions. Word has length 84 [2025-03-04 06:09:07,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 06:09:07,735 INFO L471 AbstractCegarLoop]: Abstraction has 346 states and 484 transitions. [2025-03-04 06:09:07,735 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 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-04 06:09:07,735 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 484 transitions. [2025-03-04 06:09:07,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-03-04 06:09:07,740 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 06:09:07,740 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:09:07,741 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 06:09:07,741 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 06:09:07,741 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:09:07,741 INFO L85 PathProgramCache]: Analyzing trace with hash 1250537161, now seen corresponding path program 1 times [2025-03-04 06:09:07,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:09:07,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1318416979] [2025-03-04 06:09:07,743 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:09:07,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:09:07,783 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-03-04 06:09:07,809 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-03-04 06:09:07,810 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:09:07,810 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:09:07,965 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-04 06:09:07,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:09:07,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1318416979] [2025-03-04 06:09:07,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1318416979] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:09:07,965 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:09:07,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 06:09:07,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577782417] [2025-03-04 06:09:07,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:09:07,966 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:09:07,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:09:07,966 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:09:07,966 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:09:07,967 INFO L87 Difference]: Start difference. First operand 346 states and 484 transitions. Second operand has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 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-04 06:09:08,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 06:09:08,198 INFO L93 Difference]: Finished difference Result 938 states and 1323 transitions. [2025-03-04 06:09:08,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:09:08,198 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 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 84 [2025-03-04 06:09:08,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 06:09:08,201 INFO L225 Difference]: With dead ends: 938 [2025-03-04 06:09:08,201 INFO L226 Difference]: Without dead ends: 596 [2025-03-04 06:09:08,206 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:09:08,206 INFO L435 NwaCegarLoop]: 611 mSDtfsCounter, 296 mSDsluCounter, 419 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 296 SdHoareTripleChecker+Valid, 1030 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 06:09:08,207 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [296 Valid, 1030 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 06:09:08,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596 states. [2025-03-04 06:09:08,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596 to 589. [2025-03-04 06:09:08,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 589 states, 583 states have (on average 1.4236706689536878) internal successors, (830), 584 states have internal predecessors, (830), 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-04 06:09:08,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 589 states to 589 states and 836 transitions. [2025-03-04 06:09:08,258 INFO L78 Accepts]: Start accepts. Automaton has 589 states and 836 transitions. Word has length 84 [2025-03-04 06:09:08,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 06:09:08,258 INFO L471 AbstractCegarLoop]: Abstraction has 589 states and 836 transitions. [2025-03-04 06:09:08,259 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 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-04 06:09:08,259 INFO L276 IsEmpty]: Start isEmpty. Operand 589 states and 836 transitions. [2025-03-04 06:09:08,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-04 06:09:08,261 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 06:09:08,261 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] [2025-03-04 06:09:08,262 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 06:09:08,262 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 06:09:08,263 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:09:08,263 INFO L85 PathProgramCache]: Analyzing trace with hash -571842779, now seen corresponding path program 1 times [2025-03-04 06:09:08,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:09:08,263 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357437517] [2025-03-04 06:09:08,263 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:09:08,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:09:08,313 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-04 06:09:08,370 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-04 06:09:08,371 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:09:08,371 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:09:08,707 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-04 06:09:08,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:09:08,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1357437517] [2025-03-04 06:09:08,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1357437517] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:09:08,708 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:09:08,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 06:09:08,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [634709932] [2025-03-04 06:09:08,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:09:08,708 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 06:09:08,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:09:08,709 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 06:09:08,709 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 06:09:08,709 INFO L87 Difference]: Start difference. First operand 589 states and 836 transitions. Second operand has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 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-04 06:09:08,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 06:09:08,883 INFO L93 Difference]: Finished difference Result 868 states and 1231 transitions. [2025-03-04 06:09:08,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 06:09:08,883 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 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 99 [2025-03-04 06:09:08,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 06:09:08,887 INFO L225 Difference]: With dead ends: 868 [2025-03-04 06:09:08,887 INFO L226 Difference]: Without dead ends: 864 [2025-03-04 06:09:08,888 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-04 06:09:08,888 INFO L435 NwaCegarLoop]: 424 mSDtfsCounter, 453 mSDsluCounter, 842 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 456 SdHoareTripleChecker+Valid, 1266 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 06:09:08,889 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [456 Valid, 1266 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 06:09:08,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 864 states. [2025-03-04 06:09:08,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 864 to 591. [2025-03-04 06:09:08,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 591 states, 585 states have (on average 1.4222222222222223) internal successors, (832), 586 states have internal predecessors, (832), 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-04 06:09:08,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 591 states to 591 states and 838 transitions. [2025-03-04 06:09:08,911 INFO L78 Accepts]: Start accepts. Automaton has 591 states and 838 transitions. Word has length 99 [2025-03-04 06:09:08,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 06:09:08,911 INFO L471 AbstractCegarLoop]: Abstraction has 591 states and 838 transitions. [2025-03-04 06:09:08,911 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 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-04 06:09:08,912 INFO L276 IsEmpty]: Start isEmpty. Operand 591 states and 838 transitions. [2025-03-04 06:09:08,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-03-04 06:09:08,913 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 06:09:08,913 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] [2025-03-04 06:09:08,913 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 06:09:08,913 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 06:09:08,914 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:09:08,914 INFO L85 PathProgramCache]: Analyzing trace with hash 1265311397, now seen corresponding path program 1 times [2025-03-04 06:09:08,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:09:08,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1681120688] [2025-03-04 06:09:08,914 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:09:08,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:09:08,961 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-03-04 06:09:08,986 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-03-04 06:09:08,991 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:09:08,991 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:09:09,216 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-04 06:09:09,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:09:09,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1681120688] [2025-03-04 06:09:09,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1681120688] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:09:09,217 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:09:09,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 06:09:09,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1040786875] [2025-03-04 06:09:09,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:09:09,218 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 06:09:09,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:09:09,219 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 06:09:09,219 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 06:09:09,219 INFO L87 Difference]: Start difference. First operand 591 states and 838 transitions. Second operand has 4 states, 4 states have (on average 35.75) internal successors, (143), 4 states have internal predecessors, (143), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 06:09:09,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 06:09:09,357 INFO L93 Difference]: Finished difference Result 852 states and 1214 transitions. [2025-03-04 06:09:09,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 06:09:09,357 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 35.75) internal successors, (143), 4 states have internal predecessors, (143), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 151 [2025-03-04 06:09:09,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 06:09:09,359 INFO L225 Difference]: With dead ends: 852 [2025-03-04 06:09:09,359 INFO L226 Difference]: Without dead ends: 507 [2025-03-04 06:09:09,360 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-04 06:09:09,360 INFO L435 NwaCegarLoop]: 351 mSDtfsCounter, 30 mSDsluCounter, 683 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 1034 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-04 06:09:09,361 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 1034 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 06:09:09,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 507 states. [2025-03-04 06:09:09,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 507 to 507. [2025-03-04 06:09:09,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 507 states, 501 states have (on average 1.3532934131736527) internal successors, (678), 502 states have internal predecessors, (678), 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-04 06:09:09,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 507 states to 507 states and 684 transitions. [2025-03-04 06:09:09,373 INFO L78 Accepts]: Start accepts. Automaton has 507 states and 684 transitions. Word has length 151 [2025-03-04 06:09:09,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 06:09:09,373 INFO L471 AbstractCegarLoop]: Abstraction has 507 states and 684 transitions. [2025-03-04 06:09:09,373 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 35.75) internal successors, (143), 4 states have internal predecessors, (143), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 06:09:09,373 INFO L276 IsEmpty]: Start isEmpty. Operand 507 states and 684 transitions. [2025-03-04 06:09:09,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-03-04 06:09:09,374 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 06:09:09,374 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] [2025-03-04 06:09:09,375 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 06:09:09,375 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 06:09:09,375 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:09:09,375 INFO L85 PathProgramCache]: Analyzing trace with hash -970485665, now seen corresponding path program 1 times [2025-03-04 06:09:09,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:09:09,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [801725770] [2025-03-04 06:09:09,375 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:09:09,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:09:09,419 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-03-04 06:09:09,444 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-03-04 06:09:09,444 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:09:09,444 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:09:09,595 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-04 06:09:09,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:09:09,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [801725770] [2025-03-04 06:09:09,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [801725770] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:09:09,597 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:09:09,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 06:09:09,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372249599] [2025-03-04 06:09:09,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:09:09,597 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 06:09:09,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:09:09,598 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 06:09:09,598 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 06:09:09,598 INFO L87 Difference]: Start difference. First operand 507 states and 684 transitions. Second operand has 4 states, 4 states have (on average 36.0) internal successors, (144), 4 states have internal predecessors, (144), 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-04 06:09:09,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 06:09:09,931 INFO L93 Difference]: Finished difference Result 1069 states and 1442 transitions. [2025-03-04 06:09:09,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 06:09:09,932 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 36.0) internal successors, (144), 4 states have internal predecessors, (144), 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 151 [2025-03-04 06:09:09,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 06:09:09,935 INFO L225 Difference]: With dead ends: 1069 [2025-03-04 06:09:09,936 INFO L226 Difference]: Without dead ends: 651 [2025-03-04 06:09:09,938 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-04 06:09:09,938 INFO L435 NwaCegarLoop]: 428 mSDtfsCounter, 795 mSDsluCounter, 283 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 795 SdHoareTripleChecker+Valid, 711 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 06:09:09,940 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [795 Valid, 711 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 06:09:09,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 651 states. [2025-03-04 06:09:09,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 651 to 644. [2025-03-04 06:09:09,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 644 states, 638 states have (on average 1.3557993730407523) internal successors, (865), 639 states have internal predecessors, (865), 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-04 06:09:09,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 644 states to 644 states and 871 transitions. [2025-03-04 06:09:09,981 INFO L78 Accepts]: Start accepts. Automaton has 644 states and 871 transitions. Word has length 151 [2025-03-04 06:09:09,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 06:09:09,981 INFO L471 AbstractCegarLoop]: Abstraction has 644 states and 871 transitions. [2025-03-04 06:09:09,981 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 36.0) internal successors, (144), 4 states have internal predecessors, (144), 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-04 06:09:09,982 INFO L276 IsEmpty]: Start isEmpty. Operand 644 states and 871 transitions. [2025-03-04 06:09:09,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2025-03-04 06:09:09,983 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 06:09:09,984 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, 1] [2025-03-04 06:09:09,984 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 06:09:09,984 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 06:09:09,984 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:09:09,984 INFO L85 PathProgramCache]: Analyzing trace with hash 231431857, now seen corresponding path program 1 times [2025-03-04 06:09:09,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:09:09,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336326445] [2025-03-04 06:09:09,985 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:09:09,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:09:10,035 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-03-04 06:09:10,082 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-03-04 06:09:10,082 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:09:10,082 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:09:10,779 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-04 06:09:10,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:09:10,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1336326445] [2025-03-04 06:09:10,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1336326445] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 06:09:10,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [128986410] [2025-03-04 06:09:10,780 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:09:10,780 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 06:09:10,780 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 06:09:10,782 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-04 06:09:10,784 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-04 06:09:11,059 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-03-04 06:09:11,186 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-03-04 06:09:11,186 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:09:11,186 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:09:11,193 INFO L256 TraceCheckSpWp]: Trace formula consists of 763 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-04 06:09:11,206 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 06:09:11,233 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-04 06:09:11,492 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-04 06:09:11,501 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-04 06:09:11,509 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-04 06:09:11,509 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 06:09:11,682 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-04 06:09:11,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [128986410] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 06:09:11,682 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 06:09:11,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 5] total 11 [2025-03-04 06:09:11,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252863620] [2025-03-04 06:09:11,683 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 06:09:11,683 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 06:09:11,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:09:11,684 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 06:09:11,684 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2025-03-04 06:09:11,685 INFO L87 Difference]: Start difference. First operand 644 states and 871 transitions. Second operand has 11 states, 11 states have (on average 28.90909090909091) internal successors, (318), 11 states have internal predecessors, (318), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-04 06:09:12,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 06:09:12,076 INFO L93 Difference]: Finished difference Result 2882 states and 3908 transitions. [2025-03-04 06:09:12,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 06:09:12,077 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 28.90909090909091) internal successors, (318), 11 states have internal predecessors, (318), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 161 [2025-03-04 06:09:12,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 06:09:12,086 INFO L225 Difference]: With dead ends: 2882 [2025-03-04 06:09:12,086 INFO L226 Difference]: Without dead ends: 2481 [2025-03-04 06:09:12,088 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 330 GetRequests, 315 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-04 06:09:12,089 INFO L435 NwaCegarLoop]: 394 mSDtfsCounter, 2678 mSDsluCounter, 2516 mSDsCounter, 0 mSdLazyCounter, 313 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2682 SdHoareTripleChecker+Valid, 2910 SdHoareTripleChecker+Invalid, 325 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 313 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 06:09:12,089 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2682 Valid, 2910 Invalid, 325 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 313 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 06:09:12,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2481 states. [2025-03-04 06:09:12,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2481 to 984. [2025-03-04 06:09:12,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 984 states, 974 states have (on average 1.3501026694045175) internal successors, (1315), 975 states have internal predecessors, (1315), 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-04 06:09:12,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 984 states to 984 states and 1327 transitions. [2025-03-04 06:09:12,129 INFO L78 Accepts]: Start accepts. Automaton has 984 states and 1327 transitions. Word has length 161 [2025-03-04 06:09:12,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 06:09:12,129 INFO L471 AbstractCegarLoop]: Abstraction has 984 states and 1327 transitions. [2025-03-04 06:09:12,130 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 28.90909090909091) internal successors, (318), 11 states have internal predecessors, (318), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-04 06:09:12,130 INFO L276 IsEmpty]: Start isEmpty. Operand 984 states and 1327 transitions. [2025-03-04 06:09:12,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 384 [2025-03-04 06:09:12,136 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 06:09:12,137 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, 1] [2025-03-04 06:09:12,149 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-04 06:09:12,337 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-04 06:09:12,338 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 06:09:12,338 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:09:12,338 INFO L85 PathProgramCache]: Analyzing trace with hash -954147531, now seen corresponding path program 1 times [2025-03-04 06:09:12,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:09:12,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574093953] [2025-03-04 06:09:12,339 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:09:12,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:09:12,482 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 383 statements into 1 equivalence classes. [2025-03-04 06:09:12,630 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 383 of 383 statements. [2025-03-04 06:09:12,631 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:09:12,631 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:09:15,589 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-04 06:09:15,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:09:15,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1574093953] [2025-03-04 06:09:15,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1574093953] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 06:09:15,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [501101249] [2025-03-04 06:09:15,589 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:09:15,589 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 06:09:15,590 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 06:09:15,593 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-04 06:09:15,594 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-04 06:09:15,884 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 383 statements into 1 equivalence classes. [2025-03-04 06:09:16,110 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 383 of 383 statements. [2025-03-04 06:09:16,110 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:09:16,110 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:09:16,122 INFO L256 TraceCheckSpWp]: Trace formula consists of 1891 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-04 06:09:16,135 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 06:09:16,146 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-04 06:09:16,341 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-04 06:09:16,451 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-04 06:09:16,546 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-04 06:09:16,641 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-04 06:09:16,646 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-04 06:09:16,652 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-04 06:09:16,653 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 06:09:17,084 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-04 06:09:17,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [501101249] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 06:09:17,086 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 06:09:17,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9, 8] total 20 [2025-03-04 06:09:17,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1812663613] [2025-03-04 06:09:17,087 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 06:09:17,088 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-04 06:09:17,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:09:17,089 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-04 06:09:17,090 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=236, Unknown=0, NotChecked=0, Total=380 [2025-03-04 06:09:17,090 INFO L87 Difference]: Start difference. First operand 984 states and 1327 transitions. Second operand has 20 states, 20 states have (on average 38.4) internal successors, (768), 20 states have internal predecessors, (768), 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-04 06:09:17,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 06:09:17,988 INFO L93 Difference]: Finished difference Result 6116 states and 8303 transitions. [2025-03-04 06:09:17,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-03-04 06:09:17,989 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 38.4) internal successors, (768), 20 states have internal predecessors, (768), 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 383 [2025-03-04 06:09:17,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 06:09:18,007 INFO L225 Difference]: With dead ends: 6116 [2025-03-04 06:09:18,007 INFO L226 Difference]: Without dead ends: 5715 [2025-03-04 06:09:18,010 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 785 GetRequests, 758 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-04 06:09:18,011 INFO L435 NwaCegarLoop]: 394 mSDtfsCounter, 4676 mSDsluCounter, 5497 mSDsCounter, 0 mSdLazyCounter, 642 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4686 SdHoareTripleChecker+Valid, 5891 SdHoareTripleChecker+Invalid, 661 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 642 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-04 06:09:18,012 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4686 Valid, 5891 Invalid, 661 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 642 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-04 06:09:18,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5715 states. [2025-03-04 06:09:18,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5715 to 1830. [2025-03-04 06:09:18,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1830 states, 1814 states have (on average 1.346747519294377) internal successors, (2443), 1815 states have internal predecessors, (2443), 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-04 06:09:18,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1830 states to 1830 states and 2467 transitions. [2025-03-04 06:09:18,093 INFO L78 Accepts]: Start accepts. Automaton has 1830 states and 2467 transitions. Word has length 383 [2025-03-04 06:09:18,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 06:09:18,093 INFO L471 AbstractCegarLoop]: Abstraction has 1830 states and 2467 transitions. [2025-03-04 06:09:18,094 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 38.4) internal successors, (768), 20 states have internal predecessors, (768), 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-04 06:09:18,094 INFO L276 IsEmpty]: Start isEmpty. Operand 1830 states and 2467 transitions. [2025-03-04 06:09:18,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 828 [2025-03-04 06:09:18,105 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 06:09:18,106 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-04 06:09:18,118 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-04 06:09:18,310 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-04 06:09:18,310 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 06:09:18,311 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:09:18,311 INFO L85 PathProgramCache]: Analyzing trace with hash 602488125, now seen corresponding path program 2 times [2025-03-04 06:09:18,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:09:18,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [21266750] [2025-03-04 06:09:18,311 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 06:09:18,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:09:18,549 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 827 statements into 2 equivalence classes. [2025-03-04 06:09:18,571 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 72 of 827 statements. [2025-03-04 06:09:18,572 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 06:09:18,572 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:09:18,681 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-04 06:09:18,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:09:18,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [21266750] [2025-03-04 06:09:18,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [21266750] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:09:18,683 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:09:18,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 06:09:18,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1661598582] [2025-03-04 06:09:18,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:09:18,683 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 06:09:18,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:09:18,684 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 06:09:18,684 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:09:18,684 INFO L87 Difference]: Start difference. First operand 1830 states and 2467 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-04 06:09:19,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 06:09:19,034 INFO L93 Difference]: Finished difference Result 2329 states and 3152 transitions. [2025-03-04 06:09:19,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 06:09:19,035 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-04 06:09:19,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 06:09:19,041 INFO L225 Difference]: With dead ends: 2329 [2025-03-04 06:09:19,041 INFO L226 Difference]: Without dead ends: 1931 [2025-03-04 06:09:19,042 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-04 06:09:19,043 INFO L435 NwaCegarLoop]: 377 mSDtfsCounter, 80 mSDsluCounter, 1255 mSDsCounter, 0 mSdLazyCounter, 469 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 1632 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-04 06:09:19,043 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 1632 Invalid, 479 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 469 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 06:09:19,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1931 states. [2025-03-04 06:09:19,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1931 to 1836. [2025-03-04 06:09:19,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1836 states, 1820 states have (on average 1.3456043956043957) internal successors, (2449), 1821 states have internal predecessors, (2449), 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-04 06:09:19,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1836 states to 1836 states and 2473 transitions. [2025-03-04 06:09:19,089 INFO L78 Accepts]: Start accepts. Automaton has 1836 states and 2473 transitions. Word has length 827 [2025-03-04 06:09:19,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 06:09:19,090 INFO L471 AbstractCegarLoop]: Abstraction has 1836 states and 2473 transitions. [2025-03-04 06:09:19,090 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-04 06:09:19,090 INFO L276 IsEmpty]: Start isEmpty. Operand 1836 states and 2473 transitions. [2025-03-04 06:09:19,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 829 [2025-03-04 06:09:19,109 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 06:09:19,109 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-04 06:09:19,109 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 06:09:19,109 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 06:09:19,110 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:09:19,110 INFO L85 PathProgramCache]: Analyzing trace with hash -1364900884, now seen corresponding path program 1 times [2025-03-04 06:09:19,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:09:19,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1921485148] [2025-03-04 06:09:19,111 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:09:19,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:09:19,346 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 828 statements into 1 equivalence classes. [2025-03-04 06:09:19,661 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 828 of 828 statements. [2025-03-04 06:09:19,661 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:09:19,661 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:09:21,463 INFO L134 CoverageAnalysis]: Checked inductivity of 3336 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3336 trivial. 0 not checked. [2025-03-04 06:09:21,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:09:21,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1921485148] [2025-03-04 06:09:21,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1921485148] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:09:21,464 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:09:21,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 06:09:21,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [73558695] [2025-03-04 06:09:21,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:09:21,465 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 06:09:21,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:09:21,466 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 06:09:21,466 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:09:21,466 INFO L87 Difference]: Start difference. First operand 1836 states and 2473 transitions. Second operand has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 6 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-04 06:09:21,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 06:09:21,760 INFO L93 Difference]: Finished difference Result 2255 states and 3045 transitions. [2025-03-04 06:09:21,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:09:21,760 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 6 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-04 06:09:21,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 06:09:21,767 INFO L225 Difference]: With dead ends: 2255 [2025-03-04 06:09:21,767 INFO L226 Difference]: Without dead ends: 1851 [2025-03-04 06:09:21,768 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-04 06:09:21,769 INFO L435 NwaCegarLoop]: 357 mSDtfsCounter, 14 mSDsluCounter, 1160 mSDsCounter, 0 mSdLazyCounter, 411 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 1517 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-04 06:09:21,770 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 1517 Invalid, 412 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 411 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 06:09:21,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1851 states. [2025-03-04 06:09:21,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1851 to 1848. [2025-03-04 06:09:21,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1848 states, 1832 states have (on average 1.3449781659388647) internal successors, (2464), 1833 states have internal predecessors, (2464), 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-04 06:09:21,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1848 states to 1848 states and 2488 transitions. [2025-03-04 06:09:21,814 INFO L78 Accepts]: Start accepts. Automaton has 1848 states and 2488 transitions. Word has length 828 [2025-03-04 06:09:21,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 06:09:21,815 INFO L471 AbstractCegarLoop]: Abstraction has 1848 states and 2488 transitions. [2025-03-04 06:09:21,815 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 6 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-04 06:09:21,815 INFO L276 IsEmpty]: Start isEmpty. Operand 1848 states and 2488 transitions. [2025-03-04 06:09:21,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 830 [2025-03-04 06:09:21,820 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 06:09:21,821 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-04 06:09:21,821 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 06:09:21,821 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 06:09:21,821 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:09:21,822 INFO L85 PathProgramCache]: Analyzing trace with hash 1254757291, now seen corresponding path program 1 times [2025-03-04 06:09:21,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:09:21,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [725507382] [2025-03-04 06:09:21,822 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:09:21,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:09:22,004 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 829 statements into 1 equivalence classes. [2025-03-04 06:09:22,310 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 829 of 829 statements. [2025-03-04 06:09:22,310 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:09:22,310 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:09:31,934 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-04 06:09:31,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:09:31,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [725507382] [2025-03-04 06:09:31,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [725507382] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 06:09:31,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [581457567] [2025-03-04 06:09:31,935 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:09:31,935 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 06:09:31,935 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 06:09:31,938 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-04 06:09:31,941 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-04 06:09:32,758 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 829 statements into 1 equivalence classes. [2025-03-04 06:09:33,384 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 829 of 829 statements. [2025-03-04 06:09:33,384 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:09:33,384 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:09:33,410 INFO L256 TraceCheckSpWp]: Trace formula consists of 4149 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-03-04 06:09:33,428 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 06:09:33,435 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-04 06:09:33,584 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-04 06:09:33,664 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-04 06:09:33,767 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-04 06:09:33,864 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-04 06:09:33,965 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-04 06:09:34,070 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-04 06:09:34,162 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-04 06:09:34,256 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-04 06:09:34,354 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-04 06:09:34,451 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-04 06:09:34,456 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-04 06:09:34,470 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-04 06:09:34,470 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 06:09:35,754 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-04 06:09:35,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [581457567] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 06:09:35,755 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 06:09:35,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 15, 14] total 38 [2025-03-04 06:09:35,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1806098969] [2025-03-04 06:09:35,755 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 06:09:35,757 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2025-03-04 06:09:35,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:09:35,759 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2025-03-04 06:09:35,760 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=570, Invalid=836, Unknown=0, NotChecked=0, Total=1406 [2025-03-04 06:09:35,760 INFO L87 Difference]: Start difference. First operand 1848 states and 2488 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-04 06:09:38,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 06:09:38,225 INFO L93 Difference]: Finished difference Result 13004 states and 17583 transitions. [2025-03-04 06:09:38,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2025-03-04 06:09:38,226 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-04 06:09:38,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 06:09:38,272 INFO L225 Difference]: With dead ends: 13004 [2025-03-04 06:09:38,275 INFO L226 Difference]: Without dead ends: 12585 [2025-03-04 06:09:38,281 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1697 GetRequests, 1646 SyntacticMatches, 3 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 802 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=871, Invalid=1579, Unknown=0, NotChecked=0, Total=2450 [2025-03-04 06:09:38,282 INFO L435 NwaCegarLoop]: 394 mSDtfsCounter, 16880 mSDsluCounter, 9916 mSDsCounter, 0 mSdLazyCounter, 1133 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16902 SdHoareTripleChecker+Valid, 10310 SdHoareTripleChecker+Invalid, 1208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 1133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-04 06:09:38,282 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16902 Valid, 10310 Invalid, 1208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 1133 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-04 06:09:38,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12585 states. [2025-03-04 06:09:38,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12585 to 3540. [2025-03-04 06:09:38,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3540 states, 3512 states have (on average 1.3439635535307517) internal successors, (4720), 3513 states have internal predecessors, (4720), 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-04 06:09:38,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3540 states to 3540 states and 4768 transitions. [2025-03-04 06:09:38,624 INFO L78 Accepts]: Start accepts. Automaton has 3540 states and 4768 transitions. Word has length 829 [2025-03-04 06:09:38,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 06:09:38,627 INFO L471 AbstractCegarLoop]: Abstraction has 3540 states and 4768 transitions. [2025-03-04 06:09:38,628 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-04 06:09:38,628 INFO L276 IsEmpty]: Start isEmpty. Operand 3540 states and 4768 transitions. [2025-03-04 06:09:38,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1718 [2025-03-04 06:09:38,661 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 06:09:38,662 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-04 06:09:38,683 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-04 06:09:38,863 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 06:09:38,863 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 06:09:38,864 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:09:38,865 INFO L85 PathProgramCache]: Analyzing trace with hash 717527995, now seen corresponding path program 2 times [2025-03-04 06:09:38,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:09:38,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034581843] [2025-03-04 06:09:38,865 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 06:09:38,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:09:39,292 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 1717 statements into 2 equivalence classes. [2025-03-04 06:09:39,304 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 74 of 1717 statements. [2025-03-04 06:09:39,304 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 06:09:39,304 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:09:39,568 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-04 06:09:39,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:09:39,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034581843] [2025-03-04 06:09:39,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2034581843] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:09:39,568 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:09:39,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-04 06:09:39,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413831980] [2025-03-04 06:09:39,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:09:39,571 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 06:09:39,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:09:39,571 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 06:09:39,571 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-04 06:09:39,572 INFO L87 Difference]: Start difference. First operand 3540 states and 4768 transitions. Second operand has 9 states, 9 states have (on average 17.555555555555557) internal successors, (158), 9 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-04 06:09:40,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 06:09:40,108 INFO L93 Difference]: Finished difference Result 4019 states and 5418 transitions. [2025-03-04 06:09:40,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 06:09:40,108 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 17.555555555555557) internal successors, (158), 9 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-04 06:09:40,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 06:09:40,116 INFO L225 Difference]: With dead ends: 4019 [2025-03-04 06:09:40,116 INFO L226 Difference]: Without dead ends: 3603 [2025-03-04 06:09:40,118 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-03-04 06:09:40,120 INFO L435 NwaCegarLoop]: 361 mSDtfsCounter, 41 mSDsluCounter, 2104 mSDsCounter, 0 mSdLazyCounter, 718 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 2465 SdHoareTripleChecker+Invalid, 720 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 718 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-04 06:09:40,120 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 2465 Invalid, 720 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 718 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-04 06:09:40,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3603 states. [2025-03-04 06:09:40,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3603 to 3567. [2025-03-04 06:09:40,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3567 states, 3539 states have (on average 1.3438824526702458) internal successors, (4756), 3540 states have internal predecessors, (4756), 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-04 06:09:40,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3567 states to 3567 states and 4804 transitions. [2025-03-04 06:09:40,267 INFO L78 Accepts]: Start accepts. Automaton has 3567 states and 4804 transitions. Word has length 1717 [2025-03-04 06:09:40,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 06:09:40,269 INFO L471 AbstractCegarLoop]: Abstraction has 3567 states and 4804 transitions. [2025-03-04 06:09:40,269 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 17.555555555555557) internal successors, (158), 9 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-04 06:09:40,269 INFO L276 IsEmpty]: Start isEmpty. Operand 3567 states and 4804 transitions. [2025-03-04 06:09:40,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1718 [2025-03-04 06:09:40,294 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 06:09:40,295 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-04 06:09:40,295 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-04 06:09:40,295 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 06:09:40,297 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:09:40,297 INFO L85 PathProgramCache]: Analyzing trace with hash 1014575700, now seen corresponding path program 1 times [2025-03-04 06:09:40,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:09:40,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [931632524] [2025-03-04 06:09:40,298 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:09:40,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:09:40,863 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1717 statements into 1 equivalence classes. [2025-03-04 06:09:41,859 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1717 of 1717 statements. [2025-03-04 06:09:41,859 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:09:41,859 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:09:45,545 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-04 06:09:45,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:09:45,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [931632524] [2025-03-04 06:09:45,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [931632524] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:09:45,546 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:09:45,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-04 06:09:45,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [239408145] [2025-03-04 06:09:45,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:09:45,546 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 06:09:45,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:09:45,547 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 06:09:45,547 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-04 06:09:45,547 INFO L87 Difference]: Start difference. First operand 3567 states and 4804 transitions. Second operand has 9 states, 9 states have (on average 17.555555555555557) internal successors, (158), 9 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-04 06:09:45,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 06:09:45,963 INFO L93 Difference]: Finished difference Result 4016 states and 5418 transitions. [2025-03-04 06:09:45,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 06:09:45,966 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 17.555555555555557) internal successors, (158), 9 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-04 06:09:45,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 06:09:45,973 INFO L225 Difference]: With dead ends: 4016 [2025-03-04 06:09:45,973 INFO L226 Difference]: Without dead ends: 3573 [2025-03-04 06:09:45,975 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-04 06:09:45,975 INFO L435 NwaCegarLoop]: 358 mSDtfsCounter, 31 mSDsluCounter, 2130 mSDsCounter, 0 mSdLazyCounter, 698 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 2488 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.3s IncrementalHoareTripleChecker+Time [2025-03-04 06:09:45,975 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 2488 Invalid, 702 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 698 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 06:09:45,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3573 states. [2025-03-04 06:09:46,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3573 to 3564. [2025-03-04 06:09:46,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3564 states, 3536 states have (on average 1.3424773755656108) internal successors, (4747), 3537 states have internal predecessors, (4747), 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-04 06:09:46,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3564 states to 3564 states and 4795 transitions. [2025-03-04 06:09:46,068 INFO L78 Accepts]: Start accepts. Automaton has 3564 states and 4795 transitions. Word has length 1717 [2025-03-04 06:09:46,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 06:09:46,070 INFO L471 AbstractCegarLoop]: Abstraction has 3564 states and 4795 transitions. [2025-03-04 06:09:46,070 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 17.555555555555557) internal successors, (158), 9 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-04 06:09:46,070 INFO L276 IsEmpty]: Start isEmpty. Operand 3564 states and 4795 transitions. [2025-03-04 06:09:46,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1719 [2025-03-04 06:09:46,088 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 06:09:46,089 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-04 06:09:46,089 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-04 06:09:46,090 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 06:09:46,091 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:09:46,092 INFO L85 PathProgramCache]: Analyzing trace with hash -1871490919, now seen corresponding path program 1 times [2025-03-04 06:09:46,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:09:46,092 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1256763279] [2025-03-04 06:09:46,092 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:09:46,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:09:46,463 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1718 statements into 1 equivalence classes. [2025-03-04 06:09:47,013 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1718 of 1718 statements. [2025-03-04 06:09:47,013 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:09:47,013 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:09:49,491 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-04 06:09:49,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:09:49,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1256763279] [2025-03-04 06:09:49,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1256763279] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:09:49,491 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:09:49,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 06:09:49,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98344821] [2025-03-04 06:09:49,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:09:49,492 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 06:09:49,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:09:49,492 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 06:09:49,492 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:09:49,492 INFO L87 Difference]: Start difference. First operand 3564 states and 4795 transitions. Second operand has 6 states, 6 states have (on average 26.5) internal successors, (159), 6 states have internal predecessors, (159), 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-04 06:09:49,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 06:09:49,699 INFO L93 Difference]: Finished difference Result 4013 states and 5400 transitions. [2025-03-04 06:09:49,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:09:49,700 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 26.5) internal successors, (159), 6 states have internal predecessors, (159), 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 1718 [2025-03-04 06:09:49,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 06:09:49,706 INFO L225 Difference]: With dead ends: 4013 [2025-03-04 06:09:49,706 INFO L226 Difference]: Without dead ends: 3573 [2025-03-04 06:09:49,707 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-04 06:09:49,708 INFO L435 NwaCegarLoop]: 360 mSDtfsCounter, 8 mSDsluCounter, 1176 mSDsCounter, 0 mSdLazyCounter, 396 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 1536 SdHoareTripleChecker+Invalid, 397 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 396 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 06:09:49,708 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 1536 Invalid, 397 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 396 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 06:09:49,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3573 states. [2025-03-04 06:09:49,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3573 to 3573. [2025-03-04 06:09:49,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3573 states, 3545 states have (on average 1.3416078984485191) internal successors, (4756), 3546 states have internal predecessors, (4756), 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-04 06:09:49,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3573 states to 3573 states and 4804 transitions. [2025-03-04 06:09:49,766 INFO L78 Accepts]: Start accepts. Automaton has 3573 states and 4804 transitions. Word has length 1718 [2025-03-04 06:09:49,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 06:09:49,767 INFO L471 AbstractCegarLoop]: Abstraction has 3573 states and 4804 transitions. [2025-03-04 06:09:49,768 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.5) internal successors, (159), 6 states have internal predecessors, (159), 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-04 06:09:49,768 INFO L276 IsEmpty]: Start isEmpty. Operand 3573 states and 4804 transitions. [2025-03-04 06:09:49,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1719 [2025-03-04 06:09:49,784 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 06:09:49,784 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-04 06:09:49,784 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-04 06:09:49,784 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 06:09:49,785 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:09:49,785 INFO L85 PathProgramCache]: Analyzing trace with hash 665031429, now seen corresponding path program 1 times [2025-03-04 06:09:49,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:09:49,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535818826] [2025-03-04 06:09:49,786 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:09:49,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:09:50,202 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1718 statements into 1 equivalence classes. [2025-03-04 06:09:50,673 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1718 of 1718 statements. [2025-03-04 06:09:50,673 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:09:50,673 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat