./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_BER_test5-3.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_BER_test5-3.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 5b724500cddd07446974ec59df8ac86aa980f4ff713324fa73d397377235cbe2 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 20:39:56,321 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 20:39:56,375 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:39:56,380 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 20:39:56,380 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 20:39:56,404 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 20:39:56,405 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 20:39:56,405 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 20:39:56,405 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 20:39:56,406 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 20:39:56,406 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 20:39:56,406 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 20:39:56,407 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 20:39:56,407 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 20:39:56,407 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 20:39:56,407 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 20:39:56,407 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 20:39:56,407 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 20:39:56,408 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 20:39:56,408 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 20:39:56,408 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 20:39:56,408 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 20:39:56,408 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 20:39:56,408 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 20:39:56,408 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 20:39:56,408 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 20:39:56,408 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 20:39:56,408 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 20:39:56,409 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 20:39:56,409 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 20:39:56,409 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 20:39:56,409 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 20:39:56,409 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 20:39:56,409 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 20:39:56,410 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 20:39:56,410 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 20:39:56,410 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 20:39:56,410 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 20:39:56,410 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 20:39:56,410 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 20:39:56,410 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 20:39:56,410 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 20:39:56,410 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 20:39:56,410 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 20:39:56,410 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 20:39:56,410 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 20:39:56,411 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 20:39:56,411 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 20:39:56,411 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 -> 5b724500cddd07446974ec59df8ac86aa980f4ff713324fa73d397377235cbe2 [2025-01-09 20:39:56,661 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 20:39:56,672 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 20:39:56,675 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 20:39:56,675 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 20:39:56,676 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 20:39:56,677 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_BER_test5-3.i [2025-01-09 20:39:57,854 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8aa2f28d1/d2bab16006714c90921441bdfb881f5b/FLAG83d48ffd2 [2025-01-09 20:39:58,271 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 20:39:58,272 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test5-3.i [2025-01-09 20:39:58,284 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8aa2f28d1/d2bab16006714c90921441bdfb881f5b/FLAG83d48ffd2 [2025-01-09 20:39:58,436 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8aa2f28d1/d2bab16006714c90921441bdfb881f5b [2025-01-09 20:39:58,438 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 20:39:58,439 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 20:39:58,440 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 20:39:58,440 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 20:39:58,443 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 20:39:58,444 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 08:39:58" (1/1) ... [2025-01-09 20:39:58,448 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@60c2345a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:39:58, skipping insertion in model container [2025-01-09 20:39:58,448 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 08:39:58" (1/1) ... [2025-01-09 20:39:58,482 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 20:39:58,727 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_BER_test5-3.i[33021,33034] [2025-01-09 20:39:58,826 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_BER_test5-3.i[49681,49694] [2025-01-09 20:39:58,841 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 20:39:58,848 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 20:39:58,884 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_BER_test5-3.i[33021,33034] [2025-01-09 20:39:58,952 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_BER_test5-3.i[49681,49694] [2025-01-09 20:39:58,962 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 20:39:58,987 INFO L204 MainTranslator]: Completed translation [2025-01-09 20:39:58,992 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:39:58 WrapperNode [2025-01-09 20:39:58,992 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 20:39:58,993 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 20:39:58,993 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 20:39:58,993 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 20:39:58,997 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:39:58" (1/1) ... [2025-01-09 20:39:59,024 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:39:58" (1/1) ... [2025-01-09 20:39:59,073 INFO L138 Inliner]: procedures = 177, calls = 472, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 2278 [2025-01-09 20:39:59,073 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 20:39:59,074 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 20:39:59,074 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 20:39:59,074 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 20:39:59,082 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:39:58" (1/1) ... [2025-01-09 20:39:59,083 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:39:58" (1/1) ... [2025-01-09 20:39:59,096 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:39:58" (1/1) ... [2025-01-09 20:39:59,230 INFO L175 MemorySlicer]: Split 443 memory accesses to 3 slices as follows [2, 24, 417]. 94 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 99 writes are split as follows [0, 1, 98]. [2025-01-09 20:39:59,235 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:39:58" (1/1) ... [2025-01-09 20:39:59,235 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:39:58" (1/1) ... [2025-01-09 20:39:59,270 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:39:58" (1/1) ... [2025-01-09 20:39:59,272 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:39:58" (1/1) ... [2025-01-09 20:39:59,281 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:39:58" (1/1) ... [2025-01-09 20:39:59,286 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:39:58" (1/1) ... [2025-01-09 20:39:59,289 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:39:58" (1/1) ... [2025-01-09 20:39:59,299 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 20:39:59,301 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 20:39:59,301 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 20:39:59,301 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 20:39:59,302 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:39:58" (1/1) ... [2025-01-09 20:39:59,309 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 20:39:59,321 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 20:39:59,334 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:39:59,337 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:39:59,356 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-09 20:39:59,356 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-09 20:39:59,356 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-01-09 20:39:59,356 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-01-09 20:39:59,356 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-01-09 20:39:59,356 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-09 20:39:59,356 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-09 20:39:59,356 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-01-09 20:39:59,356 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2025-01-09 20:39:59,356 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2025-01-09 20:39:59,356 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2025-01-09 20:39:59,357 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2025-01-09 20:39:59,357 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2025-01-09 20:39:59,357 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2025-01-09 20:39:59,357 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-09 20:39:59,357 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 20:39:59,357 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-01-09 20:39:59,357 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-01-09 20:39:59,357 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-01-09 20:39:59,357 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-01-09 20:39:59,358 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-01-09 20:39:59,358 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-01-09 20:39:59,358 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-01-09 20:39:59,358 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-09 20:39:59,358 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 20:39:59,358 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-09 20:39:59,358 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-09 20:39:59,358 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 20:39:59,358 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 20:39:59,575 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 20:39:59,577 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 20:40:01,196 INFO L? ?]: Removed 524 outVars from TransFormulas that were not future-live. [2025-01-09 20:40:01,197 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 20:40:01,212 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 20:40:01,212 INFO L312 CfgBuilder]: Removed 47 assume(true) statements. [2025-01-09 20:40:01,212 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 08:40:01 BoogieIcfgContainer [2025-01-09 20:40:01,212 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 20:40:01,214 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 20:40:01,214 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 20:40:01,221 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 20:40:01,221 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 08:39:58" (1/3) ... [2025-01-09 20:40:01,221 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59784000 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 08:40:01, skipping insertion in model container [2025-01-09 20:40:01,221 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:39:58" (2/3) ... [2025-01-09 20:40:01,222 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59784000 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 08:40:01, skipping insertion in model container [2025-01-09 20:40:01,222 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 08:40:01" (3/3) ... [2025-01-09 20:40:01,223 INFO L128 eAbstractionObserver]: Analyzing ICFG uthash_BER_test5-3.i [2025-01-09 20:40:01,233 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 20:40:01,234 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG uthash_BER_test5-3.i that has 5 procedures, 632 locations, 1 initial locations, 58 loop locations, and 2 error locations. [2025-01-09 20:40:01,280 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 20:40:01,288 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;@7aa02d63, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 20:40:01,288 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-01-09 20:40:01,293 INFO L276 IsEmpty]: Start isEmpty. Operand has 624 states, 608 states have (on average 1.618421052631579) internal successors, (984), 615 states have internal predecessors, (984), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2025-01-09 20:40:01,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-01-09 20:40:01,296 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:40:01,297 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-01-09 20:40:01,297 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 20:40:01,300 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:40:01,301 INFO L85 PathProgramCache]: Analyzing trace with hash -557051575, now seen corresponding path program 1 times [2025-01-09 20:40:01,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:40:01,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500839262] [2025-01-09 20:40:01,306 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:40:01,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:40:01,429 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-09 20:40:01,437 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-09 20:40:01,438 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:40:01,438 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:40:01,471 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:40:01,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:40:01,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [500839262] [2025-01-09 20:40:01,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [500839262] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:40:01,472 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:40:01,472 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 20:40:01,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189468989] [2025-01-09 20:40:01,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:40:01,480 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 20:40:01,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:40:01,504 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 20:40:01,509 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 20:40:01,512 INFO L87 Difference]: Start difference. First operand has 624 states, 608 states have (on average 1.618421052631579) internal successors, (984), 615 states have internal predecessors, (984), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 20:40:01,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:40:01,601 INFO L93 Difference]: Finished difference Result 1246 states and 2015 transitions. [2025-01-09 20:40:01,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 20:40:01,602 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-01-09 20:40:01,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:40:01,618 INFO L225 Difference]: With dead ends: 1246 [2025-01-09 20:40:01,622 INFO L226 Difference]: Without dead ends: 561 [2025-01-09 20:40:01,628 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 20:40:01,632 INFO L435 NwaCegarLoop]: 906 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 906 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 20:40:01,637 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 906 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 20:40:01,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 561 states. [2025-01-09 20:40:01,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 561 to 561. [2025-01-09 20:40:01,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 561 states, 546 states have (on average 1.4615384615384615) internal successors, (798), 552 states have internal predecessors, (798), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2025-01-09 20:40:01,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 561 states to 561 states and 820 transitions. [2025-01-09 20:40:01,725 INFO L78 Accepts]: Start accepts. Automaton has 561 states and 820 transitions. Word has length 7 [2025-01-09 20:40:01,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:40:01,726 INFO L471 AbstractCegarLoop]: Abstraction has 561 states and 820 transitions. [2025-01-09 20:40:01,726 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 20:40:01,726 INFO L276 IsEmpty]: Start isEmpty. Operand 561 states and 820 transitions. [2025-01-09 20:40:01,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-01-09 20:40:01,729 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:40:01,729 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 20:40:01,729 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 20:40:01,730 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 20:40:01,730 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:40:01,730 INFO L85 PathProgramCache]: Analyzing trace with hash 1284923811, now seen corresponding path program 1 times [2025-01-09 20:40:01,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:40:01,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2119455889] [2025-01-09 20:40:01,730 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:40:01,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:40:01,759 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-01-09 20:40:01,772 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-01-09 20:40:01,773 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:40:01,773 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:40:01,962 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:40:01,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:40:01,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2119455889] [2025-01-09 20:40:01,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2119455889] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:40:01,962 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:40:01,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 20:40:01,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [201591141] [2025-01-09 20:40:01,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:40:01,963 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 20:40:01,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:40:01,963 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 20:40:01,963 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 20:40:01,964 INFO L87 Difference]: Start difference. First operand 561 states and 820 transitions. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 20:40:02,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:40:02,062 INFO L93 Difference]: Finished difference Result 1283 states and 1886 transitions. [2025-01-09 20:40:02,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 20:40:02,062 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2025-01-09 20:40:02,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:40:02,067 INFO L225 Difference]: With dead ends: 1283 [2025-01-09 20:40:02,067 INFO L226 Difference]: Without dead ends: 1110 [2025-01-09 20:40:02,067 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:40:02,068 INFO L435 NwaCegarLoop]: 816 mSDtfsCounter, 784 mSDsluCounter, 813 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 795 SdHoareTripleChecker+Valid, 1629 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 20:40:02,068 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [795 Valid, 1629 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 20:40:02,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1110 states. [2025-01-09 20:40:02,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1110 to 562. [2025-01-09 20:40:02,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 562 states, 547 states have (on average 1.4606946983546618) internal successors, (799), 553 states have internal predecessors, (799), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2025-01-09 20:40:02,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 562 states to 562 states and 821 transitions. [2025-01-09 20:40:02,114 INFO L78 Accepts]: Start accepts. Automaton has 562 states and 821 transitions. Word has length 60 [2025-01-09 20:40:02,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:40:02,114 INFO L471 AbstractCegarLoop]: Abstraction has 562 states and 821 transitions. [2025-01-09 20:40:02,114 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 20:40:02,114 INFO L276 IsEmpty]: Start isEmpty. Operand 562 states and 821 transitions. [2025-01-09 20:40:02,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2025-01-09 20:40:02,123 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:40:02,123 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 20:40:02,123 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 20:40:02,124 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 20:40:02,124 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:40:02,124 INFO L85 PathProgramCache]: Analyzing trace with hash 1309299646, now seen corresponding path program 1 times [2025-01-09 20:40:02,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:40:02,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1691013578] [2025-01-09 20:40:02,124 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:40:02,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:40:02,207 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 204 statements into 1 equivalence classes. [2025-01-09 20:40:02,226 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 204 of 204 statements. [2025-01-09 20:40:02,229 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:40:02,230 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:40:02,699 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:40:02,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:40:02,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1691013578] [2025-01-09 20:40:02,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1691013578] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:40:02,700 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:40:02,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 20:40:02,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909994036] [2025-01-09 20:40:02,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:40:02,701 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 20:40:02,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:40:02,702 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 20:40:02,702 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 20:40:02,702 INFO L87 Difference]: Start difference. First operand 562 states and 821 transitions. Second operand has 4 states, 4 states have (on average 51.0) internal successors, (204), 4 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 20:40:02,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:40:02,781 INFO L93 Difference]: Finished difference Result 1124 states and 1642 transitions. [2025-01-09 20:40:02,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 20:40:02,782 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 51.0) internal successors, (204), 4 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 204 [2025-01-09 20:40:02,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:40:02,784 INFO L225 Difference]: With dead ends: 1124 [2025-01-09 20:40:02,785 INFO L226 Difference]: Without dead ends: 565 [2025-01-09 20:40:02,786 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:40:02,787 INFO L435 NwaCegarLoop]: 793 mSDtfsCounter, 105 mSDsluCounter, 1493 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 2286 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:40:02,787 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 2286 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 20:40:02,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 565 states. [2025-01-09 20:40:02,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 565 to 562. [2025-01-09 20:40:02,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 562 states, 547 states have (on average 1.4478976234003655) internal successors, (792), 553 states have internal predecessors, (792), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2025-01-09 20:40:02,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 562 states to 562 states and 814 transitions. [2025-01-09 20:40:02,800 INFO L78 Accepts]: Start accepts. Automaton has 562 states and 814 transitions. Word has length 204 [2025-01-09 20:40:02,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:40:02,801 INFO L471 AbstractCegarLoop]: Abstraction has 562 states and 814 transitions. [2025-01-09 20:40:02,801 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 51.0) internal successors, (204), 4 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 20:40:02,801 INFO L276 IsEmpty]: Start isEmpty. Operand 562 states and 814 transitions. [2025-01-09 20:40:02,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2025-01-09 20:40:02,803 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:40:02,803 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 20:40:02,803 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 20:40:02,803 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 20:40:02,804 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:40:02,804 INFO L85 PathProgramCache]: Analyzing trace with hash 1509611978, now seen corresponding path program 1 times [2025-01-09 20:40:02,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:40:02,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930439412] [2025-01-09 20:40:02,804 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:40:02,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:40:02,865 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 204 statements into 1 equivalence classes. [2025-01-09 20:40:02,874 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 204 of 204 statements. [2025-01-09 20:40:02,878 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:40:02,879 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:40:03,075 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:40:03,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:40:03,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [930439412] [2025-01-09 20:40:03,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [930439412] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:40:03,075 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:40:03,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 20:40:03,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1146435045] [2025-01-09 20:40:03,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:40:03,076 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 20:40:03,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:40:03,076 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 20:40:03,076 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 20:40:03,077 INFO L87 Difference]: Start difference. First operand 562 states and 814 transitions. Second operand has 3 states, 3 states have (on average 68.0) internal successors, (204), 3 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 20:40:03,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:40:03,125 INFO L93 Difference]: Finished difference Result 1127 states and 1634 transitions. [2025-01-09 20:40:03,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 20:40:03,125 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 68.0) internal successors, (204), 3 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 204 [2025-01-09 20:40:03,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:40:03,128 INFO L225 Difference]: With dead ends: 1127 [2025-01-09 20:40:03,128 INFO L226 Difference]: Without dead ends: 568 [2025-01-09 20:40:03,128 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:40:03,131 INFO L435 NwaCegarLoop]: 807 mSDtfsCounter, 1 mSDsluCounter, 785 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1592 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 20:40:03,131 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1592 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 20:40:03,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 568 states. [2025-01-09 20:40:03,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 568 to 568. [2025-01-09 20:40:03,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 568 states, 553 states have (on average 1.4430379746835442) internal successors, (798), 559 states have internal predecessors, (798), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2025-01-09 20:40:03,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 568 states to 568 states and 820 transitions. [2025-01-09 20:40:03,153 INFO L78 Accepts]: Start accepts. Automaton has 568 states and 820 transitions. Word has length 204 [2025-01-09 20:40:03,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:40:03,153 INFO L471 AbstractCegarLoop]: Abstraction has 568 states and 820 transitions. [2025-01-09 20:40:03,154 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 68.0) internal successors, (204), 3 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 20:40:03,154 INFO L276 IsEmpty]: Start isEmpty. Operand 568 states and 820 transitions. [2025-01-09 20:40:03,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2025-01-09 20:40:03,156 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:40:03,156 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 20:40:03,157 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 20:40:03,157 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 20:40:03,157 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:40:03,157 INFO L85 PathProgramCache]: Analyzing trace with hash 1490070856, now seen corresponding path program 1 times [2025-01-09 20:40:03,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:40:03,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [582037011] [2025-01-09 20:40:03,157 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:40:03,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:40:03,210 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 204 statements into 1 equivalence classes. [2025-01-09 20:40:03,225 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 204 of 204 statements. [2025-01-09 20:40:03,225 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:40:03,225 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:40:03,399 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:40:03,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:40:03,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [582037011] [2025-01-09 20:40:03,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [582037011] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:40:03,400 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:40:03,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 20:40:03,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983876680] [2025-01-09 20:40:03,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:40:03,400 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 20:40:03,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:40:03,401 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 20:40:03,401 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 20:40:03,401 INFO L87 Difference]: Start difference. First operand 568 states and 820 transitions. Second operand has 3 states, 3 states have (on average 68.0) internal successors, (204), 3 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 20:40:03,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:40:03,443 INFO L93 Difference]: Finished difference Result 1267 states and 1831 transitions. [2025-01-09 20:40:03,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 20:40:03,445 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 68.0) internal successors, (204), 3 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 204 [2025-01-09 20:40:03,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:40:03,448 INFO L225 Difference]: With dead ends: 1267 [2025-01-09 20:40:03,448 INFO L226 Difference]: Without dead ends: 702 [2025-01-09 20:40:03,449 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:40:03,449 INFO L435 NwaCegarLoop]: 812 mSDtfsCounter, 134 mSDsluCounter, 805 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 1617 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:40:03,450 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 1617 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 20:40:03,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 702 states. [2025-01-09 20:40:03,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 702 to 702. [2025-01-09 20:40:03,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 702 states, 687 states have (on average 1.4425036390101893) internal successors, (991), 693 states have internal predecessors, (991), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2025-01-09 20:40:03,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 702 states to 702 states and 1013 transitions. [2025-01-09 20:40:03,463 INFO L78 Accepts]: Start accepts. Automaton has 702 states and 1013 transitions. Word has length 204 [2025-01-09 20:40:03,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:40:03,463 INFO L471 AbstractCegarLoop]: Abstraction has 702 states and 1013 transitions. [2025-01-09 20:40:03,464 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 68.0) internal successors, (204), 3 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 20:40:03,464 INFO L276 IsEmpty]: Start isEmpty. Operand 702 states and 1013 transitions. [2025-01-09 20:40:03,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2025-01-09 20:40:03,465 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:40:03,466 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 20:40:03,466 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 20:40:03,466 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 20:40:03,466 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:40:03,466 INFO L85 PathProgramCache]: Analyzing trace with hash -1350622626, now seen corresponding path program 1 times [2025-01-09 20:40:03,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:40:03,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445695334] [2025-01-09 20:40:03,466 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:40:03,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:40:03,522 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 219 statements into 1 equivalence classes. [2025-01-09 20:40:03,539 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 219 of 219 statements. [2025-01-09 20:40:03,539 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:40:03,539 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:40:03,820 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:40:03,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:40:03,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [445695334] [2025-01-09 20:40:03,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [445695334] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:40:03,820 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:40:03,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 20:40:03,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657640812] [2025-01-09 20:40:03,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:40:03,821 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 20:40:03,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:40:03,822 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 20:40:03,822 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 20:40:03,822 INFO L87 Difference]: Start difference. First operand 702 states and 1013 transitions. Second operand has 5 states, 5 states have (on average 42.4) internal successors, (212), 5 states have internal predecessors, (212), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 20:40:03,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:40:03,933 INFO L93 Difference]: Finished difference Result 1225 states and 1764 transitions. [2025-01-09 20:40:03,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 20:40:03,933 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 42.4) internal successors, (212), 5 states have internal predecessors, (212), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 219 [2025-01-09 20:40:03,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:40:03,937 INFO L225 Difference]: With dead ends: 1225 [2025-01-09 20:40:03,937 INFO L226 Difference]: Without dead ends: 660 [2025-01-09 20:40:03,938 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 20:40:03,938 INFO L435 NwaCegarLoop]: 711 mSDtfsCounter, 18 mSDsluCounter, 1404 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 2115 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 20:40:03,939 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 2115 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 20:40:03,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 660 states. [2025-01-09 20:40:03,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 660 to 660. [2025-01-09 20:40:03,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 660 states, 645 states have (on average 1.4170542635658914) internal successors, (914), 651 states have internal predecessors, (914), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2025-01-09 20:40:03,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 660 states to 660 states and 936 transitions. [2025-01-09 20:40:03,955 INFO L78 Accepts]: Start accepts. Automaton has 660 states and 936 transitions. Word has length 219 [2025-01-09 20:40:03,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:40:03,956 INFO L471 AbstractCegarLoop]: Abstraction has 660 states and 936 transitions. [2025-01-09 20:40:03,956 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 42.4) internal successors, (212), 5 states have internal predecessors, (212), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 20:40:03,956 INFO L276 IsEmpty]: Start isEmpty. Operand 660 states and 936 transitions. [2025-01-09 20:40:03,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2025-01-09 20:40:03,958 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:40:03,958 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 20:40:03,958 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 20:40:03,958 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 20:40:03,958 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:40:03,958 INFO L85 PathProgramCache]: Analyzing trace with hash 769601772, now seen corresponding path program 1 times [2025-01-09 20:40:03,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:40:03,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151874195] [2025-01-09 20:40:03,959 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:40:03,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:40:04,012 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 219 statements into 1 equivalence classes. [2025-01-09 20:40:04,033 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 219 of 219 statements. [2025-01-09 20:40:04,034 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:40:04,034 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:40:04,186 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:40:04,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:40:04,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1151874195] [2025-01-09 20:40:04,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1151874195] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:40:04,186 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:40:04,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 20:40:04,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094623355] [2025-01-09 20:40:04,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:40:04,187 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 20:40:04,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:40:04,189 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 20:40:04,189 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 20:40:04,189 INFO L87 Difference]: Start difference. First operand 660 states and 936 transitions. Second operand has 3 states, 3 states have (on average 70.66666666666667) internal successors, (212), 3 states have internal predecessors, (212), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 20:40:04,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:40:04,231 INFO L93 Difference]: Finished difference Result 1183 states and 1676 transitions. [2025-01-09 20:40:04,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 20:40:04,231 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 70.66666666666667) internal successors, (212), 3 states have internal predecessors, (212), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 219 [2025-01-09 20:40:04,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:40:04,234 INFO L225 Difference]: With dead ends: 1183 [2025-01-09 20:40:04,235 INFO L226 Difference]: Without dead ends: 660 [2025-01-09 20:40:04,236 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:40:04,236 INFO L435 NwaCegarLoop]: 724 mSDtfsCounter, 1 mSDsluCounter, 702 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1426 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 20:40:04,237 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1426 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 20:40:04,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 660 states. [2025-01-09 20:40:04,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 660 to 660. [2025-01-09 20:40:04,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 660 states, 645 states have (on average 1.4124031007751938) internal successors, (911), 651 states have internal predecessors, (911), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2025-01-09 20:40:04,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 660 states to 660 states and 933 transitions. [2025-01-09 20:40:04,250 INFO L78 Accepts]: Start accepts. Automaton has 660 states and 933 transitions. Word has length 219 [2025-01-09 20:40:04,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:40:04,251 INFO L471 AbstractCegarLoop]: Abstraction has 660 states and 933 transitions. [2025-01-09 20:40:04,251 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 70.66666666666667) internal successors, (212), 3 states have internal predecessors, (212), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 20:40:04,251 INFO L276 IsEmpty]: Start isEmpty. Operand 660 states and 933 transitions. [2025-01-09 20:40:04,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2025-01-09 20:40:04,253 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:40:04,253 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 20:40:04,253 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 20:40:04,253 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 20:40:04,253 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:40:04,254 INFO L85 PathProgramCache]: Analyzing trace with hash -1501946520, now seen corresponding path program 1 times [2025-01-09 20:40:04,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:40:04,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [520762971] [2025-01-09 20:40:04,254 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:40:04,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:40:04,305 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 219 statements into 1 equivalence classes. [2025-01-09 20:40:04,359 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 219 of 219 statements. [2025-01-09 20:40:04,360 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:40:04,360 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:40:04,546 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:40:04,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:40:04,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [520762971] [2025-01-09 20:40:04,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [520762971] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:40:04,546 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:40:04,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 20:40:04,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [672380678] [2025-01-09 20:40:04,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:40:04,546 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 20:40:04,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:40:04,547 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 20:40:04,547 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 20:40:04,547 INFO L87 Difference]: Start difference. First operand 660 states and 933 transitions. Second operand has 3 states, 3 states have (on average 70.66666666666667) internal successors, (212), 3 states have internal predecessors, (212), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 20:40:04,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:40:04,609 INFO L93 Difference]: Finished difference Result 1474 states and 2087 transitions. [2025-01-09 20:40:04,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 20:40:04,610 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 70.66666666666667) internal successors, (212), 3 states have internal predecessors, (212), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 219 [2025-01-09 20:40:04,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:40:04,615 INFO L225 Difference]: With dead ends: 1474 [2025-01-09 20:40:04,615 INFO L226 Difference]: Without dead ends: 951 [2025-01-09 20:40:04,616 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:40:04,616 INFO L435 NwaCegarLoop]: 923 mSDtfsCounter, 454 mSDsluCounter, 716 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 460 SdHoareTripleChecker+Valid, 1639 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 20:40:04,617 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [460 Valid, 1639 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 20:40:04,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 951 states. [2025-01-09 20:40:04,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 951 to 949. [2025-01-09 20:40:04,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 949 states, 926 states have (on average 1.4136069114470842) internal successors, (1309), 937 states have internal predecessors, (1309), 19 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 11 states have call predecessors, (19), 19 states have call successors, (19) [2025-01-09 20:40:04,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 949 states to 949 states and 1347 transitions. [2025-01-09 20:40:04,642 INFO L78 Accepts]: Start accepts. Automaton has 949 states and 1347 transitions. Word has length 219 [2025-01-09 20:40:04,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:40:04,642 INFO L471 AbstractCegarLoop]: Abstraction has 949 states and 1347 transitions. [2025-01-09 20:40:04,642 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 70.66666666666667) internal successors, (212), 3 states have internal predecessors, (212), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 20:40:04,642 INFO L276 IsEmpty]: Start isEmpty. Operand 949 states and 1347 transitions. [2025-01-09 20:40:04,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2025-01-09 20:40:04,645 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:40:04,645 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 20:40:04,645 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 20:40:04,645 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 20:40:04,646 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:40:04,646 INFO L85 PathProgramCache]: Analyzing trace with hash -2024859296, now seen corresponding path program 1 times [2025-01-09 20:40:04,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:40:04,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917790798] [2025-01-09 20:40:04,646 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:40:04,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:40:04,724 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 234 statements into 1 equivalence classes. [2025-01-09 20:40:04,768 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 234 of 234 statements. [2025-01-09 20:40:04,769 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:40:04,769 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:40:04,998 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:40:04,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:40:04,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [917790798] [2025-01-09 20:40:04,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [917790798] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 20:40:04,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [441567185] [2025-01-09 20:40:04,998 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:40:04,999 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 20:40:04,999 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 20:40:05,001 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:40:05,004 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:40:05,298 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 234 statements into 1 equivalence classes. [2025-01-09 20:40:05,458 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 234 of 234 statements. [2025-01-09 20:40:05,458 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:40:05,459 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:40:05,464 INFO L256 TraceCheckSpWp]: Trace formula consists of 1203 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 20:40:05,474 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 20:40:05,514 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-01-09 20:40:05,515 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 20:40:05,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [441567185] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:40:05,515 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 20:40:05,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-01-09 20:40:05,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [825065933] [2025-01-09 20:40:05,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:40:05,515 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 20:40:05,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:40:05,520 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 20:40:05,520 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 20:40:05,520 INFO L87 Difference]: Start difference. First operand 949 states and 1347 transitions. Second operand has 3 states, 3 states have (on average 72.33333333333333) internal successors, (217), 3 states have internal predecessors, (217), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-01-09 20:40:05,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:40:05,589 INFO L93 Difference]: Finished difference Result 1306 states and 1885 transitions. [2025-01-09 20:40:05,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 20:40:05,590 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 72.33333333333333) internal successors, (217), 3 states have internal predecessors, (217), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 234 [2025-01-09 20:40:05,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:40:05,593 INFO L225 Difference]: With dead ends: 1306 [2025-01-09 20:40:05,594 INFO L226 Difference]: Without dead ends: 989 [2025-01-09 20:40:05,594 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 234 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 20:40:05,595 INFO L435 NwaCegarLoop]: 710 mSDtfsCounter, 8 mSDsluCounter, 695 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 1405 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 20:40:05,595 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 1405 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 20:40:05,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 989 states. [2025-01-09 20:40:05,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 989 to 989. [2025-01-09 20:40:05,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 989 states, 966 states have (on average 1.39648033126294) internal successors, (1349), 977 states have internal predecessors, (1349), 19 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 11 states have call predecessors, (19), 19 states have call successors, (19) [2025-01-09 20:40:05,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 989 states to 989 states and 1387 transitions. [2025-01-09 20:40:05,614 INFO L78 Accepts]: Start accepts. Automaton has 989 states and 1387 transitions. Word has length 234 [2025-01-09 20:40:05,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:40:05,614 INFO L471 AbstractCegarLoop]: Abstraction has 989 states and 1387 transitions. [2025-01-09 20:40:05,614 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 72.33333333333333) internal successors, (217), 3 states have internal predecessors, (217), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-01-09 20:40:05,615 INFO L276 IsEmpty]: Start isEmpty. Operand 989 states and 1387 transitions. [2025-01-09 20:40:05,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2025-01-09 20:40:05,616 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:40:05,616 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 20:40:05,626 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:40:05,817 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 20:40:05,821 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 20:40:05,821 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:40:05,822 INFO L85 PathProgramCache]: Analyzing trace with hash -995499998, now seen corresponding path program 1 times [2025-01-09 20:40:05,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:40:05,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [321499190] [2025-01-09 20:40:05,822 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:40:05,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:40:05,896 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 234 statements into 1 equivalence classes. [2025-01-09 20:40:05,925 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 234 of 234 statements. [2025-01-09 20:40:05,925 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:40:05,925 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:40:06,086 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:40:06,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:40:06,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [321499190] [2025-01-09 20:40:06,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [321499190] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 20:40:06,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1993029264] [2025-01-09 20:40:06,087 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:40:06,087 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 20:40:06,087 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 20:40:06,089 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:40:06,090 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:40:06,404 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 234 statements into 1 equivalence classes. [2025-01-09 20:40:06,529 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 234 of 234 statements. [2025-01-09 20:40:06,530 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:40:06,530 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:40:06,535 INFO L256 TraceCheckSpWp]: Trace formula consists of 1207 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 20:40:06,540 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 20:40:06,572 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-01-09 20:40:06,572 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 20:40:06,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1993029264] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:40:06,572 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 20:40:06,572 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2025-01-09 20:40:06,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274326535] [2025-01-09 20:40:06,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:40:06,573 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 20:40:06,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:40:06,573 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 20:40:06,573 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 20:40:06,573 INFO L87 Difference]: Start difference. First operand 989 states and 1387 transitions. Second operand has 4 states, 4 states have (on average 54.25) internal successors, (217), 4 states have internal predecessors, (217), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-01-09 20:40:06,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:40:06,634 INFO L93 Difference]: Finished difference Result 1318 states and 1877 transitions. [2025-01-09 20:40:06,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 20:40:06,634 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 54.25) internal successors, (217), 4 states have internal predecessors, (217), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 234 [2025-01-09 20:40:06,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:40:06,638 INFO L225 Difference]: With dead ends: 1318 [2025-01-09 20:40:06,638 INFO L226 Difference]: Without dead ends: 961 [2025-01-09 20:40:06,638 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 238 GetRequests, 233 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-01-09 20:40:06,639 INFO L435 NwaCegarLoop]: 703 mSDtfsCounter, 106 mSDsluCounter, 1313 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 2016 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 20:40:06,639 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 2016 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 20:40:06,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 961 states. [2025-01-09 20:40:06,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 961 to 961. [2025-01-09 20:40:06,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 961 states, 938 states have (on average 1.3933901918976546) internal successors, (1307), 949 states have internal predecessors, (1307), 19 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 11 states have call predecessors, (19), 19 states have call successors, (19) [2025-01-09 20:40:06,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 961 states to 961 states and 1345 transitions. [2025-01-09 20:40:06,695 INFO L78 Accepts]: Start accepts. Automaton has 961 states and 1345 transitions. Word has length 234 [2025-01-09 20:40:06,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:40:06,696 INFO L471 AbstractCegarLoop]: Abstraction has 961 states and 1345 transitions. [2025-01-09 20:40:06,696 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 54.25) internal successors, (217), 4 states have internal predecessors, (217), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-01-09 20:40:06,696 INFO L276 IsEmpty]: Start isEmpty. Operand 961 states and 1345 transitions. [2025-01-09 20:40:06,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2025-01-09 20:40:06,698 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:40:06,698 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 20:40:06,707 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:40:06,902 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 20:40:06,902 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 20:40:06,903 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:40:06,903 INFO L85 PathProgramCache]: Analyzing trace with hash -273213422, now seen corresponding path program 1 times [2025-01-09 20:40:06,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:40:06,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [161779958] [2025-01-09 20:40:06,903 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:40:06,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:40:06,954 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 234 statements into 1 equivalence classes. [2025-01-09 20:40:06,975 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 234 of 234 statements. [2025-01-09 20:40:06,975 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:40:06,975 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:40:07,108 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:40:07,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:40:07,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [161779958] [2025-01-09 20:40:07,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [161779958] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 20:40:07,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1688599170] [2025-01-09 20:40:07,108 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:40:07,108 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 20:40:07,108 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 20:40:07,110 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 20:40:07,112 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-09 20:40:07,414 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 234 statements into 1 equivalence classes. [2025-01-09 20:40:07,531 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 234 of 234 statements. [2025-01-09 20:40:07,531 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:40:07,531 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:40:07,536 INFO L256 TraceCheckSpWp]: Trace formula consists of 1175 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-09 20:40:07,540 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 20:40:07,571 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-01-09 20:40:07,571 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 20:40:07,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1688599170] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:40:07,571 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 20:40:07,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2025-01-09 20:40:07,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [497270601] [2025-01-09 20:40:07,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:40:07,572 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 20:40:07,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:40:07,573 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 20:40:07,573 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 20:40:07,574 INFO L87 Difference]: Start difference. First operand 961 states and 1345 transitions. Second operand has 4 states, 4 states have (on average 54.25) internal successors, (217), 4 states have internal predecessors, (217), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-01-09 20:40:07,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:40:07,625 INFO L93 Difference]: Finished difference Result 1182 states and 1653 transitions. [2025-01-09 20:40:07,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 20:40:07,626 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 54.25) internal successors, (217), 4 states have internal predecessors, (217), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 234 [2025-01-09 20:40:07,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:40:07,629 INFO L225 Difference]: With dead ends: 1182 [2025-01-09 20:40:07,629 INFO L226 Difference]: Without dead ends: 853 [2025-01-09 20:40:07,630 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 238 GetRequests, 233 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-01-09 20:40:07,631 INFO L435 NwaCegarLoop]: 628 mSDtfsCounter, 9 mSDsluCounter, 1237 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 1865 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 20:40:07,632 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 1865 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 20:40:07,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 853 states. [2025-01-09 20:40:07,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 853 to 853. [2025-01-09 20:40:07,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 853 states, 830 states have (on average 1.3674698795180722) internal successors, (1135), 841 states have internal predecessors, (1135), 19 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 11 states have call predecessors, (19), 19 states have call successors, (19) [2025-01-09 20:40:07,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 853 states to 853 states and 1173 transitions. [2025-01-09 20:40:07,651 INFO L78 Accepts]: Start accepts. Automaton has 853 states and 1173 transitions. Word has length 234 [2025-01-09 20:40:07,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:40:07,652 INFO L471 AbstractCegarLoop]: Abstraction has 853 states and 1173 transitions. [2025-01-09 20:40:07,652 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 54.25) internal successors, (217), 4 states have internal predecessors, (217), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-01-09 20:40:07,652 INFO L276 IsEmpty]: Start isEmpty. Operand 853 states and 1173 transitions. [2025-01-09 20:40:07,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2025-01-09 20:40:07,654 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:40:07,655 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 20:40:07,665 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-01-09 20:40:07,855 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 20:40:07,856 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 20:40:07,856 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:40:07,856 INFO L85 PathProgramCache]: Analyzing trace with hash 756145876, now seen corresponding path program 1 times [2025-01-09 20:40:07,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:40:07,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405046788] [2025-01-09 20:40:07,856 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:40:07,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:40:07,907 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 234 statements into 1 equivalence classes. [2025-01-09 20:40:07,935 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 234 of 234 statements. [2025-01-09 20:40:07,935 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:40:07,935 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:40:08,102 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:40:08,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:40:08,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1405046788] [2025-01-09 20:40:08,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1405046788] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 20:40:08,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1378110451] [2025-01-09 20:40:08,103 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:40:08,103 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 20:40:08,103 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 20:40:08,105 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 20:40:08,107 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-09 20:40:08,415 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 234 statements into 1 equivalence classes. [2025-01-09 20:40:08,531 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 234 of 234 statements. [2025-01-09 20:40:08,532 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:40:08,532 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:40:08,537 INFO L256 TraceCheckSpWp]: Trace formula consists of 1179 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 20:40:08,541 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 20:40:08,710 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:40:08,710 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 20:40:09,008 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:40:09,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1378110451] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 20:40:09,011 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 20:40:09,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-01-09 20:40:09,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52234524] [2025-01-09 20:40:09,011 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 20:40:09,012 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 20:40:09,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:40:09,012 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 20:40:09,013 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-01-09 20:40:09,013 INFO L87 Difference]: Start difference. First operand 853 states and 1173 transitions. Second operand has 7 states, 7 states have (on average 75.42857142857143) internal successors, (528), 7 states have internal predecessors, (528), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-01-09 20:40:09,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:40:09,215 INFO L93 Difference]: Finished difference Result 2180 states and 3005 transitions. [2025-01-09 20:40:09,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 20:40:09,216 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 75.42857142857143) internal successors, (528), 7 states have internal predecessors, (528), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 234 [2025-01-09 20:40:09,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:40:09,224 INFO L225 Difference]: With dead ends: 2180 [2025-01-09 20:40:09,224 INFO L226 Difference]: Without dead ends: 1959 [2025-01-09 20:40:09,225 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 470 GetRequests, 465 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-01-09 20:40:09,225 INFO L435 NwaCegarLoop]: 726 mSDtfsCounter, 2625 mSDsluCounter, 2352 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2656 SdHoareTripleChecker+Valid, 3078 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 20:40:09,226 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2656 Valid, 3078 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 20:40:09,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1959 states. [2025-01-09 20:40:09,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1959 to 1608. [2025-01-09 20:40:09,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1608 states, 1570 states have (on average 1.3617834394904458) internal successors, (2138), 1581 states have internal predecessors, (2138), 34 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 26 states have call predecessors, (34), 34 states have call successors, (34) [2025-01-09 20:40:09,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1608 states to 1608 states and 2206 transitions. [2025-01-09 20:40:09,263 INFO L78 Accepts]: Start accepts. Automaton has 1608 states and 2206 transitions. Word has length 234 [2025-01-09 20:40:09,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:40:09,264 INFO L471 AbstractCegarLoop]: Abstraction has 1608 states and 2206 transitions. [2025-01-09 20:40:09,265 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 75.42857142857143) internal successors, (528), 7 states have internal predecessors, (528), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-01-09 20:40:09,265 INFO L276 IsEmpty]: Start isEmpty. Operand 1608 states and 2206 transitions. [2025-01-09 20:40:09,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 667 [2025-01-09 20:40:09,274 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:40:09,274 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 20:40:09,285 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-01-09 20:40:09,475 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-01-09 20:40:09,475 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 20:40:09,476 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:40:09,477 INFO L85 PathProgramCache]: Analyzing trace with hash -1793430815, now seen corresponding path program 1 times [2025-01-09 20:40:09,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:40:09,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [641105903] [2025-01-09 20:40:09,477 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:40:09,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:40:09,710 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 666 statements into 1 equivalence classes. [2025-01-09 20:40:09,830 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 666 of 666 statements. [2025-01-09 20:40:09,831 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:40:09,831 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:40:10,564 INFO L134 CoverageAnalysis]: Checked inductivity of 880 backedges. 4 proven. 526 refuted. 0 times theorem prover too weak. 350 trivial. 0 not checked. [2025-01-09 20:40:10,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:40:10,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [641105903] [2025-01-09 20:40:10,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [641105903] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 20:40:10,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1170206441] [2025-01-09 20:40:10,565 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:40:10,565 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 20:40:10,565 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 20:40:10,569 INFO L229 MonitoredProcess]: Starting monitored process 6 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:40:10,571 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-01-09 20:40:11,114 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 666 statements into 1 equivalence classes. [2025-01-09 20:40:11,463 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 666 of 666 statements. [2025-01-09 20:40:11,463 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:40:11,463 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:40:11,479 INFO L256 TraceCheckSpWp]: Trace formula consists of 3255 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-09 20:40:11,490 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 20:40:12,005 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:40:12,005 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 20:40:12,552 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:40:12,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1170206441] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 20:40:12,552 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 20:40:12,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 16 [2025-01-09 20:40:12,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1897520673] [2025-01-09 20:40:12,553 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 20:40:12,554 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-01-09 20:40:12,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:40:12,555 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-01-09 20:40:12,555 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=166, Unknown=0, NotChecked=0, Total=240 [2025-01-09 20:40:12,556 INFO L87 Difference]: Start difference. First operand 1608 states and 2206 transitions. Second operand has 16 states, 16 states have (on average 102.6875) internal successors, (1643), 16 states have internal predecessors, (1643), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) [2025-01-09 20:40:21,027 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 20:40:22,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:40:22,674 INFO L93 Difference]: Finished difference Result 14778 states and 20405 transitions. [2025-01-09 20:40:22,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2025-01-09 20:40:22,675 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 102.6875) internal successors, (1643), 16 states have internal predecessors, (1643), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) Word has length 666 [2025-01-09 20:40:22,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:40:22,715 INFO L225 Difference]: With dead ends: 14778 [2025-01-09 20:40:22,715 INFO L226 Difference]: Without dead ends: 13798 [2025-01-09 20:40:22,720 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1390 GetRequests, 1322 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1516 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=1240, Invalid=3590, Unknown=0, NotChecked=0, Total=4830 [2025-01-09 20:40:22,721 INFO L435 NwaCegarLoop]: 1328 mSDtfsCounter, 30335 mSDsluCounter, 13208 mSDsCounter, 0 mSdLazyCounter, 2550 mSolverCounterSat, 370 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30335 SdHoareTripleChecker+Valid, 14536 SdHoareTripleChecker+Invalid, 2920 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 370 IncrementalHoareTripleChecker+Valid, 2550 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.8s IncrementalHoareTripleChecker+Time [2025-01-09 20:40:22,721 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30335 Valid, 14536 Invalid, 2920 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [370 Valid, 2550 Invalid, 0 Unknown, 0 Unchecked, 8.8s Time] [2025-01-09 20:40:22,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13798 states. [2025-01-09 20:40:22,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13798 to 9335. [2025-01-09 20:40:22,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9335 states, 9205 states have (on average 1.367191743617599) internal successors, (12585), 9221 states have internal predecessors, (12585), 126 states have call successors, (126), 2 states have call predecessors, (126), 2 states have return successors, (126), 114 states have call predecessors, (126), 126 states have call successors, (126) [2025-01-09 20:40:22,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9335 states to 9335 states and 12837 transitions. [2025-01-09 20:40:22,972 INFO L78 Accepts]: Start accepts. Automaton has 9335 states and 12837 transitions. Word has length 666 [2025-01-09 20:40:22,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:40:22,973 INFO L471 AbstractCegarLoop]: Abstraction has 9335 states and 12837 transitions. [2025-01-09 20:40:22,977 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 102.6875) internal successors, (1643), 16 states have internal predecessors, (1643), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) [2025-01-09 20:40:22,977 INFO L276 IsEmpty]: Start isEmpty. Operand 9335 states and 12837 transitions. [2025-01-09 20:40:23,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1541 [2025-01-09 20:40:23,021 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:40:23,022 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 20:40:23,036 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-01-09 20:40:23,226 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-01-09 20:40:23,226 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 20:40:23,227 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:40:23,228 INFO L85 PathProgramCache]: Analyzing trace with hash 1668827274, now seen corresponding path program 1 times [2025-01-09 20:40:23,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:40:23,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2055747127] [2025-01-09 20:40:23,228 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:40:23,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:40:23,555 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1540 statements into 1 equivalence classes.