./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test9-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test9-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0672e9446c2cfbd152a4f960adca314d72e71aa68b29fd9a83ebc5c34f7546dd --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 21:25:16,332 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 21:25:16,386 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 21:25:16,390 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 21:25:16,393 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 21:25:16,411 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 21:25:16,412 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 21:25:16,413 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 21:25:16,413 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 21:25:16,413 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 21:25:16,414 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 21:25:16,414 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 21:25:16,414 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 21:25:16,414 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 21:25:16,414 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 21:25:16,415 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 21:25:16,415 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 21:25:16,415 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 21:25:16,415 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 21:25:16,415 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 21:25:16,415 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 21:25:16,415 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 21:25:16,415 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 21:25:16,415 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 21:25:16,415 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 21:25:16,416 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 21:25:16,416 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 21:25:16,416 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 21:25:16,416 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 21:25:16,416 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 21:25:16,416 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 21:25:16,416 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 21:25:16,416 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 21:25:16,416 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 21:25:16,417 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 21:25:16,417 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 21:25:16,417 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 21:25:16,417 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 21:25:16,417 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 21:25:16,417 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 21:25:16,417 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 21:25:16,417 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 21:25:16,417 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 21:25:16,417 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 0672e9446c2cfbd152a4f960adca314d72e71aa68b29fd9a83ebc5c34f7546dd [2025-03-08 21:25:16,619 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 21:25:16,624 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 21:25:16,626 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 21:25:16,627 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 21:25:16,627 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 21:25:16,628 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test9-2.i [2025-03-08 21:25:17,783 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3b85fe364/31fd9c8832e8489691a457451d2d91e0/FLAGdfe7d777f [2025-03-08 21:25:18,146 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 21:25:18,146 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test9-2.i [2025-03-08 21:25:18,162 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3b85fe364/31fd9c8832e8489691a457451d2d91e0/FLAGdfe7d777f [2025-03-08 21:25:18,173 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3b85fe364/31fd9c8832e8489691a457451d2d91e0 [2025-03-08 21:25:18,175 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 21:25:18,176 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 21:25:18,177 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 21:25:18,177 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 21:25:18,181 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 21:25:18,181 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 09:25:18" (1/1) ... [2025-03-08 21:25:18,182 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@504c2d4c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:25:18, skipping insertion in model container [2025-03-08 21:25:18,183 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 09:25:18" (1/1) ... [2025-03-08 21:25:18,233 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 21:25:18,483 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test9-2.i[33021,33034] [2025-03-08 21:25:18,630 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test9-2.i[84583,84596] [2025-03-08 21:25:18,643 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 21:25:18,653 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 21:25:18,684 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test9-2.i[33021,33034] [2025-03-08 21:25:18,752 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test9-2.i[84583,84596] [2025-03-08 21:25:18,758 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 21:25:18,779 INFO L204 MainTranslator]: Completed translation [2025-03-08 21:25:18,779 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:25:18 WrapperNode [2025-03-08 21:25:18,779 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 21:25:18,780 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 21:25:18,780 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 21:25:18,780 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 21:25:18,784 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:25:18" (1/1) ... [2025-03-08 21:25:18,819 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:25:18" (1/1) ... [2025-03-08 21:25:18,901 INFO L138 Inliner]: procedures = 177, calls = 773, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 3403 [2025-03-08 21:25:18,902 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 21:25:18,902 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 21:25:18,902 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 21:25:18,902 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 21:25:18,909 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:25:18" (1/1) ... [2025-03-08 21:25:18,910 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:25:18" (1/1) ... [2025-03-08 21:25:18,920 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:25:18" (1/1) ... [2025-03-08 21:25:19,014 INFO L175 MemorySlicer]: Split 256 memory accesses to 3 slices as follows [2, 220, 34]. 86 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 54 writes are split as follows [0, 50, 4]. [2025-03-08 21:25:19,014 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:25:18" (1/1) ... [2025-03-08 21:25:19,014 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:25:18" (1/1) ... [2025-03-08 21:25:19,061 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:25:18" (1/1) ... [2025-03-08 21:25:19,067 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:25:18" (1/1) ... [2025-03-08 21:25:19,074 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:25:18" (1/1) ... [2025-03-08 21:25:19,081 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:25:18" (1/1) ... [2025-03-08 21:25:19,097 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 21:25:19,099 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 21:25:19,099 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 21:25:19,099 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 21:25:19,100 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:25:18" (1/1) ... [2025-03-08 21:25:19,104 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 21:25:19,113 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 21:25:19,125 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 21:25:19,131 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 21:25:19,149 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-08 21:25:19,149 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-08 21:25:19,149 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-08 21:25:19,149 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-03-08 21:25:19,149 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-03-08 21:25:19,149 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-08 21:25:19,150 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-08 21:25:19,150 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-08 21:25:19,150 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2025-03-08 21:25:19,150 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2025-03-08 21:25:19,150 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2025-03-08 21:25:19,150 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2025-03-08 21:25:19,150 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2025-03-08 21:25:19,150 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2025-03-08 21:25:19,150 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-08 21:25:19,151 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 21:25:19,151 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-08 21:25:19,151 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-08 21:25:19,151 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-08 21:25:19,151 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-08 21:25:19,151 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-08 21:25:19,151 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-08 21:25:19,151 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-08 21:25:19,151 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-08 21:25:19,151 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 21:25:19,152 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-08 21:25:19,152 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-08 21:25:19,152 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 21:25:19,152 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 21:25:19,315 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 21:25:19,317 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 21:25:21,277 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2218: call ULTIMATE.dealloc(main_~#i~0#1.base, main_~#i~0#1.offset);havoc main_~#i~0#1.base, main_~#i~0#1.offset; [2025-03-08 21:25:21,485 INFO L? ?]: Removed 823 outVars from TransFormulas that were not future-live. [2025-03-08 21:25:21,485 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 21:25:21,560 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 21:25:21,560 INFO L336 CfgBuilder]: Removed 1 assume(true) statements. [2025-03-08 21:25:21,561 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 09:25:21 BoogieIcfgContainer [2025-03-08 21:25:21,561 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 21:25:21,563 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 21:25:21,563 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 21:25:21,567 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 21:25:21,567 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 09:25:18" (1/3) ... [2025-03-08 21:25:21,568 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e07e347 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 09:25:21, skipping insertion in model container [2025-03-08 21:25:21,568 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:25:18" (2/3) ... [2025-03-08 21:25:21,568 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e07e347 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 09:25:21, skipping insertion in model container [2025-03-08 21:25:21,568 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 09:25:21" (3/3) ... [2025-03-08 21:25:21,569 INFO L128 eAbstractionObserver]: Analyzing ICFG uthash_OAT_test9-2.i [2025-03-08 21:25:21,580 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 21:25:21,582 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG uthash_OAT_test9-2.i that has 5 procedures, 1407 locations, 1 initial locations, 36 loop locations, and 2 error locations. [2025-03-08 21:25:21,660 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 21:25:21,670 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;@32a28dc5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 21:25:21,671 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-03-08 21:25:21,680 INFO L276 IsEmpty]: Start isEmpty. Operand has 1399 states, 891 states have (on average 1.8316498316498318) internal successors, (1632), 1393 states have internal predecessors, (1632), 503 states have call successors, (503), 2 states have call predecessors, (503), 2 states have return successors, (503), 4 states have call predecessors, (503), 503 states have call successors, (503) [2025-03-08 21:25:21,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-03-08 21:25:21,684 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 21:25:21,685 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 21:25:21,685 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 21:25:21,689 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:25:21,689 INFO L85 PathProgramCache]: Analyzing trace with hash 1715556443, now seen corresponding path program 1 times [2025-03-08 21:25:21,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:25:21,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1346338114] [2025-03-08 21:25:21,696 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:25:21,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:25:21,766 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-08 21:25:21,779 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-08 21:25:21,779 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:25:21,780 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:25:21,811 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 21:25:21,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:25:21,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1346338114] [2025-03-08 21:25:21,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1346338114] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:25:21,813 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:25:21,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 21:25:21,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1376701698] [2025-03-08 21:25:21,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:25:21,816 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 21:25:21,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:25:21,828 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 21:25:21,829 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 21:25:21,834 INFO L87 Difference]: Start difference. First operand has 1399 states, 891 states have (on average 1.8316498316498318) internal successors, (1632), 1393 states have internal predecessors, (1632), 503 states have call successors, (503), 2 states have call predecessors, (503), 2 states have return successors, (503), 4 states have call predecessors, (503), 503 states have call successors, (503) Second operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:25:22,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 21:25:22,037 INFO L93 Difference]: Finished difference Result 2796 states and 5774 transitions. [2025-03-08 21:25:22,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 21:25:22,039 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2025-03-08 21:25:22,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 21:25:22,069 INFO L225 Difference]: With dead ends: 2796 [2025-03-08 21:25:22,070 INFO L226 Difference]: Without dead ends: 1362 [2025-03-08 21:25:22,083 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 21:25:22,086 INFO L435 NwaCegarLoop]: 2532 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2532 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 21:25:22,087 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2532 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 21:25:22,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1362 states. [2025-03-08 21:25:22,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1362 to 1362. [2025-03-08 21:25:22,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1362 states, 855 states have (on average 1.775438596491228) internal successors, (1518), 1356 states have internal predecessors, (1518), 503 states have call successors, (503), 2 states have call predecessors, (503), 2 states have return successors, (503), 4 states have call predecessors, (503), 503 states have call successors, (503) [2025-03-08 21:25:22,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1362 states to 1362 states and 2524 transitions. [2025-03-08 21:25:22,425 INFO L78 Accepts]: Start accepts. Automaton has 1362 states and 2524 transitions. Word has length 9 [2025-03-08 21:25:22,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 21:25:22,426 INFO L471 AbstractCegarLoop]: Abstraction has 1362 states and 2524 transitions. [2025-03-08 21:25:22,426 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:25:22,426 INFO L276 IsEmpty]: Start isEmpty. Operand 1362 states and 2524 transitions. [2025-03-08 21:25:22,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-03-08 21:25:22,428 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 21:25:22,428 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] [2025-03-08 21:25:22,428 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 21:25:22,429 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 21:25:22,429 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:25:22,429 INFO L85 PathProgramCache]: Analyzing trace with hash 726888382, now seen corresponding path program 1 times [2025-03-08 21:25:22,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:25:22,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [855807513] [2025-03-08 21:25:22,429 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:25:22,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:25:22,449 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-08 21:25:22,461 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-08 21:25:22,461 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:25:22,461 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:25:22,791 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 21:25:22,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:25:22,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [855807513] [2025-03-08 21:25:22,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [855807513] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:25:22,792 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:25:22,792 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 21:25:22,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [619644626] [2025-03-08 21:25:22,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:25:22,792 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 21:25:22,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:25:22,793 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 21:25:22,793 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 21:25:22,793 INFO L87 Difference]: Start difference. First operand 1362 states and 2524 transitions. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:25:23,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 21:25:23,629 INFO L93 Difference]: Finished difference Result 3875 states and 7274 transitions. [2025-03-08 21:25:23,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 21:25:23,629 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 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 62 [2025-03-08 21:25:23,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 21:25:23,646 INFO L225 Difference]: With dead ends: 3875 [2025-03-08 21:25:23,646 INFO L226 Difference]: Without dead ends: 2711 [2025-03-08 21:25:23,651 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 21:25:23,652 INFO L435 NwaCegarLoop]: 2703 mSDtfsCounter, 1503 mSDsluCounter, 4661 mSDsCounter, 0 mSdLazyCounter, 684 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2006 SdHoareTripleChecker+Valid, 7364 SdHoareTripleChecker+Invalid, 685 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 684 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-08 21:25:23,652 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2006 Valid, 7364 Invalid, 685 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 684 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-08 21:25:23,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2711 states. [2025-03-08 21:25:23,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2711 to 1364. [2025-03-08 21:25:23,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1364 states, 857 states have (on average 1.7736289381563595) internal successors, (1520), 1358 states have internal predecessors, (1520), 503 states have call successors, (503), 2 states have call predecessors, (503), 2 states have return successors, (503), 4 states have call predecessors, (503), 503 states have call successors, (503) [2025-03-08 21:25:23,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1364 states to 1364 states and 2526 transitions. [2025-03-08 21:25:23,933 INFO L78 Accepts]: Start accepts. Automaton has 1364 states and 2526 transitions. Word has length 62 [2025-03-08 21:25:23,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 21:25:23,934 INFO L471 AbstractCegarLoop]: Abstraction has 1364 states and 2526 transitions. [2025-03-08 21:25:23,934 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:25:23,934 INFO L276 IsEmpty]: Start isEmpty. Operand 1364 states and 2526 transitions. [2025-03-08 21:25:23,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-03-08 21:25:23,937 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 21:25:23,937 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 21:25:23,937 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 21:25:23,937 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 21:25:23,938 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:25:23,938 INFO L85 PathProgramCache]: Analyzing trace with hash 54422276, now seen corresponding path program 1 times [2025-03-08 21:25:23,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:25:23,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [517938879] [2025-03-08 21:25:23,938 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:25:23,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:25:23,983 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-03-08 21:25:23,992 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-03-08 21:25:23,993 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:25:23,993 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:25:24,251 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 21:25:24,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:25:24,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [517938879] [2025-03-08 21:25:24,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [517938879] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:25:24,251 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:25:24,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 21:25:24,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20054810] [2025-03-08 21:25:24,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:25:24,252 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 21:25:24,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:25:24,252 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 21:25:24,252 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 21:25:24,252 INFO L87 Difference]: Start difference. First operand 1364 states and 2526 transitions. Second operand has 4 states, 4 states have (on average 34.0) internal successors, (136), 4 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:25:24,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 21:25:24,416 INFO L93 Difference]: Finished difference Result 2682 states and 4982 transitions. [2025-03-08 21:25:24,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 21:25:24,417 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 34.0) internal successors, (136), 4 states have internal predecessors, (136), 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 136 [2025-03-08 21:25:24,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 21:25:24,427 INFO L225 Difference]: With dead ends: 2682 [2025-03-08 21:25:24,428 INFO L226 Difference]: Without dead ends: 1322 [2025-03-08 21:25:24,432 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 21:25:24,433 INFO L435 NwaCegarLoop]: 2391 mSDtfsCounter, 30 mSDsluCounter, 4763 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 7154 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 21:25:24,434 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 7154 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 21:25:24,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1322 states. [2025-03-08 21:25:24,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1322 to 1322. [2025-03-08 21:25:24,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1322 states, 815 states have (on average 1.7705521472392638) internal successors, (1443), 1316 states have internal predecessors, (1443), 503 states have call successors, (503), 2 states have call predecessors, (503), 2 states have return successors, (503), 4 states have call predecessors, (503), 503 states have call successors, (503) [2025-03-08 21:25:24,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1322 states to 1322 states and 2449 transitions. [2025-03-08 21:25:24,550 INFO L78 Accepts]: Start accepts. Automaton has 1322 states and 2449 transitions. Word has length 136 [2025-03-08 21:25:24,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 21:25:24,551 INFO L471 AbstractCegarLoop]: Abstraction has 1322 states and 2449 transitions. [2025-03-08 21:25:24,551 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 34.0) internal successors, (136), 4 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:25:24,551 INFO L276 IsEmpty]: Start isEmpty. Operand 1322 states and 2449 transitions. [2025-03-08 21:25:24,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-03-08 21:25:24,555 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 21:25:24,555 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 21:25:24,555 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 21:25:24,556 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 21:25:24,556 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:25:24,556 INFO L85 PathProgramCache]: Analyzing trace with hash -622833398, now seen corresponding path program 1 times [2025-03-08 21:25:24,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:25:24,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087588523] [2025-03-08 21:25:24,556 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:25:24,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:25:24,591 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-03-08 21:25:24,612 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-03-08 21:25:24,613 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:25:24,613 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:25:24,731 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 21:25:24,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:25:24,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2087588523] [2025-03-08 21:25:24,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2087588523] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:25:24,733 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:25:24,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 21:25:24,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360701857] [2025-03-08 21:25:24,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:25:24,734 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 21:25:24,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:25:24,734 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 21:25:24,734 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 21:25:24,734 INFO L87 Difference]: Start difference. First operand 1322 states and 2449 transitions. Second operand has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:25:24,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 21:25:24,950 INFO L93 Difference]: Finished difference Result 3861 states and 7214 transitions. [2025-03-08 21:25:24,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 21:25:24,952 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 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 136 [2025-03-08 21:25:24,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 21:25:24,973 INFO L225 Difference]: With dead ends: 3861 [2025-03-08 21:25:24,973 INFO L226 Difference]: Without dead ends: 2543 [2025-03-08 21:25:24,981 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 21:25:24,982 INFO L435 NwaCegarLoop]: 2821 mSDtfsCounter, 1259 mSDsluCounter, 2395 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1759 SdHoareTripleChecker+Valid, 5216 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 21:25:24,983 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1759 Valid, 5216 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 21:25:24,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2543 states. [2025-03-08 21:25:25,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2543 to 2541. [2025-03-08 21:25:25,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2541 states, 1534 states have (on average 1.7992177314211213) internal successors, (2760), 2535 states have internal predecessors, (2760), 1003 states have call successors, (1003), 2 states have call predecessors, (1003), 2 states have return successors, (1003), 5 states have call predecessors, (1003), 1003 states have call successors, (1003) [2025-03-08 21:25:25,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2541 states to 2541 states and 4766 transitions. [2025-03-08 21:25:25,277 INFO L78 Accepts]: Start accepts. Automaton has 2541 states and 4766 transitions. Word has length 136 [2025-03-08 21:25:25,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 21:25:25,279 INFO L471 AbstractCegarLoop]: Abstraction has 2541 states and 4766 transitions. [2025-03-08 21:25:25,279 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:25:25,279 INFO L276 IsEmpty]: Start isEmpty. Operand 2541 states and 4766 transitions. [2025-03-08 21:25:25,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-03-08 21:25:25,281 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 21:25:25,281 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 21:25:25,281 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 21:25:25,282 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 21:25:25,282 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:25:25,282 INFO L85 PathProgramCache]: Analyzing trace with hash 334790059, now seen corresponding path program 1 times [2025-03-08 21:25:25,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:25:25,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122242512] [2025-03-08 21:25:25,282 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:25:25,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:25:25,330 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-03-08 21:25:25,358 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-03-08 21:25:25,358 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:25:25,358 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:25:25,495 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-08 21:25:25,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:25:25,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [122242512] [2025-03-08 21:25:25,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [122242512] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:25:25,496 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:25:25,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 21:25:25,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199354003] [2025-03-08 21:25:25,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:25:25,497 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 21:25:25,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:25:25,498 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 21:25:25,498 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 21:25:25,498 INFO L87 Difference]: Start difference. First operand 2541 states and 4766 transitions. Second operand has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-08 21:25:25,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 21:25:25,670 INFO L93 Difference]: Finished difference Result 4878 states and 9264 transitions. [2025-03-08 21:25:25,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 21:25:25,671 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 151 [2025-03-08 21:25:25,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 21:25:25,691 INFO L225 Difference]: With dead ends: 4878 [2025-03-08 21:25:25,691 INFO L226 Difference]: Without dead ends: 2581 [2025-03-08 21:25:25,699 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-03-08 21:25:25,700 INFO L435 NwaCegarLoop]: 2389 mSDtfsCounter, 8 mSDsluCounter, 2374 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 4763 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 21:25:25,700 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 4763 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 21:25:25,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2581 states. [2025-03-08 21:25:25,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2581 to 2581. [2025-03-08 21:25:25,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2581 states, 1574 states have (on average 1.7789072426937738) internal successors, (2800), 2575 states have internal predecessors, (2800), 1003 states have call successors, (1003), 2 states have call predecessors, (1003), 2 states have return successors, (1003), 5 states have call predecessors, (1003), 1003 states have call successors, (1003) [2025-03-08 21:25:25,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2581 states to 2581 states and 4806 transitions. [2025-03-08 21:25:25,928 INFO L78 Accepts]: Start accepts. Automaton has 2581 states and 4806 transitions. Word has length 151 [2025-03-08 21:25:25,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 21:25:25,931 INFO L471 AbstractCegarLoop]: Abstraction has 2581 states and 4806 transitions. [2025-03-08 21:25:25,931 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-08 21:25:25,931 INFO L276 IsEmpty]: Start isEmpty. Operand 2581 states and 4806 transitions. [2025-03-08 21:25:25,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-03-08 21:25:25,934 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 21:25:25,934 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 21:25:25,934 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 21:25:25,934 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 21:25:25,934 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:25:25,934 INFO L85 PathProgramCache]: Analyzing trace with hash -1950073396, now seen corresponding path program 1 times [2025-03-08 21:25:25,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:25:25,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1802292253] [2025-03-08 21:25:25,935 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:25:25,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:25:25,970 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-03-08 21:25:25,991 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-03-08 21:25:25,992 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:25:25,992 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:25:26,149 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-08 21:25:26,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:25:26,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1802292253] [2025-03-08 21:25:26,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1802292253] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:25:26,150 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:25:26,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 21:25:26,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1987041737] [2025-03-08 21:25:26,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:25:26,150 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 21:25:26,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:25:26,151 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 21:25:26,151 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 21:25:26,151 INFO L87 Difference]: Start difference. First operand 2581 states and 4806 transitions. Second operand has 4 states, 4 states have (on average 35.75) internal successors, (143), 4 states have internal predecessors, (143), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-08 21:25:26,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 21:25:26,332 INFO L93 Difference]: Finished difference Result 4794 states and 9106 transitions. [2025-03-08 21:25:26,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 21:25:26,332 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 35.75) internal successors, (143), 4 states have internal predecessors, (143), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 151 [2025-03-08 21:25:26,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 21:25:26,348 INFO L225 Difference]: With dead ends: 4794 [2025-03-08 21:25:26,349 INFO L226 Difference]: Without dead ends: 2457 [2025-03-08 21:25:26,355 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 21:25:26,355 INFO L435 NwaCegarLoop]: 2314 mSDtfsCounter, 32 mSDsluCounter, 4614 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 6928 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 21:25:26,356 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 6928 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 21:25:26,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2457 states. [2025-03-08 21:25:26,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2457 to 2457. [2025-03-08 21:25:26,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2457 states, 1450 states have (on average 1.793103448275862) internal successors, (2600), 2451 states have internal predecessors, (2600), 1003 states have call successors, (1003), 2 states have call predecessors, (1003), 2 states have return successors, (1003), 5 states have call predecessors, (1003), 1003 states have call successors, (1003) [2025-03-08 21:25:26,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2457 states to 2457 states and 4606 transitions. [2025-03-08 21:25:26,675 INFO L78 Accepts]: Start accepts. Automaton has 2457 states and 4606 transitions. Word has length 151 [2025-03-08 21:25:26,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 21:25:26,675 INFO L471 AbstractCegarLoop]: Abstraction has 2457 states and 4606 transitions. [2025-03-08 21:25:26,676 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 35.75) internal successors, (143), 4 states have internal predecessors, (143), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-08 21:25:26,676 INFO L276 IsEmpty]: Start isEmpty. Operand 2457 states and 4606 transitions. [2025-03-08 21:25:26,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-03-08 21:25:26,677 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 21:25:26,677 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 21:25:26,677 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 21:25:26,677 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 21:25:26,678 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:25:26,678 INFO L85 PathProgramCache]: Analyzing trace with hash -1074250459, now seen corresponding path program 1 times [2025-03-08 21:25:26,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:25:26,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244932699] [2025-03-08 21:25:26,678 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:25:26,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:25:26,721 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-03-08 21:25:26,746 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-03-08 21:25:26,746 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:25:26,746 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:25:26,885 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-08 21:25:26,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:25:26,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [244932699] [2025-03-08 21:25:26,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [244932699] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:25:26,885 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:25:26,886 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 21:25:26,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1401017298] [2025-03-08 21:25:26,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:25:26,886 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 21:25:26,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:25:26,887 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 21:25:26,887 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 21:25:26,887 INFO L87 Difference]: Start difference. First operand 2457 states and 4606 transitions. Second operand has 4 states, 4 states have (on average 36.0) internal successors, (144), 4 states have internal predecessors, (144), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-08 21:25:28,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 21:25:28,150 INFO L93 Difference]: Finished difference Result 3733 states and 6971 transitions. [2025-03-08 21:25:28,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 21:25:28,151 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 36.0) internal successors, (144), 4 states have internal predecessors, (144), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 151 [2025-03-08 21:25:28,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 21:25:28,166 INFO L225 Difference]: With dead ends: 3733 [2025-03-08 21:25:28,166 INFO L226 Difference]: Without dead ends: 1365 [2025-03-08 21:25:28,172 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 21:25:28,173 INFO L435 NwaCegarLoop]: 2395 mSDtfsCounter, 2541 mSDsluCounter, 1129 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 1003 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2541 SdHoareTripleChecker+Valid, 3524 SdHoareTripleChecker+Invalid, 1096 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1003 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-08 21:25:28,174 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2541 Valid, 3524 Invalid, 1096 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1003 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-08 21:25:28,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1365 states. [2025-03-08 21:25:28,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1365 to 1365. [2025-03-08 21:25:28,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1365 states, 858 states have (on average 1.7214452214452214) internal successors, (1477), 1359 states have internal predecessors, (1477), 503 states have call successors, (503), 2 states have call predecessors, (503), 2 states have return successors, (503), 4 states have call predecessors, (503), 503 states have call successors, (503) [2025-03-08 21:25:28,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1365 states to 1365 states and 2483 transitions. [2025-03-08 21:25:28,324 INFO L78 Accepts]: Start accepts. Automaton has 1365 states and 2483 transitions. Word has length 151 [2025-03-08 21:25:28,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 21:25:28,324 INFO L471 AbstractCegarLoop]: Abstraction has 1365 states and 2483 transitions. [2025-03-08 21:25:28,325 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 36.0) internal successors, (144), 4 states have internal predecessors, (144), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-08 21:25:28,325 INFO L276 IsEmpty]: Start isEmpty. Operand 1365 states and 2483 transitions. [2025-03-08 21:25:28,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2025-03-08 21:25:28,327 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 21:25:28,327 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 21:25:28,327 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 21:25:28,327 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 21:25:28,327 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:25:28,327 INFO L85 PathProgramCache]: Analyzing trace with hash -1625473961, now seen corresponding path program 1 times [2025-03-08 21:25:28,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:25:28,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982811279] [2025-03-08 21:25:28,328 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:25:28,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:25:28,363 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-03-08 21:25:28,402 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-03-08 21:25:28,402 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:25:28,402 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:25:28,867 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-08 21:25:28,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:25:28,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [982811279] [2025-03-08 21:25:28,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [982811279] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 21:25:28,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [649911040] [2025-03-08 21:25:28,869 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:25:28,869 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 21:25:28,869 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 21:25:28,872 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 21:25:28,874 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 21:25:29,058 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-03-08 21:25:29,143 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-03-08 21:25:29,143 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:25:29,143 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:25:29,149 INFO L256 TraceCheckSpWp]: Trace formula consists of 765 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-08 21:25:29,157 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 21:25:29,177 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-08 21:25:29,355 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-03-08 21:25:29,370 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-08 21:25:29,372 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 21:25:29,526 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-08 21:25:29,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [649911040] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 21:25:29,526 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 21:25:29,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 5] total 12 [2025-03-08 21:25:29,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075687227] [2025-03-08 21:25:29,526 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 21:25:29,527 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-08 21:25:29,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:25:29,527 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-08 21:25:29,527 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2025-03-08 21:25:29,528 INFO L87 Difference]: Start difference. First operand 1365 states and 2483 transitions. Second operand has 12 states, 12 states have (on average 26.583333333333332) internal successors, (319), 12 states have internal predecessors, (319), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-08 21:25:34,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 21:25:34,680 INFO L93 Difference]: Finished difference Result 5202 states and 9594 transitions. [2025-03-08 21:25:34,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-08 21:25:34,680 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 26.583333333333332) internal successors, (319), 12 states have internal predecessors, (319), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 161 [2025-03-08 21:25:34,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 21:25:34,701 INFO L225 Difference]: With dead ends: 5202 [2025-03-08 21:25:34,701 INFO L226 Difference]: Without dead ends: 4080 [2025-03-08 21:25:34,705 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 330 GetRequests, 314 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=144, Unknown=0, NotChecked=0, Total=210 [2025-03-08 21:25:34,705 INFO L435 NwaCegarLoop]: 1984 mSDtfsCounter, 3173 mSDsluCounter, 13900 mSDsCounter, 0 mSdLazyCounter, 6407 mSolverCounterSat, 506 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4177 SdHoareTripleChecker+Valid, 15884 SdHoareTripleChecker+Invalid, 6913 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 506 IncrementalHoareTripleChecker+Valid, 6407 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2025-03-08 21:25:34,706 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4177 Valid, 15884 Invalid, 6913 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [506 Valid, 6407 Invalid, 0 Unknown, 0 Unchecked, 4.8s Time] [2025-03-08 21:25:34,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4080 states. [2025-03-08 21:25:35,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4080 to 1705. [2025-03-08 21:25:35,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1705 states, 1194 states have (on average 1.6139028475711892) internal successors, (1927), 1695 states have internal predecessors, (1927), 506 states have call successors, (506), 3 states have call predecessors, (506), 3 states have return successors, (506), 7 states have call predecessors, (506), 506 states have call successors, (506) [2025-03-08 21:25:35,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1705 states to 1705 states and 2939 transitions. [2025-03-08 21:25:35,023 INFO L78 Accepts]: Start accepts. Automaton has 1705 states and 2939 transitions. Word has length 161 [2025-03-08 21:25:35,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 21:25:35,023 INFO L471 AbstractCegarLoop]: Abstraction has 1705 states and 2939 transitions. [2025-03-08 21:25:35,024 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 26.583333333333332) internal successors, (319), 12 states have internal predecessors, (319), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-08 21:25:35,024 INFO L276 IsEmpty]: Start isEmpty. Operand 1705 states and 2939 transitions. [2025-03-08 21:25:35,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 384 [2025-03-08 21:25:35,027 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 21:25:35,028 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 21:25:35,038 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-08 21:25:35,232 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 21:25:35,232 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 21:25:35,232 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:25:35,233 INFO L85 PathProgramCache]: Analyzing trace with hash 1267499387, now seen corresponding path program 1 times [2025-03-08 21:25:35,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:25:35,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1394221058] [2025-03-08 21:25:35,233 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:25:35,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:25:35,326 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 383 statements into 1 equivalence classes. [2025-03-08 21:25:35,450 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 383 of 383 statements. [2025-03-08 21:25:35,450 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:25:35,450 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:25:37,572 INFO L134 CoverageAnalysis]: Checked inductivity of 450 backedges. 0 proven. 446 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-08 21:25:37,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:25:37,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1394221058] [2025-03-08 21:25:37,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1394221058] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 21:25:37,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1456405756] [2025-03-08 21:25:37,572 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:25:37,572 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 21:25:37,572 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 21:25:37,575 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 21:25:37,576 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-08 21:25:37,880 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 383 statements into 1 equivalence classes. [2025-03-08 21:25:38,067 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 383 of 383 statements. [2025-03-08 21:25:38,067 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:25:38,067 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:25:38,075 INFO L256 TraceCheckSpWp]: Trace formula consists of 1893 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-08 21:25:38,088 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 21:25:38,091 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-08 21:25:38,224 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-03-08 21:25:38,318 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-03-08 21:25:38,390 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-03-08 21:25:38,472 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-03-08 21:25:38,488 INFO L134 CoverageAnalysis]: Checked inductivity of 450 backedges. 0 proven. 446 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-08 21:25:38,488 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 21:25:38,875 INFO L134 CoverageAnalysis]: Checked inductivity of 450 backedges. 0 proven. 446 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-08 21:25:38,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1456405756] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 21:25:38,876 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 21:25:38,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 8] total 23 [2025-03-08 21:25:38,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1630628270] [2025-03-08 21:25:38,876 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 21:25:38,877 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-08 21:25:38,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:25:38,878 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-08 21:25:38,878 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=167, Invalid=339, Unknown=0, NotChecked=0, Total=506 [2025-03-08 21:25:38,879 INFO L87 Difference]: Start difference. First operand 1705 states and 2939 transitions. Second operand has 23 states, 23 states have (on average 42.82608695652174) internal successors, (985), 23 states have internal predecessors, (985), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-08 21:25:51,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 21:25:51,201 INFO L93 Difference]: Finished difference Result 10508 states and 19341 transitions. [2025-03-08 21:25:51,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-03-08 21:25:51,201 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 42.82608695652174) internal successors, (985), 23 states have internal predecessors, (985), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 383 [2025-03-08 21:25:51,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 21:25:51,239 INFO L225 Difference]: With dead ends: 10508 [2025-03-08 21:25:51,239 INFO L226 Difference]: Without dead ends: 9386 [2025-03-08 21:25:51,244 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 787 GetRequests, 754 SyntacticMatches, 3 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 319 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=296, Invalid=696, Unknown=0, NotChecked=0, Total=992 [2025-03-08 21:25:51,244 INFO L435 NwaCegarLoop]: 6747 mSDtfsCounter, 15921 mSDsluCounter, 44014 mSDsCounter, 0 mSdLazyCounter, 20743 mSolverCounterSat, 3270 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18931 SdHoareTripleChecker+Valid, 50761 SdHoareTripleChecker+Invalid, 24013 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 3270 IncrementalHoareTripleChecker+Valid, 20743 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.3s IncrementalHoareTripleChecker+Time [2025-03-08 21:25:51,245 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18931 Valid, 50761 Invalid, 24013 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [3270 Valid, 20743 Invalid, 0 Unknown, 0 Unchecked, 11.3s Time] [2025-03-08 21:25:51,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9386 states. [2025-03-08 21:25:52,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9386 to 2551. [2025-03-08 21:25:52,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2551 states, 2034 states have (on average 1.5019665683382497) internal successors, (3055), 2535 states have internal predecessors, (3055), 512 states have call successors, (512), 3 states have call predecessors, (512), 3 states have return successors, (512), 13 states have call predecessors, (512), 512 states have call successors, (512) [2025-03-08 21:25:52,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2551 states to 2551 states and 4079 transitions. [2025-03-08 21:25:52,059 INFO L78 Accepts]: Start accepts. Automaton has 2551 states and 4079 transitions. Word has length 383 [2025-03-08 21:25:52,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 21:25:52,103 INFO L471 AbstractCegarLoop]: Abstraction has 2551 states and 4079 transitions. [2025-03-08 21:25:52,103 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 42.82608695652174) internal successors, (985), 23 states have internal predecessors, (985), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-08 21:25:52,104 INFO L276 IsEmpty]: Start isEmpty. Operand 2551 states and 4079 transitions. [2025-03-08 21:25:52,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 828 [2025-03-08 21:25:52,135 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 21:25:52,136 INFO L218 NwaCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 21:25:52,166 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-08 21:25:52,336 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2025-03-08 21:25:52,337 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 21:25:52,338 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:25:52,338 INFO L85 PathProgramCache]: Analyzing trace with hash -387881277, now seen corresponding path program 2 times [2025-03-08 21:25:52,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:25:52,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359019448] [2025-03-08 21:25:52,338 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 21:25:52,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:25:52,560 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 827 statements into 2 equivalence classes. [2025-03-08 21:25:52,582 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 72 of 827 statements. [2025-03-08 21:25:52,585 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-08 21:25:52,585 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:25:52,723 INFO L134 CoverageAnalysis]: Checked inductivity of 3336 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3336 trivial. 0 not checked. [2025-03-08 21:25:52,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:25:52,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359019448] [2025-03-08 21:25:52,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [359019448] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:25:52,724 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:25:52,724 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 21:25:52,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236345276] [2025-03-08 21:25:52,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:25:52,724 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 21:25:52,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:25:52,725 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 21:25:52,725 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 21:25:52,725 INFO L87 Difference]: Start difference. First operand 2551 states and 4079 transitions. Second operand has 6 states, 6 states have (on average 26.0) internal successors, (156), 6 states have internal predecessors, (156), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-08 21:25:53,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 21:25:53,079 INFO L93 Difference]: Finished difference Result 3712 states and 6291 transitions. [2025-03-08 21:25:53,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 21:25:53,080 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 26.0) internal successors, (156), 6 states have internal predecessors, (156), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 827 [2025-03-08 21:25:53,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 21:25:53,096 INFO L225 Difference]: With dead ends: 3712 [2025-03-08 21:25:53,097 INFO L226 Difference]: Without dead ends: 2591 [2025-03-08 21:25:53,101 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-03-08 21:25:53,102 INFO L435 NwaCegarLoop]: 2342 mSDtfsCounter, 80 mSDsluCounter, 9115 mSDsCounter, 0 mSdLazyCounter, 464 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 11457 SdHoareTripleChecker+Invalid, 474 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 464 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 21:25:53,102 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 11457 Invalid, 474 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 464 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 21:25:53,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2591 states. [2025-03-08 21:25:53,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2591 to 2553. [2025-03-08 21:25:53,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2553 states, 2036 states have (on average 1.5014734774066798) internal successors, (3057), 2537 states have internal predecessors, (3057), 512 states have call successors, (512), 3 states have call predecessors, (512), 3 states have return successors, (512), 13 states have call predecessors, (512), 512 states have call successors, (512) [2025-03-08 21:25:53,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2553 states to 2553 states and 4081 transitions. [2025-03-08 21:25:53,306 INFO L78 Accepts]: Start accepts. Automaton has 2553 states and 4081 transitions. Word has length 827 [2025-03-08 21:25:53,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 21:25:53,307 INFO L471 AbstractCegarLoop]: Abstraction has 2553 states and 4081 transitions. [2025-03-08 21:25:53,307 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.0) internal successors, (156), 6 states have internal predecessors, (156), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-08 21:25:53,307 INFO L276 IsEmpty]: Start isEmpty. Operand 2553 states and 4081 transitions. [2025-03-08 21:25:53,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 829 [2025-03-08 21:25:53,320 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 21:25:53,320 INFO L218 NwaCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 21:25:53,320 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 21:25:53,321 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 21:25:53,321 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:25:53,321 INFO L85 PathProgramCache]: Analyzing trace with hash -2001578355, now seen corresponding path program 1 times [2025-03-08 21:25:53,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:25:53,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [139495887] [2025-03-08 21:25:53,322 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:25:53,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:25:53,501 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 828 statements into 1 equivalence classes. [2025-03-08 21:25:53,888 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 828 of 828 statements. [2025-03-08 21:25:53,892 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:25:53,893 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:25:55,652 INFO L134 CoverageAnalysis]: Checked inductivity of 3336 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3336 trivial. 0 not checked. [2025-03-08 21:25:55,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:25:55,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [139495887] [2025-03-08 21:25:55,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [139495887] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:25:55,653 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:25:55,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 21:25:55,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1219904613] [2025-03-08 21:25:55,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:25:55,654 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 21:25:55,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:25:55,654 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 21:25:55,654 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 21:25:55,655 INFO L87 Difference]: Start difference. First operand 2553 states and 4081 transitions. Second operand has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 6 states have internal predecessors, (157), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-08 21:25:55,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 21:25:55,986 INFO L93 Difference]: Finished difference Result 3681 states and 6247 transitions. [2025-03-08 21:25:55,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 21:25:55,987 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 6 states have internal predecessors, (157), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 828 [2025-03-08 21:25:55,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 21:25:55,997 INFO L225 Difference]: With dead ends: 3681 [2025-03-08 21:25:55,997 INFO L226 Difference]: Without dead ends: 2558 [2025-03-08 21:25:56,001 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-08 21:25:56,001 INFO L435 NwaCegarLoop]: 2322 mSDtfsCounter, 14 mSDsluCounter, 9020 mSDsCounter, 0 mSdLazyCounter, 406 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 11342 SdHoareTripleChecker+Invalid, 407 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 406 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 21:25:56,002 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 11342 Invalid, 407 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 406 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 21:25:56,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2558 states. [2025-03-08 21:25:56,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2558 to 2557. [2025-03-08 21:25:56,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2557 states, 2040 states have (on average 1.5009803921568627) internal successors, (3062), 2541 states have internal predecessors, (3062), 512 states have call successors, (512), 3 states have call predecessors, (512), 3 states have return successors, (512), 13 states have call predecessors, (512), 512 states have call successors, (512) [2025-03-08 21:25:56,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2557 states to 2557 states and 4086 transitions. [2025-03-08 21:25:56,167 INFO L78 Accepts]: Start accepts. Automaton has 2557 states and 4086 transitions. Word has length 828 [2025-03-08 21:25:56,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 21:25:56,168 INFO L471 AbstractCegarLoop]: Abstraction has 2557 states and 4086 transitions. [2025-03-08 21:25:56,168 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 6 states have internal predecessors, (157), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-08 21:25:56,168 INFO L276 IsEmpty]: Start isEmpty. Operand 2557 states and 4086 transitions. [2025-03-08 21:25:56,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 830 [2025-03-08 21:25:56,173 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 21:25:56,173 INFO L218 NwaCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 21:25:56,173 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 21:25:56,173 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 21:25:56,174 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:25:56,174 INFO L85 PathProgramCache]: Analyzing trace with hash -1005324502, now seen corresponding path program 1 times [2025-03-08 21:25:56,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:25:56,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [490867014] [2025-03-08 21:25:56,174 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:25:56,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:25:56,355 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 829 statements into 1 equivalence classes. [2025-03-08 21:25:56,562 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 829 of 829 statements. [2025-03-08 21:25:56,562 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:25:56,562 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:25:58,149 INFO L134 CoverageAnalysis]: Checked inductivity of 3336 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3336 trivial. 0 not checked. [2025-03-08 21:25:58,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:25:58,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [490867014] [2025-03-08 21:25:58,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [490867014] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:25:58,149 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:25:58,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-08 21:25:58,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1165887095] [2025-03-08 21:25:58,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:25:58,150 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 21:25:58,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:25:58,150 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 21:25:58,150 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-08 21:25:58,151 INFO L87 Difference]: Start difference. First operand 2557 states and 4086 transitions. Second operand has 9 states, 9 states have (on average 17.555555555555557) internal successors, (158), 9 states have internal predecessors, (158), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-08 21:25:58,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 21:25:58,584 INFO L93 Difference]: Finished difference Result 3695 states and 6266 transitions. [2025-03-08 21:25:58,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 21:25:58,585 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 17.555555555555557) internal successors, (158), 9 states have internal predecessors, (158), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 829 [2025-03-08 21:25:58,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 21:25:58,595 INFO L225 Difference]: With dead ends: 3695 [2025-03-08 21:25:58,595 INFO L226 Difference]: Without dead ends: 2568 [2025-03-08 21:25:58,600 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2025-03-08 21:25:58,600 INFO L435 NwaCegarLoop]: 2323 mSDtfsCounter, 31 mSDsluCounter, 15885 mSDsCounter, 0 mSdLazyCounter, 690 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 18208 SdHoareTripleChecker+Invalid, 694 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 690 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 21:25:58,600 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 18208 Invalid, 694 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 690 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 21:25:58,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2568 states. [2025-03-08 21:25:58,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2568 to 2565. [2025-03-08 21:25:58,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2565 states, 2048 states have (on average 1.49951171875) internal successors, (3071), 2549 states have internal predecessors, (3071), 512 states have call successors, (512), 3 states have call predecessors, (512), 3 states have return successors, (512), 13 states have call predecessors, (512), 512 states have call successors, (512) [2025-03-08 21:25:58,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2565 states to 2565 states and 4095 transitions. [2025-03-08 21:25:58,784 INFO L78 Accepts]: Start accepts. Automaton has 2565 states and 4095 transitions. Word has length 829 [2025-03-08 21:25:58,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 21:25:58,785 INFO L471 AbstractCegarLoop]: Abstraction has 2565 states and 4095 transitions. [2025-03-08 21:25:58,785 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 17.555555555555557) internal successors, (158), 9 states have internal predecessors, (158), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-08 21:25:58,785 INFO L276 IsEmpty]: Start isEmpty. Operand 2565 states and 4095 transitions. [2025-03-08 21:25:58,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 831 [2025-03-08 21:25:58,790 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 21:25:58,790 INFO L218 NwaCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 21:25:58,791 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 21:25:58,791 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 21:25:58,791 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:25:58,791 INFO L85 PathProgramCache]: Analyzing trace with hash 206853690, now seen corresponding path program 1 times [2025-03-08 21:25:58,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:25:58,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1215584322] [2025-03-08 21:25:58,792 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:25:58,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:25:58,978 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 830 statements into 1 equivalence classes. [2025-03-08 21:25:59,175 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 830 of 830 statements. [2025-03-08 21:25:59,175 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:25:59,175 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:26:05,997 INFO L134 CoverageAnalysis]: Checked inductivity of 3336 backedges. 0 proven. 3332 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-08 21:26:05,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:26:05,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1215584322] [2025-03-08 21:26:05,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1215584322] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 21:26:05,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [86724446] [2025-03-08 21:26:05,998 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:26:05,998 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 21:26:05,998 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 21:26:06,002 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 21:26:06,004 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-08 21:26:06,581 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 830 statements into 1 equivalence classes. [2025-03-08 21:26:06,968 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 830 of 830 statements. [2025-03-08 21:26:06,969 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:26:06,969 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:26:06,987 INFO L256 TraceCheckSpWp]: Trace formula consists of 4149 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-03-08 21:26:06,998 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 21:26:07,001 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-08 21:26:07,115 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-03-08 21:26:07,183 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-03-08 21:26:07,259 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-03-08 21:26:07,335 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-03-08 21:26:07,403 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-03-08 21:26:07,479 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-03-08 21:26:07,560 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-03-08 21:26:07,636 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-03-08 21:26:07,716 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-03-08 21:26:07,789 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-03-08 21:26:07,804 INFO L134 CoverageAnalysis]: Checked inductivity of 3336 backedges. 0 proven. 3332 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-08 21:26:07,805 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 21:26:08,712 INFO L134 CoverageAnalysis]: Checked inductivity of 3336 backedges. 0 proven. 3332 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-08 21:26:08,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [86724446] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 21:26:08,713 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 21:26:08,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 15, 14] total 42 [2025-03-08 21:26:08,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311219426] [2025-03-08 21:26:08,713 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 21:26:08,714 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2025-03-08 21:26:08,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:26:08,716 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2025-03-08 21:26:08,716 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=595, Invalid=1127, Unknown=0, NotChecked=0, Total=1722 [2025-03-08 21:26:08,717 INFO L87 Difference]: Start difference. First operand 2565 states and 4095 transitions. Second operand has 42 states, 42 states have (on average 55.23809523809524) internal successors, (2320), 42 states have internal predecessors, (2320), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6)