./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.5.ufo.UNBOUNDED.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-var-start-time.5.ufo.UNBOUNDED.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 8d970a6b46f522cdb24394c622109e56254d5436a464b2c277d963fe4612a422 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 16:36:57,251 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 16:36:57,295 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:36:57,299 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 16:36:57,299 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 16:36:57,325 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 16:36:57,326 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 16:36:57,326 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 16:36:57,326 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 16:36:57,326 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 16:36:57,326 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 16:36:57,327 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 16:36:57,327 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 16:36:57,328 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 16:36:57,328 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 16:36:57,329 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 16:36:57,329 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 16:36:57,329 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 16:36:57,329 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 16:36:57,329 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 16:36:57,329 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 16:36:57,329 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 16:36:57,329 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 16:36:57,329 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 16:36:57,329 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 16:36:57,329 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 16:36:57,329 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 16:36:57,329 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 16:36:57,329 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 16:36:57,329 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 16:36:57,329 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 16:36:57,329 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 16:36:57,329 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 16:36:57,329 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 16:36:57,329 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 16:36:57,329 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 16:36:57,329 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 16:36:57,329 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 16:36:57,329 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 16:36:57,330 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 16:36:57,330 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 16:36:57,330 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 16:36:57,330 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 16:36:57,330 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 -> 8d970a6b46f522cdb24394c622109e56254d5436a464b2c277d963fe4612a422 [2025-02-05 16:36:57,589 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 16:36:57,597 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 16:36:57,600 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 16:36:57,601 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 16:36:57,601 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 16:36:57,603 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-var-start-time.5.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2025-02-05 16:36:58,861 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/88a14f376/2195ba23dd454c26bac3ce9c8b3e2cc7/FLAGf13c708cd [2025-02-05 16:36:59,181 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 16:36:59,182 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.5.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2025-02-05 16:36:59,191 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/88a14f376/2195ba23dd454c26bac3ce9c8b3e2cc7/FLAGf13c708cd [2025-02-05 16:36:59,451 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/88a14f376/2195ba23dd454c26bac3ce9c8b3e2cc7 [2025-02-05 16:36:59,457 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 16:36:59,460 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 16:36:59,464 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 16:36:59,465 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 16:36:59,472 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 16:36:59,473 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 04:36:59" (1/1) ... [2025-02-05 16:36:59,475 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3f93efe2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:36:59, skipping insertion in model container [2025-02-05 16:36:59,478 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 04:36:59" (1/1) ... [2025-02-05 16:36:59,522 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 16:36:59,797 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-var-start-time.5.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c[6356,6369] [2025-02-05 16:36:59,845 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 16:36:59,863 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 16:36:59,906 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-var-start-time.5.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c[6356,6369] [2025-02-05 16:36:59,928 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 16:36:59,955 INFO L204 MainTranslator]: Completed translation [2025-02-05 16:36:59,956 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:36:59 WrapperNode [2025-02-05 16:36:59,956 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 16:36:59,960 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 16:36:59,960 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 16:36:59,960 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 16:36:59,965 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:36:59" (1/1) ... [2025-02-05 16:36:59,977 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:36:59" (1/1) ... [2025-02-05 16:37:00,011 INFO L138 Inliner]: procedures = 25, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 572 [2025-02-05 16:37:00,012 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 16:37:00,012 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 16:37:00,012 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 16:37:00,012 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 16:37:00,020 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:36:59" (1/1) ... [2025-02-05 16:37:00,020 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:36:59" (1/1) ... [2025-02-05 16:37:00,023 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:36:59" (1/1) ... [2025-02-05 16:37:00,042 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:37:00,043 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:36:59" (1/1) ... [2025-02-05 16:37:00,043 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:36:59" (1/1) ... [2025-02-05 16:37:00,048 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:36:59" (1/1) ... [2025-02-05 16:37:00,049 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:36:59" (1/1) ... [2025-02-05 16:37:00,050 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:36:59" (1/1) ... [2025-02-05 16:37:00,051 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:36:59" (1/1) ... [2025-02-05 16:37:00,053 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 16:37:00,053 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 16:37:00,054 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 16:37:00,054 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 16:37:00,054 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:36:59" (1/1) ... [2025-02-05 16:37:00,058 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 16:37:00,066 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 16:37:00,078 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:37:00,081 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:37:00,099 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 16:37:00,099 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 16:37:00,099 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 16:37:00,099 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 16:37:00,205 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 16:37:00,207 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 16:37:00,583 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L234: havoc main_~node3__m3~0#1; [2025-02-05 16:37:00,583 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L631: havoc main_~node2____CPAchecker_TMP_0~0#1; [2025-02-05 16:37:00,583 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L252: havoc main_~node4__m4~0#1; [2025-02-05 16:37:00,583 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L401: havoc main_~node5____CPAchecker_TMP_1~0#1; [2025-02-05 16:37:00,583 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L270: havoc main_~node5__m5~0#1; [2025-02-05 16:37:00,583 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L750: havoc main_~node1____CPAchecker_TMP_1~0#1; [2025-02-05 16:37:00,583 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L487: havoc main_~node4____CPAchecker_TMP_1~0#1; [2025-02-05 16:37:00,584 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L373: havoc main_~node5____CPAchecker_TMP_0~0#1; [2025-02-05 16:37:00,584 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L193: havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2025-02-05 16:37:00,584 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L573: havoc main_~node3____CPAchecker_TMP_1~0#1; [2025-02-05 16:37:00,584 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L309: havoc main_~__tmp_1~0#1, main_~assert__arg~0#1;havoc main_~check__tmp~0#1; [2025-02-05 16:37:00,584 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L722: havoc main_~node1____CPAchecker_TMP_0~0#1; [2025-02-05 16:37:00,584 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L459: havoc main_~node4____CPAchecker_TMP_0~0#1; [2025-02-05 16:37:00,584 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L659: havoc main_~node2____CPAchecker_TMP_1~0#1; [2025-02-05 16:37:00,584 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L545: havoc main_~node3____CPAchecker_TMP_0~0#1; [2025-02-05 16:37:00,584 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L216: havoc main_~node2__m2~0#1; [2025-02-05 16:37:00,604 INFO L? ?]: Removed 51 outVars from TransFormulas that were not future-live. [2025-02-05 16:37:00,604 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 16:37:00,612 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 16:37:00,613 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 16:37:00,613 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 04:37:00 BoogieIcfgContainer [2025-02-05 16:37:00,613 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 16:37:00,615 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 16:37:00,615 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 16:37:00,619 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 16:37:00,619 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 04:36:59" (1/3) ... [2025-02-05 16:37:00,619 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31a7791b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 04:37:00, skipping insertion in model container [2025-02-05 16:37:00,619 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:36:59" (2/3) ... [2025-02-05 16:37:00,620 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31a7791b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 04:37:00, skipping insertion in model container [2025-02-05 16:37:00,620 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 04:37:00" (3/3) ... [2025-02-05 16:37:00,621 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.5.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2025-02-05 16:37:00,630 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 16:37:00,631 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_lcr-var-start-time.5.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c that has 1 procedures, 138 locations, 1 initial locations, 0 loop locations, and 1 error locations. [2025-02-05 16:37:00,667 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 16:37:00,676 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;@53104cbb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 16:37:00,677 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 16:37:00,680 INFO L276 IsEmpty]: Start isEmpty. Operand has 138 states, 136 states have (on average 1.6911764705882353) internal successors, (230), 137 states have internal predecessors, (230), 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:37:00,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-02-05 16:37:00,685 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:37:00,685 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:37:00,685 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:37:00,689 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:37:00,689 INFO L85 PathProgramCache]: Analyzing trace with hash 32515227, now seen corresponding path program 1 times [2025-02-05 16:37:00,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:37:00,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329090221] [2025-02-05 16:37:00,695 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:37:00,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:37:00,783 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-02-05 16:37:00,836 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-02-05 16:37:00,836 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:37:00,836 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:37:01,046 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:37:01,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:37:01,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [329090221] [2025-02-05 16:37:01,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [329090221] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:37:01,048 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:37:01,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:37:01,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526775245] [2025-02-05 16:37:01,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:37:01,053 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:37:01,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:37:01,064 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:37:01,067 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:37:01,068 INFO L87 Difference]: Start difference. First operand has 138 states, 136 states have (on average 1.6911764705882353) internal successors, (230), 137 states have internal predecessors, (230), 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 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 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:37:01,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:37:01,134 INFO L93 Difference]: Finished difference Result 328 states and 528 transitions. [2025-02-05 16:37:01,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:37:01,136 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 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:37:01,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:37:01,142 INFO L225 Difference]: With dead ends: 328 [2025-02-05 16:37:01,144 INFO L226 Difference]: Without dead ends: 219 [2025-02-05 16:37:01,146 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:37:01,148 INFO L435 NwaCegarLoop]: 328 mSDtfsCounter, 167 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 487 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:37:01,148 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [167 Valid, 487 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:37:01,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2025-02-05 16:37:01,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 217. [2025-02-05 16:37:01,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 216 states have (on average 1.5046296296296295) internal successors, (325), 216 states have internal predecessors, (325), 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:37:01,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 325 transitions. [2025-02-05 16:37:01,179 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 325 transitions. Word has length 61 [2025-02-05 16:37:01,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:37:01,180 INFO L471 AbstractCegarLoop]: Abstraction has 217 states and 325 transitions. [2025-02-05 16:37:01,180 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 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:37:01,180 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 325 transitions. [2025-02-05 16:37:01,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-02-05 16:37:01,181 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:37:01,181 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:37:01,181 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 16:37:01,182 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:37:01,182 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:37:01,182 INFO L85 PathProgramCache]: Analyzing trace with hash -2002620334, now seen corresponding path program 1 times [2025-02-05 16:37:01,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:37:01,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1261277400] [2025-02-05 16:37:01,182 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:37:01,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:37:01,202 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-02-05 16:37:01,227 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-02-05 16:37:01,227 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:37:01,227 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:37:01,318 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:37:01,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:37:01,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1261277400] [2025-02-05 16:37:01,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1261277400] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:37:01,321 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:37:01,321 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:37:01,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [425782952] [2025-02-05 16:37:01,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:37:01,322 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:37:01,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:37:01,323 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:37:01,323 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:37:01,323 INFO L87 Difference]: Start difference. First operand 217 states and 325 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:37:01,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:37:01,364 INFO L93 Difference]: Finished difference Result 549 states and 853 transitions. [2025-02-05 16:37:01,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:37:01,364 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 62 [2025-02-05 16:37:01,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:37:01,366 INFO L225 Difference]: With dead ends: 549 [2025-02-05 16:37:01,368 INFO L226 Difference]: Without dead ends: 367 [2025-02-05 16:37:01,369 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:37:01,369 INFO L435 NwaCegarLoop]: 272 mSDtfsCounter, 137 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 424 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:37:01,370 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 424 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:37:01,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 367 states. [2025-02-05 16:37:01,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 367 to 365. [2025-02-05 16:37:01,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 365 states, 364 states have (on average 1.5384615384615385) internal successors, (560), 364 states have internal predecessors, (560), 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:37:01,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 560 transitions. [2025-02-05 16:37:01,390 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 560 transitions. Word has length 62 [2025-02-05 16:37:01,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:37:01,391 INFO L471 AbstractCegarLoop]: Abstraction has 365 states and 560 transitions. [2025-02-05 16:37:01,391 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:37:01,391 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 560 transitions. [2025-02-05 16:37:01,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-02-05 16:37:01,392 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:37:01,392 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:37:01,392 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 16:37:01,392 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:37:01,393 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:37:01,393 INFO L85 PathProgramCache]: Analyzing trace with hash 1465361237, now seen corresponding path program 1 times [2025-02-05 16:37:01,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:37:01,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393621073] [2025-02-05 16:37:01,393 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:37:01,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:37:01,437 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-02-05 16:37:01,452 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-02-05 16:37:01,455 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:37:01,456 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:37:01,536 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:37:01,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:37:01,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393621073] [2025-02-05 16:37:01,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [393621073] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:37:01,537 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:37:01,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:37:01,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855208795] [2025-02-05 16:37:01,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:37:01,537 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:37:01,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:37:01,538 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:37:01,538 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:37:01,538 INFO L87 Difference]: Start difference. First operand 365 states and 560 transitions. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 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:37:01,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:37:01,561 INFO L93 Difference]: Finished difference Result 961 states and 1506 transitions. [2025-02-05 16:37:01,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:37:01,561 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 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:37:01,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:37:01,563 INFO L225 Difference]: With dead ends: 961 [2025-02-05 16:37:01,564 INFO L226 Difference]: Without dead ends: 631 [2025-02-05 16:37:01,564 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:37:01,565 INFO L435 NwaCegarLoop]: 253 mSDtfsCounter, 132 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 409 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:37:01,565 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 409 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:37:01,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 631 states. [2025-02-05 16:37:01,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 631 to 629. [2025-02-05 16:37:01,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 629 states, 628 states have (on average 1.5541401273885351) internal successors, (976), 628 states have internal predecessors, (976), 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:37:01,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 629 states to 629 states and 976 transitions. [2025-02-05 16:37:01,585 INFO L78 Accepts]: Start accepts. Automaton has 629 states and 976 transitions. Word has length 63 [2025-02-05 16:37:01,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:37:01,585 INFO L471 AbstractCegarLoop]: Abstraction has 629 states and 976 transitions. [2025-02-05 16:37:01,585 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 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:37:01,585 INFO L276 IsEmpty]: Start isEmpty. Operand 629 states and 976 transitions. [2025-02-05 16:37:01,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-02-05 16:37:01,587 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:37:01,587 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:37:01,587 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 16:37:01,587 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:37:01,588 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:37:01,588 INFO L85 PathProgramCache]: Analyzing trace with hash -100084340, now seen corresponding path program 1 times [2025-02-05 16:37:01,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:37:01,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316899002] [2025-02-05 16:37:01,588 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:37:01,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:37:01,602 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-02-05 16:37:01,611 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-02-05 16:37:01,611 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:37:01,611 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:37:01,671 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:37:01,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:37:01,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1316899002] [2025-02-05 16:37:01,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1316899002] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:37:01,676 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:37:01,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:37:01,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1554210192] [2025-02-05 16:37:01,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:37:01,676 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:37:01,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:37:01,676 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:37:01,676 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:37:01,677 INFO L87 Difference]: Start difference. First operand 629 states and 976 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:37:01,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:37:01,718 INFO L93 Difference]: Finished difference Result 1689 states and 2650 transitions. [2025-02-05 16:37:01,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:37:01,719 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:37:01,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:37:01,727 INFO L225 Difference]: With dead ends: 1689 [2025-02-05 16:37:01,727 INFO L226 Difference]: Without dead ends: 1095 [2025-02-05 16:37:01,728 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:37:01,729 INFO L435 NwaCegarLoop]: 234 mSDtfsCounter, 127 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 394 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:37:01,729 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 394 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:37:01,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1095 states. [2025-02-05 16:37:01,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1095 to 1093. [2025-02-05 16:37:01,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1093 states, 1092 states have (on average 1.5567765567765568) internal successors, (1700), 1092 states have internal predecessors, (1700), 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:37:01,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1093 states to 1093 states and 1700 transitions. [2025-02-05 16:37:01,774 INFO L78 Accepts]: Start accepts. Automaton has 1093 states and 1700 transitions. Word has length 64 [2025-02-05 16:37:01,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:37:01,774 INFO L471 AbstractCegarLoop]: Abstraction has 1093 states and 1700 transitions. [2025-02-05 16:37:01,774 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:37:01,774 INFO L276 IsEmpty]: Start isEmpty. Operand 1093 states and 1700 transitions. [2025-02-05 16:37:01,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-02-05 16:37:01,776 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:37:01,776 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:37:01,776 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 16:37:01,777 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:37:01,777 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:37:01,780 INFO L85 PathProgramCache]: Analyzing trace with hash -697930737, now seen corresponding path program 1 times [2025-02-05 16:37:01,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:37:01,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474125049] [2025-02-05 16:37:01,781 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:37:01,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:37:01,823 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-02-05 16:37:01,839 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-02-05 16:37:01,841 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:37:01,841 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:37:02,046 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:37:02,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:37:02,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1474125049] [2025-02-05 16:37:02,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1474125049] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:37:02,047 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:37:02,047 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 16:37:02,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [935883373] [2025-02-05 16:37:02,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:37:02,048 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 16:37:02,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:37:02,049 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 16:37:02,049 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-05 16:37:02,049 INFO L87 Difference]: Start difference. First operand 1093 states and 1700 transitions. Second operand has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 7 states have internal predecessors, (65), 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:37:02,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:37:02,260 INFO L93 Difference]: Finished difference Result 7441 states and 11690 transitions. [2025-02-05 16:37:02,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 16:37:02,261 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 7 states have internal predecessors, (65), 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 65 [2025-02-05 16:37:02,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:37:02,280 INFO L225 Difference]: With dead ends: 7441 [2025-02-05 16:37:02,281 INFO L226 Difference]: Without dead ends: 6383 [2025-02-05 16:37:02,284 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2025-02-05 16:37:02,285 INFO L435 NwaCegarLoop]: 192 mSDtfsCounter, 1477 mSDsluCounter, 2267 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1477 SdHoareTripleChecker+Valid, 2459 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:37:02,286 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1477 Valid, 2459 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:37:02,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6383 states. [2025-02-05 16:37:02,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6383 to 2149. [2025-02-05 16:37:02,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2149 states, 2148 states have (on average 1.5512104283054005) internal successors, (3332), 2148 states have internal predecessors, (3332), 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:37:02,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2149 states to 2149 states and 3332 transitions. [2025-02-05 16:37:02,370 INFO L78 Accepts]: Start accepts. Automaton has 2149 states and 3332 transitions. Word has length 65 [2025-02-05 16:37:02,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:37:02,372 INFO L471 AbstractCegarLoop]: Abstraction has 2149 states and 3332 transitions. [2025-02-05 16:37:02,372 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 7 states have internal predecessors, (65), 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:37:02,372 INFO L276 IsEmpty]: Start isEmpty. Operand 2149 states and 3332 transitions. [2025-02-05 16:37:02,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-02-05 16:37:02,373 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:37:02,373 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:37:02,376 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 16:37:02,376 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:37:02,377 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:37:02,377 INFO L85 PathProgramCache]: Analyzing trace with hash -160061060, now seen corresponding path program 1 times [2025-02-05 16:37:02,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:37:02,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [752328346] [2025-02-05 16:37:02,377 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:37:02,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:37:02,393 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-02-05 16:37:02,421 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-02-05 16:37:02,422 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:37:02,422 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:37:02,659 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:37:02,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:37:02,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [752328346] [2025-02-05 16:37:02,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [752328346] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:37:02,661 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:37:02,661 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 16:37:02,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [26065742] [2025-02-05 16:37:02,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:37:02,661 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 16:37:02,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:37:02,662 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 16:37:02,662 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-05 16:37:02,662 INFO L87 Difference]: Start difference. First operand 2149 states and 3332 transitions. Second operand has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 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:37:02,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:37:02,810 INFO L93 Difference]: Finished difference Result 11279 states and 17449 transitions. [2025-02-05 16:37:02,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 16:37:02,811 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 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 66 [2025-02-05 16:37:02,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:37:02,841 INFO L225 Difference]: With dead ends: 11279 [2025-02-05 16:37:02,841 INFO L226 Difference]: Without dead ends: 9165 [2025-02-05 16:37:02,847 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-05 16:37:02,848 INFO L435 NwaCegarLoop]: 322 mSDtfsCounter, 809 mSDsluCounter, 626 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 809 SdHoareTripleChecker+Valid, 948 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:37:02,849 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [809 Valid, 948 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:37:02,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9165 states. [2025-02-05 16:37:03,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9165 to 9157. [2025-02-05 16:37:03,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9157 states, 9156 states have (on average 1.5417212756662297) internal successors, (14116), 9156 states have internal predecessors, (14116), 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:37:03,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9157 states to 9157 states and 14116 transitions. [2025-02-05 16:37:03,053 INFO L78 Accepts]: Start accepts. Automaton has 9157 states and 14116 transitions. Word has length 66 [2025-02-05 16:37:03,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:37:03,054 INFO L471 AbstractCegarLoop]: Abstraction has 9157 states and 14116 transitions. [2025-02-05 16:37:03,054 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 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:37:03,054 INFO L276 IsEmpty]: Start isEmpty. Operand 9157 states and 14116 transitions. [2025-02-05 16:37:03,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-02-05 16:37:03,057 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:37:03,057 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:37:03,057 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 16:37:03,058 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:37:03,059 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:37:03,059 INFO L85 PathProgramCache]: Analyzing trace with hash 1401017307, now seen corresponding path program 1 times [2025-02-05 16:37:03,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:37:03,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114898200] [2025-02-05 16:37:03,059 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:37:03,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:37:03,081 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-02-05 16:37:03,092 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-02-05 16:37:03,092 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:37:03,093 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:37:03,139 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:37:03,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:37:03,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1114898200] [2025-02-05 16:37:03,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1114898200] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:37:03,139 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:37:03,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:37:03,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198134999] [2025-02-05 16:37:03,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:37:03,140 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:37:03,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:37:03,140 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:37:03,140 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:37:03,140 INFO L87 Difference]: Start difference. First operand 9157 states and 14116 transitions. Second operand has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 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:37:03,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:37:03,231 INFO L93 Difference]: Finished difference Result 24681 states and 37894 transitions. [2025-02-05 16:37:03,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:37:03,234 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 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 67 [2025-02-05 16:37:03,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:37:03,283 INFO L225 Difference]: With dead ends: 24681 [2025-02-05 16:37:03,283 INFO L226 Difference]: Without dead ends: 15559 [2025-02-05 16:37:03,297 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:37:03,298 INFO L435 NwaCegarLoop]: 320 mSDtfsCounter, 144 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 464 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:37:03,299 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 464 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:37:03,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15559 states. [2025-02-05 16:37:03,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15559 to 15557. [2025-02-05 16:37:03,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15557 states, 15556 states have (on average 1.5204422730779121) internal successors, (23652), 15556 states have internal predecessors, (23652), 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:37:03,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15557 states to 15557 states and 23652 transitions. [2025-02-05 16:37:03,650 INFO L78 Accepts]: Start accepts. Automaton has 15557 states and 23652 transitions. Word has length 67 [2025-02-05 16:37:03,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:37:03,651 INFO L471 AbstractCegarLoop]: Abstraction has 15557 states and 23652 transitions. [2025-02-05 16:37:03,651 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 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:37:03,651 INFO L276 IsEmpty]: Start isEmpty. Operand 15557 states and 23652 transitions. [2025-02-05 16:37:03,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-02-05 16:37:03,652 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:37:03,652 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:37:03,652 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 16:37:03,652 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:37:03,653 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:37:03,653 INFO L85 PathProgramCache]: Analyzing trace with hash 803665438, now seen corresponding path program 1 times [2025-02-05 16:37:03,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:37:03,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812636358] [2025-02-05 16:37:03,653 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:37:03,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:37:03,667 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-02-05 16:37:03,691 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-02-05 16:37:03,694 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:37:03,695 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:37:04,005 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:37:04,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:37:04,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [812636358] [2025-02-05 16:37:04,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [812636358] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:37:04,006 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:37:04,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 16:37:04,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2124048830] [2025-02-05 16:37:04,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:37:04,006 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 16:37:04,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:37:04,007 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 16:37:04,007 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:37:04,007 INFO L87 Difference]: Start difference. First operand 15557 states and 23652 transitions. Second operand has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 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:37:04,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:37:04,051 INFO L93 Difference]: Finished difference Result 16199 states and 24613 transitions. [2025-02-05 16:37:04,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 16:37:04,052 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 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 68 [2025-02-05 16:37:04,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:37:04,080 INFO L225 Difference]: With dead ends: 16199 [2025-02-05 16:37:04,080 INFO L226 Difference]: Without dead ends: 16197 [2025-02-05 16:37:04,087 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:37:04,088 INFO L435 NwaCegarLoop]: 191 mSDtfsCounter, 0 mSDsluCounter, 563 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 754 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:37:04,089 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 754 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:37:04,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16197 states. [2025-02-05 16:37:04,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16197 to 16197. [2025-02-05 16:37:04,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16197 states, 16196 states have (on average 1.49987651271919) internal successors, (24292), 16196 states have internal predecessors, (24292), 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:37:04,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16197 states to 16197 states and 24292 transitions. [2025-02-05 16:37:04,304 INFO L78 Accepts]: Start accepts. Automaton has 16197 states and 24292 transitions. Word has length 68 [2025-02-05 16:37:04,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:37:04,304 INFO L471 AbstractCegarLoop]: Abstraction has 16197 states and 24292 transitions. [2025-02-05 16:37:04,306 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 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:37:04,306 INFO L276 IsEmpty]: Start isEmpty. Operand 16197 states and 24292 transitions. [2025-02-05 16:37:04,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-02-05 16:37:04,307 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:37:04,307 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:37:04,307 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 16:37:04,307 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:37:04,307 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:37:04,308 INFO L85 PathProgramCache]: Analyzing trace with hash -851406643, now seen corresponding path program 1 times [2025-02-05 16:37:04,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:37:04,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453097701] [2025-02-05 16:37:04,308 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:37:04,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:37:04,321 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-02-05 16:37:04,331 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-02-05 16:37:04,331 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:37:04,332 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:37:04,450 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:37:04,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:37:04,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [453097701] [2025-02-05 16:37:04,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [453097701] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:37:04,451 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:37:04,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:37:04,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692588647] [2025-02-05 16:37:04,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:37:04,452 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:37:04,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:37:04,452 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:37:04,452 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:37:04,457 INFO L87 Difference]: Start difference. First operand 16197 states and 24292 transitions. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 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:37:04,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:37:04,538 INFO L93 Difference]: Finished difference Result 39963 states and 59960 transitions. [2025-02-05 16:37:04,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:37:04,539 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 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 69 [2025-02-05 16:37:04,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:37:04,580 INFO L225 Difference]: With dead ends: 39963 [2025-02-05 16:37:04,581 INFO L226 Difference]: Without dead ends: 23801 [2025-02-05 16:37:04,604 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:37:04,606 INFO L435 NwaCegarLoop]: 193 mSDtfsCounter, 116 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 347 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:37:04,606 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 347 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:37:04,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23801 states. [2025-02-05 16:37:04,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23801 to 23655. [2025-02-05 16:37:04,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23655 states, 23654 states have (on average 1.4910797328147458) internal successors, (35270), 23654 states have internal predecessors, (35270), 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:37:05,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23655 states to 23655 states and 35270 transitions. [2025-02-05 16:37:05,029 INFO L78 Accepts]: Start accepts. Automaton has 23655 states and 35270 transitions. Word has length 69 [2025-02-05 16:37:05,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:37:05,029 INFO L471 AbstractCegarLoop]: Abstraction has 23655 states and 35270 transitions. [2025-02-05 16:37:05,029 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 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:37:05,029 INFO L276 IsEmpty]: Start isEmpty. Operand 23655 states and 35270 transitions. [2025-02-05 16:37:05,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-02-05 16:37:05,042 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:37:05,042 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:37:05,042 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 16:37:05,042 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:37:05,043 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:37:05,043 INFO L85 PathProgramCache]: Analyzing trace with hash 953501939, now seen corresponding path program 1 times [2025-02-05 16:37:05,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:37:05,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590407109] [2025-02-05 16:37:05,043 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:37:05,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:37:05,062 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-02-05 16:37:05,114 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-02-05 16:37:05,114 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:37:05,115 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:37:05,506 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 13 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:37:05,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:37:05,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [590407109] [2025-02-05 16:37:05,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [590407109] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 16:37:05,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1996527832] [2025-02-05 16:37:05,507 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:37:05,507 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:37:05,507 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 16:37:05,509 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:37:05,511 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:37:05,591 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-02-05 16:37:05,662 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-02-05 16:37:05,666 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:37:05,667 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:37:05,676 INFO L256 TraceCheckSpWp]: Trace formula consists of 453 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-02-05 16:37:05,685 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 16:37:06,847 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:37:06,850 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 16:37:07,827 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:37:07,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1996527832] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 16:37:07,828 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 16:37:07,828 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 8] total 23 [2025-02-05 16:37:07,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444786164] [2025-02-05 16:37:07,828 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 16:37:07,828 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-02-05 16:37:07,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:37:07,829 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-02-05 16:37:07,829 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=410, Unknown=0, NotChecked=0, Total=506 [2025-02-05 16:37:07,829 INFO L87 Difference]: Start difference. First operand 23655 states and 35270 transitions. Second operand has 23 states, 23 states have (on average 12.130434782608695) internal successors, (279), 23 states have internal predecessors, (279), 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:37:14,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:37:14,154 INFO L93 Difference]: Finished difference Result 169118 states and 251973 transitions. [2025-02-05 16:37:14,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2025-02-05 16:37:14,155 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 12.130434782608695) internal successors, (279), 23 states have internal predecessors, (279), 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 96 [2025-02-05 16:37:14,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:37:14,518 INFO L225 Difference]: With dead ends: 169118 [2025-02-05 16:37:14,518 INFO L226 Difference]: Without dead ends: 145500 [2025-02-05 16:37:14,569 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 298 GetRequests, 179 SyntacticMatches, 0 SemanticMatches, 119 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5340 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=2788, Invalid=11732, Unknown=0, NotChecked=0, Total=14520 [2025-02-05 16:37:14,569 INFO L435 NwaCegarLoop]: 230 mSDtfsCounter, 13315 mSDsluCounter, 3155 mSDsCounter, 0 mSdLazyCounter, 3330 mSolverCounterSat, 138 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13315 SdHoareTripleChecker+Valid, 3385 SdHoareTripleChecker+Invalid, 3468 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 138 IncrementalHoareTripleChecker+Valid, 3330 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:37:14,570 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13315 Valid, 3385 Invalid, 3468 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [138 Valid, 3330 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-02-05 16:37:14,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145500 states. [2025-02-05 16:37:16,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145500 to 132416. [2025-02-05 16:37:16,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132416 states, 132415 states have (on average 1.4731865725182192) internal successors, (195072), 132415 states have internal predecessors, (195072), 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:37:17,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132416 states to 132416 states and 195072 transitions. [2025-02-05 16:37:17,033 INFO L78 Accepts]: Start accepts. Automaton has 132416 states and 195072 transitions. Word has length 96 [2025-02-05 16:37:17,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:37:17,034 INFO L471 AbstractCegarLoop]: Abstraction has 132416 states and 195072 transitions. [2025-02-05 16:37:17,034 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 12.130434782608695) internal successors, (279), 23 states have internal predecessors, (279), 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:37:17,034 INFO L276 IsEmpty]: Start isEmpty. Operand 132416 states and 195072 transitions. [2025-02-05 16:37:17,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-02-05 16:37:17,047 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:37:17,048 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:37:17,061 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-05 16:37:17,248 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,SelfDestructingSolverStorable9 [2025-02-05 16:37:17,249 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:37:17,250 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:37:17,250 INFO L85 PathProgramCache]: Analyzing trace with hash -487938543, now seen corresponding path program 1 times [2025-02-05 16:37:17,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:37:17,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [221403795] [2025-02-05 16:37:17,250 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:37:17,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:37:17,262 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-02-05 16:37:17,272 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-02-05 16:37:17,272 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:37:17,272 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:37:17,317 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:37:17,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:37:17,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [221403795] [2025-02-05 16:37:17,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [221403795] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:37:17,318 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:37:17,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:37:17,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [673842913] [2025-02-05 16:37:17,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:37:17,319 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:37:17,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:37:17,319 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:37:17,319 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:37:17,319 INFO L87 Difference]: Start difference. First operand 132416 states and 195072 transitions. Second operand has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 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:37:18,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:37:18,190 INFO L93 Difference]: Finished difference Result 338349 states and 497824 transitions. [2025-02-05 16:37:18,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:37:18,191 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 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 97 [2025-02-05 16:37:18,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:37:18,663 INFO L225 Difference]: With dead ends: 338349 [2025-02-05 16:37:18,663 INFO L226 Difference]: Without dead ends: 228377 [2025-02-05 16:37:18,719 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:37:18,720 INFO L435 NwaCegarLoop]: 195 mSDtfsCounter, 112 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 374 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:37:18,720 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 374 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:37:18,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228377 states. [2025-02-05 16:37:20,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228377 to 228375. [2025-02-05 16:37:21,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228375 states, 228374 states have (on average 1.4585986145533205) internal successors, (333106), 228374 states have internal predecessors, (333106), 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:37:21,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228375 states to 228375 states and 333106 transitions. [2025-02-05 16:37:21,849 INFO L78 Accepts]: Start accepts. Automaton has 228375 states and 333106 transitions. Word has length 97 [2025-02-05 16:37:21,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:37:21,850 INFO L471 AbstractCegarLoop]: Abstraction has 228375 states and 333106 transitions. [2025-02-05 16:37:21,850 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 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:37:21,850 INFO L276 IsEmpty]: Start isEmpty. Operand 228375 states and 333106 transitions. [2025-02-05 16:37:21,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-02-05 16:37:21,859 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:37:21,860 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:37:21,860 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-05 16:37:21,860 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:37:21,860 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:37:21,860 INFO L85 PathProgramCache]: Analyzing trace with hash 1557273135, now seen corresponding path program 1 times [2025-02-05 16:37:21,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:37:21,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [900715504] [2025-02-05 16:37:21,861 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:37:21,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:37:21,911 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-02-05 16:37:21,920 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-02-05 16:37:21,921 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:37:21,921 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:37:21,961 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:37:21,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:37:21,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [900715504] [2025-02-05 16:37:21,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [900715504] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:37:21,963 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:37:21,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:37:21,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753200605] [2025-02-05 16:37:21,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:37:21,963 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:37:21,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:37:21,963 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:37:21,963 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:37:21,963 INFO L87 Difference]: Start difference. First operand 228375 states and 333106 transitions. Second operand has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 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:37:23,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:37:23,933 INFO L93 Difference]: Finished difference Result 589640 states and 857759 transitions. [2025-02-05 16:37:23,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:37:23,933 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 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 97 [2025-02-05 16:37:23,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:37:24,478 INFO L225 Difference]: With dead ends: 589640 [2025-02-05 16:37:24,479 INFO L226 Difference]: Without dead ends: 383964 [2025-02-05 16:37:24,584 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:37:24,585 INFO L435 NwaCegarLoop]: 214 mSDtfsCounter, 113 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 393 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:37:24,585 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 393 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:37:24,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383964 states. [2025-02-05 16:37:29,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383964 to 375422. [2025-02-05 16:37:29,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 375422 states, 375421 states have (on average 1.4434221846939836) internal successors, (541891), 375421 states have internal predecessors, (541891), 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:37:30,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375422 states to 375422 states and 541891 transitions. [2025-02-05 16:37:30,295 INFO L78 Accepts]: Start accepts. Automaton has 375422 states and 541891 transitions. Word has length 97 [2025-02-05 16:37:30,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:37:30,296 INFO L471 AbstractCegarLoop]: Abstraction has 375422 states and 541891 transitions. [2025-02-05 16:37:30,296 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 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:37:30,296 INFO L276 IsEmpty]: Start isEmpty. Operand 375422 states and 541891 transitions. [2025-02-05 16:37:30,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-02-05 16:37:30,307 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:37:30,307 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:37:30,307 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-05 16:37:30,307 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:37:30,308 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:37:30,308 INFO L85 PathProgramCache]: Analyzing trace with hash 816066377, now seen corresponding path program 1 times [2025-02-05 16:37:30,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:37:30,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1767533127] [2025-02-05 16:37:30,308 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:37:30,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:37:30,321 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-02-05 16:37:30,327 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-02-05 16:37:30,331 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:37:30,331 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:37:30,381 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:37:30,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:37:30,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1767533127] [2025-02-05 16:37:30,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1767533127] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:37:30,381 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:37:30,382 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:37:30,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1840757264] [2025-02-05 16:37:30,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:37:30,382 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:37:30,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:37:30,383 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:37:30,383 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:37:30,383 INFO L87 Difference]: Start difference. First operand 375422 states and 541891 transitions. Second operand has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 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:37:33,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:37:33,794 INFO L93 Difference]: Finished difference Result 898065 states and 1291559 transitions. [2025-02-05 16:37:33,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:37:33,795 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 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 97 [2025-02-05 16:37:33,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:37:34,748 INFO L225 Difference]: With dead ends: 898065 [2025-02-05 16:37:34,749 INFO L226 Difference]: Without dead ends: 594222 [2025-02-05 16:37:34,975 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:37:34,977 INFO L435 NwaCegarLoop]: 233 mSDtfsCounter, 114 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 412 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:37:34,977 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 412 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:37:35,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 594222 states. [2025-02-05 16:37:41,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 594222 to 576980. [2025-02-05 16:37:42,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 576980 states, 576979 states have (on average 1.4262928113501532) internal successors, (822941), 576979 states have internal predecessors, (822941), 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:37:44,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 576980 states to 576980 states and 822941 transitions. [2025-02-05 16:37:44,169 INFO L78 Accepts]: Start accepts. Automaton has 576980 states and 822941 transitions. Word has length 97 [2025-02-05 16:37:44,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:37:44,169 INFO L471 AbstractCegarLoop]: Abstraction has 576980 states and 822941 transitions. [2025-02-05 16:37:44,169 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 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:37:44,169 INFO L276 IsEmpty]: Start isEmpty. Operand 576980 states and 822941 transitions. [2025-02-05 16:37:44,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-02-05 16:37:44,184 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:37:44,184 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:37:44,188 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-05 16:37:44,189 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:37:44,189 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:37:44,189 INFO L85 PathProgramCache]: Analyzing trace with hash 481354083, now seen corresponding path program 1 times [2025-02-05 16:37:44,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:37:44,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1695404045] [2025-02-05 16:37:44,189 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:37:44,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:37:44,214 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-02-05 16:37:44,228 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-02-05 16:37:44,231 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:37:44,231 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:37:44,374 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-02-05 16:37:44,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:37:44,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1695404045] [2025-02-05 16:37:44,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1695404045] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:37:44,375 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:37:44,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 16:37:44,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31354234] [2025-02-05 16:37:44,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:37:44,375 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 16:37:44,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:37:44,375 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 16:37:44,375 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-05 16:37:44,376 INFO L87 Difference]: Start difference. First operand 576980 states and 822941 transitions. Second operand has 7 states, 7 states have (on average 13.285714285714286) internal successors, (93), 7 states have internal predecessors, (93), 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)