./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.1.ufo.BOUNDED-6.pals.c.v+cfa-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc 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/seq-mthreaded-reduced/pals_lcr.3.1.ufo.BOUNDED-6.pals.c.v+cfa-reducer.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 afac0863a681e4712e7bffaf04a415cd693c6153e1fe439605f11a4c250fdcc1 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 16:38:01,818 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 16:38:01,898 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 16:38:01,903 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 16:38:01,905 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 16:38:01,934 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 16:38:01,935 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 16:38:01,936 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 16:38:01,936 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 16:38:01,936 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 16:38:01,937 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 16:38:01,937 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 16:38:01,938 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 16:38:01,938 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 16:38:01,938 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 16:38:01,938 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 16:38:01,939 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 16:38:01,939 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 16:38:01,939 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 16:38:01,939 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 16:38:01,939 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 16:38:01,939 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 16:38:01,939 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 16:38:01,939 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 16:38:01,940 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 16:38:01,940 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 16:38:01,940 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 16:38:01,940 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 16:38:01,940 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 16:38:01,940 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 16:38:01,940 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 16:38:01,940 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 16:38:01,940 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 16:38:01,940 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 16:38:01,941 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 16:38:01,941 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 16:38:01,941 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 16:38:01,941 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 16:38:01,941 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 16:38:01,941 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 16:38:01,941 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 16:38:01,941 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 16:38:01,941 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 16:38:01,941 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 -> afac0863a681e4712e7bffaf04a415cd693c6153e1fe439605f11a4c250fdcc1 [2025-02-05 16:38:02,243 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 16:38:02,254 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 16:38:02,257 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 16:38:02,258 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 16:38:02,258 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 16:38:02,259 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.1.ufo.BOUNDED-6.pals.c.v+cfa-reducer.c [2025-02-05 16:38:03,636 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/01d828088/6445999b6bfe422cbc3b02a44bfb3389/FLAGc82b410d5 [2025-02-05 16:38:03,977 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 16:38:03,978 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.1.ufo.BOUNDED-6.pals.c.v+cfa-reducer.c [2025-02-05 16:38:03,990 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/01d828088/6445999b6bfe422cbc3b02a44bfb3389/FLAGc82b410d5 [2025-02-05 16:38:04,019 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/01d828088/6445999b6bfe422cbc3b02a44bfb3389 [2025-02-05 16:38:04,022 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 16:38:04,024 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 16:38:04,026 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 16:38:04,026 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 16:38:04,030 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 16:38:04,031 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 04:38:04" (1/1) ... [2025-02-05 16:38:04,033 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7fca40fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:38:04, skipping insertion in model container [2025-02-05 16:38:04,034 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 04:38:04" (1/1) ... [2025-02-05 16:38:04,058 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 16:38:04,232 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/seq-mthreaded-reduced/pals_lcr.3.1.ufo.BOUNDED-6.pals.c.v+cfa-reducer.c[4069,4082] [2025-02-05 16:38:04,247 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 16:38:04,259 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 16:38:04,299 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/seq-mthreaded-reduced/pals_lcr.3.1.ufo.BOUNDED-6.pals.c.v+cfa-reducer.c[4069,4082] [2025-02-05 16:38:04,308 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 16:38:04,325 INFO L204 MainTranslator]: Completed translation [2025-02-05 16:38:04,326 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:38:04 WrapperNode [2025-02-05 16:38:04,326 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 16:38:04,328 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 16:38:04,328 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 16:38:04,328 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 16:38:04,336 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:38:04" (1/1) ... [2025-02-05 16:38:04,349 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:38:04" (1/1) ... [2025-02-05 16:38:04,386 INFO L138 Inliner]: procedures = 22, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 296 [2025-02-05 16:38:04,391 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 16:38:04,391 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 16:38:04,391 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 16:38:04,391 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 16:38:04,399 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:38:04" (1/1) ... [2025-02-05 16:38:04,399 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:38:04" (1/1) ... [2025-02-05 16:38:04,401 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:38:04" (1/1) ... [2025-02-05 16:38:04,420 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-02-05 16:38:04,423 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:38:04" (1/1) ... [2025-02-05 16:38:04,423 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:38:04" (1/1) ... [2025-02-05 16:38:04,432 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:38:04" (1/1) ... [2025-02-05 16:38:04,437 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:38:04" (1/1) ... [2025-02-05 16:38:04,438 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:38:04" (1/1) ... [2025-02-05 16:38:04,439 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:38:04" (1/1) ... [2025-02-05 16:38:04,445 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 16:38:04,446 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 16:38:04,446 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 16:38:04,446 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 16:38:04,450 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:38:04" (1/1) ... [2025-02-05 16:38:04,456 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 16:38:04,468 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 16:38:04,483 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-02-05 16:38:04,487 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-02-05 16:38:04,511 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 16:38:04,511 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 16:38:04,511 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 16:38:04,511 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 16:38:04,614 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 16:38:04,616 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 16:38:04,991 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L308: havoc main_~node2____CPAchecker_TMP_0~0#1; [2025-02-05 16:38:04,992 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L203: havoc main_~main____CPAchecker_TMP_0~0#1;havoc main_~__tmp_1~0#1, main_~assert__arg~0#1;havoc main_~check__tmp~0#1; [2025-02-05 16:38:04,992 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L263: havoc main_~node3____CPAchecker_TMP_0~0#1; [2025-02-05 16:38:04,992 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L354: havoc main_~node1____CPAchecker_TMP_0~0#1; [2025-02-05 16:38:04,992 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L156: havoc main_~node3__m3~0#1; [2025-02-05 16:38:04,992 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L141: havoc main_~node2__m2~0#1; [2025-02-05 16:38:04,992 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L125: havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2025-02-05 16:38:05,019 INFO L? ?]: Removed 30 outVars from TransFormulas that were not future-live. [2025-02-05 16:38:05,019 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 16:38:05,030 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 16:38:05,031 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 16:38:05,031 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 04:38:05 BoogieIcfgContainer [2025-02-05 16:38:05,031 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 16:38:05,033 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 16:38:05,033 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 16:38:05,037 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 16:38:05,037 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 04:38:04" (1/3) ... [2025-02-05 16:38:05,038 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f536dd5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 04:38:05, skipping insertion in model container [2025-02-05 16:38:05,038 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:38:04" (2/3) ... [2025-02-05 16:38:05,038 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f536dd5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 04:38:05, skipping insertion in model container [2025-02-05 16:38:05,038 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 04:38:05" (3/3) ... [2025-02-05 16:38:05,039 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr.3.1.ufo.BOUNDED-6.pals.c.v+cfa-reducer.c [2025-02-05 16:38:05,052 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 16:38:05,053 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_lcr.3.1.ufo.BOUNDED-6.pals.c.v+cfa-reducer.c that has 1 procedures, 62 locations, 1 initial locations, 0 loop locations, and 1 error locations. [2025-02-05 16:38:05,105 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 16:38:05,120 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;@7d6cc9c9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 16:38:05,121 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 16:38:05,125 INFO L276 IsEmpty]: Start isEmpty. Operand has 62 states, 60 states have (on average 1.7166666666666666) internal successors, (103), 61 states have internal predecessors, (103), 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-02-05 16:38:05,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-02-05 16:38:05,132 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:38:05,133 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:38:05,133 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:38:05,138 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:38:05,139 INFO L85 PathProgramCache]: Analyzing trace with hash -1946824725, now seen corresponding path program 1 times [2025-02-05 16:38:05,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:38:05,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1627888295] [2025-02-05 16:38:05,150 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:38:05,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:38:05,235 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-02-05 16:38:05,290 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-02-05 16:38:05,290 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:38:05,291 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:38:05,473 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:38:05,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:38:05,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1627888295] [2025-02-05 16:38:05,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1627888295] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:38:05,479 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:38:05,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:38:05,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2142294701] [2025-02-05 16:38:05,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:38:05,484 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:38:05,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:38:05,503 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:38:05,504 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:38:05,507 INFO L87 Difference]: Start difference. First operand has 62 states, 60 states have (on average 1.7166666666666666) internal successors, (103), 61 states have internal predecessors, (103), 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 3 states, 3 states have (on average 12.0) internal successors, (36), 3 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-02-05 16:38:05,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:38:05,553 INFO L93 Difference]: Finished difference Result 140 states and 224 transitions. [2025-02-05 16:38:05,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:38:05,555 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 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) Word has length 36 [2025-02-05 16:38:05,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:38:05,564 INFO L225 Difference]: With dead ends: 140 [2025-02-05 16:38:05,564 INFO L226 Difference]: Without dead ends: 91 [2025-02-05 16:38:05,571 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-02-05 16:38:05,574 INFO L435 NwaCegarLoop]: 150 mSDtfsCounter, 68 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 215 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:38:05,576 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 215 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:38:05,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2025-02-05 16:38:05,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 89. [2025-02-05 16:38:05,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 88 states have (on average 1.4772727272727273) internal successors, (130), 88 states have internal predecessors, (130), 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-02-05 16:38:05,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 130 transitions. [2025-02-05 16:38:05,611 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 130 transitions. Word has length 36 [2025-02-05 16:38:05,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:38:05,611 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 130 transitions. [2025-02-05 16:38:05,611 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 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-02-05 16:38:05,611 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 130 transitions. [2025-02-05 16:38:05,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-02-05 16:38:05,612 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:38:05,612 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:38:05,613 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 16:38:05,613 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:38:05,614 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:38:05,614 INFO L85 PathProgramCache]: Analyzing trace with hash 488759384, now seen corresponding path program 1 times [2025-02-05 16:38:05,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:38:05,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817890024] [2025-02-05 16:38:05,614 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:38:05,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:38:05,659 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-02-05 16:38:05,680 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-02-05 16:38:05,680 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:38:05,680 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:38:05,790 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:38:05,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:38:05,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1817890024] [2025-02-05 16:38:05,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1817890024] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:38:05,790 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:38:05,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:38:05,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1919942675] [2025-02-05 16:38:05,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:38:05,792 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:38:05,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:38:05,792 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:38:05,793 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:38:05,793 INFO L87 Difference]: Start difference. First operand 89 states and 130 transitions. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 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-02-05 16:38:05,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:38:05,818 INFO L93 Difference]: Finished difference Result 213 states and 326 transitions. [2025-02-05 16:38:05,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:38:05,819 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 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 37 [2025-02-05 16:38:05,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:38:05,820 INFO L225 Difference]: With dead ends: 213 [2025-02-05 16:38:05,820 INFO L226 Difference]: Without dead ends: 143 [2025-02-05 16:38:05,821 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-02-05 16:38:05,821 INFO L435 NwaCegarLoop]: 120 mSDtfsCounter, 48 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:38:05,823 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 182 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:38:05,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2025-02-05 16:38:05,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 141. [2025-02-05 16:38:05,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 140 states have (on average 1.5142857142857142) internal successors, (212), 140 states have internal predecessors, (212), 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-02-05 16:38:05,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 212 transitions. [2025-02-05 16:38:05,837 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 212 transitions. Word has length 37 [2025-02-05 16:38:05,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:38:05,837 INFO L471 AbstractCegarLoop]: Abstraction has 141 states and 212 transitions. [2025-02-05 16:38:05,837 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 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-02-05 16:38:05,837 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 212 transitions. [2025-02-05 16:38:05,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-02-05 16:38:05,838 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:38:05,838 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:38:05,838 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 16:38:05,838 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:38:05,839 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:38:05,839 INFO L85 PathProgramCache]: Analyzing trace with hash -851060552, now seen corresponding path program 1 times [2025-02-05 16:38:05,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:38:05,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251749110] [2025-02-05 16:38:05,839 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:38:05,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:38:05,864 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-02-05 16:38:05,880 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-02-05 16:38:05,880 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:38:05,880 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:38:05,966 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:38:05,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:38:05,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251749110] [2025-02-05 16:38:05,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1251749110] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:38:05,967 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:38:05,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:38:05,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18337350] [2025-02-05 16:38:05,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:38:05,968 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:38:05,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:38:05,968 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:38:05,968 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:38:05,969 INFO L87 Difference]: Start difference. First operand 141 states and 212 transitions. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 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-02-05 16:38:05,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:38:05,996 INFO L93 Difference]: Finished difference Result 353 states and 546 transitions. [2025-02-05 16:38:05,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:38:05,997 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 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 38 [2025-02-05 16:38:05,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:38:05,998 INFO L225 Difference]: With dead ends: 353 [2025-02-05 16:38:05,998 INFO L226 Difference]: Without dead ends: 231 [2025-02-05 16:38:05,999 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-02-05 16:38:06,004 INFO L435 NwaCegarLoop]: 112 mSDtfsCounter, 43 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:38:06,004 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 178 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:38:06,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2025-02-05 16:38:06,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 229. [2025-02-05 16:38:06,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 228 states have (on average 1.5263157894736843) internal successors, (348), 228 states have internal predecessors, (348), 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-02-05 16:38:06,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 348 transitions. [2025-02-05 16:38:06,030 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 348 transitions. Word has length 38 [2025-02-05 16:38:06,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:38:06,030 INFO L471 AbstractCegarLoop]: Abstraction has 229 states and 348 transitions. [2025-02-05 16:38:06,030 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 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-02-05 16:38:06,030 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 348 transitions. [2025-02-05 16:38:06,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-02-05 16:38:06,031 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:38:06,031 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:38:06,031 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 16:38:06,031 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:38:06,034 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:38:06,034 INFO L85 PathProgramCache]: Analyzing trace with hash 1172145669, now seen corresponding path program 1 times [2025-02-05 16:38:06,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:38:06,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508348978] [2025-02-05 16:38:06,034 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:38:06,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:38:06,055 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-02-05 16:38:06,082 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-02-05 16:38:06,082 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:38:06,082 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:38:06,203 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:38:06,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:38:06,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [508348978] [2025-02-05 16:38:06,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [508348978] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:38:06,204 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:38:06,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 16:38:06,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [546753477] [2025-02-05 16:38:06,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:38:06,205 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 16:38:06,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:38:06,206 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 16:38:06,206 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:38:06,206 INFO L87 Difference]: Start difference. First operand 229 states and 348 transitions. Second operand has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 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-02-05 16:38:06,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:38:06,370 INFO L93 Difference]: Finished difference Result 1489 states and 2322 transitions. [2025-02-05 16:38:06,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 16:38:06,373 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 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 39 [2025-02-05 16:38:06,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:38:06,382 INFO L225 Difference]: With dead ends: 1489 [2025-02-05 16:38:06,382 INFO L226 Difference]: Without dead ends: 1279 [2025-02-05 16:38:06,383 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-02-05 16:38:06,384 INFO L435 NwaCegarLoop]: 78 mSDtfsCounter, 374 mSDsluCounter, 457 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 374 SdHoareTripleChecker+Valid, 535 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:38:06,384 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [374 Valid, 535 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:38:06,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1279 states. [2025-02-05 16:38:06,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1279 to 437. [2025-02-05 16:38:06,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 437 states, 436 states have (on average 1.5137614678899083) internal successors, (660), 436 states have internal predecessors, (660), 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-02-05 16:38:06,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 437 states to 437 states and 660 transitions. [2025-02-05 16:38:06,458 INFO L78 Accepts]: Start accepts. Automaton has 437 states and 660 transitions. Word has length 39 [2025-02-05 16:38:06,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:38:06,459 INFO L471 AbstractCegarLoop]: Abstraction has 437 states and 660 transitions. [2025-02-05 16:38:06,459 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 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-02-05 16:38:06,459 INFO L276 IsEmpty]: Start isEmpty. Operand 437 states and 660 transitions. [2025-02-05 16:38:06,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-02-05 16:38:06,462 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:38:06,462 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:38:06,463 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 16:38:06,463 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:38:06,465 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:38:06,465 INFO L85 PathProgramCache]: Analyzing trace with hash 1189439790, now seen corresponding path program 1 times [2025-02-05 16:38:06,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:38:06,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [213812288] [2025-02-05 16:38:06,466 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:38:06,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:38:06,486 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-02-05 16:38:06,501 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-02-05 16:38:06,501 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:38:06,501 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:38:06,585 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:38:06,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:38:06,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [213812288] [2025-02-05 16:38:06,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [213812288] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:38:06,585 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:38:06,585 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:38:06,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [380728620] [2025-02-05 16:38:06,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:38:06,587 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:38:06,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:38:06,588 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:38:06,588 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:38:06,588 INFO L87 Difference]: Start difference. First operand 437 states and 660 transitions. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 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-02-05 16:38:06,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:38:06,617 INFO L93 Difference]: Finished difference Result 1055 states and 1604 transitions. [2025-02-05 16:38:06,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:38:06,618 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 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 41 [2025-02-05 16:38:06,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:38:06,620 INFO L225 Difference]: With dead ends: 1055 [2025-02-05 16:38:06,620 INFO L226 Difference]: Without dead ends: 637 [2025-02-05 16:38:06,621 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-02-05 16:38:06,625 INFO L435 NwaCegarLoop]: 96 mSDtfsCounter, 34 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:38:06,626 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 154 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:38:06,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 637 states. [2025-02-05 16:38:06,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 637 to 635. [2025-02-05 16:38:06,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 635 states, 634 states have (on average 1.498422712933754) internal successors, (950), 634 states have internal predecessors, (950), 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-02-05 16:38:06,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 635 states to 635 states and 950 transitions. [2025-02-05 16:38:06,648 INFO L78 Accepts]: Start accepts. Automaton has 635 states and 950 transitions. Word has length 41 [2025-02-05 16:38:06,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:38:06,648 INFO L471 AbstractCegarLoop]: Abstraction has 635 states and 950 transitions. [2025-02-05 16:38:06,648 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 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-02-05 16:38:06,649 INFO L276 IsEmpty]: Start isEmpty. Operand 635 states and 950 transitions. [2025-02-05 16:38:06,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-02-05 16:38:06,650 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:38:06,650 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:38:06,650 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 16:38:06,650 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:38:06,651 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:38:06,651 INFO L85 PathProgramCache]: Analyzing trace with hash 1190601639, now seen corresponding path program 1 times [2025-02-05 16:38:06,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:38:06,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1345110052] [2025-02-05 16:38:06,653 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:38:06,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:38:06,671 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-02-05 16:38:06,680 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-02-05 16:38:06,681 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:38:06,681 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:38:06,870 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:38:06,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:38:06,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1345110052] [2025-02-05 16:38:06,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1345110052] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:38:06,872 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:38:06,872 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 16:38:06,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1271005294] [2025-02-05 16:38:06,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:38:06,873 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 16:38:06,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:38:06,873 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 16:38:06,873 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:38:06,873 INFO L87 Difference]: Start difference. First operand 635 states and 950 transitions. Second operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 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-02-05 16:38:06,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:38:06,950 INFO L93 Difference]: Finished difference Result 1251 states and 1880 transitions. [2025-02-05 16:38:06,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 16:38:06,951 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 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 41 [2025-02-05 16:38:06,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:38:06,967 INFO L225 Difference]: With dead ends: 1251 [2025-02-05 16:38:06,967 INFO L226 Difference]: Without dead ends: 637 [2025-02-05 16:38:06,968 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-02-05 16:38:06,968 INFO L435 NwaCegarLoop]: 77 mSDtfsCounter, 82 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:38:06,969 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 195 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:38:06,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 637 states. [2025-02-05 16:38:06,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 637 to 635. [2025-02-05 16:38:06,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 635 states, 634 states have (on average 1.4794952681388012) internal successors, (938), 634 states have internal predecessors, (938), 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-02-05 16:38:06,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 635 states to 635 states and 938 transitions. [2025-02-05 16:38:06,984 INFO L78 Accepts]: Start accepts. Automaton has 635 states and 938 transitions. Word has length 41 [2025-02-05 16:38:06,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:38:06,984 INFO L471 AbstractCegarLoop]: Abstraction has 635 states and 938 transitions. [2025-02-05 16:38:06,984 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 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-02-05 16:38:06,984 INFO L276 IsEmpty]: Start isEmpty. Operand 635 states and 938 transitions. [2025-02-05 16:38:06,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-02-05 16:38:06,986 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:38:06,986 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:38:06,986 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 16:38:06,986 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:38:06,986 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:38:06,987 INFO L85 PathProgramCache]: Analyzing trace with hash -1745099488, now seen corresponding path program 1 times [2025-02-05 16:38:06,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:38:06,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [898962289] [2025-02-05 16:38:06,987 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:38:06,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:38:06,998 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-02-05 16:38:07,016 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-02-05 16:38:07,017 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:38:07,017 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:38:07,268 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:38:07,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:38:07,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [898962289] [2025-02-05 16:38:07,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [898962289] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:38:07,268 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:38:07,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 16:38:07,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730513195] [2025-02-05 16:38:07,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:38:07,269 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 16:38:07,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:38:07,269 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 16:38:07,269 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:38:07,270 INFO L87 Difference]: Start difference. First operand 635 states and 938 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 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-02-05 16:38:07,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:38:07,304 INFO L93 Difference]: Finished difference Result 669 states and 987 transitions. [2025-02-05 16:38:07,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 16:38:07,305 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 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 42 [2025-02-05 16:38:07,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:38:07,307 INFO L225 Difference]: With dead ends: 669 [2025-02-05 16:38:07,308 INFO L226 Difference]: Without dead ends: 667 [2025-02-05 16:38:07,308 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:38:07,309 INFO L435 NwaCegarLoop]: 79 mSDtfsCounter, 0 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 304 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:38:07,309 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 304 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:38:07,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 667 states. [2025-02-05 16:38:07,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 667 to 667. [2025-02-05 16:38:07,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 667 states, 666 states have (on average 1.4504504504504505) internal successors, (966), 666 states have internal predecessors, (966), 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-02-05 16:38:07,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 667 states to 667 states and 966 transitions. [2025-02-05 16:38:07,333 INFO L78 Accepts]: Start accepts. Automaton has 667 states and 966 transitions. Word has length 42 [2025-02-05 16:38:07,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:38:07,333 INFO L471 AbstractCegarLoop]: Abstraction has 667 states and 966 transitions. [2025-02-05 16:38:07,334 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 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-02-05 16:38:07,334 INFO L276 IsEmpty]: Start isEmpty. Operand 667 states and 966 transitions. [2025-02-05 16:38:07,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-02-05 16:38:07,338 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:38:07,339 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:38:07,339 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 16:38:07,339 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:38:07,339 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:38:07,339 INFO L85 PathProgramCache]: Analyzing trace with hash 208880481, now seen corresponding path program 1 times [2025-02-05 16:38:07,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:38:07,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486790912] [2025-02-05 16:38:07,340 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:38:07,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:38:07,382 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-02-05 16:38:07,392 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-02-05 16:38:07,393 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:38:07,393 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:38:07,505 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-05 16:38:07,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:38:07,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1486790912] [2025-02-05 16:38:07,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1486790912] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:38:07,506 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:38:07,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 16:38:07,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [822734874] [2025-02-05 16:38:07,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:38:07,506 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 16:38:07,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:38:07,507 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 16:38:07,507 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:38:07,507 INFO L87 Difference]: Start difference. First operand 667 states and 966 transitions. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 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-02-05 16:38:07,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:38:07,602 INFO L93 Difference]: Finished difference Result 2539 states and 3698 transitions. [2025-02-05 16:38:07,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 16:38:07,602 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2025-02-05 16:38:07,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:38:07,615 INFO L225 Difference]: With dead ends: 2539 [2025-02-05 16:38:07,615 INFO L226 Difference]: Without dead ends: 2089 [2025-02-05 16:38:07,617 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-02-05 16:38:07,618 INFO L435 NwaCegarLoop]: 138 mSDtfsCounter, 209 mSDsluCounter, 247 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 209 SdHoareTripleChecker+Valid, 385 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:38:07,618 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [209 Valid, 385 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:38:07,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2089 states. [2025-02-05 16:38:07,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2089 to 1215. [2025-02-05 16:38:07,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1215 states, 1214 states have (on average 1.4481054365733115) internal successors, (1758), 1214 states have internal predecessors, (1758), 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-02-05 16:38:07,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1215 states to 1215 states and 1758 transitions. [2025-02-05 16:38:07,665 INFO L78 Accepts]: Start accepts. Automaton has 1215 states and 1758 transitions. Word has length 60 [2025-02-05 16:38:07,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:38:07,666 INFO L471 AbstractCegarLoop]: Abstraction has 1215 states and 1758 transitions. [2025-02-05 16:38:07,666 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 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-02-05 16:38:07,666 INFO L276 IsEmpty]: Start isEmpty. Operand 1215 states and 1758 transitions. [2025-02-05 16:38:07,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-02-05 16:38:07,667 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:38:07,667 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:38:07,667 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 16:38:07,667 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:38:07,668 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:38:07,668 INFO L85 PathProgramCache]: Analyzing trace with hash -1934366975, now seen corresponding path program 1 times [2025-02-05 16:38:07,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:38:07,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612915104] [2025-02-05 16:38:07,668 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:38:07,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:38:07,694 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-02-05 16:38:07,712 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-02-05 16:38:07,713 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:38:07,713 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:38:07,843 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-05 16:38:07,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:38:07,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1612915104] [2025-02-05 16:38:07,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1612915104] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:38:07,846 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:38:07,846 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 16:38:07,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [381231148] [2025-02-05 16:38:07,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:38:07,846 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 16:38:07,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:38:07,847 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 16:38:07,847 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:38:07,847 INFO L87 Difference]: Start difference. First operand 1215 states and 1758 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 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-02-05 16:38:07,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:38:07,937 INFO L93 Difference]: Finished difference Result 3183 states and 4634 transitions. [2025-02-05 16:38:07,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 16:38:07,938 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2025-02-05 16:38:07,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:38:07,948 INFO L225 Difference]: With dead ends: 3183 [2025-02-05 16:38:07,948 INFO L226 Difference]: Without dead ends: 2537 [2025-02-05 16:38:07,951 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-02-05 16:38:07,951 INFO L435 NwaCegarLoop]: 137 mSDtfsCounter, 210 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 210 SdHoareTripleChecker+Valid, 366 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:38:07,951 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [210 Valid, 366 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:38:07,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2537 states. [2025-02-05 16:38:07,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2537 to 2083. [2025-02-05 16:38:08,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2083 states, 2082 states have (on average 1.445725264169068) internal successors, (3010), 2082 states have internal predecessors, (3010), 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-02-05 16:38:08,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2083 states to 2083 states and 3010 transitions. [2025-02-05 16:38:08,012 INFO L78 Accepts]: Start accepts. Automaton has 2083 states and 3010 transitions. Word has length 60 [2025-02-05 16:38:08,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:38:08,012 INFO L471 AbstractCegarLoop]: Abstraction has 2083 states and 3010 transitions. [2025-02-05 16:38:08,013 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 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-02-05 16:38:08,013 INFO L276 IsEmpty]: Start isEmpty. Operand 2083 states and 3010 transitions. [2025-02-05 16:38:08,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-02-05 16:38:08,014 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:38:08,014 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:38:08,014 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 16:38:08,014 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:38:08,016 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:38:08,016 INFO L85 PathProgramCache]: Analyzing trace with hash -1726522719, now seen corresponding path program 1 times [2025-02-05 16:38:08,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:38:08,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [428547731] [2025-02-05 16:38:08,016 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:38:08,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:38:08,032 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-02-05 16:38:08,044 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-02-05 16:38:08,044 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:38:08,044 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:38:08,127 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-05 16:38:08,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:38:08,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [428547731] [2025-02-05 16:38:08,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [428547731] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:38:08,127 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:38:08,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 16:38:08,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1037768119] [2025-02-05 16:38:08,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:38:08,128 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 16:38:08,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:38:08,128 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 16:38:08,129 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:38:08,129 INFO L87 Difference]: Start difference. First operand 2083 states and 3010 transitions. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 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-02-05 16:38:08,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:38:08,228 INFO L93 Difference]: Finished difference Result 3827 states and 5566 transitions. [2025-02-05 16:38:08,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 16:38:08,228 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2025-02-05 16:38:08,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:38:08,241 INFO L225 Difference]: With dead ends: 3827 [2025-02-05 16:38:08,241 INFO L226 Difference]: Without dead ends: 3181 [2025-02-05 16:38:08,243 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-02-05 16:38:08,244 INFO L435 NwaCegarLoop]: 136 mSDtfsCounter, 215 mSDsluCounter, 235 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 215 SdHoareTripleChecker+Valid, 371 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:38:08,244 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [215 Valid, 371 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:38:08,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3181 states. [2025-02-05 16:38:08,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3181 to 2727. [2025-02-05 16:38:08,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2727 states, 2726 states have (on average 1.446074834922964) internal successors, (3942), 2726 states have internal predecessors, (3942), 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-02-05 16:38:08,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2727 states to 2727 states and 3942 transitions. [2025-02-05 16:38:08,316 INFO L78 Accepts]: Start accepts. Automaton has 2727 states and 3942 transitions. Word has length 60 [2025-02-05 16:38:08,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:38:08,316 INFO L471 AbstractCegarLoop]: Abstraction has 2727 states and 3942 transitions. [2025-02-05 16:38:08,316 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 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-02-05 16:38:08,316 INFO L276 IsEmpty]: Start isEmpty. Operand 2727 states and 3942 transitions. [2025-02-05 16:38:08,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-02-05 16:38:08,318 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:38:08,318 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:38:08,318 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-05 16:38:08,318 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:38:08,318 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:38:08,319 INFO L85 PathProgramCache]: Analyzing trace with hash -1147147911, now seen corresponding path program 1 times [2025-02-05 16:38:08,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:38:08,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1516668995] [2025-02-05 16:38:08,319 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:38:08,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:38:08,334 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-02-05 16:38:08,350 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-02-05 16:38:08,350 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:38:08,350 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:38:08,629 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:38:08,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:38:08,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1516668995] [2025-02-05 16:38:08,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1516668995] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 16:38:08,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1330690615] [2025-02-05 16:38:08,629 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:38:08,629 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:38:08,630 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 16:38:08,634 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-02-05 16:38:08,637 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-02-05 16:38:08,704 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-02-05 16:38:08,750 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-02-05 16:38:08,750 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:38:08,750 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:38:08,759 INFO L256 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-02-05 16:38:08,765 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 16:38:09,002 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:38:09,003 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 16:38:09,539 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:38:09,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1330690615] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 16:38:09,540 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 16:38:09,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6, 6] total 18 [2025-02-05 16:38:09,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1389182666] [2025-02-05 16:38:09,540 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 16:38:09,540 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-02-05 16:38:09,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:38:09,541 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-02-05 16:38:09,541 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=251, Unknown=0, NotChecked=0, Total=306 [2025-02-05 16:38:09,542 INFO L87 Difference]: Start difference. First operand 2727 states and 3942 transitions. Second operand has 18 states, 18 states have (on average 9.61111111111111) internal successors, (173), 18 states have internal predecessors, (173), 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-02-05 16:38:13,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:38:13,484 INFO L93 Difference]: Finished difference Result 27774 states and 39986 transitions. [2025-02-05 16:38:13,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2025-02-05 16:38:13,485 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 9.61111111111111) internal successors, (173), 18 states have internal predecessors, (173), 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 61 [2025-02-05 16:38:13,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:38:13,568 INFO L225 Difference]: With dead ends: 27774 [2025-02-05 16:38:13,568 INFO L226 Difference]: Without dead ends: 24748 [2025-02-05 16:38:13,583 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 226 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4993 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=2003, Invalid=10879, Unknown=0, NotChecked=0, Total=12882 [2025-02-05 16:38:13,584 INFO L435 NwaCegarLoop]: 129 mSDtfsCounter, 3643 mSDsluCounter, 910 mSDsCounter, 0 mSdLazyCounter, 1981 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3643 SdHoareTripleChecker+Valid, 1039 SdHoareTripleChecker+Invalid, 2066 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 1981 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-02-05 16:38:13,585 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3643 Valid, 1039 Invalid, 2066 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 1981 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-02-05 16:38:13,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24748 states. [2025-02-05 16:38:14,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24748 to 20507. [2025-02-05 16:38:14,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20507 states, 20506 states have (on average 1.409684970252609) internal successors, (28907), 20506 states have internal predecessors, (28907), 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-02-05 16:38:14,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20507 states to 20507 states and 28907 transitions. [2025-02-05 16:38:14,158 INFO L78 Accepts]: Start accepts. Automaton has 20507 states and 28907 transitions. Word has length 61 [2025-02-05 16:38:14,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:38:14,159 INFO L471 AbstractCegarLoop]: Abstraction has 20507 states and 28907 transitions. [2025-02-05 16:38:14,159 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 9.61111111111111) internal successors, (173), 18 states have internal predecessors, (173), 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-02-05 16:38:14,159 INFO L276 IsEmpty]: Start isEmpty. Operand 20507 states and 28907 transitions. [2025-02-05 16:38:14,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-02-05 16:38:14,161 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:38:14,161 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:38:14,170 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-05 16:38:14,361 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-02-05 16:38:14,362 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:38:14,363 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:38:14,363 INFO L85 PathProgramCache]: Analyzing trace with hash 1722963677, now seen corresponding path program 1 times [2025-02-05 16:38:14,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:38:14,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929826004] [2025-02-05 16:38:14,363 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:38:14,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:38:14,375 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-02-05 16:38:14,403 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-02-05 16:38:14,403 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:38:14,403 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:38:14,724 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:38:14,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:38:14,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1929826004] [2025-02-05 16:38:14,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1929826004] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 16:38:14,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1754318320] [2025-02-05 16:38:14,725 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:38:14,725 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:38:14,725 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 16:38:14,727 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-02-05 16:38:14,729 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-02-05 16:38:14,789 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-02-05 16:38:14,827 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-02-05 16:38:14,827 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:38:14,827 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:38:14,832 INFO L256 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-02-05 16:38:14,836 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 16:38:15,923 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:38:15,923 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 16:38:16,619 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:38:16,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1754318320] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 16:38:16,619 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 16:38:16,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 12, 12] total 30 [2025-02-05 16:38:16,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [75327131] [2025-02-05 16:38:16,620 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 16:38:16,620 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-02-05 16:38:16,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:38:16,621 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-02-05 16:38:16,621 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=781, Unknown=0, NotChecked=0, Total=870 [2025-02-05 16:38:16,621 INFO L87 Difference]: Start difference. First operand 20507 states and 28907 transitions. Second operand has 30 states, 30 states have (on average 5.633333333333334) internal successors, (169), 30 states have internal predecessors, (169), 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-02-05 16:38:37,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:38:37,277 INFO L93 Difference]: Finished difference Result 633999 states and 892818 transitions. [2025-02-05 16:38:37,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 401 states. [2025-02-05 16:38:37,277 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 5.633333333333334) internal successors, (169), 30 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2025-02-05 16:38:37,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:38:38,735 INFO L225 Difference]: With dead ends: 633999 [2025-02-05 16:38:38,736 INFO L226 Difference]: Without dead ends: 613513 [2025-02-05 16:38:39,174 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 531 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 427 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84839 ImplicationChecksByTransitivity, 16.8s TimeCoverageRelationStatistics Valid=19897, Invalid=163715, Unknown=0, NotChecked=0, Total=183612 [2025-02-05 16:38:39,174 INFO L435 NwaCegarLoop]: 79 mSDtfsCounter, 9266 mSDsluCounter, 1676 mSDsCounter, 0 mSdLazyCounter, 2970 mSolverCounterSat, 191 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9266 SdHoareTripleChecker+Valid, 1755 SdHoareTripleChecker+Invalid, 3161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 191 IncrementalHoareTripleChecker+Valid, 2970 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:38:39,175 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9266 Valid, 1755 Invalid, 3161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [191 Valid, 2970 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-02-05 16:38:39,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 613513 states. [2025-02-05 16:38:45,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 613513 to 281147. [2025-02-05 16:38:45,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 281147 states, 281146 states have (on average 1.3970214763859348) internal successors, (392767), 281146 states have internal predecessors, (392767), 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-02-05 16:38:47,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281147 states to 281147 states and 392767 transitions. [2025-02-05 16:38:47,004 INFO L78 Accepts]: Start accepts. Automaton has 281147 states and 392767 transitions. Word has length 62 [2025-02-05 16:38:47,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:38:47,005 INFO L471 AbstractCegarLoop]: Abstraction has 281147 states and 392767 transitions. [2025-02-05 16:38:47,005 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 5.633333333333334) internal successors, (169), 30 states have internal predecessors, (169), 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-02-05 16:38:47,005 INFO L276 IsEmpty]: Start isEmpty. Operand 281147 states and 392767 transitions. [2025-02-05 16:38:47,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-02-05 16:38:47,009 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:38:47,010 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:38:47,018 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-02-05 16:38:47,214 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:38:47,214 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:38:47,215 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:38:47,215 INFO L85 PathProgramCache]: Analyzing trace with hash 902704569, now seen corresponding path program 1 times [2025-02-05 16:38:47,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:38:47,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455410230] [2025-02-05 16:38:47,216 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:38:47,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:38:47,230 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-02-05 16:38:47,426 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-02-05 16:38:47,427 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:38:47,427 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:38:47,457 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-02-05 16:38:47,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:38:47,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455410230] [2025-02-05 16:38:47,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1455410230] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:38:47,457 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:38:47,457 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:38:47,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1135275250] [2025-02-05 16:38:47,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:38:47,458 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:38:47,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:38:47,459 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:38:47,459 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:38:47,459 INFO L87 Difference]: Start difference. First operand 281147 states and 392767 transitions. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 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-02-05 16:38:49,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:38:49,140 INFO L93 Difference]: Finished difference Result 459403 states and 641979 transitions. [2025-02-05 16:38:49,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:38:49,141 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 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 63 [2025-02-05 16:38:49,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:38:49,412 INFO L225 Difference]: With dead ends: 459403 [2025-02-05 16:38:49,413 INFO L226 Difference]: Without dead ends: 178277 [2025-02-05 16:38:49,529 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-02-05 16:38:49,529 INFO L435 NwaCegarLoop]: 73 mSDtfsCounter, 57 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:38:49,530 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 106 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:38:49,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178277 states. [2025-02-05 16:38:51,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178277 to 178277. [2025-02-05 16:38:51,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178277 states, 178276 states have (on average 1.3738416836814826) internal successors, (244923), 178276 states have internal predecessors, (244923), 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-02-05 16:38:51,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178277 states to 178277 states and 244923 transitions. [2025-02-05 16:38:51,895 INFO L78 Accepts]: Start accepts. Automaton has 178277 states and 244923 transitions. Word has length 63 [2025-02-05 16:38:51,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:38:51,895 INFO L471 AbstractCegarLoop]: Abstraction has 178277 states and 244923 transitions. [2025-02-05 16:38:51,895 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 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-02-05 16:38:51,895 INFO L276 IsEmpty]: Start isEmpty. Operand 178277 states and 244923 transitions. [2025-02-05 16:38:51,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-02-05 16:38:51,896 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:38:51,897 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:38:51,897 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-05 16:38:51,897 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:38:51,897 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:38:51,897 INFO L85 PathProgramCache]: Analyzing trace with hash -401980053, now seen corresponding path program 1 times [2025-02-05 16:38:51,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:38:51,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1840379180] [2025-02-05 16:38:51,897 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:38:51,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:38:51,909 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-02-05 16:38:51,950 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-02-05 16:38:51,951 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:38:51,951 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:38:52,925 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:38:52,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:38:52,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1840379180] [2025-02-05 16:38:52,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1840379180] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 16:38:52,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1798781753] [2025-02-05 16:38:52,926 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:38:52,926 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:38:52,926 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 16:38:52,929 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-02-05 16:38:52,932 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-02-05 16:38:52,994 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-02-05 16:38:53,036 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-02-05 16:38:53,036 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:38:53,037 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:38:53,039 INFO L256 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-02-05 16:38:53,042 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 16:38:53,698 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:38:53,698 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 16:38:54,381 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:38:54,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1798781753] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 16:38:54,381 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 16:38:54,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 32 [2025-02-05 16:38:54,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1401616636] [2025-02-05 16:38:54,383 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 16:38:54,384 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-02-05 16:38:54,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:38:54,384 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-02-05 16:38:54,384 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=870, Unknown=0, NotChecked=0, Total=992 [2025-02-05 16:38:54,385 INFO L87 Difference]: Start difference. First operand 178277 states and 244923 transitions. Second operand has 32 states, 32 states have (on average 4.75) internal successors, (152), 32 states have internal predecessors, (152), 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-02-05 16:38:56,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:38:56,900 INFO L93 Difference]: Finished difference Result 438170 states and 601487 transitions. [2025-02-05 16:38:56,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-02-05 16:38:56,901 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 4.75) internal successors, (152), 32 states have internal predecessors, (152), 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 63 [2025-02-05 16:38:56,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:38:57,391 INFO L225 Difference]: With dead ends: 438170 [2025-02-05 16:38:57,391 INFO L226 Difference]: Without dead ends: 367602 [2025-02-05 16:38:57,433 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 464 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=619, Invalid=2243, Unknown=0, NotChecked=0, Total=2862 [2025-02-05 16:38:57,434 INFO L435 NwaCegarLoop]: 94 mSDtfsCounter, 2020 mSDsluCounter, 882 mSDsCounter, 0 mSdLazyCounter, 419 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2020 SdHoareTripleChecker+Valid, 976 SdHoareTripleChecker+Invalid, 435 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 419 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 16:38:57,434 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2020 Valid, 976 Invalid, 435 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 419 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 16:38:57,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 367602 states. [2025-02-05 16:38:59,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 367602 to 178837. [2025-02-05 16:39:00,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178837 states, 178836 states have (on average 1.3747791272450738) internal successors, (245860), 178836 states have internal predecessors, (245860), 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-02-05 16:39:00,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178837 states to 178837 states and 245860 transitions. [2025-02-05 16:39:00,448 INFO L78 Accepts]: Start accepts. Automaton has 178837 states and 245860 transitions. Word has length 63 [2025-02-05 16:39:00,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:39:00,449 INFO L471 AbstractCegarLoop]: Abstraction has 178837 states and 245860 transitions. [2025-02-05 16:39:00,449 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 4.75) internal successors, (152), 32 states have internal predecessors, (152), 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-02-05 16:39:00,449 INFO L276 IsEmpty]: Start isEmpty. Operand 178837 states and 245860 transitions. [2025-02-05 16:39:00,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-02-05 16:39:00,450 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:39:00,450 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:39:00,456 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-05 16:39:00,651 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:39:00,651 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:39:00,652 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:39:00,652 INFO L85 PathProgramCache]: Analyzing trace with hash -616183089, now seen corresponding path program 1 times [2025-02-05 16:39:00,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:39:00,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436435138] [2025-02-05 16:39:00,652 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:39:00,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:39:00,663 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-02-05 16:39:00,670 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-02-05 16:39:00,670 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:39:00,670 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:39:00,708 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-05 16:39:00,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:39:00,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1436435138] [2025-02-05 16:39:00,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1436435138] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:39:00,709 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:39:00,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:39:00,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25838511] [2025-02-05 16:39:00,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:39:00,710 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:39:00,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:39:00,710 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:39:00,710 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:39:00,711 INFO L87 Difference]: Start difference. First operand 178837 states and 245860 transitions. Second operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:39:02,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:39:02,255 INFO L93 Difference]: Finished difference Result 335487 states and 461365 transitions. [2025-02-05 16:39:02,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:39:02,256 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2025-02-05 16:39:02,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:39:02,567 INFO L225 Difference]: With dead ends: 335487 [2025-02-05 16:39:02,568 INFO L226 Difference]: Without dead ends: 156671 [2025-02-05 16:39:02,676 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-02-05 16:39:02,677 INFO L435 NwaCegarLoop]: 57 mSDtfsCounter, 46 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:39:02,677 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 74 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:39:02,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156671 states. [2025-02-05 16:39:04,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156671 to 156671. [2025-02-05 16:39:04,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156671 states, 156670 states have (on average 1.3563413544392673) internal successors, (212498), 156670 states have internal predecessors, (212498), 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-02-05 16:39:04,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156671 states to 156671 states and 212498 transitions. [2025-02-05 16:39:04,860 INFO L78 Accepts]: Start accepts. Automaton has 156671 states and 212498 transitions. Word has length 64 [2025-02-05 16:39:04,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:39:04,860 INFO L471 AbstractCegarLoop]: Abstraction has 156671 states and 212498 transitions. [2025-02-05 16:39:04,860 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:39:04,860 INFO L276 IsEmpty]: Start isEmpty. Operand 156671 states and 212498 transitions. [2025-02-05 16:39:04,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-02-05 16:39:04,861 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:39:04,861 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:39:04,861 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-05 16:39:04,861 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:39:04,861 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:39:04,861 INFO L85 PathProgramCache]: Analyzing trace with hash -2135889904, now seen corresponding path program 1 times [2025-02-05 16:39:04,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:39:04,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455636825] [2025-02-05 16:39:04,862 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:39:04,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:39:04,870 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-02-05 16:39:04,878 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-02-05 16:39:04,878 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:39:04,878 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:39:04,920 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:39:04,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:39:04,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455636825] [2025-02-05 16:39:04,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1455636825] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:39:04,921 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:39:04,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:39:04,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [9017961] [2025-02-05 16:39:04,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:39:04,922 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:39:04,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:39:04,922 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:39:04,922 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:39:04,922 INFO L87 Difference]: Start difference. First operand 156671 states and 212498 transitions. Second operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 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-02-05 16:39:05,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:39:05,968 INFO L93 Difference]: Finished difference Result 210984 states and 286108 transitions. [2025-02-05 16:39:05,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:39:05,969 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 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 64 [2025-02-05 16:39:05,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:39:06,062 INFO L225 Difference]: With dead ends: 210984 [2025-02-05 16:39:06,062 INFO L226 Difference]: Without dead ends: 54334 [2025-02-05 16:39:06,131 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-02-05 16:39:06,132 INFO L435 NwaCegarLoop]: 104 mSDtfsCounter, 36 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 171 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-02-05 16:39:06,133 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 171 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:39:06,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54334 states. [2025-02-05 16:39:06,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54334 to 50469. [2025-02-05 16:39:06,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50469 states, 50468 states have (on average 1.343286835222319) internal successors, (67793), 50468 states have internal predecessors, (67793), 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-02-05 16:39:06,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50469 states to 50469 states and 67793 transitions. [2025-02-05 16:39:06,851 INFO L78 Accepts]: Start accepts. Automaton has 50469 states and 67793 transitions. Word has length 64 [2025-02-05 16:39:06,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:39:06,851 INFO L471 AbstractCegarLoop]: Abstraction has 50469 states and 67793 transitions. [2025-02-05 16:39:06,851 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 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-02-05 16:39:06,851 INFO L276 IsEmpty]: Start isEmpty. Operand 50469 states and 67793 transitions. [2025-02-05 16:39:06,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-02-05 16:39:06,852 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:39:06,852 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:39:06,852 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-05 16:39:06,852 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:39:06,853 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:39:06,853 INFO L85 PathProgramCache]: Analyzing trace with hash -109019888, now seen corresponding path program 1 times [2025-02-05 16:39:06,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:39:06,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157841917] [2025-02-05 16:39:06,853 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:39:06,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:39:06,862 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-02-05 16:39:06,882 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-02-05 16:39:06,882 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:39:06,882 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:39:08,078 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:39:08,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:39:08,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [157841917] [2025-02-05 16:39:08,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [157841917] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 16:39:08,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [648827070] [2025-02-05 16:39:08,079 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:39:08,079 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:39:08,079 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 16:39:08,080 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-02-05 16:39:08,081 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-02-05 16:39:08,135 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-02-05 16:39:08,168 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-02-05 16:39:08,168 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:39:08,168 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:39:08,169 INFO L256 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-02-05 16:39:08,171 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 16:39:10,173 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:39:10,173 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 16:39:11,334 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:39:11,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [648827070] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 16:39:11,334 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 16:39:11,334 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 20, 17] total 54 [2025-02-05 16:39:11,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234734907] [2025-02-05 16:39:11,334 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 16:39:11,335 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2025-02-05 16:39:11,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:39:11,335 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2025-02-05 16:39:11,335 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=226, Invalid=2636, Unknown=0, NotChecked=0, Total=2862 [2025-02-05 16:39:11,336 INFO L87 Difference]: Start difference. First operand 50469 states and 67793 transitions. Second operand has 54 states, 54 states have (on average 3.2037037037037037) internal successors, (173), 54 states have internal predecessors, (173), 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)