./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-industry-pattern/check_removal_from_set_after_insertion.c --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/array-industry-pattern/check_removal_from_set_after_insertion.c -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 07a8b8b198dffd8285677bd0bfdd16b4d1f780e3a9696ef3e27a077e8ff12a49 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-08 22:13:05,473 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-08 22:13:05,515 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-08 22:13:05,521 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-08 22:13:05,521 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-08 22:13:05,537 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-08 22:13:05,538 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-08 22:13:05,538 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-08 22:13:05,538 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-08 22:13:05,538 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-08 22:13:05,539 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-08 22:13:05,539 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-08 22:13:05,539 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-08 22:13:05,539 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-08 22:13:05,539 INFO L153 SettingsManager]: * Use SBE=true [2025-01-08 22:13:05,539 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-08 22:13:05,539 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-08 22:13:05,539 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-08 22:13:05,539 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-08 22:13:05,540 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-08 22:13:05,540 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-08 22:13:05,540 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-08 22:13:05,540 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-08 22:13:05,540 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-08 22:13:05,540 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-08 22:13:05,540 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-08 22:13:05,540 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-08 22:13:05,540 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-08 22:13:05,540 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-08 22:13:05,540 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-08 22:13:05,540 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-08 22:13:05,540 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-08 22:13:05,540 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-08 22:13:05,540 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-08 22:13:05,540 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-08 22:13:05,540 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-08 22:13:05,540 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-08 22:13:05,540 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-08 22:13:05,541 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-08 22:13:05,541 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-08 22:13:05,541 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-08 22:13:05,541 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-08 22:13:05,541 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-08 22:13:05,541 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-08 22:13:05,541 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-08 22:13:05,541 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-08 22:13:05,541 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-08 22:13:05,542 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-08 22:13:05,542 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 -> 07a8b8b198dffd8285677bd0bfdd16b4d1f780e3a9696ef3e27a077e8ff12a49 [2025-01-08 22:13:05,762 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-08 22:13:05,770 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-08 22:13:05,772 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-08 22:13:05,774 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-08 22:13:05,774 INFO L274 PluginConnector]: CDTParser initialized [2025-01-08 22:13:05,776 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-industry-pattern/check_removal_from_set_after_insertion.c [2025-01-08 22:13:06,951 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c3c49bfbd/7da6fbe354e24629bd8b1bcde128bfd2/FLAGa7e6f105a [2025-01-08 22:13:07,202 INFO L384 CDTParser]: Found 1 translation units. [2025-01-08 22:13:07,203 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/array-industry-pattern/check_removal_from_set_after_insertion.c [2025-01-08 22:13:07,212 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c3c49bfbd/7da6fbe354e24629bd8b1bcde128bfd2/FLAGa7e6f105a [2025-01-08 22:13:07,227 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c3c49bfbd/7da6fbe354e24629bd8b1bcde128bfd2 [2025-01-08 22:13:07,229 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-08 22:13:07,231 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-08 22:13:07,232 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-08 22:13:07,233 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-08 22:13:07,237 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-08 22:13:07,237 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.01 10:13:07" (1/1) ... [2025-01-08 22:13:07,239 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@e4c24e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:13:07, skipping insertion in model container [2025-01-08 22:13:07,239 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.01 10:13:07" (1/1) ... [2025-01-08 22:13:07,250 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-08 22:13:07,343 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/array-industry-pattern/check_removal_from_set_after_insertion.c[342,355] [2025-01-08 22:13:07,360 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-08 22:13:07,366 INFO L200 MainTranslator]: Completed pre-run [2025-01-08 22:13:07,374 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/array-industry-pattern/check_removal_from_set_after_insertion.c[342,355] [2025-01-08 22:13:07,385 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-08 22:13:07,396 INFO L204 MainTranslator]: Completed translation [2025-01-08 22:13:07,396 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:13:07 WrapperNode [2025-01-08 22:13:07,396 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-08 22:13:07,397 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-08 22:13:07,397 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-08 22:13:07,397 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-08 22:13:07,401 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:13:07" (1/1) ... [2025-01-08 22:13:07,406 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:13:07" (1/1) ... [2025-01-08 22:13:07,416 INFO L138 Inliner]: procedures = 16, calls = 24, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 115 [2025-01-08 22:13:07,416 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-08 22:13:07,417 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-08 22:13:07,417 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-08 22:13:07,417 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-08 22:13:07,422 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:13:07" (1/1) ... [2025-01-08 22:13:07,423 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:13:07" (1/1) ... [2025-01-08 22:13:07,424 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:13:07" (1/1) ... [2025-01-08 22:13:07,433 INFO L175 MemorySlicer]: Split 12 memory accesses to 3 slices as follows [2, 7, 3]. 58 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 4 writes are split as follows [0, 3, 1]. [2025-01-08 22:13:07,433 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:13:07" (1/1) ... [2025-01-08 22:13:07,433 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:13:07" (1/1) ... [2025-01-08 22:13:07,438 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:13:07" (1/1) ... [2025-01-08 22:13:07,442 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:13:07" (1/1) ... [2025-01-08 22:13:07,449 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:13:07" (1/1) ... [2025-01-08 22:13:07,450 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:13:07" (1/1) ... [2025-01-08 22:13:07,450 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:13:07" (1/1) ... [2025-01-08 22:13:07,451 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-08 22:13:07,452 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-08 22:13:07,452 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-08 22:13:07,452 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-08 22:13:07,452 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:13:07" (1/1) ... [2025-01-08 22:13:07,456 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-08 22:13:07,464 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:13:07,474 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-08 22:13:07,477 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-08 22:13:07,501 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-08 22:13:07,502 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-08 22:13:07,502 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-08 22:13:07,502 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-08 22:13:07,502 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-01-08 22:13:07,502 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-08 22:13:07,502 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-08 22:13:07,502 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-01-08 22:13:07,502 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-08 22:13:07,502 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-08 22:13:07,503 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-08 22:13:07,503 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-08 22:13:07,503 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-01-08 22:13:07,503 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-08 22:13:07,554 INFO L234 CfgBuilder]: Building ICFG [2025-01-08 22:13:07,556 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-08 22:13:07,719 INFO L? ?]: Removed 34 outVars from TransFormulas that were not future-live. [2025-01-08 22:13:07,719 INFO L283 CfgBuilder]: Performing block encoding [2025-01-08 22:13:07,728 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-08 22:13:07,729 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-08 22:13:07,729 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.01 10:13:07 BoogieIcfgContainer [2025-01-08 22:13:07,729 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-08 22:13:07,731 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-08 22:13:07,732 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-08 22:13:07,735 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-08 22:13:07,735 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.01 10:13:07" (1/3) ... [2025-01-08 22:13:07,735 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71bc990d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.01 10:13:07, skipping insertion in model container [2025-01-08 22:13:07,735 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:13:07" (2/3) ... [2025-01-08 22:13:07,736 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71bc990d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.01 10:13:07, skipping insertion in model container [2025-01-08 22:13:07,737 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.01 10:13:07" (3/3) ... [2025-01-08 22:13:07,737 INFO L128 eAbstractionObserver]: Analyzing ICFG check_removal_from_set_after_insertion.c [2025-01-08 22:13:07,747 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-08 22:13:07,748 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG check_removal_from_set_after_insertion.c that has 1 procedures, 25 locations, 1 initial locations, 6 loop locations, and 1 error locations. [2025-01-08 22:13:07,790 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-08 22:13:07,802 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;@7d066957, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-08 22:13:07,802 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-08 22:13:07,809 INFO L276 IsEmpty]: Start isEmpty. Operand has 25 states, 23 states have (on average 1.565217391304348) internal successors, (36), 24 states have internal predecessors, (36), 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-08 22:13:07,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-01-08 22:13:07,812 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:13:07,813 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:13:07,813 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:13:07,816 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:13:07,816 INFO L85 PathProgramCache]: Analyzing trace with hash -1008704144, now seen corresponding path program 1 times [2025-01-08 22:13:07,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:13:07,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499237654] [2025-01-08 22:13:07,822 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:13:07,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:13:07,882 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-08 22:13:07,899 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-08 22:13:07,900 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:13:07,900 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:13:08,042 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-08 22:13:08,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:13:08,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499237654] [2025-01-08 22:13:08,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1499237654] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:13:08,044 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:13:08,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 22:13:08,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [264559769] [2025-01-08 22:13:08,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:13:08,048 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-08 22:13:08,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:13:08,061 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-08 22:13:08,062 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-08 22:13:08,063 INFO L87 Difference]: Start difference. First operand has 25 states, 23 states have (on average 1.565217391304348) internal successors, (36), 24 states have internal predecessors, (36), 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) Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 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-08 22:13:08,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:13:08,121 INFO L93 Difference]: Finished difference Result 56 states and 82 transitions. [2025-01-08 22:13:08,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-08 22:13:08,126 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 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 10 [2025-01-08 22:13:08,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:13:08,130 INFO L225 Difference]: With dead ends: 56 [2025-01-08 22:13:08,131 INFO L226 Difference]: Without dead ends: 30 [2025-01-08 22:13:08,133 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-08 22:13:08,135 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 42 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-08 22:13:08,137 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 38 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-08 22:13:08,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2025-01-08 22:13:08,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 22. [2025-01-08 22:13:08,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 1.4761904761904763) internal successors, (31), 21 states have internal predecessors, (31), 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-08 22:13:08,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 31 transitions. [2025-01-08 22:13:08,158 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 31 transitions. Word has length 10 [2025-01-08 22:13:08,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:13:08,159 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 31 transitions. [2025-01-08 22:13:08,159 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 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-08 22:13:08,159 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 31 transitions. [2025-01-08 22:13:08,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-01-08 22:13:08,159 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:13:08,159 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:13:08,160 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-08 22:13:08,160 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:13:08,161 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:13:08,161 INFO L85 PathProgramCache]: Analyzing trace with hash 1884419664, now seen corresponding path program 1 times [2025-01-08 22:13:08,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:13:08,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822434151] [2025-01-08 22:13:08,161 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:13:08,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:13:08,174 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-08 22:13:08,180 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-08 22:13:08,181 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:13:08,181 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:13:08,251 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-08 22:13:08,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:13:08,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [822434151] [2025-01-08 22:13:08,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [822434151] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:13:08,252 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:13:08,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 22:13:08,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533791770] [2025-01-08 22:13:08,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:13:08,253 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-08 22:13:08,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:13:08,253 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-08 22:13:08,253 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-08 22:13:08,254 INFO L87 Difference]: Start difference. First operand 22 states and 31 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 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-08 22:13:08,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:13:08,283 INFO L93 Difference]: Finished difference Result 40 states and 57 transitions. [2025-01-08 22:13:08,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-08 22:13:08,283 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 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 11 [2025-01-08 22:13:08,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:13:08,283 INFO L225 Difference]: With dead ends: 40 [2025-01-08 22:13:08,284 INFO L226 Difference]: Without dead ends: 29 [2025-01-08 22:13:08,284 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-08 22:13:08,284 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 36 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-08 22:13:08,285 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 35 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-08 22:13:08,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2025-01-08 22:13:08,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 23. [2025-01-08 22:13:08,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 22 states have (on average 1.4545454545454546) internal successors, (32), 22 states have internal predecessors, (32), 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-08 22:13:08,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 32 transitions. [2025-01-08 22:13:08,288 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 32 transitions. Word has length 11 [2025-01-08 22:13:08,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:13:08,288 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 32 transitions. [2025-01-08 22:13:08,288 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 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-08 22:13:08,288 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 32 transitions. [2025-01-08 22:13:08,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-01-08 22:13:08,289 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:13:08,289 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:13:08,289 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-08 22:13:08,289 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:13:08,289 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:13:08,289 INFO L85 PathProgramCache]: Analyzing trace with hash 2006368138, now seen corresponding path program 1 times [2025-01-08 22:13:08,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:13:08,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365699915] [2025-01-08 22:13:08,290 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:13:08,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:13:08,297 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-01-08 22:13:08,313 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-01-08 22:13:08,313 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:13:08,313 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:13:08,377 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-08 22:13:08,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:13:08,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [365699915] [2025-01-08 22:13:08,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [365699915] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:13:08,378 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:13:08,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-08 22:13:08,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [94858398] [2025-01-08 22:13:08,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:13:08,378 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-08 22:13:08,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:13:08,379 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-08 22:13:08,379 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-08 22:13:08,379 INFO L87 Difference]: Start difference. First operand 23 states and 32 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 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-08 22:13:08,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:13:08,392 INFO L93 Difference]: Finished difference Result 43 states and 61 transitions. [2025-01-08 22:13:08,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-08 22:13:08,393 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 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 16 [2025-01-08 22:13:08,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:13:08,393 INFO L225 Difference]: With dead ends: 43 [2025-01-08 22:13:08,393 INFO L226 Difference]: Without dead ends: 25 [2025-01-08 22:13:08,393 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-08 22:13:08,394 INFO L435 NwaCegarLoop]: 28 mSDtfsCounter, 0 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-08 22:13:08,394 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 79 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-08 22:13:08,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2025-01-08 22:13:08,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2025-01-08 22:13:08,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 24 states have (on average 1.4166666666666667) internal successors, (34), 24 states have internal predecessors, (34), 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-08 22:13:08,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 34 transitions. [2025-01-08 22:13:08,397 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 34 transitions. Word has length 16 [2025-01-08 22:13:08,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:13:08,397 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 34 transitions. [2025-01-08 22:13:08,397 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 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-08 22:13:08,397 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 34 transitions. [2025-01-08 22:13:08,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-01-08 22:13:08,398 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:13:08,398 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:13:08,398 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-08 22:13:08,398 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:13:08,398 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:13:08,398 INFO L85 PathProgramCache]: Analyzing trace with hash 1594597412, now seen corresponding path program 1 times [2025-01-08 22:13:08,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:13:08,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943621416] [2025-01-08 22:13:08,399 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:13:08,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:13:08,405 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-01-08 22:13:08,410 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-01-08 22:13:08,410 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:13:08,410 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:13:08,467 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-08 22:13:08,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:13:08,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1943621416] [2025-01-08 22:13:08,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1943621416] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:13:08,467 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:13:08,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-08 22:13:08,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708874379] [2025-01-08 22:13:08,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:13:08,468 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-08 22:13:08,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:13:08,468 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-08 22:13:08,468 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-08 22:13:08,468 INFO L87 Difference]: Start difference. First operand 25 states and 34 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 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-08 22:13:08,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:13:08,496 INFO L93 Difference]: Finished difference Result 48 states and 66 transitions. [2025-01-08 22:13:08,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-08 22:13:08,499 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 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 17 [2025-01-08 22:13:08,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:13:08,500 INFO L225 Difference]: With dead ends: 48 [2025-01-08 22:13:08,500 INFO L226 Difference]: Without dead ends: 28 [2025-01-08 22:13:08,500 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-08 22:13:08,500 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 3 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-08 22:13:08,501 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 75 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-08 22:13:08,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2025-01-08 22:13:08,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 26. [2025-01-08 22:13:08,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 25 states have (on average 1.4) internal successors, (35), 25 states have internal predecessors, (35), 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-08 22:13:08,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 35 transitions. [2025-01-08 22:13:08,508 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 35 transitions. Word has length 17 [2025-01-08 22:13:08,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:13:08,508 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 35 transitions. [2025-01-08 22:13:08,508 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 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-08 22:13:08,508 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 35 transitions. [2025-01-08 22:13:08,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-01-08 22:13:08,508 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:13:08,509 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:13:08,510 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-08 22:13:08,510 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:13:08,510 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:13:08,510 INFO L85 PathProgramCache]: Analyzing trace with hash -963196002, now seen corresponding path program 1 times [2025-01-08 22:13:08,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:13:08,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845930900] [2025-01-08 22:13:08,510 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:13:08,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:13:08,522 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-01-08 22:13:08,533 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-01-08 22:13:08,536 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:13:08,536 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:13:08,561 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-08 22:13:08,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:13:08,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [845930900] [2025-01-08 22:13:08,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [845930900] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:13:08,561 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:13:08,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 22:13:08,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1241303281] [2025-01-08 22:13:08,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:13:08,562 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:13:08,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:13:08,562 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:13:08,562 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:13:08,563 INFO L87 Difference]: Start difference. First operand 26 states and 35 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 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-08 22:13:08,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:13:08,586 INFO L93 Difference]: Finished difference Result 37 states and 49 transitions. [2025-01-08 22:13:08,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:13:08,588 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 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 17 [2025-01-08 22:13:08,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:13:08,588 INFO L225 Difference]: With dead ends: 37 [2025-01-08 22:13:08,589 INFO L226 Difference]: Without dead ends: 28 [2025-01-08 22:13:08,589 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-08 22:13:08,589 INFO L435 NwaCegarLoop]: 28 mSDtfsCounter, 17 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-08 22:13:08,591 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 37 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-08 22:13:08,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2025-01-08 22:13:08,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2025-01-08 22:13:08,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 27 states have (on average 1.3333333333333333) internal successors, (36), 27 states have internal predecessors, (36), 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-08 22:13:08,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 36 transitions. [2025-01-08 22:13:08,596 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 36 transitions. Word has length 17 [2025-01-08 22:13:08,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:13:08,596 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 36 transitions. [2025-01-08 22:13:08,596 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 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-08 22:13:08,596 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 36 transitions. [2025-01-08 22:13:08,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-01-08 22:13:08,596 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:13:08,597 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] [2025-01-08 22:13:08,597 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-08 22:13:08,597 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:13:08,597 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:13:08,597 INFO L85 PathProgramCache]: Analyzing trace with hash 1570750046, now seen corresponding path program 1 times [2025-01-08 22:13:08,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:13:08,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474222810] [2025-01-08 22:13:08,597 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:13:08,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:13:08,606 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-01-08 22:13:08,611 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-01-08 22:13:08,612 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:13:08,612 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:13:08,682 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-08 22:13:08,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:13:08,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1474222810] [2025-01-08 22:13:08,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1474222810] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 22:13:08,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [868968043] [2025-01-08 22:13:08,683 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:13:08,683 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:13:08,683 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:13:08,685 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-08 22:13:08,687 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-08 22:13:08,737 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-01-08 22:13:08,763 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-01-08 22:13:08,763 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:13:08,763 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:13:08,765 INFO L256 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-08 22:13:08,768 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:13:08,808 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-08 22:13:08,808 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-08 22:13:08,831 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-08 22:13:08,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [868968043] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-08 22:13:08,832 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-08 22:13:08,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2025-01-08 22:13:08,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574650821] [2025-01-08 22:13:08,832 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-08 22:13:08,832 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-08 22:13:08,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:13:08,833 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-08 22:13:08,833 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2025-01-08 22:13:08,833 INFO L87 Difference]: Start difference. First operand 28 states and 36 transitions. Second operand has 10 states, 10 states have (on average 4.1) internal successors, (41), 9 states have internal predecessors, (41), 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-08 22:13:09,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:13:09,031 INFO L93 Difference]: Finished difference Result 96 states and 127 transitions. [2025-01-08 22:13:09,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-08 22:13:09,031 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.1) internal successors, (41), 9 states have internal predecessors, (41), 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 21 [2025-01-08 22:13:09,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:13:09,032 INFO L225 Difference]: With dead ends: 96 [2025-01-08 22:13:09,032 INFO L226 Difference]: Without dead ends: 72 [2025-01-08 22:13:09,033 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=98, Invalid=142, Unknown=0, NotChecked=0, Total=240 [2025-01-08 22:13:09,033 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 88 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-08 22:13:09,033 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 54 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-08 22:13:09,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2025-01-08 22:13:09,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 39. [2025-01-08 22:13:09,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 38 states have (on average 1.2894736842105263) internal successors, (49), 38 states have internal predecessors, (49), 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-08 22:13:09,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 49 transitions. [2025-01-08 22:13:09,044 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 49 transitions. Word has length 21 [2025-01-08 22:13:09,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:13:09,044 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 49 transitions. [2025-01-08 22:13:09,045 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.1) internal successors, (41), 9 states have internal predecessors, (41), 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-08 22:13:09,045 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 49 transitions. [2025-01-08 22:13:09,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-01-08 22:13:09,045 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:13:09,045 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:13:09,051 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-08 22:13:09,250 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:13:09,250 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:13:09,250 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:13:09,251 INFO L85 PathProgramCache]: Analyzing trace with hash 782667210, now seen corresponding path program 1 times [2025-01-08 22:13:09,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:13:09,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [907926210] [2025-01-08 22:13:09,251 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:13:09,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:13:09,275 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-01-08 22:13:09,290 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-01-08 22:13:09,290 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:13:09,290 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:13:09,411 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-01-08 22:13:09,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:13:09,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [907926210] [2025-01-08 22:13:09,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [907926210] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 22:13:09,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1533175172] [2025-01-08 22:13:09,411 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:13:09,411 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:13:09,411 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:13:09,417 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-08 22:13:09,418 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-08 22:13:09,467 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-01-08 22:13:09,492 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-01-08 22:13:09,492 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:13:09,492 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:13:09,493 INFO L256 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-01-08 22:13:09,495 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:13:09,548 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-01-08 22:13:09,549 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-08 22:13:09,608 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-01-08 22:13:09,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1533175172] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-08 22:13:09,608 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-08 22:13:09,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 18 [2025-01-08 22:13:09,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [610842208] [2025-01-08 22:13:09,608 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-08 22:13:09,609 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-01-08 22:13:09,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:13:09,609 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-01-08 22:13:09,609 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=195, Unknown=0, NotChecked=0, Total=342 [2025-01-08 22:13:09,609 INFO L87 Difference]: Start difference. First operand 39 states and 49 transitions. Second operand has 19 states, 19 states have (on average 2.0) internal successors, (38), 18 states have internal predecessors, (38), 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-08 22:13:09,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:13:09,797 INFO L93 Difference]: Finished difference Result 161 states and 203 transitions. [2025-01-08 22:13:09,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-08 22:13:09,798 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.0) internal successors, (38), 18 states have internal predecessors, (38), 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 27 [2025-01-08 22:13:09,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:13:09,798 INFO L225 Difference]: With dead ends: 161 [2025-01-08 22:13:09,798 INFO L226 Difference]: Without dead ends: 129 [2025-01-08 22:13:09,799 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 157 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=222, Invalid=330, Unknown=0, NotChecked=0, Total=552 [2025-01-08 22:13:09,799 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 212 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 212 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-08 22:13:09,799 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [212 Valid, 106 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-08 22:13:09,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2025-01-08 22:13:09,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 45. [2025-01-08 22:13:09,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 44 states have (on average 1.25) internal successors, (55), 44 states have internal predecessors, (55), 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-08 22:13:09,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 55 transitions. [2025-01-08 22:13:09,806 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 55 transitions. Word has length 27 [2025-01-08 22:13:09,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:13:09,807 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 55 transitions. [2025-01-08 22:13:09,807 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.0) internal successors, (38), 18 states have internal predecessors, (38), 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-08 22:13:09,807 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 55 transitions. [2025-01-08 22:13:09,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-01-08 22:13:09,807 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:13:09,807 INFO L218 NwaCegarLoop]: trace histogram [10, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:13:09,813 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-08 22:13:10,008 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:13:10,008 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:13:10,009 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:13:10,009 INFO L85 PathProgramCache]: Analyzing trace with hash 149404106, now seen corresponding path program 2 times [2025-01-08 22:13:10,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:13:10,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [633766941] [2025-01-08 22:13:10,010 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-08 22:13:10,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:13:10,043 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 33 statements into 2 equivalence classes. [2025-01-08 22:13:10,055 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 33 of 33 statements. [2025-01-08 22:13:10,055 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-08 22:13:10,055 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:13:10,140 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2025-01-08 22:13:10,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:13:10,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [633766941] [2025-01-08 22:13:10,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [633766941] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 22:13:10,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [699679443] [2025-01-08 22:13:10,141 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-08 22:13:10,141 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:13:10,141 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:13:10,143 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-08 22:13:10,147 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-08 22:13:10,206 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 33 statements into 2 equivalence classes. [2025-01-08 22:13:10,237 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 33 of 33 statements. [2025-01-08 22:13:10,238 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-08 22:13:10,238 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:13:10,239 INFO L256 TraceCheckSpWp]: Trace formula consists of 321 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-01-08 22:13:10,240 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:13:10,390 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-01-08 22:13:10,390 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-08 22:13:10,564 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-01-08 22:13:10,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [699679443] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-08 22:13:10,564 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-08 22:13:10,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 13, 13] total 27 [2025-01-08 22:13:10,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1859711997] [2025-01-08 22:13:10,564 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-08 22:13:10,565 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-01-08 22:13:10,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:13:10,565 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-01-08 22:13:10,566 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=310, Invalid=446, Unknown=0, NotChecked=0, Total=756 [2025-01-08 22:13:10,566 INFO L87 Difference]: Start difference. First operand 45 states and 55 transitions. Second operand has 28 states, 28 states have (on average 1.9285714285714286) internal successors, (54), 27 states have internal predecessors, (54), 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-08 22:13:11,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:13:11,024 INFO L93 Difference]: Finished difference Result 306 states and 382 transitions. [2025-01-08 22:13:11,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-01-08 22:13:11,025 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 1.9285714285714286) internal successors, (54), 27 states have internal predecessors, (54), 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 33 [2025-01-08 22:13:11,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:13:11,026 INFO L225 Difference]: With dead ends: 306 [2025-01-08 22:13:11,026 INFO L226 Difference]: Without dead ends: 274 [2025-01-08 22:13:11,027 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 310 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=602, Invalid=958, Unknown=0, NotChecked=0, Total=1560 [2025-01-08 22:13:11,027 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 574 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 190 mSolverCounterSat, 120 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 574 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 310 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 120 IncrementalHoareTripleChecker+Valid, 190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-08 22:13:11,028 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [574 Valid, 136 Invalid, 310 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [120 Valid, 190 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-08 22:13:11,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2025-01-08 22:13:11,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 62. [2025-01-08 22:13:11,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 61 states have (on average 1.180327868852459) internal successors, (72), 61 states have internal predecessors, (72), 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-08 22:13:11,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 72 transitions. [2025-01-08 22:13:11,036 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 72 transitions. Word has length 33 [2025-01-08 22:13:11,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:13:11,036 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 72 transitions. [2025-01-08 22:13:11,036 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 1.9285714285714286) internal successors, (54), 27 states have internal predecessors, (54), 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-08 22:13:11,037 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 72 transitions. [2025-01-08 22:13:11,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-01-08 22:13:11,037 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:13:11,037 INFO L218 NwaCegarLoop]: trace histogram [22, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:13:11,043 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-01-08 22:13:11,242 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:13:11,242 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:13:11,242 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:13:11,242 INFO L85 PathProgramCache]: Analyzing trace with hash 1320799222, now seen corresponding path program 1 times [2025-01-08 22:13:11,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:13:11,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1287760566] [2025-01-08 22:13:11,242 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:13:11,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:13:11,265 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-01-08 22:13:11,284 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-01-08 22:13:11,284 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:13:11,284 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:13:11,946 INFO L134 CoverageAnalysis]: Checked inductivity of 267 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-01-08 22:13:11,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:13:11,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1287760566] [2025-01-08 22:13:11,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1287760566] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 22:13:11,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1988267054] [2025-01-08 22:13:11,946 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:13:11,946 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:13:11,947 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:13:11,948 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-08 22:13:11,957 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-08 22:13:12,054 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-01-08 22:13:12,102 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-01-08 22:13:12,102 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:13:12,102 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:13:12,104 INFO L256 TraceCheckSpWp]: Trace formula consists of 537 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-01-08 22:13:12,106 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:13:12,469 INFO L134 CoverageAnalysis]: Checked inductivity of 267 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-01-08 22:13:12,470 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-08 22:13:13,154 INFO L134 CoverageAnalysis]: Checked inductivity of 267 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-01-08 22:13:13,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1988267054] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-08 22:13:13,154 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-08 22:13:13,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 72 [2025-01-08 22:13:13,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1617629709] [2025-01-08 22:13:13,154 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-08 22:13:13,155 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 73 states [2025-01-08 22:13:13,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:13:13,156 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2025-01-08 22:13:13,158 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=2307, Invalid=2949, Unknown=0, NotChecked=0, Total=5256 [2025-01-08 22:13:13,158 INFO L87 Difference]: Start difference. First operand 62 states and 72 transitions. Second operand has 73 states, 73 states have (on average 1.3013698630136987) internal successors, (95), 72 states have internal predecessors, (95), 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-08 22:13:14,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:13:14,542 INFO L93 Difference]: Finished difference Result 567 states and 699 transitions. [2025-01-08 22:13:14,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2025-01-08 22:13:14,542 INFO L78 Accepts]: Start accepts. Automaton has has 73 states, 73 states have (on average 1.3013698630136987) internal successors, (95), 72 states have internal predecessors, (95), 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 51 [2025-01-08 22:13:14,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:13:14,544 INFO L225 Difference]: With dead ends: 567 [2025-01-08 22:13:14,544 INFO L226 Difference]: Without dead ends: 530 [2025-01-08 22:13:14,547 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3217 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=3480, Invalid=5640, Unknown=0, NotChecked=0, Total=9120 [2025-01-08 22:13:14,549 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 1740 mSDsluCounter, 232 mSDsCounter, 0 mSdLazyCounter, 351 mSolverCounterSat, 416 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1740 SdHoareTripleChecker+Valid, 248 SdHoareTripleChecker+Invalid, 767 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 416 IncrementalHoareTripleChecker+Valid, 351 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-08 22:13:14,549 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1740 Valid, 248 Invalid, 767 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [416 Valid, 351 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-08 22:13:14,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 530 states. [2025-01-08 22:13:14,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 530 to 86. [2025-01-08 22:13:14,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 85 states have (on average 1.1294117647058823) internal successors, (96), 85 states have internal predecessors, (96), 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-08 22:13:14,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 96 transitions. [2025-01-08 22:13:14,572 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 96 transitions. Word has length 51 [2025-01-08 22:13:14,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:13:14,573 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 96 transitions. [2025-01-08 22:13:14,573 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 73 states, 73 states have (on average 1.3013698630136987) internal successors, (95), 72 states have internal predecessors, (95), 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-08 22:13:14,573 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 96 transitions. [2025-01-08 22:13:14,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-01-08 22:13:14,574 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:13:14,574 INFO L218 NwaCegarLoop]: trace histogram [46, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:13:14,584 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-01-08 22:13:14,774 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,SelfDestructingSolverStorable8 [2025-01-08 22:13:14,775 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:13:14,776 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:13:14,776 INFO L85 PathProgramCache]: Analyzing trace with hash 1447590902, now seen corresponding path program 2 times [2025-01-08 22:13:14,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:13:14,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2092503302] [2025-01-08 22:13:14,776 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-08 22:13:14,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:13:14,836 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 75 statements into 2 equivalence classes. [2025-01-08 22:13:14,879 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 75 of 75 statements. [2025-01-08 22:13:14,879 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-08 22:13:14,879 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:13:16,769 INFO L134 CoverageAnalysis]: Checked inductivity of 1095 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-01-08 22:13:16,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:13:16,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2092503302] [2025-01-08 22:13:16,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2092503302] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 22:13:16,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [587731369] [2025-01-08 22:13:16,770 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-08 22:13:16,770 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:13:16,770 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:13:16,772 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-08 22:13:16,773 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-08 22:13:16,901 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 75 statements into 2 equivalence classes. [2025-01-08 22:13:16,979 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 75 of 75 statements. [2025-01-08 22:13:16,979 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-08 22:13:16,979 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:13:16,985 INFO L256 TraceCheckSpWp]: Trace formula consists of 897 conjuncts, 49 conjuncts are in the unsatisfiable core [2025-01-08 22:13:16,991 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:13:18,212 INFO L134 CoverageAnalysis]: Checked inductivity of 1095 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-01-08 22:13:18,213 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-08 22:13:20,501 INFO L134 CoverageAnalysis]: Checked inductivity of 1095 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-01-08 22:13:20,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [587731369] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-08 22:13:20,501 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-08 22:13:20,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49, 49] total 144 [2025-01-08 22:13:20,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1370341669] [2025-01-08 22:13:20,502 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-08 22:13:20,502 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 145 states [2025-01-08 22:13:20,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:13:20,505 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 145 interpolants. [2025-01-08 22:13:20,508 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9219, Invalid=11661, Unknown=0, NotChecked=0, Total=20880 [2025-01-08 22:13:20,509 INFO L87 Difference]: Start difference. First operand 86 states and 96 transitions. Second operand has 145 states, 145 states have (on average 1.1517241379310346) internal successors, (167), 144 states have internal predecessors, (167), 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-08 22:13:26,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:13:26,402 INFO L93 Difference]: Finished difference Result 1095 states and 1347 transitions. [2025-01-08 22:13:26,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2025-01-08 22:13:26,403 INFO L78 Accepts]: Start accepts. Automaton has has 145 states, 145 states have (on average 1.1517241379310346) internal successors, (167), 144 states have internal predecessors, (167), 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 75 [2025-01-08 22:13:26,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:13:26,413 INFO L225 Difference]: With dead ends: 1095 [2025-01-08 22:13:26,413 INFO L226 Difference]: Without dead ends: 1058 [2025-01-08 22:13:26,421 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 244 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 190 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13345 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=13872, Invalid=22800, Unknown=0, NotChecked=0, Total=36672 [2025-01-08 22:13:26,422 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 4059 mSDsluCounter, 516 mSDsCounter, 0 mSdLazyCounter, 753 mSolverCounterSat, 800 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4059 SdHoareTripleChecker+Valid, 532 SdHoareTripleChecker+Invalid, 1553 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 800 IncrementalHoareTripleChecker+Valid, 753 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-08 22:13:26,422 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4059 Valid, 532 Invalid, 1553 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [800 Valid, 753 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-08 22:13:26,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1058 states. [2025-01-08 22:13:26,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1058 to 134. [2025-01-08 22:13:26,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 133 states have (on average 1.0827067669172932) internal successors, (144), 133 states have internal predecessors, (144), 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-08 22:13:26,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 144 transitions. [2025-01-08 22:13:26,444 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 144 transitions. Word has length 75 [2025-01-08 22:13:26,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:13:26,444 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 144 transitions. [2025-01-08 22:13:26,444 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 145 states, 145 states have (on average 1.1517241379310346) internal successors, (167), 144 states have internal predecessors, (167), 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-08 22:13:26,445 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 144 transitions. [2025-01-08 22:13:26,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-01-08 22:13:26,448 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:13:26,448 INFO L218 NwaCegarLoop]: trace histogram [94, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:13:26,460 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-08 22:13:26,648 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,SelfDestructingSolverStorable9 [2025-01-08 22:13:26,649 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:13:26,653 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:13:26,653 INFO L85 PathProgramCache]: Analyzing trace with hash 1446370294, now seen corresponding path program 3 times [2025-01-08 22:13:26,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:13:26,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1108802235] [2025-01-08 22:13:26,653 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-08 22:13:26,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:13:26,752 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 123 statements into 48 equivalence classes. [2025-01-08 22:13:26,767 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 33 of 123 statements. [2025-01-08 22:13:26,767 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-01-08 22:13:26,767 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:13:26,834 INFO L134 CoverageAnalysis]: Checked inductivity of 4479 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 4472 trivial. 0 not checked. [2025-01-08 22:13:26,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:13:26,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1108802235] [2025-01-08 22:13:26,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1108802235] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 22:13:26,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [574237821] [2025-01-08 22:13:26,835 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-08 22:13:26,835 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:13:26,835 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:13:26,837 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-08 22:13:26,841 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-01-08 22:13:27,048 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 123 statements into 48 equivalence classes. [2025-01-08 22:13:27,078 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 33 of 123 statements. [2025-01-08 22:13:27,078 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-01-08 22:13:27,078 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:13:27,080 INFO L256 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-08 22:13:27,083 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:13:27,236 INFO L134 CoverageAnalysis]: Checked inductivity of 4479 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 4472 trivial. 0 not checked. [2025-01-08 22:13:27,236 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-08 22:13:27,366 INFO L134 CoverageAnalysis]: Checked inductivity of 4479 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 4472 trivial. 0 not checked. [2025-01-08 22:13:27,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [574237821] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-08 22:13:27,367 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-08 22:13:27,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7, 7] total 16 [2025-01-08 22:13:27,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1112626826] [2025-01-08 22:13:27,367 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-08 22:13:27,367 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-01-08 22:13:27,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:13:27,368 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-01-08 22:13:27,368 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=196, Unknown=0, NotChecked=0, Total=272 [2025-01-08 22:13:27,368 INFO L87 Difference]: Start difference. First operand 134 states and 144 transitions. Second operand has 17 states, 17 states have (on average 4.176470588235294) internal successors, (71), 16 states have internal predecessors, (71), 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-08 22:13:27,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:13:27,778 INFO L93 Difference]: Finished difference Result 292 states and 347 transitions. [2025-01-08 22:13:27,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-01-08 22:13:27,779 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 4.176470588235294) internal successors, (71), 16 states have internal predecessors, (71), 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 123 [2025-01-08 22:13:27,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:13:27,781 INFO L225 Difference]: With dead ends: 292 [2025-01-08 22:13:27,781 INFO L226 Difference]: Without dead ends: 271 [2025-01-08 22:13:27,781 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 271 GetRequests, 234 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 293 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=438, Invalid=1044, Unknown=0, NotChecked=0, Total=1482 [2025-01-08 22:13:27,782 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 285 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 226 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 285 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 270 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 226 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-08 22:13:27,783 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [285 Valid, 145 Invalid, 270 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 226 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-08 22:13:27,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2025-01-08 22:13:27,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 169. [2025-01-08 22:13:27,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 168 states have (on average 1.130952380952381) internal successors, (190), 168 states have internal predecessors, (190), 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-08 22:13:27,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 190 transitions. [2025-01-08 22:13:27,815 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 190 transitions. Word has length 123 [2025-01-08 22:13:27,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:13:27,815 INFO L471 AbstractCegarLoop]: Abstraction has 169 states and 190 transitions. [2025-01-08 22:13:27,816 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 4.176470588235294) internal successors, (71), 16 states have internal predecessors, (71), 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-08 22:13:27,816 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 190 transitions. [2025-01-08 22:13:27,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-01-08 22:13:27,817 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:13:27,817 INFO L218 NwaCegarLoop]: trace histogram [94, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:13:27,826 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-01-08 22:13:28,017 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-01-08 22:13:28,018 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:13:28,018 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:13:28,018 INFO L85 PathProgramCache]: Analyzing trace with hash 1380457704, now seen corresponding path program 4 times [2025-01-08 22:13:28,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:13:28,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [117897753] [2025-01-08 22:13:28,018 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-08 22:13:28,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:13:28,097 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 133 statements into 2 equivalence classes. [2025-01-08 22:13:28,102 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 32 of 133 statements. [2025-01-08 22:13:28,104 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-01-08 22:13:28,104 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:13:28,116 INFO L134 CoverageAnalysis]: Checked inductivity of 4499 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 4494 trivial. 0 not checked. [2025-01-08 22:13:28,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:13:28,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [117897753] [2025-01-08 22:13:28,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [117897753] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:13:28,116 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:13:28,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 22:13:28,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1785141815] [2025-01-08 22:13:28,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:13:28,117 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:13:28,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:13:28,117 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:13:28,117 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:13:28,117 INFO L87 Difference]: Start difference. First operand 169 states and 190 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 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-08 22:13:28,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:13:28,145 INFO L93 Difference]: Finished difference Result 205 states and 237 transitions. [2025-01-08 22:13:28,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:13:28,146 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 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 133 [2025-01-08 22:13:28,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:13:28,147 INFO L225 Difference]: With dead ends: 205 [2025-01-08 22:13:28,147 INFO L226 Difference]: Without dead ends: 169 [2025-01-08 22:13:28,147 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-08 22:13:28,148 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 4 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-08 22:13:28,148 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 47 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-08 22:13:28,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2025-01-08 22:13:28,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 163. [2025-01-08 22:13:28,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 162 states have (on average 1.0987654320987654) internal successors, (178), 162 states have internal predecessors, (178), 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-08 22:13:28,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 178 transitions. [2025-01-08 22:13:28,168 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 178 transitions. Word has length 133 [2025-01-08 22:13:28,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:13:28,169 INFO L471 AbstractCegarLoop]: Abstraction has 163 states and 178 transitions. [2025-01-08 22:13:28,169 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 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-08 22:13:28,169 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 178 transitions. [2025-01-08 22:13:28,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-01-08 22:13:28,171 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:13:28,171 INFO L218 NwaCegarLoop]: trace histogram [94, 4, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:13:28,171 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-08 22:13:28,171 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:13:28,172 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:13:28,172 INFO L85 PathProgramCache]: Analyzing trace with hash 359389350, now seen corresponding path program 1 times [2025-01-08 22:13:28,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:13:28,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [746177880] [2025-01-08 22:13:28,172 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:13:28,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:13:28,256 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-01-08 22:13:28,322 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-01-08 22:13:28,322 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:13:28,322 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:13:33,367 INFO L134 CoverageAnalysis]: Checked inductivity of 4499 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-01-08 22:13:33,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:13:33,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [746177880] [2025-01-08 22:13:33,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [746177880] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 22:13:33,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [385333810] [2025-01-08 22:13:33,368 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:13:33,368 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:13:33,368 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:13:33,370 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-08 22:13:33,372 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-01-08 22:13:33,638 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-01-08 22:13:33,806 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-01-08 22:13:33,807 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:13:33,807 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:13:33,820 INFO L256 TraceCheckSpWp]: Trace formula consists of 1667 conjuncts, 97 conjuncts are in the unsatisfiable core [2025-01-08 22:13:33,826 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:13:37,010 INFO L134 CoverageAnalysis]: Checked inductivity of 4499 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-01-08 22:13:37,011 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-08 22:13:44,759 INFO L134 CoverageAnalysis]: Checked inductivity of 4499 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-01-08 22:13:44,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [385333810] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-08 22:13:44,760 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-08 22:13:44,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [97, 97, 97] total 288 [2025-01-08 22:13:44,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1448624417] [2025-01-08 22:13:44,760 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-08 22:13:44,760 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 289 states [2025-01-08 22:13:44,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:13:44,767 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 289 interpolants. [2025-01-08 22:13:44,771 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36867, Invalid=46365, Unknown=0, NotChecked=0, Total=83232 [2025-01-08 22:13:44,772 INFO L87 Difference]: Start difference. First operand 163 states and 178 transitions. Second operand has 289 states, 289 states have (on average 1.0795847750865053) internal successors, (312), 288 states have internal predecessors, (312), 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-08 22:14:33,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:14:33,122 INFO L93 Difference]: Finished difference Result 2196 states and 2506 transitions. [2025-01-08 22:14:33,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 193 states. [2025-01-08 22:14:33,122 INFO L78 Accepts]: Start accepts. Automaton has has 289 states, 289 states have (on average 1.0795847750865053) internal successors, (312), 288 states have internal predecessors, (312), 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 133 [2025-01-08 22:14:33,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:14:33,128 INFO L225 Difference]: With dead ends: 2196 [2025-01-08 22:14:33,128 INFO L226 Difference]: Without dead ends: 2130 [2025-01-08 22:14:33,132 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 456 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 382 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54337 ImplicationChecksByTransitivity, 20.5s TimeCoverageRelationStatistics Valid=55392, Invalid=91680, Unknown=0, NotChecked=0, Total=147072 [2025-01-08 22:14:33,133 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 9503 mSDsluCounter, 987 mSDsCounter, 0 mSdLazyCounter, 1465 mSolverCounterSat, 2390 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9503 SdHoareTripleChecker+Valid, 1003 SdHoareTripleChecker+Invalid, 3855 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2390 IncrementalHoareTripleChecker+Valid, 1465 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-01-08 22:14:33,133 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9503 Valid, 1003 Invalid, 3855 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2390 Valid, 1465 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-01-08 22:14:33,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2130 states. [2025-01-08 22:14:33,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2130 to 259. [2025-01-08 22:14:33,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 259 states, 258 states have (on average 1.062015503875969) internal successors, (274), 258 states have internal predecessors, (274), 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-08 22:14:33,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 274 transitions. [2025-01-08 22:14:33,168 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 274 transitions. Word has length 133 [2025-01-08 22:14:33,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:14:33,169 INFO L471 AbstractCegarLoop]: Abstraction has 259 states and 274 transitions. [2025-01-08 22:14:33,169 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 289 states, 289 states have (on average 1.0795847750865053) internal successors, (312), 288 states have internal predecessors, (312), 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-08 22:14:33,169 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 274 transitions. [2025-01-08 22:14:33,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2025-01-08 22:14:33,170 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:14:33,170 INFO L218 NwaCegarLoop]: trace histogram [190, 4, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:14:33,179 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-01-08 22:14:33,375 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:14:33,375 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:14:33,375 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:14:33,375 INFO L85 PathProgramCache]: Analyzing trace with hash 102144166, now seen corresponding path program 2 times [2025-01-08 22:14:33,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:14:33,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [102022977] [2025-01-08 22:14:33,375 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-08 22:14:33,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:14:33,463 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 229 statements into 2 equivalence classes. [2025-01-08 22:14:33,604 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 229 of 229 statements. [2025-01-08 22:14:33,605 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-08 22:14:33,605 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat