./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test4-2.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_test4-2.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 834766c90c3d5af368509ae691087999af545dba19d7eed6a5d75f823cbb2437 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 20:43:11,562 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 20:43:11,613 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:43:11,620 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 20:43:11,623 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 20:43:11,648 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 20:43:11,649 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 20:43:11,649 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 20:43:11,649 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 20:43:11,649 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 20:43:11,649 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 20:43:11,649 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 20:43:11,649 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 20:43:11,650 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 20:43:11,650 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 20:43:11,650 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 20:43:11,650 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 20:43:11,650 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 20:43:11,650 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 20:43:11,650 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 20:43:11,650 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 20:43:11,650 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 20:43:11,650 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 20:43:11,650 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 20:43:11,650 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 20:43:11,650 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 20:43:11,650 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 20:43:11,650 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 20:43:11,650 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 20:43:11,650 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 20:43:11,650 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 20:43:11,651 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 20:43:11,651 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 20:43:11,651 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 20:43:11,651 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 20:43:11,651 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 20:43:11,651 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 20:43:11,651 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 20:43:11,651 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 20:43:11,651 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 20:43:11,651 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 20:43:11,651 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 20:43:11,651 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 20:43:11,651 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 20:43:11,651 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 20:43:11,651 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 20:43:11,652 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 20:43:11,653 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 20:43:11,653 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 -> 834766c90c3d5af368509ae691087999af545dba19d7eed6a5d75f823cbb2437 [2025-01-09 20:43:11,901 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 20:43:11,910 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 20:43:11,912 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 20:43:11,914 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 20:43:11,914 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 20:43:11,916 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_test4-2.i [2025-01-09 20:43:13,086 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1ec1ebaf2/e7631c4316794f689fc9a1d490c0f271/FLAG8d5cb42a4 [2025-01-09 20:43:13,423 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 20:43:13,424 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test4-2.i [2025-01-09 20:43:13,445 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1ec1ebaf2/e7631c4316794f689fc9a1d490c0f271/FLAG8d5cb42a4 [2025-01-09 20:43:13,660 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1ec1ebaf2/e7631c4316794f689fc9a1d490c0f271 [2025-01-09 20:43:13,662 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 20:43:13,663 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 20:43:13,665 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 20:43:13,665 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 20:43:13,668 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 20:43:13,669 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 08:43:13" (1/1) ... [2025-01-09 20:43:13,670 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@61ba6db2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:43:13, skipping insertion in model container [2025-01-09 20:43:13,670 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 08:43:13" (1/1) ... [2025-01-09 20:43:13,706 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 20:43:13,925 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_test4-2.i[33021,33034] [2025-01-09 20:43:14,016 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 20:43:14,024 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 20:43:14,048 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_test4-2.i[33021,33034] [2025-01-09 20:43:14,109 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 20:43:14,130 INFO L204 MainTranslator]: Completed translation [2025-01-09 20:43:14,130 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:43:14 WrapperNode [2025-01-09 20:43:14,130 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 20:43:14,131 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 20:43:14,131 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 20:43:14,131 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 20:43:14,135 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:43:14" (1/1) ... [2025-01-09 20:43:14,154 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:43:14" (1/1) ... [2025-01-09 20:43:14,211 INFO L138 Inliner]: procedures = 176, calls = 386, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1699 [2025-01-09 20:43:14,212 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 20:43:14,213 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 20:43:14,213 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 20:43:14,213 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 20:43:14,219 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:43:14" (1/1) ... [2025-01-09 20:43:14,220 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:43:14" (1/1) ... [2025-01-09 20:43:14,234 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:43:14" (1/1) ... [2025-01-09 20:43:14,318 INFO L175 MemorySlicer]: Split 357 memory accesses to 2 slices as follows [2, 355]. 99 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 90 writes are split as follows [0, 90]. [2025-01-09 20:43:14,318 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:43:14" (1/1) ... [2025-01-09 20:43:14,318 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:43:14" (1/1) ... [2025-01-09 20:43:14,348 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:43:14" (1/1) ... [2025-01-09 20:43:14,351 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:43:14" (1/1) ... [2025-01-09 20:43:14,379 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:43:14" (1/1) ... [2025-01-09 20:43:14,392 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:43:14" (1/1) ... [2025-01-09 20:43:14,399 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:43:14" (1/1) ... [2025-01-09 20:43:14,408 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 20:43:14,410 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 20:43:14,411 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 20:43:14,411 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 20:43:14,411 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:43:14" (1/1) ... [2025-01-09 20:43:14,415 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 20:43:14,425 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 20:43:14,436 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:43:14,440 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:43:14,458 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-09 20:43:14,459 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-09 20:43:14,459 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-01-09 20:43:14,459 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-01-09 20:43:14,459 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-09 20:43:14,459 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-09 20:43:14,459 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2025-01-09 20:43:14,460 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2025-01-09 20:43:14,460 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2025-01-09 20:43:14,460 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2025-01-09 20:43:14,460 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-09 20:43:14,460 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 20:43:14,460 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-01-09 20:43:14,460 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-01-09 20:43:14,460 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-01-09 20:43:14,460 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-01-09 20:43:14,460 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-09 20:43:14,460 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 20:43:14,461 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-09 20:43:14,461 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 20:43:14,461 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 20:43:14,635 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 20:43:14,638 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 20:43:15,818 INFO L? ?]: Removed 411 outVars from TransFormulas that were not future-live. [2025-01-09 20:43:15,818 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 20:43:15,835 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 20:43:15,835 INFO L312 CfgBuilder]: Removed 32 assume(true) statements. [2025-01-09 20:43:15,835 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 08:43:15 BoogieIcfgContainer [2025-01-09 20:43:15,836 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 20:43:15,837 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 20:43:15,837 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 20:43:15,840 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 20:43:15,840 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 08:43:13" (1/3) ... [2025-01-09 20:43:15,840 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@706539f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 08:43:15, skipping insertion in model container [2025-01-09 20:43:15,840 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:43:14" (2/3) ... [2025-01-09 20:43:15,840 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@706539f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 08:43:15, skipping insertion in model container [2025-01-09 20:43:15,840 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 08:43:15" (3/3) ... [2025-01-09 20:43:15,841 INFO L128 eAbstractionObserver]: Analyzing ICFG uthash_FNV_test4-2.i [2025-01-09 20:43:15,852 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 20:43:15,853 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG uthash_FNV_test4-2.i that has 4 procedures, 457 locations, 1 initial locations, 41 loop locations, and 1 error locations. [2025-01-09 20:43:15,905 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 20:43:15,915 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;@1ffdd9ef, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 20:43:15,915 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 20:43:15,921 INFO L276 IsEmpty]: Start isEmpty. Operand has 453 states, 433 states have (on average 1.6120092378752886) internal successors, (698), 444 states have internal predecessors, (698), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2025-01-09 20:43:15,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-01-09 20:43:15,925 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:43:15,925 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 20:43:15,926 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 20:43:15,930 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:43:15,930 INFO L85 PathProgramCache]: Analyzing trace with hash -1542237608, now seen corresponding path program 1 times [2025-01-09 20:43:15,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:43:15,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279479656] [2025-01-09 20:43:15,935 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:43:15,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:43:16,000 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-09 20:43:16,010 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-09 20:43:16,011 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:43:16,011 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:43:16,094 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:43:16,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:43:16,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [279479656] [2025-01-09 20:43:16,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [279479656] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:43:16,097 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:43:16,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 20:43:16,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442839603] [2025-01-09 20:43:16,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:43:16,102 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 20:43:16,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:43:16,116 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 20:43:16,117 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 20:43:16,119 INFO L87 Difference]: Start difference. First operand has 453 states, 433 states have (on average 1.6120092378752886) internal successors, (698), 444 states have internal predecessors, (698), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) 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:43:16,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:43:16,227 INFO L93 Difference]: Finished difference Result 1286 states and 2086 transitions. [2025-01-09 20:43:16,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 20:43:16,228 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:43:16,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:43:16,245 INFO L225 Difference]: With dead ends: 1286 [2025-01-09 20:43:16,245 INFO L226 Difference]: Without dead ends: 799 [2025-01-09 20:43:16,248 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:43:16,252 INFO L435 NwaCegarLoop]: 700 mSDtfsCounter, 543 mSDsluCounter, 654 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 549 SdHoareTripleChecker+Valid, 1354 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:43:16,254 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [549 Valid, 1354 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 20:43:16,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 799 states. [2025-01-09 20:43:16,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 799 to 418. [2025-01-09 20:43:16,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 418 states, 399 states have (on average 1.4536340852130325) internal successors, (580), 409 states have internal predecessors, (580), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2025-01-09 20:43:16,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 612 transitions. [2025-01-09 20:43:16,316 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 612 transitions. Word has length 9 [2025-01-09 20:43:16,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:43:16,316 INFO L471 AbstractCegarLoop]: Abstraction has 418 states and 612 transitions. [2025-01-09 20:43:16,316 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:43:16,316 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 612 transitions. [2025-01-09 20:43:16,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-01-09 20:43:16,325 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:43:16,325 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 20:43:16,325 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 20:43:16,325 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 20:43:16,326 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:43:16,326 INFO L85 PathProgramCache]: Analyzing trace with hash -667397663, now seen corresponding path program 1 times [2025-01-09 20:43:16,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:43:16,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1221020922] [2025-01-09 20:43:16,326 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:43:16,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:43:16,412 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-01-09 20:43:16,428 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-01-09 20:43:16,429 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:43:16,429 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:43:16,946 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:43:16,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:43:16,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1221020922] [2025-01-09 20:43:16,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1221020922] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:43:16,947 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:43:16,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 20:43:16,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25072840] [2025-01-09 20:43:16,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:43:16,949 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 20:43:16,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:43:16,950 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 20:43:16,950 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 20:43:16,950 INFO L87 Difference]: Start difference. First operand 418 states and 612 transitions. Second operand has 4 states, 4 states have (on average 38.0) internal successors, (152), 4 states have internal predecessors, (152), 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:43:17,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:43:17,052 INFO L93 Difference]: Finished difference Result 836 states and 1224 transitions. [2025-01-09 20:43:17,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 20:43:17,053 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 38.0) internal successors, (152), 4 states have internal predecessors, (152), 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 153 [2025-01-09 20:43:17,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:43:17,055 INFO L225 Difference]: With dead ends: 836 [2025-01-09 20:43:17,055 INFO L226 Difference]: Without dead ends: 421 [2025-01-09 20:43:17,057 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:43:17,057 INFO L435 NwaCegarLoop]: 584 mSDtfsCounter, 105 mSDsluCounter, 1075 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 1659 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.1s IncrementalHoareTripleChecker+Time [2025-01-09 20:43:17,057 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 1659 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 20:43:17,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 421 states. [2025-01-09 20:43:17,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 421 to 418. [2025-01-09 20:43:17,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 418 states, 399 states have (on average 1.4360902255639099) internal successors, (573), 409 states have internal predecessors, (573), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2025-01-09 20:43:17,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 605 transitions. [2025-01-09 20:43:17,086 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 605 transitions. Word has length 153 [2025-01-09 20:43:17,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:43:17,087 INFO L471 AbstractCegarLoop]: Abstraction has 418 states and 605 transitions. [2025-01-09 20:43:17,087 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 38.0) internal successors, (152), 4 states have internal predecessors, (152), 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:43:17,087 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 605 transitions. [2025-01-09 20:43:17,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-01-09 20:43:17,095 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:43:17,095 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 20:43:17,096 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 20:43:17,096 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 20:43:17,097 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:43:17,097 INFO L85 PathProgramCache]: Analyzing trace with hash 378812117, now seen corresponding path program 1 times [2025-01-09 20:43:17,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:43:17,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1113751719] [2025-01-09 20:43:17,099 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:43:17,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:43:17,159 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-01-09 20:43:17,186 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-01-09 20:43:17,186 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:43:17,186 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:43:17,348 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:43:17,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:43:17,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1113751719] [2025-01-09 20:43:17,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1113751719] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:43:17,350 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:43:17,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 20:43:17,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354503219] [2025-01-09 20:43:17,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:43:17,351 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 20:43:17,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:43:17,352 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 20:43:17,352 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 20:43:17,352 INFO L87 Difference]: Start difference. First operand 418 states and 605 transitions. Second operand has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 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:43:17,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:43:17,409 INFO L93 Difference]: Finished difference Result 961 states and 1395 transitions. [2025-01-09 20:43:17,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 20:43:17,411 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 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 153 [2025-01-09 20:43:17,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:43:17,413 INFO L225 Difference]: With dead ends: 961 [2025-01-09 20:43:17,413 INFO L226 Difference]: Without dead ends: 546 [2025-01-09 20:43:17,414 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:43:17,417 INFO L435 NwaCegarLoop]: 603 mSDtfsCounter, 134 mSDsluCounter, 596 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 1199 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:43:17,418 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 1199 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 20:43:17,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 546 states. [2025-01-09 20:43:17,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 546 to 546. [2025-01-09 20:43:17,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 546 states, 527 states have (on average 1.4421252371916509) internal successors, (760), 537 states have internal predecessors, (760), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2025-01-09 20:43:17,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 546 states to 546 states and 792 transitions. [2025-01-09 20:43:17,437 INFO L78 Accepts]: Start accepts. Automaton has 546 states and 792 transitions. Word has length 153 [2025-01-09 20:43:17,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:43:17,438 INFO L471 AbstractCegarLoop]: Abstraction has 546 states and 792 transitions. [2025-01-09 20:43:17,439 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 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:43:17,439 INFO L276 IsEmpty]: Start isEmpty. Operand 546 states and 792 transitions. [2025-01-09 20:43:17,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2025-01-09 20:43:17,441 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:43:17,441 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 20:43:17,442 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 20:43:17,442 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 20:43:17,443 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:43:17,443 INFO L85 PathProgramCache]: Analyzing trace with hash -1655030265, now seen corresponding path program 1 times [2025-01-09 20:43:17,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:43:17,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958709249] [2025-01-09 20:43:17,443 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:43:17,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:43:17,504 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-01-09 20:43:17,532 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-01-09 20:43:17,533 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:43:17,533 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:43:17,792 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-09 20:43:17,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:43:17,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1958709249] [2025-01-09 20:43:17,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1958709249] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:43:17,794 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:43:17,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 20:43:17,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [865205176] [2025-01-09 20:43:17,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:43:17,794 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 20:43:17,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:43:17,795 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 20:43:17,795 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 20:43:17,795 INFO L87 Difference]: Start difference. First operand 546 states and 792 transitions. Second operand has 4 states, 4 states have (on average 40.0) internal successors, (160), 4 states have internal predecessors, (160), 2 states have call successors, (3), 2 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:17,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:43:17,893 INFO L93 Difference]: Finished difference Result 919 states and 1328 transitions. [2025-01-09 20:43:17,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 20:43:17,894 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 40.0) internal successors, (160), 4 states have internal predecessors, (160), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 168 [2025-01-09 20:43:17,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:43:17,896 INFO L225 Difference]: With dead ends: 919 [2025-01-09 20:43:17,896 INFO L226 Difference]: Without dead ends: 504 [2025-01-09 20:43:17,897 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-01-09 20:43:17,897 INFO L435 NwaCegarLoop]: 501 mSDtfsCounter, 33 mSDsluCounter, 986 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 1487 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 20:43:17,899 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 1487 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 20:43:17,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 504 states. [2025-01-09 20:43:17,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 504 to 504. [2025-01-09 20:43:17,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 504 states, 485 states have (on average 1.4082474226804125) internal successors, (683), 495 states have internal predecessors, (683), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2025-01-09 20:43:17,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 504 states to 504 states and 715 transitions. [2025-01-09 20:43:17,920 INFO L78 Accepts]: Start accepts. Automaton has 504 states and 715 transitions. Word has length 168 [2025-01-09 20:43:17,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:43:17,920 INFO L471 AbstractCegarLoop]: Abstraction has 504 states and 715 transitions. [2025-01-09 20:43:17,920 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 40.0) internal successors, (160), 4 states have internal predecessors, (160), 2 states have call successors, (3), 2 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:17,920 INFO L276 IsEmpty]: Start isEmpty. Operand 504 states and 715 transitions. [2025-01-09 20:43:17,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2025-01-09 20:43:17,921 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:43:17,922 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 20:43:17,922 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 20:43:17,922 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 20:43:17,922 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:43:17,922 INFO L85 PathProgramCache]: Analyzing trace with hash -1390771081, now seen corresponding path program 1 times [2025-01-09 20:43:17,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:43:17,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959465920] [2025-01-09 20:43:17,923 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:43:17,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:43:17,971 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-01-09 20:43:17,988 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-01-09 20:43:17,988 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:43:17,989 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:43:18,135 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-09 20:43:18,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:43:18,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1959465920] [2025-01-09 20:43:18,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1959465920] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:43:18,136 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:43:18,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 20:43:18,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [956414981] [2025-01-09 20:43:18,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:43:18,137 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 20:43:18,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:43:18,137 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 20:43:18,137 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 20:43:18,138 INFO L87 Difference]: Start difference. First operand 504 states and 715 transitions. Second operand has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 3 states have internal predecessors, (160), 2 states have call successors, (3), 2 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,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:43:18,178 INFO L93 Difference]: Finished difference Result 877 states and 1240 transitions. [2025-01-09 20:43:18,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 20:43:18,179 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 3 states have internal predecessors, (160), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 168 [2025-01-09 20:43:18,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:43:18,182 INFO L225 Difference]: With dead ends: 877 [2025-01-09 20:43:18,183 INFO L226 Difference]: Without dead ends: 504 [2025-01-09 20:43:18,185 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-01-09 20:43:18,185 INFO L435 NwaCegarLoop]: 515 mSDtfsCounter, 2 mSDsluCounter, 493 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1008 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 20:43:18,187 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1008 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 20:43:18,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 504 states. [2025-01-09 20:43:18,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 504 to 504. [2025-01-09 20:43:18,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 504 states, 485 states have (on average 1.402061855670103) internal successors, (680), 495 states have internal predecessors, (680), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2025-01-09 20:43:18,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 504 states to 504 states and 712 transitions. [2025-01-09 20:43:18,209 INFO L78 Accepts]: Start accepts. Automaton has 504 states and 712 transitions. Word has length 168 [2025-01-09 20:43:18,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:43:18,210 INFO L471 AbstractCegarLoop]: Abstraction has 504 states and 712 transitions. [2025-01-09 20:43:18,210 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 3 states have internal predecessors, (160), 2 states have call successors, (3), 2 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,210 INFO L276 IsEmpty]: Start isEmpty. Operand 504 states and 712 transitions. [2025-01-09 20:43:18,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2025-01-09 20:43:18,214 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:43:18,214 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 20:43:18,214 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 20:43:18,215 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 20:43:18,215 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:43:18,215 INFO L85 PathProgramCache]: Analyzing trace with hash 1553773373, now seen corresponding path program 1 times [2025-01-09 20:43:18,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:43:18,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013760272] [2025-01-09 20:43:18,215 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:43:18,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:43:18,282 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-01-09 20:43:18,320 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-01-09 20:43:18,321 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:43:18,321 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:43:18,450 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-09 20:43:18,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:43:18,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2013760272] [2025-01-09 20:43:18,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2013760272] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:43:18,451 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:43:18,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 20:43:18,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1780443099] [2025-01-09 20:43:18,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:43:18,451 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 20:43:18,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:43:18,452 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 20:43:18,452 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 20:43:18,452 INFO L87 Difference]: Start difference. First operand 504 states and 712 transitions. Second operand has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 3 states have internal predecessors, (160), 2 states have call successors, (3), 2 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,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:43:18,491 INFO L93 Difference]: Finished difference Result 1022 states and 1428 transitions. [2025-01-09 20:43:18,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 20:43:18,493 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 3 states have internal predecessors, (160), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 168 [2025-01-09 20:43:18,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:43:18,496 INFO L225 Difference]: With dead ends: 1022 [2025-01-09 20:43:18,496 INFO L226 Difference]: Without dead ends: 649 [2025-01-09 20:43:18,497 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:43:18,497 INFO L435 NwaCegarLoop]: 520 mSDtfsCounter, 243 mSDsluCounter, 512 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 244 SdHoareTripleChecker+Valid, 1032 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:43:18,498 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [244 Valid, 1032 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 20:43:18,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 649 states. [2025-01-09 20:43:18,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 649 to 649. [2025-01-09 20:43:18,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 649 states, 627 states have (on average 1.3827751196172249) internal successors, (867), 637 states have internal predecessors, (867), 19 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 10 states have call predecessors, (19), 19 states have call successors, (19) [2025-01-09 20:43:18,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 649 states to 649 states and 905 transitions. [2025-01-09 20:43:18,513 INFO L78 Accepts]: Start accepts. Automaton has 649 states and 905 transitions. Word has length 168 [2025-01-09 20:43:18,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:43:18,513 INFO L471 AbstractCegarLoop]: Abstraction has 649 states and 905 transitions. [2025-01-09 20:43:18,514 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 3 states have internal predecessors, (160), 2 states have call successors, (3), 2 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,514 INFO L276 IsEmpty]: Start isEmpty. Operand 649 states and 905 transitions. [2025-01-09 20:43:18,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2025-01-09 20:43:18,515 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:43:18,515 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 20:43:18,515 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 20:43:18,515 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 20:43:18,516 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:43:18,516 INFO L85 PathProgramCache]: Analyzing trace with hash 54636733, now seen corresponding path program 1 times [2025-01-09 20:43:18,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:43:18,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284248959] [2025-01-09 20:43:18,516 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:43:18,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:43:18,580 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 183 statements into 1 equivalence classes. [2025-01-09 20:43:18,608 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 183 of 183 statements. [2025-01-09 20:43:18,608 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:43:18,608 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:43:18,775 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-01-09 20:43:18,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:43:18,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [284248959] [2025-01-09 20:43:18,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [284248959] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 20:43:18,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [953069854] [2025-01-09 20:43:18,776 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:43:18,776 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 20:43:18,776 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 20:43:18,778 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:43:18,780 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:43:19,060 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 183 statements into 1 equivalence classes. [2025-01-09 20:43:19,189 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 183 of 183 statements. [2025-01-09 20:43:19,189 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:43:19,189 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:43:19,195 INFO L256 TraceCheckSpWp]: Trace formula consists of 1029 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 20:43:19,201 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 20:43:19,381 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-01-09 20:43:19,381 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 20:43:19,574 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-01-09 20:43:19,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [953069854] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 20:43:19,575 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 20:43:19,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-01-09 20:43:19,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [188773481] [2025-01-09 20:43:19,575 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 20:43:19,576 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 20:43:19,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:43:19,576 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 20:43:19,577 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-01-09 20:43:19,577 INFO L87 Difference]: Start difference. First operand 649 states and 905 transitions. Second operand has 7 states, 7 states have (on average 68.0) internal successors, (476), 7 states have internal predecessors, (476), 4 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-01-09 20:43:19,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:43:19,675 INFO L93 Difference]: Finished difference Result 1421 states and 1977 transitions. [2025-01-09 20:43:19,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 20:43:19,675 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 68.0) internal successors, (476), 7 states have internal predecessors, (476), 4 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 183 [2025-01-09 20:43:19,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:43:19,681 INFO L225 Difference]: With dead ends: 1421 [2025-01-09 20:43:19,681 INFO L226 Difference]: Without dead ends: 1392 [2025-01-09 20:43:19,681 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 368 GetRequests, 363 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:43:19,682 INFO L435 NwaCegarLoop]: 561 mSDtfsCounter, 2526 mSDsluCounter, 1558 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2542 SdHoareTripleChecker+Valid, 2119 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 20:43:19,682 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2542 Valid, 2119 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 20:43:19,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1392 states. [2025-01-09 20:43:19,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1392 to 1392. [2025-01-09 20:43:19,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1392 states, 1355 states have (on average 1.3712177121771219) internal successors, (1858), 1365 states have internal predecessors, (1858), 34 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 25 states have call predecessors, (34), 34 states have call successors, (34) [2025-01-09 20:43:19,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1392 states to 1392 states and 1926 transitions. [2025-01-09 20:43:19,712 INFO L78 Accepts]: Start accepts. Automaton has 1392 states and 1926 transitions. Word has length 183 [2025-01-09 20:43:19,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:43:19,712 INFO L471 AbstractCegarLoop]: Abstraction has 1392 states and 1926 transitions. [2025-01-09 20:43:19,713 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 68.0) internal successors, (476), 7 states have internal predecessors, (476), 4 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-01-09 20:43:19,713 INFO L276 IsEmpty]: Start isEmpty. Operand 1392 states and 1926 transitions. [2025-01-09 20:43:19,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 616 [2025-01-09 20:43:19,736 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:43:19,736 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 20:43:19,745 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 20:43:19,937 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 20:43:19,938 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 20:43:19,938 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:43:19,938 INFO L85 PathProgramCache]: Analyzing trace with hash -1002590762, now seen corresponding path program 1 times [2025-01-09 20:43:19,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:43:19,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068296393] [2025-01-09 20:43:19,939 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:43:19,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:43:20,094 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 615 statements into 1 equivalence classes. [2025-01-09 20:43:20,384 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 615 of 615 statements. [2025-01-09 20:43:20,385 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:43:20,385 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:43:21,187 INFO L134 CoverageAnalysis]: Checked inductivity of 880 backedges. 0 proven. 856 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-01-09 20:43:21,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:43:21,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2068296393] [2025-01-09 20:43:21,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2068296393] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 20:43:21,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1367044587] [2025-01-09 20:43:21,187 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:43:21,187 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 20:43:21,188 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 20:43:21,189 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:43:21,191 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:43:21,641 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 615 statements into 1 equivalence classes. [2025-01-09 20:43:21,971 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 615 of 615 statements. [2025-01-09 20:43:21,971 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:43:21,971 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:43:21,986 INFO L256 TraceCheckSpWp]: Trace formula consists of 3084 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-09 20:43:21,996 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 20:43:22,639 INFO L134 CoverageAnalysis]: Checked inductivity of 880 backedges. 0 proven. 856 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-01-09 20:43:22,639 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 20:43:23,261 INFO L134 CoverageAnalysis]: Checked inductivity of 880 backedges. 0 proven. 856 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-01-09 20:43:23,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1367044587] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 20:43:23,261 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 20:43:23,261 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2025-01-09 20:43:23,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [488853092] [2025-01-09 20:43:23,262 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 20:43:23,263 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 20:43:23,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:43:23,265 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 20:43:23,266 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-01-09 20:43:23,266 INFO L87 Difference]: Start difference. First operand 1392 states and 1926 transitions. Second operand has 13 states, 13 states have (on average 103.07692307692308) internal successors, (1340), 13 states have internal predecessors, (1340), 4 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-01-09 20:43:23,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:43:23,565 INFO L93 Difference]: Finished difference Result 3461 states and 4794 transitions. [2025-01-09 20:43:23,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 20:43:23,566 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 103.07692307692308) internal successors, (1340), 13 states have internal predecessors, (1340), 4 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 615 [2025-01-09 20:43:23,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:43:23,581 INFO L225 Difference]: With dead ends: 3461 [2025-01-09 20:43:23,581 INFO L226 Difference]: Without dead ends: 3432 [2025-01-09 20:43:23,583 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1235 GetRequests, 1224 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:43:23,583 INFO L435 NwaCegarLoop]: 561 mSDtfsCounter, 6546 mSDsluCounter, 4531 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6598 SdHoareTripleChecker+Valid, 5092 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 20:43:23,583 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6598 Valid, 5092 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 20:43:23,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3432 states. [2025-01-09 20:43:23,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3432 to 3432. [2025-01-09 20:43:23,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3432 states, 3359 states have (on average 1.3694551949985114) internal successors, (4600), 3369 states have internal predecessors, (4600), 70 states have call successors, (70), 2 states have call predecessors, (70), 2 states have return successors, (70), 61 states have call predecessors, (70), 70 states have call successors, (70) [2025-01-09 20:43:23,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3432 states to 3432 states and 4740 transitions. [2025-01-09 20:43:23,656 INFO L78 Accepts]: Start accepts. Automaton has 3432 states and 4740 transitions. Word has length 615 [2025-01-09 20:43:23,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:43:23,657 INFO L471 AbstractCegarLoop]: Abstraction has 3432 states and 4740 transitions. [2025-01-09 20:43:23,658 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 103.07692307692308) internal successors, (1340), 13 states have internal predecessors, (1340), 4 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-01-09 20:43:23,658 INFO L276 IsEmpty]: Start isEmpty. Operand 3432 states and 4740 transitions. [2025-01-09 20:43:23,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1480 [2025-01-09 20:43:23,690 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:43:23,691 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 20:43:23,704 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-09 20:43:23,891 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 20:43:23,892 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 20:43:23,892 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:43:23,893 INFO L85 PathProgramCache]: Analyzing trace with hash -1287604728, now seen corresponding path program 2 times [2025-01-09 20:43:23,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:43:23,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [781669198] [2025-01-09 20:43:23,893 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 20:43:23,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:43:24,241 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 1479 statements into 2 equivalence classes.