./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test1-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test1-1.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 72c3cbe0b435a963730c7c79c0d825f3c978c53ad7cc61822ef9417e2e6ee67f --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 20:41:41,066 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 20:41:41,119 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 20:41:41,126 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 20:41:41,127 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 20:41:41,148 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 20:41:41,149 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 20:41:41,149 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 20:41:41,150 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 20:41:41,150 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 20:41:41,150 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 20:41:41,151 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 20:41:41,151 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 20:41:41,151 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 20:41:41,151 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 20:41:41,151 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 20:41:41,151 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 20:41:41,152 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 20:41:41,152 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 20:41:41,152 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 20:41:41,152 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 20:41:41,152 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 20:41:41,152 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 20:41:41,152 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 20:41:41,152 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 20:41:41,152 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 20:41:41,152 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 20:41:41,152 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 20:41:41,153 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 20:41:41,153 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 20:41:41,153 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 20:41:41,153 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 20:41:41,153 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 20:41:41,153 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 20:41:41,153 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 20:41:41,153 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 20:41:41,154 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 20:41:41,154 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 20:41:41,154 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 20:41:41,154 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 20:41:41,154 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 20:41:41,154 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 20:41:41,154 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 20:41:41,154 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 20:41:41,154 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 20:41:41,154 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 20:41:41,154 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 20:41:41,154 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 20:41:41,154 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 72c3cbe0b435a963730c7c79c0d825f3c978c53ad7cc61822ef9417e2e6ee67f [2025-01-09 20:41:41,373 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 20:41:41,389 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 20:41:41,390 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 20:41:41,394 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 20:41:41,394 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 20:41:41,395 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test1-1.i [2025-01-09 20:41:42,620 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d1a035c4e/b29354bf88c343dea6c6721bb894df0e/FLAGbdeac3ac5 [2025-01-09 20:41:42,955 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 20:41:42,955 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test1-1.i [2025-01-09 20:41:42,972 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d1a035c4e/b29354bf88c343dea6c6721bb894df0e/FLAGbdeac3ac5 [2025-01-09 20:41:43,187 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d1a035c4e/b29354bf88c343dea6c6721bb894df0e [2025-01-09 20:41:43,189 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 20:41:43,190 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 20:41:43,192 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 20:41:43,192 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 20:41:43,195 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 20:41:43,195 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 08:41:43" (1/1) ... [2025-01-09 20:41:43,196 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6255d101 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:41:43, skipping insertion in model container [2025-01-09 20:41:43,196 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 08:41:43" (1/1) ... [2025-01-09 20:41:43,228 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 20:41:43,460 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test1-1.i[33021,33034] [2025-01-09 20:41:43,509 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 20:41:43,521 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 20:41:43,552 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test1-1.i[33021,33034] [2025-01-09 20:41:43,578 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 20:41:43,600 INFO L204 MainTranslator]: Completed translation [2025-01-09 20:41:43,601 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:41:43 WrapperNode [2025-01-09 20:41:43,601 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 20:41:43,602 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 20:41:43,602 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 20:41:43,602 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 20:41:43,606 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:41:43" (1/1) ... [2025-01-09 20:41:43,618 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:41:43" (1/1) ... [2025-01-09 20:41:43,647 INFO L138 Inliner]: procedures = 176, calls = 179, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 812 [2025-01-09 20:41:43,647 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 20:41:43,648 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 20:41:43,648 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 20:41:43,648 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 20:41:43,654 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:41:43" (1/1) ... [2025-01-09 20:41:43,654 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:41:43" (1/1) ... [2025-01-09 20:41:43,659 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:41:43" (1/1) ... [2025-01-09 20:41:43,707 INFO L175 MemorySlicer]: Split 158 memory accesses to 2 slices as follows [2, 156]. 99 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 42 writes are split as follows [0, 42]. [2025-01-09 20:41:43,710 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:41:43" (1/1) ... [2025-01-09 20:41:43,711 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:41:43" (1/1) ... [2025-01-09 20:41:43,742 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:41:43" (1/1) ... [2025-01-09 20:41:43,747 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:41:43" (1/1) ... [2025-01-09 20:41:43,755 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:41:43" (1/1) ... [2025-01-09 20:41:43,761 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:41:43" (1/1) ... [2025-01-09 20:41:43,766 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:41:43" (1/1) ... [2025-01-09 20:41:43,774 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 20:41:43,775 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 20:41:43,775 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 20:41:43,775 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 20:41:43,776 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:41:43" (1/1) ... [2025-01-09 20:41:43,780 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 20:41:43,789 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 20:41:43,800 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 20:41:43,808 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 20:41:43,836 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-09 20:41:43,836 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-09 20:41:43,836 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-01-09 20:41:43,836 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-01-09 20:41:43,836 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-09 20:41:43,836 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-09 20:41:43,836 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2025-01-09 20:41:43,836 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2025-01-09 20:41:43,836 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2025-01-09 20:41:43,836 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2025-01-09 20:41:43,836 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-09 20:41:43,837 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 20:41:43,837 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-01-09 20:41:43,837 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-01-09 20:41:43,837 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-01-09 20:41:43,837 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-01-09 20:41:43,837 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-09 20:41:43,837 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 20:41:43,837 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-09 20:41:43,837 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 20:41:43,837 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 20:41:43,941 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 20:41:43,942 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 20:41:44,696 INFO L? ?]: Removed 208 outVars from TransFormulas that were not future-live. [2025-01-09 20:41:44,696 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 20:41:44,710 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 20:41:44,712 INFO L312 CfgBuilder]: Removed 14 assume(true) statements. [2025-01-09 20:41:44,712 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 08:41:44 BoogieIcfgContainer [2025-01-09 20:41:44,712 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 20:41:44,713 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 20:41:44,713 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 20:41:44,717 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 20:41:44,717 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 08:41:43" (1/3) ... [2025-01-09 20:41:44,717 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@771e8968 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 08:41:44, skipping insertion in model container [2025-01-09 20:41:44,718 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:41:43" (2/3) ... [2025-01-09 20:41:44,718 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@771e8968 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 08:41:44, skipping insertion in model container [2025-01-09 20:41:44,718 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 08:41:44" (3/3) ... [2025-01-09 20:41:44,719 INFO L128 eAbstractionObserver]: Analyzing ICFG uthash_FNV_test1-1.i [2025-01-09 20:41:44,730 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 20:41:44,731 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG uthash_FNV_test1-1.i that has 4 procedures, 235 locations, 1 initial locations, 20 loop locations, and 1 error locations. [2025-01-09 20:41:44,782 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 20:41:44,792 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;@21b83763, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 20:41:44,793 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 20:41:44,797 INFO L276 IsEmpty]: Start isEmpty. Operand has 231 states, 214 states have (on average 1.6074766355140186) internal successors, (344), 225 states have internal predecessors, (344), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2025-01-09 20:41:44,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-01-09 20:41:44,801 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:41:44,801 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 20:41:44,802 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 20:41:44,805 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:41:44,805 INFO L85 PathProgramCache]: Analyzing trace with hash -1631995128, now seen corresponding path program 1 times [2025-01-09 20:41:44,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:41:44,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347974018] [2025-01-09 20:41:44,810 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:41:44,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:41:44,869 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-09 20:41:44,880 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-09 20:41:44,880 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:41:44,880 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:41:44,937 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 20:41:44,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:41:44,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1347974018] [2025-01-09 20:41:44,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1347974018] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:41:44,938 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:41:44,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 20:41:44,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [751174980] [2025-01-09 20:41:44,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:41:44,941 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 20:41:44,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:41:44,956 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 20:41:44,957 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 20:41:44,958 INFO L87 Difference]: Start difference. First operand has 231 states, 214 states have (on average 1.6074766355140186) internal successors, (344), 225 states have internal predecessors, (344), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 20:41:45,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:41:45,030 INFO L93 Difference]: Finished difference Result 653 states and 1060 transitions. [2025-01-09 20:41:45,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 20:41:45,032 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2025-01-09 20:41:45,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:41:45,039 INFO L225 Difference]: With dead ends: 653 [2025-01-09 20:41:45,039 INFO L226 Difference]: Without dead ends: 421 [2025-01-09 20:41:45,041 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-01-09 20:41:45,043 INFO L435 NwaCegarLoop]: 335 mSDtfsCounter, 273 mSDsluCounter, 332 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 276 SdHoareTripleChecker+Valid, 667 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 20:41:45,043 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [276 Valid, 667 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 20:41:45,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 421 states. [2025-01-09 20:41:45,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 421 to 229. [2025-01-09 20:41:45,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 213 states have (on average 1.4553990610328638) internal successors, (310), 223 states have internal predecessors, (310), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2025-01-09 20:41:45,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 336 transitions. [2025-01-09 20:41:45,077 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 336 transitions. Word has length 9 [2025-01-09 20:41:45,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:41:45,078 INFO L471 AbstractCegarLoop]: Abstraction has 229 states and 336 transitions. [2025-01-09 20:41:45,078 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 20:41:45,078 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 336 transitions. [2025-01-09 20:41:45,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-01-09 20:41:45,080 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:41:45,080 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 20:41:45,081 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 20:41:45,081 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 20:41:45,081 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:41:45,081 INFO L85 PathProgramCache]: Analyzing trace with hash 1040177097, now seen corresponding path program 1 times [2025-01-09 20:41:45,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:41:45,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1426437037] [2025-01-09 20:41:45,082 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:41:45,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:41:45,116 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-01-09 20:41:45,126 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-01-09 20:41:45,126 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:41:45,126 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:41:45,378 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 20:41:45,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:41:45,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1426437037] [2025-01-09 20:41:45,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1426437037] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:41:45,379 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:41:45,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 20:41:45,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415838494] [2025-01-09 20:41:45,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:41:45,380 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 20:41:45,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:41:45,381 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 20:41:45,381 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 20:41:45,381 INFO L87 Difference]: Start difference. First operand 229 states and 336 transitions. Second operand has 4 states, 4 states have (on average 20.5) internal successors, (82), 4 states have internal predecessors, (82), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 20:41:45,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:41:45,443 INFO L93 Difference]: Finished difference Result 458 states and 672 transitions. [2025-01-09 20:41:45,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 20:41:45,443 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.5) internal successors, (82), 4 states have internal predecessors, (82), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 83 [2025-01-09 20:41:45,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:41:45,444 INFO L225 Difference]: With dead ends: 458 [2025-01-09 20:41:45,445 INFO L226 Difference]: Without dead ends: 232 [2025-01-09 20:41:45,445 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-01-09 20:41:45,446 INFO L435 NwaCegarLoop]: 308 mSDtfsCounter, 105 mSDsluCounter, 523 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 831 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 20:41:45,446 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 831 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 20:41:45,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2025-01-09 20:41:45,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 229. [2025-01-09 20:41:45,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 213 states have (on average 1.4225352112676057) internal successors, (303), 223 states have internal predecessors, (303), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2025-01-09 20:41:45,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 329 transitions. [2025-01-09 20:41:45,455 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 329 transitions. Word has length 83 [2025-01-09 20:41:45,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:41:45,455 INFO L471 AbstractCegarLoop]: Abstraction has 229 states and 329 transitions. [2025-01-09 20:41:45,455 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.5) internal successors, (82), 4 states have internal predecessors, (82), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 20:41:45,455 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 329 transitions. [2025-01-09 20:41:45,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-01-09 20:41:45,457 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:41:45,457 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 20:41:45,457 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 20:41:45,457 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 20:41:45,457 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:41:45,457 INFO L85 PathProgramCache]: Analyzing trace with hash -1443814467, now seen corresponding path program 1 times [2025-01-09 20:41:45,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:41:45,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [237681183] [2025-01-09 20:41:45,457 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:41:45,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:41:45,488 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-01-09 20:41:45,511 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-01-09 20:41:45,511 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:41:45,511 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:41:45,655 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 20:41:45,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:41:45,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [237681183] [2025-01-09 20:41:45,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [237681183] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:41:45,655 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:41:45,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 20:41:45,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573968193] [2025-01-09 20:41:45,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:41:45,655 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 20:41:45,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:41:45,656 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 20:41:45,656 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 20:41:45,656 INFO L87 Difference]: Start difference. First operand 229 states and 329 transitions. Second operand has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 20:41:45,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:41:45,706 INFO L93 Difference]: Finished difference Result 583 states and 843 transitions. [2025-01-09 20:41:45,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 20:41:45,708 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 83 [2025-01-09 20:41:45,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:41:45,709 INFO L225 Difference]: With dead ends: 583 [2025-01-09 20:41:45,709 INFO L226 Difference]: Without dead ends: 357 [2025-01-09 20:41:45,710 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-01-09 20:41:45,711 INFO L435 NwaCegarLoop]: 327 mSDtfsCounter, 134 mSDsluCounter, 319 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 646 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 20:41:45,711 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 646 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 20:41:45,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2025-01-09 20:41:45,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 357. [2025-01-09 20:41:45,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 357 states, 341 states have (on average 1.436950146627566) internal successors, (490), 351 states have internal predecessors, (490), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2025-01-09 20:41:45,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 516 transitions. [2025-01-09 20:41:45,723 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 516 transitions. Word has length 83 [2025-01-09 20:41:45,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:41:45,723 INFO L471 AbstractCegarLoop]: Abstraction has 357 states and 516 transitions. [2025-01-09 20:41:45,724 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 20:41:45,724 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 516 transitions. [2025-01-09 20:41:45,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-01-09 20:41:45,726 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:41:45,726 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 20:41:45,726 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 20:41:45,726 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 20:41:45,726 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:41:45,727 INFO L85 PathProgramCache]: Analyzing trace with hash -1197039505, now seen corresponding path program 1 times [2025-01-09 20:41:45,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:41:45,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2041262692] [2025-01-09 20:41:45,727 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:41:45,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:41:45,770 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-01-09 20:41:45,799 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-01-09 20:41:45,800 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:41:45,800 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:41:45,964 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-09 20:41:45,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:41:45,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2041262692] [2025-01-09 20:41:45,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2041262692] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 20:41:45,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1798469351] [2025-01-09 20:41:45,964 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:41:45,965 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 20:41:45,965 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 20:41:45,970 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 20:41:45,975 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 20:41:46,104 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-01-09 20:41:46,169 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-01-09 20:41:46,169 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:41:46,169 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:41:46,173 INFO L256 TraceCheckSpWp]: Trace formula consists of 564 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 20:41:46,177 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 20:41:46,317 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-09 20:41:46,317 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 20:41:46,436 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-09 20:41:46,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1798469351] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 20:41:46,437 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 20:41:46,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-01-09 20:41:46,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [514793862] [2025-01-09 20:41:46,437 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 20:41:46,438 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 20:41:46,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:41:46,439 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 20:41:46,439 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-01-09 20:41:46,439 INFO L87 Difference]: Start difference. First operand 357 states and 516 transitions. Second operand has 7 states, 7 states have (on average 35.857142857142854) internal successors, (251), 7 states have internal predecessors, (251), 4 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-01-09 20:41:46,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:41:46,504 INFO L93 Difference]: Finished difference Result 835 states and 1196 transitions. [2025-01-09 20:41:46,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 20:41:46,505 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 35.857142857142854) internal successors, (251), 7 states have internal predecessors, (251), 4 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 98 [2025-01-09 20:41:46,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:41:46,508 INFO L225 Difference]: With dead ends: 835 [2025-01-09 20:41:46,508 INFO L226 Difference]: Without dead ends: 806 [2025-01-09 20:41:46,509 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 193 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-01-09 20:41:46,509 INFO L435 NwaCegarLoop]: 411 mSDtfsCounter, 905 mSDsluCounter, 1327 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 913 SdHoareTripleChecker+Valid, 1738 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 20:41:46,509 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [913 Valid, 1738 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 20:41:46,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 806 states. [2025-01-09 20:41:46,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 806 to 806. [2025-01-09 20:41:46,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 806 states, 781 states have (on average 1.409731113956466) internal successors, (1101), 791 states have internal predecessors, (1101), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 13 states have call predecessors, (22), 22 states have call successors, (22) [2025-01-09 20:41:46,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 806 states to 806 states and 1145 transitions. [2025-01-09 20:41:46,555 INFO L78 Accepts]: Start accepts. Automaton has 806 states and 1145 transitions. Word has length 98 [2025-01-09 20:41:46,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:41:46,556 INFO L471 AbstractCegarLoop]: Abstraction has 806 states and 1145 transitions. [2025-01-09 20:41:46,556 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 35.857142857142854) internal successors, (251), 7 states have internal predecessors, (251), 4 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-01-09 20:41:46,557 INFO L276 IsEmpty]: Start isEmpty. Operand 806 states and 1145 transitions. [2025-01-09 20:41:46,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 321 [2025-01-09 20:41:46,564 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:41:46,564 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2025-01-09 20:41:46,572 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-01-09 20:41:46,765 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 20:41:46,766 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 20:41:46,767 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:41:46,767 INFO L85 PathProgramCache]: Analyzing trace with hash 1411121550, now seen corresponding path program 1 times [2025-01-09 20:41:46,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:41:46,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1485283056] [2025-01-09 20:41:46,768 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:41:46,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:41:46,863 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 320 statements into 1 equivalence classes. [2025-01-09 20:41:47,003 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 320 of 320 statements. [2025-01-09 20:41:47,003 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:41:47,003 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:41:47,598 INFO L134 CoverageAnalysis]: Checked inductivity of 446 backedges. 0 proven. 442 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-09 20:41:47,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:41:47,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1485283056] [2025-01-09 20:41:47,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1485283056] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 20:41:47,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [105151295] [2025-01-09 20:41:47,598 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:41:47,598 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 20:41:47,599 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 20:41:47,600 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 20:41:47,607 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-09 20:41:47,872 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 320 statements into 1 equivalence classes. [2025-01-09 20:41:48,085 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 320 of 320 statements. [2025-01-09 20:41:48,085 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:41:48,085 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:41:48,094 INFO L256 TraceCheckSpWp]: Trace formula consists of 1659 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-09 20:41:48,101 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 20:41:48,455 INFO L134 CoverageAnalysis]: Checked inductivity of 446 backedges. 0 proven. 442 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-09 20:41:48,455 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 20:41:48,785 INFO L134 CoverageAnalysis]: Checked inductivity of 446 backedges. 0 proven. 442 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-09 20:41:48,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [105151295] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 20:41:48,785 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 20:41:48,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2025-01-09 20:41:48,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2050026179] [2025-01-09 20:41:48,786 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 20:41:48,787 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 20:41:48,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:41:48,788 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 20:41:48,788 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-01-09 20:41:48,788 INFO L87 Difference]: Start difference. First operand 806 states and 1145 transitions. Second operand has 13 states, 13 states have (on average 53.46153846153846) internal successors, (695), 13 states have internal predecessors, (695), 4 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-01-09 20:41:48,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:41:48,981 INFO L93 Difference]: Finished difference Result 1993 states and 2837 transitions. [2025-01-09 20:41:48,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 20:41:48,982 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 53.46153846153846) internal successors, (695), 13 states have internal predecessors, (695), 4 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 320 [2025-01-09 20:41:48,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:41:48,993 INFO L225 Difference]: With dead ends: 1993 [2025-01-09 20:41:48,993 INFO L226 Difference]: Without dead ends: 1964 [2025-01-09 20:41:48,994 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 645 GetRequests, 634 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-01-09 20:41:48,994 INFO L435 NwaCegarLoop]: 368 mSDtfsCounter, 4246 mSDsluCounter, 2722 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4272 SdHoareTripleChecker+Valid, 3090 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 20:41:48,995 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4272 Valid, 3090 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 20:41:48,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1964 states. [2025-01-09 20:41:49,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1964 to 1964. [2025-01-09 20:41:49,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1964 states, 1921 states have (on average 1.407079646017699) internal successors, (2703), 1931 states have internal predecessors, (2703), 40 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 31 states have call predecessors, (40), 40 states have call successors, (40) [2025-01-09 20:41:49,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1964 states to 1964 states and 2783 transitions. [2025-01-09 20:41:49,056 INFO L78 Accepts]: Start accepts. Automaton has 1964 states and 2783 transitions. Word has length 320 [2025-01-09 20:41:49,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:41:49,057 INFO L471 AbstractCegarLoop]: Abstraction has 1964 states and 2783 transitions. [2025-01-09 20:41:49,058 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 53.46153846153846) internal successors, (695), 13 states have internal predecessors, (695), 4 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-01-09 20:41:49,058 INFO L276 IsEmpty]: Start isEmpty. Operand 1964 states and 2783 transitions. [2025-01-09 20:41:49,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 765 [2025-01-09 20:41:49,068 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:41:49,068 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 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] [2025-01-09 20:41:49,078 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-09 20:41:49,273 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 20:41:49,273 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 20:41:49,274 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:41:49,274 INFO L85 PathProgramCache]: Analyzing trace with hash 1162345228, now seen corresponding path program 2 times [2025-01-09 20:41:49,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:41:49,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091760039] [2025-01-09 20:41:49,275 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 20:41:49,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:41:49,480 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 764 statements into 2 equivalence classes. [2025-01-09 20:42:42,253 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 764 of 764 statements. [2025-01-09 20:42:42,254 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 20:42:42,254 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:42:43,124 INFO L134 CoverageAnalysis]: Checked inductivity of 3326 backedges. 487 proven. 3 refuted. 0 times theorem prover too weak. 2836 trivial. 0 not checked. [2025-01-09 20:42:43,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:42:43,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2091760039] [2025-01-09 20:42:43,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2091760039] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 20:42:43,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1703098594] [2025-01-09 20:42:43,125 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 20:42:43,125 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 20:42:43,125 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 20:42:43,127 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 20:42:43,128 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-09 20:42:43,569 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 764 statements into 2 equivalence classes. [2025-01-09 20:43:14,063 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 764 of 764 statements. [2025-01-09 20:43:14,064 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 20:43:14,064 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:43:14,132 INFO L256 TraceCheckSpWp]: Trace formula consists of 3849 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-01-09 20:43:14,145 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 20:43:14,171 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 16 treesize of output 17 [2025-01-09 20:43:14,608 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 20:43:14,608 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 63 treesize of output 41 [2025-01-09 20:43:14,806 INFO L134 CoverageAnalysis]: Checked inductivity of 3326 backedges. 280 proven. 0 refuted. 0 times theorem prover too weak. 3046 trivial. 0 not checked. [2025-01-09 20:43:14,806 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 20:43:14,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1703098594] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:43:14,807 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 20:43:14,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [4] total 13 [2025-01-09 20:43:14,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1554366766] [2025-01-09 20:43:14,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:43:14,807 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 20:43:14,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:43:14,808 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 20:43:14,808 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2025-01-09 20:43:14,808 INFO L87 Difference]: Start difference. First operand 1964 states and 2783 transitions. Second operand has 11 states, 11 states have (on average 11.272727272727273) internal successors, (124), 11 states have internal predecessors, (124), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 20:43:18,872 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0]