./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test5-3.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test5-3.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 85752dfa9e642a242de1661b045d725551498d8fafaaba42a5d915ccb8e5b948 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 08:41:44,924 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 08:41:44,995 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-06 08:41:45,000 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 08:41:45,000 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 08:41:45,025 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 08:41:45,025 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 08:41:45,025 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 08:41:45,026 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 08:41:45,026 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 08:41:45,026 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 08:41:45,026 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 08:41:45,026 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 08:41:45,026 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 08:41:45,026 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 08:41:45,028 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 08:41:45,028 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 08:41:45,028 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 08:41:45,029 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 08:41:45,029 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 08:41:45,029 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 08:41:45,029 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 08:41:45,030 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 08:41:45,030 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 08:41:45,030 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 08:41:45,030 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 08:41:45,030 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 08:41:45,030 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 08:41:45,030 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 08:41:45,030 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 08:41:45,031 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 08:41:45,031 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 08:41:45,031 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 08:41:45,031 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 08:41:45,031 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 08:41:45,031 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 08:41:45,031 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 08:41:45,031 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 08:41:45,032 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 08:41:45,032 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 08:41:45,032 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 08:41:45,032 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 08:41:45,032 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 08:41:45,032 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 85752dfa9e642a242de1661b045d725551498d8fafaaba42a5d915ccb8e5b948 [2025-02-06 08:41:45,300 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 08:41:45,310 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 08:41:45,313 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 08:41:45,315 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 08:41:45,315 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 08:41:45,316 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test5-3.i [2025-02-06 08:41:46,601 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8c83e80da/03edad932da4475bb902f46b0f41c8ef/FLAGd8df20ce1 [2025-02-06 08:41:47,014 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 08:41:47,015 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test5-3.i [2025-02-06 08:41:47,030 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8c83e80da/03edad932da4475bb902f46b0f41c8ef/FLAGd8df20ce1 [2025-02-06 08:41:47,043 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8c83e80da/03edad932da4475bb902f46b0f41c8ef [2025-02-06 08:41:47,046 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 08:41:47,048 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 08:41:47,049 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 08:41:47,049 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 08:41:47,053 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 08:41:47,054 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 08:41:47" (1/1) ... [2025-02-06 08:41:47,054 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3d743ee4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:41:47, skipping insertion in model container [2025-02-06 08:41:47,055 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 08:41:47" (1/1) ... [2025-02-06 08:41:47,101 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 08:41:47,408 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test5-3.i[33021,33034] [2025-02-06 08:41:47,540 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test5-3.i[49681,49694] [2025-02-06 08:41:47,563 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 08:41:47,577 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 08:41:47,608 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test5-3.i[33021,33034] [2025-02-06 08:41:47,674 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test5-3.i[49681,49694] [2025-02-06 08:41:47,689 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 08:41:47,717 INFO L204 MainTranslator]: Completed translation [2025-02-06 08:41:47,717 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:41:47 WrapperNode [2025-02-06 08:41:47,717 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 08:41:47,718 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 08:41:47,718 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 08:41:47,719 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 08:41:47,724 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:41:47" (1/1) ... [2025-02-06 08:41:47,774 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:41:47" (1/1) ... [2025-02-06 08:41:47,868 INFO L138 Inliner]: procedures = 177, calls = 472, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 2278 [2025-02-06 08:41:47,869 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 08:41:47,870 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 08:41:47,870 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 08:41:47,871 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 08:41:47,879 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:41:47" (1/1) ... [2025-02-06 08:41:47,879 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:41:47" (1/1) ... [2025-02-06 08:41:47,892 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:41:47" (1/1) ... [2025-02-06 08:41:48,060 INFO L175 MemorySlicer]: Split 443 memory accesses to 3 slices as follows [2, 417, 24]. 94 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 99 writes are split as follows [0, 98, 1]. [2025-02-06 08:41:48,061 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:41:47" (1/1) ... [2025-02-06 08:41:48,061 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:41:47" (1/1) ... [2025-02-06 08:41:48,146 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:41:47" (1/1) ... [2025-02-06 08:41:48,150 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:41:47" (1/1) ... [2025-02-06 08:41:48,156 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:41:47" (1/1) ... [2025-02-06 08:41:48,162 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:41:47" (1/1) ... [2025-02-06 08:41:48,175 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 08:41:48,176 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 08:41:48,176 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 08:41:48,176 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 08:41:48,177 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:41:47" (1/1) ... [2025-02-06 08:41:48,186 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 08:41:48,199 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 08:41:48,214 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 08:41:48,220 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 08:41:48,243 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-06 08:41:48,244 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-06 08:41:48,244 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-06 08:41:48,244 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-02-06 08:41:48,244 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-02-06 08:41:48,244 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-06 08:41:48,245 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-06 08:41:48,245 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-06 08:41:48,245 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2025-02-06 08:41:48,245 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2025-02-06 08:41:48,245 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2025-02-06 08:41:48,245 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2025-02-06 08:41:48,245 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2025-02-06 08:41:48,245 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2025-02-06 08:41:48,246 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-06 08:41:48,246 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 08:41:48,246 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-02-06 08:41:48,246 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-02-06 08:41:48,246 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-02-06 08:41:48,246 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-06 08:41:48,246 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-02-06 08:41:48,247 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-02-06 08:41:48,247 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-02-06 08:41:48,247 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-06 08:41:48,247 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 08:41:48,247 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-06 08:41:48,248 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-06 08:41:48,248 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 08:41:48,248 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 08:41:48,499 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 08:41:48,501 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 08:41:50,316 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L734: call ULTIMATE.dealloc(main_~#j~0#1.base, main_~#j~0#1.offset);havoc main_~#j~0#1.base, main_~#j~0#1.offset; [2025-02-06 08:41:50,454 INFO L? ?]: Removed 524 outVars from TransFormulas that were not future-live. [2025-02-06 08:41:50,455 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 08:41:50,527 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 08:41:50,531 INFO L337 CfgBuilder]: Removed 2 assume(true) statements. [2025-02-06 08:41:50,531 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 08:41:50 BoogieIcfgContainer [2025-02-06 08:41:50,531 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 08:41:50,533 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 08:41:50,533 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 08:41:50,537 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 08:41:50,537 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 08:41:47" (1/3) ... [2025-02-06 08:41:50,538 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c2d0f0b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 08:41:50, skipping insertion in model container [2025-02-06 08:41:50,538 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:41:47" (2/3) ... [2025-02-06 08:41:50,538 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c2d0f0b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 08:41:50, skipping insertion in model container [2025-02-06 08:41:50,538 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 08:41:50" (3/3) ... [2025-02-06 08:41:50,539 INFO L128 eAbstractionObserver]: Analyzing ICFG uthash_JEN_test5-3.i [2025-02-06 08:41:50,556 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 08:41:50,557 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG uthash_JEN_test5-3.i that has 5 procedures, 630 locations, 1 initial locations, 58 loop locations, and 2 error locations. [2025-02-06 08:41:50,634 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 08:41:50,647 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;@315b3150, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 08:41:50,648 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-02-06 08:41:50,655 INFO L276 IsEmpty]: Start isEmpty. Operand has 622 states, 606 states have (on average 1.6204620462046204) internal successors, (982), 613 states have internal predecessors, (982), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2025-02-06 08:41:50,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-02-06 08:41:50,661 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:41:50,662 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-02-06 08:41:50,662 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 08:41:50,667 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:41:50,668 INFO L85 PathProgramCache]: Analyzing trace with hash 945622400, now seen corresponding path program 1 times [2025-02-06 08:41:50,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:41:50,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710823999] [2025-02-06 08:41:50,678 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:41:50,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:41:50,772 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-06 08:41:50,787 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-06 08:41:50,789 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:41:50,790 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:41:50,836 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 08:41:50,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:41:50,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1710823999] [2025-02-06 08:41:50,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1710823999] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:41:50,838 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:41:50,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 08:41:50,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1478611542] [2025-02-06 08:41:50,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:41:50,843 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 08:41:50,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:41:50,858 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 08:41:50,859 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 08:41:50,863 INFO L87 Difference]: Start difference. First operand has 622 states, 606 states have (on average 1.6204620462046204) internal successors, (982), 613 states have internal predecessors, (982), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:41:51,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:41:51,076 INFO L93 Difference]: Finished difference Result 1242 states and 2011 transitions. [2025-02-06 08:41:51,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 08:41:51,079 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-02-06 08:41:51,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:41:51,093 INFO L225 Difference]: With dead ends: 1242 [2025-02-06 08:41:51,095 INFO L226 Difference]: Without dead ends: 559 [2025-02-06 08:41:51,101 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 08:41:51,104 INFO L435 NwaCegarLoop]: 839 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 839 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 08:41:51,107 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 839 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 08:41:51,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 559 states. [2025-02-06 08:41:51,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 559 to 559. [2025-02-06 08:41:51,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 559 states, 544 states have (on average 1.463235294117647) internal successors, (796), 550 states have internal predecessors, (796), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2025-02-06 08:41:51,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 559 states to 559 states and 818 transitions. [2025-02-06 08:41:51,185 INFO L78 Accepts]: Start accepts. Automaton has 559 states and 818 transitions. Word has length 7 [2025-02-06 08:41:51,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:41:51,186 INFO L471 AbstractCegarLoop]: Abstraction has 559 states and 818 transitions. [2025-02-06 08:41:51,186 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:41:51,186 INFO L276 IsEmpty]: Start isEmpty. Operand 559 states and 818 transitions. [2025-02-06 08:41:51,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-02-06 08:41:51,188 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:41:51,189 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 08:41:51,189 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 08:41:51,189 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 08:41:51,189 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:41:51,190 INFO L85 PathProgramCache]: Analyzing trace with hash -224384479, now seen corresponding path program 1 times [2025-02-06 08:41:51,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:41:51,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2045015575] [2025-02-06 08:41:51,190 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:41:51,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:41:51,219 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-02-06 08:41:51,235 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-02-06 08:41:51,239 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:41:51,240 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:41:51,454 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 08:41:51,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:41:51,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2045015575] [2025-02-06 08:41:51,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2045015575] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:41:51,455 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:41:51,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 08:41:51,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2058271710] [2025-02-06 08:41:51,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:41:51,456 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 08:41:51,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:41:51,457 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 08:41:51,457 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 08:41:51,457 INFO L87 Difference]: Start difference. First operand 559 states and 818 transitions. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 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-02-06 08:41:51,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:41:51,745 INFO L93 Difference]: Finished difference Result 1279 states and 1882 transitions. [2025-02-06 08:41:51,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 08:41:51,746 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 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 60 [2025-02-06 08:41:51,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:41:51,755 INFO L225 Difference]: With dead ends: 1279 [2025-02-06 08:41:51,757 INFO L226 Difference]: Without dead ends: 1106 [2025-02-06 08:41:51,759 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 08:41:51,761 INFO L435 NwaCegarLoop]: 834 mSDtfsCounter, 782 mSDsluCounter, 749 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 793 SdHoareTripleChecker+Valid, 1583 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 08:41:51,761 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [793 Valid, 1583 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 08:41:51,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1106 states. [2025-02-06 08:41:51,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1106 to 560. [2025-02-06 08:41:51,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 560 states, 545 states have (on average 1.4623853211009175) internal successors, (797), 551 states have internal predecessors, (797), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2025-02-06 08:41:51,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 560 states to 560 states and 819 transitions. [2025-02-06 08:41:51,816 INFO L78 Accepts]: Start accepts. Automaton has 560 states and 819 transitions. Word has length 60 [2025-02-06 08:41:51,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:41:51,817 INFO L471 AbstractCegarLoop]: Abstraction has 560 states and 819 transitions. [2025-02-06 08:41:51,817 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 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-02-06 08:41:51,817 INFO L276 IsEmpty]: Start isEmpty. Operand 560 states and 819 transitions. [2025-02-06 08:41:51,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2025-02-06 08:41:51,832 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:41:51,832 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 08:41:51,833 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 08:41:51,833 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 08:41:51,834 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:41:51,837 INFO L85 PathProgramCache]: Analyzing trace with hash -1133277744, now seen corresponding path program 1 times [2025-02-06 08:41:51,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:41:51,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [478864094] [2025-02-06 08:41:51,837 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:41:51,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:41:51,951 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 204 statements into 1 equivalence classes. [2025-02-06 08:41:51,976 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 204 of 204 statements. [2025-02-06 08:41:51,976 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:41:51,976 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:41:52,552 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 08:41:52,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:41:52,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [478864094] [2025-02-06 08:41:52,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [478864094] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:41:52,553 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:41:52,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 08:41:52,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [946864035] [2025-02-06 08:41:52,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:41:52,554 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 08:41:52,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:41:52,556 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 08:41:52,556 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 08:41:52,556 INFO L87 Difference]: Start difference. First operand 560 states and 819 transitions. Second operand has 4 states, 4 states have (on average 51.0) internal successors, (204), 4 states have internal predecessors, (204), 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-02-06 08:41:52,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:41:52,816 INFO L93 Difference]: Finished difference Result 1120 states and 1638 transitions. [2025-02-06 08:41:52,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 08:41:52,817 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 51.0) internal successors, (204), 4 states have internal predecessors, (204), 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 204 [2025-02-06 08:41:52,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:41:52,822 INFO L225 Difference]: With dead ends: 1120 [2025-02-06 08:41:52,823 INFO L226 Difference]: Without dead ends: 563 [2025-02-06 08:41:52,824 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-02-06 08:41:52,826 INFO L435 NwaCegarLoop]: 728 mSDtfsCounter, 105 mSDsluCounter, 1372 mSDsCounter, 0 mSdLazyCounter, 223 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 2100 SdHoareTripleChecker+Invalid, 239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 08:41:52,826 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 2100 Invalid, 239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 223 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 08:41:52,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 563 states. [2025-02-06 08:41:52,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 563 to 560. [2025-02-06 08:41:52,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 560 states, 545 states have (on average 1.4495412844036697) internal successors, (790), 551 states have internal predecessors, (790), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2025-02-06 08:41:52,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 560 states to 560 states and 812 transitions. [2025-02-06 08:41:52,855 INFO L78 Accepts]: Start accepts. Automaton has 560 states and 812 transitions. Word has length 204 [2025-02-06 08:41:52,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:41:52,856 INFO L471 AbstractCegarLoop]: Abstraction has 560 states and 812 transitions. [2025-02-06 08:41:52,856 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 51.0) internal successors, (204), 4 states have internal predecessors, (204), 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-02-06 08:41:52,856 INFO L276 IsEmpty]: Start isEmpty. Operand 560 states and 812 transitions. [2025-02-06 08:41:52,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2025-02-06 08:41:52,860 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:41:52,861 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 08:41:52,861 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 08:41:52,861 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 08:41:52,862 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:41:52,862 INFO L85 PathProgramCache]: Analyzing trace with hash -971480745, now seen corresponding path program 1 times [2025-02-06 08:41:52,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:41:52,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1734871118] [2025-02-06 08:41:52,862 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:41:52,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:41:52,965 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 204 statements into 1 equivalence classes. [2025-02-06 08:41:53,009 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 204 of 204 statements. [2025-02-06 08:41:53,010 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:41:53,010 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:41:53,234 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 08:41:53,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:41:53,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1734871118] [2025-02-06 08:41:53,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1734871118] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:41:53,235 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:41:53,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 08:41:53,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [574156865] [2025-02-06 08:41:53,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:41:53,236 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 08:41:53,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:41:53,237 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 08:41:53,237 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 08:41:53,237 INFO L87 Difference]: Start difference. First operand 560 states and 812 transitions. Second operand has 3 states, 3 states have (on average 68.0) internal successors, (204), 3 states have internal predecessors, (204), 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-02-06 08:41:53,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:41:53,430 INFO L93 Difference]: Finished difference Result 1245 states and 1809 transitions. [2025-02-06 08:41:53,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 08:41:53,431 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 68.0) internal successors, (204), 3 states have internal predecessors, (204), 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 204 [2025-02-06 08:41:53,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:41:53,435 INFO L225 Difference]: With dead ends: 1245 [2025-02-06 08:41:53,435 INFO L226 Difference]: Without dead ends: 688 [2025-02-06 08:41:53,436 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 08:41:53,437 INFO L435 NwaCegarLoop]: 747 mSDtfsCounter, 134 mSDsluCounter, 740 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 1487 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 08:41:53,437 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 1487 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 08:41:53,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 688 states. [2025-02-06 08:41:53,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 688 to 688. [2025-02-06 08:41:53,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 688 states, 673 states have (on average 1.451708766716196) internal successors, (977), 679 states have internal predecessors, (977), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2025-02-06 08:41:53,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 688 states to 688 states and 999 transitions. [2025-02-06 08:41:53,465 INFO L78 Accepts]: Start accepts. Automaton has 688 states and 999 transitions. Word has length 204 [2025-02-06 08:41:53,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:41:53,466 INFO L471 AbstractCegarLoop]: Abstraction has 688 states and 999 transitions. [2025-02-06 08:41:53,466 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 68.0) internal successors, (204), 3 states have internal predecessors, (204), 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-02-06 08:41:53,466 INFO L276 IsEmpty]: Start isEmpty. Operand 688 states and 999 transitions. [2025-02-06 08:41:53,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2025-02-06 08:41:53,470 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:41:53,470 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 08:41:53,470 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 08:41:53,470 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 08:41:53,471 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:41:53,471 INFO L85 PathProgramCache]: Analyzing trace with hash -1144525970, now seen corresponding path program 1 times [2025-02-06 08:41:53,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:41:53,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [597883013] [2025-02-06 08:41:53,471 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:41:53,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:41:53,548 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 219 statements into 1 equivalence classes. [2025-02-06 08:41:53,592 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 219 of 219 statements. [2025-02-06 08:41:53,596 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:41:53,596 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:41:53,987 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-06 08:41:53,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:41:53,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [597883013] [2025-02-06 08:41:53,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [597883013] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:41:53,988 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:41:53,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 08:41:53,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1175078728] [2025-02-06 08:41:53,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:41:53,989 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 08:41:53,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:41:53,991 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 08:41:53,991 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 08:41:53,991 INFO L87 Difference]: Start difference. First operand 688 states and 999 transitions. Second operand has 4 states, 4 states have (on average 53.0) internal successors, (212), 4 states have internal predecessors, (212), 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-02-06 08:41:54,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:41:54,178 INFO L93 Difference]: Finished difference Result 1203 states and 1742 transitions. [2025-02-06 08:41:54,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 08:41:54,179 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 53.0) internal successors, (212), 4 states have internal predecessors, (212), 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 219 [2025-02-06 08:41:54,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:41:54,183 INFO L225 Difference]: With dead ends: 1203 [2025-02-06 08:41:54,183 INFO L226 Difference]: Without dead ends: 646 [2025-02-06 08:41:54,184 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-02-06 08:41:54,185 INFO L435 NwaCegarLoop]: 655 mSDtfsCounter, 30 mSDsluCounter, 1292 mSDsCounter, 0 mSdLazyCounter, 200 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 1947 SdHoareTripleChecker+Invalid, 222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 08:41:54,185 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 1947 Invalid, 222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 200 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 08:41:54,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 646 states. [2025-02-06 08:41:54,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 646 to 646. [2025-02-06 08:41:54,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 646 states, 631 states have (on average 1.4263074484944533) internal successors, (900), 637 states have internal predecessors, (900), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2025-02-06 08:41:54,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 646 states to 646 states and 922 transitions. [2025-02-06 08:41:54,215 INFO L78 Accepts]: Start accepts. Automaton has 646 states and 922 transitions. Word has length 219 [2025-02-06 08:41:54,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:41:54,215 INFO L471 AbstractCegarLoop]: Abstraction has 646 states and 922 transitions. [2025-02-06 08:41:54,217 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 53.0) internal successors, (212), 4 states have internal predecessors, (212), 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-02-06 08:41:54,218 INFO L276 IsEmpty]: Start isEmpty. Operand 646 states and 922 transitions. [2025-02-06 08:41:54,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2025-02-06 08:41:54,223 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:41:54,224 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 08:41:54,224 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 08:41:54,224 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 08:41:54,224 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:41:54,224 INFO L85 PathProgramCache]: Analyzing trace with hash 1709771574, now seen corresponding path program 1 times [2025-02-06 08:41:54,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:41:54,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [319584510] [2025-02-06 08:41:54,225 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:41:54,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:41:54,292 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 219 statements into 1 equivalence classes. [2025-02-06 08:41:54,322 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 219 of 219 statements. [2025-02-06 08:41:54,323 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:41:54,323 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:41:54,577 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-06 08:41:54,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:41:54,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [319584510] [2025-02-06 08:41:54,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [319584510] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:41:54,578 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:41:54,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 08:41:54,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1508616935] [2025-02-06 08:41:54,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:41:54,580 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 08:41:54,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:41:54,580 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 08:41:54,581 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 08:41:54,581 INFO L87 Difference]: Start difference. First operand 646 states and 922 transitions. Second operand has 3 states, 3 states have (on average 70.66666666666667) internal successors, (212), 3 states have internal predecessors, (212), 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-02-06 08:41:54,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:41:54,716 INFO L93 Difference]: Finished difference Result 1161 states and 1654 transitions. [2025-02-06 08:41:54,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 08:41:54,717 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 70.66666666666667) internal successors, (212), 3 states have internal predecessors, (212), 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 219 [2025-02-06 08:41:54,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:41:54,720 INFO L225 Difference]: With dead ends: 1161 [2025-02-06 08:41:54,721 INFO L226 Difference]: Without dead ends: 646 [2025-02-06 08:41:54,722 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 08:41:54,722 INFO L435 NwaCegarLoop]: 668 mSDtfsCounter, 1 mSDsluCounter, 646 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1314 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 08:41:54,723 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1314 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 08:41:54,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 646 states. [2025-02-06 08:41:54,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 646 to 646. [2025-02-06 08:41:54,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 646 states, 631 states have (on average 1.421553090332805) internal successors, (897), 637 states have internal predecessors, (897), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2025-02-06 08:41:54,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 646 states to 646 states and 919 transitions. [2025-02-06 08:41:54,741 INFO L78 Accepts]: Start accepts. Automaton has 646 states and 919 transitions. Word has length 219 [2025-02-06 08:41:54,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:41:54,741 INFO L471 AbstractCegarLoop]: Abstraction has 646 states and 919 transitions. [2025-02-06 08:41:54,742 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 70.66666666666667) internal successors, (212), 3 states have internal predecessors, (212), 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-02-06 08:41:54,742 INFO L276 IsEmpty]: Start isEmpty. Operand 646 states and 919 transitions. [2025-02-06 08:41:54,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2025-02-06 08:41:54,745 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:41:54,745 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 08:41:54,745 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 08:41:54,745 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 08:41:54,746 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:41:54,746 INFO L85 PathProgramCache]: Analyzing trace with hash 573997428, now seen corresponding path program 1 times [2025-02-06 08:41:54,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:41:54,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456892885] [2025-02-06 08:41:54,746 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:41:54,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:41:54,816 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 219 statements into 1 equivalence classes. [2025-02-06 08:41:54,856 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 219 of 219 statements. [2025-02-06 08:41:54,856 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:41:54,856 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:41:55,105 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-06 08:41:55,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:41:55,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1456892885] [2025-02-06 08:41:55,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1456892885] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:41:55,106 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:41:55,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 08:41:55,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888441284] [2025-02-06 08:41:55,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:41:55,107 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 08:41:55,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:41:55,108 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 08:41:55,108 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 08:41:55,108 INFO L87 Difference]: Start difference. First operand 646 states and 919 transitions. Second operand has 3 states, 3 states have (on average 70.66666666666667) internal successors, (212), 3 states have internal predecessors, (212), 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-02-06 08:41:55,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:41:55,338 INFO L93 Difference]: Finished difference Result 1451 states and 2064 transitions. [2025-02-06 08:41:55,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 08:41:55,339 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 70.66666666666667) internal successors, (212), 3 states have internal predecessors, (212), 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 219 [2025-02-06 08:41:55,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:41:55,345 INFO L225 Difference]: With dead ends: 1451 [2025-02-06 08:41:55,345 INFO L226 Difference]: Without dead ends: 936 [2025-02-06 08:41:55,347 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 08:41:55,347 INFO L435 NwaCegarLoop]: 849 mSDtfsCounter, 453 mSDsluCounter, 660 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 459 SdHoareTripleChecker+Valid, 1509 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 08:41:55,349 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [459 Valid, 1509 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 08:41:55,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 936 states. [2025-02-06 08:41:55,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 936 to 934. [2025-02-06 08:41:55,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 934 states, 911 states have (on average 1.420417124039517) internal successors, (1294), 922 states have internal predecessors, (1294), 19 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 11 states have call predecessors, (19), 19 states have call successors, (19) [2025-02-06 08:41:55,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 934 states to 934 states and 1332 transitions. [2025-02-06 08:41:55,383 INFO L78 Accepts]: Start accepts. Automaton has 934 states and 1332 transitions. Word has length 219 [2025-02-06 08:41:55,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:41:55,384 INFO L471 AbstractCegarLoop]: Abstraction has 934 states and 1332 transitions. [2025-02-06 08:41:55,384 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 70.66666666666667) internal successors, (212), 3 states have internal predecessors, (212), 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-02-06 08:41:55,384 INFO L276 IsEmpty]: Start isEmpty. Operand 934 states and 1332 transitions. [2025-02-06 08:41:55,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2025-02-06 08:41:55,388 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:41:55,388 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 08:41:55,388 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 08:41:55,388 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 08:41:55,389 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:41:55,389 INFO L85 PathProgramCache]: Analyzing trace with hash -1364227079, now seen corresponding path program 1 times [2025-02-06 08:41:55,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:41:55,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160603340] [2025-02-06 08:41:55,390 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:41:55,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:41:55,467 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 234 statements into 1 equivalence classes. [2025-02-06 08:41:55,519 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 234 of 234 statements. [2025-02-06 08:41:55,519 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:41:55,519 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:41:55,830 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-02-06 08:41:55,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:41:55,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [160603340] [2025-02-06 08:41:55,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [160603340] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 08:41:55,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2042008250] [2025-02-06 08:41:55,832 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:41:55,834 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 08:41:55,834 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 08:41:55,837 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 08:41:55,840 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-06 08:41:56,260 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 234 statements into 1 equivalence classes. [2025-02-06 08:41:56,449 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 234 of 234 statements. [2025-02-06 08:41:56,450 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:41:56,450 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:41:56,463 INFO L256 TraceCheckSpWp]: Trace formula consists of 1203 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-06 08:41:56,476 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 08:41:56,526 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-02-06 08:41:56,526 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 08:41:56,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2042008250] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:41:56,526 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 08:41:56,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-02-06 08:41:56,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900141883] [2025-02-06 08:41:56,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:41:56,529 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 08:41:56,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:41:56,530 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 08:41:56,530 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-06 08:41:56,530 INFO L87 Difference]: Start difference. First operand 934 states and 1332 transitions. Second operand has 3 states, 3 states have (on average 72.33333333333333) internal successors, (217), 3 states have internal predecessors, (217), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-02-06 08:41:56,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:41:56,710 INFO L93 Difference]: Finished difference Result 1291 states and 1870 transitions. [2025-02-06 08:41:56,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 08:41:56,711 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 72.33333333333333) internal successors, (217), 3 states have internal predecessors, (217), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 234 [2025-02-06 08:41:56,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:41:56,717 INFO L225 Difference]: With dead ends: 1291 [2025-02-06 08:41:56,717 INFO L226 Difference]: Without dead ends: 974 [2025-02-06 08:41:56,718 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 234 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-06 08:41:56,718 INFO L435 NwaCegarLoop]: 654 mSDtfsCounter, 8 mSDsluCounter, 639 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 1293 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 08:41:56,718 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 1293 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 08:41:56,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 974 states. [2025-02-06 08:41:56,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 974 to 974. [2025-02-06 08:41:56,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 974 states, 951 states have (on average 1.4027339642481598) internal successors, (1334), 962 states have internal predecessors, (1334), 19 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 11 states have call predecessors, (19), 19 states have call successors, (19) [2025-02-06 08:41:56,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 974 states to 974 states and 1372 transitions. [2025-02-06 08:41:56,752 INFO L78 Accepts]: Start accepts. Automaton has 974 states and 1372 transitions. Word has length 234 [2025-02-06 08:41:56,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:41:56,752 INFO L471 AbstractCegarLoop]: Abstraction has 974 states and 1372 transitions. [2025-02-06 08:41:56,753 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 72.33333333333333) internal successors, (217), 3 states have internal predecessors, (217), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-02-06 08:41:56,753 INFO L276 IsEmpty]: Start isEmpty. Operand 974 states and 1372 transitions. [2025-02-06 08:41:56,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2025-02-06 08:41:56,755 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:41:56,756 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 08:41:56,768 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-06 08:41:56,956 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 08:41:56,957 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 08:41:56,957 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:41:56,957 INFO L85 PathProgramCache]: Analyzing trace with hash 1469160218, now seen corresponding path program 1 times [2025-02-06 08:41:56,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:41:56,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [407568059] [2025-02-06 08:41:56,958 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:41:56,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:41:57,047 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 234 statements into 1 equivalence classes. [2025-02-06 08:41:57,094 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 234 of 234 statements. [2025-02-06 08:41:57,095 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:41:57,095 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:41:57,345 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-02-06 08:41:57,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:41:57,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [407568059] [2025-02-06 08:41:57,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [407568059] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 08:41:57,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [124447103] [2025-02-06 08:41:57,345 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:41:57,346 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 08:41:57,346 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 08:41:57,348 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 08:41:57,387 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-06 08:41:57,797 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 234 statements into 1 equivalence classes. [2025-02-06 08:41:57,985 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 234 of 234 statements. [2025-02-06 08:41:57,985 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:41:57,985 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:41:57,994 INFO L256 TraceCheckSpWp]: Trace formula consists of 1207 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-06 08:41:58,005 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 08:41:58,052 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-02-06 08:41:58,052 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 08:41:58,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [124447103] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:41:58,052 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 08:41:58,053 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2025-02-06 08:41:58,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18660146] [2025-02-06 08:41:58,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:41:58,053 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 08:41:58,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:41:58,054 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 08:41:58,054 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-06 08:41:58,055 INFO L87 Difference]: Start difference. First operand 974 states and 1372 transitions. Second operand has 4 states, 4 states have (on average 54.25) internal successors, (217), 4 states have internal predecessors, (217), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-02-06 08:41:58,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:41:58,253 INFO L93 Difference]: Finished difference Result 1303 states and 1862 transitions. [2025-02-06 08:41:58,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 08:41:58,253 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 54.25) internal successors, (217), 4 states have internal predecessors, (217), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 234 [2025-02-06 08:41:58,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:41:58,260 INFO L225 Difference]: With dead ends: 1303 [2025-02-06 08:41:58,260 INFO L226 Difference]: Without dead ends: 946 [2025-02-06 08:41:58,261 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 238 GetRequests, 233 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-02-06 08:41:58,263 INFO L435 NwaCegarLoop]: 647 mSDtfsCounter, 105 mSDsluCounter, 1210 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 1857 SdHoareTripleChecker+Invalid, 212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 08:41:58,264 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 1857 Invalid, 212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 196 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 08:41:58,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 946 states. [2025-02-06 08:41:58,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 946 to 946. [2025-02-06 08:41:58,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 946 states, 923 states have (on average 1.399783315276273) internal successors, (1292), 934 states have internal predecessors, (1292), 19 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 11 states have call predecessors, (19), 19 states have call successors, (19) [2025-02-06 08:41:58,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 946 states to 946 states and 1330 transitions. [2025-02-06 08:41:58,294 INFO L78 Accepts]: Start accepts. Automaton has 946 states and 1330 transitions. Word has length 234 [2025-02-06 08:41:58,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:41:58,295 INFO L471 AbstractCegarLoop]: Abstraction has 946 states and 1330 transitions. [2025-02-06 08:41:58,295 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 54.25) internal successors, (217), 4 states have internal predecessors, (217), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-02-06 08:41:58,295 INFO L276 IsEmpty]: Start isEmpty. Operand 946 states and 1330 transitions. [2025-02-06 08:41:58,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2025-02-06 08:41:58,298 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:41:58,299 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 08:41:58,311 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-06 08:41:58,499 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 08:41:58,500 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 08:41:58,500 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:41:58,501 INFO L85 PathProgramCache]: Analyzing trace with hash -1949984141, now seen corresponding path program 1 times [2025-02-06 08:41:58,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:41:58,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967568018] [2025-02-06 08:41:58,501 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:41:58,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:41:58,575 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 234 statements into 1 equivalence classes. [2025-02-06 08:41:58,615 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 234 of 234 statements. [2025-02-06 08:41:58,615 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:41:58,616 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:41:58,820 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-02-06 08:41:58,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:41:58,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [967568018] [2025-02-06 08:41:58,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [967568018] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 08:41:58,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [608111086] [2025-02-06 08:41:58,821 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:41:58,821 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 08:41:58,821 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 08:41:58,834 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 08:41:58,837 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-06 08:41:59,279 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 234 statements into 1 equivalence classes. [2025-02-06 08:41:59,448 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 234 of 234 statements. [2025-02-06 08:41:59,449 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:41:59,449 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:41:59,457 INFO L256 TraceCheckSpWp]: Trace formula consists of 1179 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-06 08:41:59,463 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 08:41:59,692 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-02-06 08:41:59,693 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 08:41:59,964 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-02-06 08:41:59,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [608111086] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 08:41:59,964 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 08:41:59,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-02-06 08:41:59,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [987000125] [2025-02-06 08:41:59,965 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 08:41:59,966 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 08:41:59,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:41:59,967 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 08:41:59,968 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-06 08:41:59,968 INFO L87 Difference]: Start difference. First operand 946 states and 1330 transitions. Second operand has 7 states, 7 states have (on average 75.42857142857143) internal successors, (528), 7 states have internal predecessors, (528), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-02-06 08:42:00,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:42:00,418 INFO L93 Difference]: Finished difference Result 2526 states and 3575 transitions. [2025-02-06 08:42:00,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 08:42:00,419 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 75.42857142857143) internal successors, (528), 7 states have internal predecessors, (528), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 234 [2025-02-06 08:42:00,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:42:00,429 INFO L225 Difference]: With dead ends: 2526 [2025-02-06 08:42:00,429 INFO L226 Difference]: Without dead ends: 2197 [2025-02-06 08:42:00,431 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 470 GetRequests, 465 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-06 08:42:00,432 INFO L435 NwaCegarLoop]: 664 mSDtfsCounter, 3245 mSDsluCounter, 1812 mSDsCounter, 0 mSdLazyCounter, 255 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3276 SdHoareTripleChecker+Valid, 2476 SdHoareTripleChecker+Invalid, 276 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 255 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-06 08:42:00,433 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3276 Valid, 2476 Invalid, 276 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 255 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-06 08:42:00,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2197 states. [2025-02-06 08:42:00,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2197 to 1684. [2025-02-06 08:42:00,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1684 states, 1646 states have (on average 1.3839611178614823) internal successors, (2278), 1657 states have internal predecessors, (2278), 34 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 26 states have call predecessors, (34), 34 states have call successors, (34) [2025-02-06 08:42:00,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1684 states to 1684 states and 2346 transitions. [2025-02-06 08:42:00,502 INFO L78 Accepts]: Start accepts. Automaton has 1684 states and 2346 transitions. Word has length 234 [2025-02-06 08:42:00,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:42:00,503 INFO L471 AbstractCegarLoop]: Abstraction has 1684 states and 2346 transitions. [2025-02-06 08:42:00,503 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 75.42857142857143) internal successors, (528), 7 states have internal predecessors, (528), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-02-06 08:42:00,503 INFO L276 IsEmpty]: Start isEmpty. Operand 1684 states and 2346 transitions. [2025-02-06 08:42:00,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 667 [2025-02-06 08:42:00,517 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:42:00,518 INFO L218 NwaCegarLoop]: trace histogram [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, 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, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 08:42:00,530 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-06 08:42:00,719 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 08:42:00,720 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 08:42:00,720 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:42:00,720 INFO L85 PathProgramCache]: Analyzing trace with hash -1592767961, now seen corresponding path program 1 times [2025-02-06 08:42:00,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:42:00,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [225209328] [2025-02-06 08:42:00,721 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:42:00,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:42:00,912 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 666 statements into 1 equivalence classes. [2025-02-06 08:42:01,090 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 666 of 666 statements. [2025-02-06 08:42:01,090 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:42:01,090 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:42:01,773 INFO L134 CoverageAnalysis]: Checked inductivity of 880 backedges. 4 proven. 363 refuted. 0 times theorem prover too weak. 513 trivial. 0 not checked. [2025-02-06 08:42:01,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:42:01,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [225209328] [2025-02-06 08:42:01,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [225209328] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 08:42:01,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [739821337] [2025-02-06 08:42:01,774 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:42:01,774 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 08:42:01,774 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 08:42:01,777 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 08:42:01,779 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-06 08:42:02,476 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 666 statements into 1 equivalence classes. [2025-02-06 08:42:02,937 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 666 of 666 statements. [2025-02-06 08:42:02,937 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:42:02,937 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:42:02,952 INFO L256 TraceCheckSpWp]: Trace formula consists of 3255 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-06 08:42:02,964 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 08:42:03,720 INFO L134 CoverageAnalysis]: Checked inductivity of 880 backedges. 0 proven. 856 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-02-06 08:42:03,721 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 08:42:04,453 INFO L134 CoverageAnalysis]: Checked inductivity of 880 backedges. 0 proven. 856 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-02-06 08:42:04,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [739821337] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 08:42:04,453 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 08:42:04,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 7, 7] total 14 [2025-02-06 08:42:04,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752164351] [2025-02-06 08:42:04,456 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 08:42:04,458 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-06 08:42:04,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:42:04,461 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-06 08:42:04,461 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2025-02-06 08:42:04,462 INFO L87 Difference]: Start difference. First operand 1684 states and 2346 transitions. Second operand has 14 states, 14 states have (on average 112.21428571428571) internal successors, (1571), 14 states have internal predecessors, (1571), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-02-06 08:42:09,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:42:09,027 INFO L93 Difference]: Finished difference Result 5417 states and 7587 transitions. [2025-02-06 08:42:09,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-02-06 08:42:09,028 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 112.21428571428571) internal successors, (1571), 14 states have internal predecessors, (1571), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 666 [2025-02-06 08:42:09,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:42:09,051 INFO L225 Difference]: With dead ends: 5417 [2025-02-06 08:42:09,051 INFO L226 Difference]: Without dead ends: 4346 [2025-02-06 08:42:09,055 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1346 GetRequests, 1322 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=238, Invalid=412, Unknown=0, NotChecked=0, Total=650 [2025-02-06 08:42:09,057 INFO L435 NwaCegarLoop]: 980 mSDtfsCounter, 14367 mSDsluCounter, 5500 mSDsCounter, 0 mSdLazyCounter, 1600 mSolverCounterSat, 154 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14367 SdHoareTripleChecker+Valid, 6480 SdHoareTripleChecker+Invalid, 1754 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 154 IncrementalHoareTripleChecker+Valid, 1600 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2025-02-06 08:42:09,057 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14367 Valid, 6480 Invalid, 1754 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [154 Valid, 1600 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2025-02-06 08:42:09,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4346 states. [2025-02-06 08:42:09,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4346 to 3481. [2025-02-06 08:42:09,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3481 states, 3430 states have (on average 1.3775510204081634) internal successors, (4725), 3436 states have internal predecessors, (4725), 47 states have call successors, (47), 2 states have call predecessors, (47), 2 states have return successors, (47), 43 states have call predecessors, (47), 47 states have call successors, (47) [2025-02-06 08:42:09,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3481 states to 3481 states and 4819 transitions. [2025-02-06 08:42:09,198 INFO L78 Accepts]: Start accepts. Automaton has 3481 states and 4819 transitions. Word has length 666 [2025-02-06 08:42:09,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:42:09,199 INFO L471 AbstractCegarLoop]: Abstraction has 3481 states and 4819 transitions. [2025-02-06 08:42:09,200 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 112.21428571428571) internal successors, (1571), 14 states have internal predecessors, (1571), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-02-06 08:42:09,200 INFO L276 IsEmpty]: Start isEmpty. Operand 3481 states and 4819 transitions. [2025-02-06 08:42:09,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1541 [2025-02-06 08:42:09,253 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:42:09,253 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 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, 9, 9, 9, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 08:42:09,273 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-02-06 08:42:09,454 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-02-06 08:42:09,455 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 08:42:09,456 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:42:09,457 INFO L85 PathProgramCache]: Analyzing trace with hash -348135231, now seen corresponding path program 1 times [2025-02-06 08:42:09,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:42:09,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [142533453] [2025-02-06 08:42:09,458 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:42:09,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:42:09,862 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1540 statements into 1 equivalence classes.