./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.3.1.ufo.BOUNDED-6.pals.c.v+cfa-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.3.1.ufo.BOUNDED-6.pals.c.v+cfa-reducer.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 81fc918e1fab83089d488e981f8e2fc461bd57864199cdfbd6916c01a7d86fab --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 15:00:20,298 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 15:00:20,339 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 15:00:20,343 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 15:00:20,344 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 15:00:20,358 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 15:00:20,359 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 15:00:20,359 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 15:00:20,359 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 15:00:20,359 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 15:00:20,359 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 15:00:20,359 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 15:00:20,359 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 15:00:20,359 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 15:00:20,359 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 15:00:20,359 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 15:00:20,363 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 15:00:20,364 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 15:00:20,364 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 15:00:20,364 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 15:00:20,364 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 15:00:20,364 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 15:00:20,365 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 15:00:20,365 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 15:00:20,365 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 15:00:20,365 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 15:00:20,366 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 15:00:20,366 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 15:00:20,366 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 15:00:20,366 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 15:00:20,366 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 15:00:20,366 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 15:00:20,366 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 15:00:20,366 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 15:00:20,366 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 15:00:20,366 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 15:00:20,366 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 15:00:20,367 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 15:00:20,367 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 15:00:20,367 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 15:00:20,367 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 15:00:20,367 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 15:00:20,367 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 15:00:20,367 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/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 -> 81fc918e1fab83089d488e981f8e2fc461bd57864199cdfbd6916c01a7d86fab [2025-03-03 15:00:20,594 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 15:00:20,602 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 15:00:20,604 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 15:00:20,605 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 15:00:20,605 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 15:00:20,606 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.3.1.ufo.BOUNDED-6.pals.c.v+cfa-reducer.c [2025-03-03 15:00:21,693 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9fc89da77/36d4be94f627462fb82e1f87667f4d38/FLAGf11b9974b [2025-03-03 15:00:21,927 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 15:00:21,928 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.3.1.ufo.BOUNDED-6.pals.c.v+cfa-reducer.c [2025-03-03 15:00:21,935 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9fc89da77/36d4be94f627462fb82e1f87667f4d38/FLAGf11b9974b [2025-03-03 15:00:22,258 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9fc89da77/36d4be94f627462fb82e1f87667f4d38 [2025-03-03 15:00:22,260 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 15:00:22,261 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 15:00:22,261 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 15:00:22,261 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 15:00:22,264 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 15:00:22,264 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 03:00:22" (1/1) ... [2025-03-03 15:00:22,265 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@762e98ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:00:22, skipping insertion in model container [2025-03-03 15:00:22,265 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 03:00:22" (1/1) ... [2025-03-03 15:00:22,291 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 15:00:22,416 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.3.1.ufo.BOUNDED-6.pals.c.v+cfa-reducer.c[7067,7080] [2025-03-03 15:00:22,437 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 15:00:22,447 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 15:00:22,479 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.3.1.ufo.BOUNDED-6.pals.c.v+cfa-reducer.c[7067,7080] [2025-03-03 15:00:22,489 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 15:00:22,502 INFO L204 MainTranslator]: Completed translation [2025-03-03 15:00:22,503 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:00:22 WrapperNode [2025-03-03 15:00:22,503 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 15:00:22,504 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 15:00:22,504 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 15:00:22,504 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 15:00:22,508 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:00:22" (1/1) ... [2025-03-03 15:00:22,515 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:00:22" (1/1) ... [2025-03-03 15:00:22,533 INFO L138 Inliner]: procedures = 22, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 615 [2025-03-03 15:00:22,533 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 15:00:22,534 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 15:00:22,534 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 15:00:22,534 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 15:00:22,540 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:00:22" (1/1) ... [2025-03-03 15:00:22,541 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:00:22" (1/1) ... [2025-03-03 15:00:22,543 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:00:22" (1/1) ... [2025-03-03 15:00:22,556 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-03-03 15:00:22,556 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:00:22" (1/1) ... [2025-03-03 15:00:22,556 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:00:22" (1/1) ... [2025-03-03 15:00:22,562 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:00:22" (1/1) ... [2025-03-03 15:00:22,563 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:00:22" (1/1) ... [2025-03-03 15:00:22,564 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:00:22" (1/1) ... [2025-03-03 15:00:22,565 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:00:22" (1/1) ... [2025-03-03 15:00:22,567 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 15:00:22,569 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 15:00:22,572 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 15:00:22,572 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 15:00:22,572 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:00:22" (1/1) ... [2025-03-03 15:00:22,577 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 15:00:22,586 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 15:00:22,597 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 15:00:22,600 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 15:00:22,617 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 15:00:22,617 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 15:00:22,617 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 15:00:22,617 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 15:00:22,706 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 15:00:22,708 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 15:00:23,159 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L503: havoc main_~node3____CPAchecker_TMP_1~0#1;havoc main_~node3____CPAchecker_TMP_0~0#1; [2025-03-03 15:00:23,159 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L371: havoc main_~main____CPAchecker_TMP_0~0#1;havoc main_~__tmp_1~0#1, main_~assert__arg~0#1;havoc main_~check__tmp~0#1; [2025-03-03 15:00:23,159 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L604: havoc main_~node2____CPAchecker_TMP_1~0#1;havoc main_~node2____CPAchecker_TMP_0~0#1; [2025-03-03 15:00:23,159 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L705: havoc main_~node1____CPAchecker_TMP_1~0#1;havoc main_~node1____CPAchecker_TMP_0~0#1; [2025-03-03 15:00:23,159 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L113: havoc main_~init__r121~0#1, main_~init__r131~0#1, main_~init__r211~0#1, main_~init__r231~0#1, main_~init__r311~0#1, main_~init__r321~0#1, main_~init__r122~0#1, main_~init__tmp~0#1, main_~init__r132~0#1, main_~init__tmp___0~0#1, main_~init__r212~0#1, main_~init__tmp___1~0#1, main_~init__r232~0#1, main_~init__tmp___2~0#1, main_~init__r312~0#1, main_~init__tmp___3~0#1, main_~init__r322~0#1, main_~init__tmp___4~0#1, main_~init__tmp___5~0#1; [2025-03-03 15:00:23,181 INFO L? ?]: Removed 42 outVars from TransFormulas that were not future-live. [2025-03-03 15:00:23,181 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 15:00:23,192 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 15:00:23,192 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 15:00:23,193 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 03:00:23 BoogieIcfgContainer [2025-03-03 15:00:23,193 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 15:00:23,195 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 15:00:23,195 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 15:00:23,198 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 15:00:23,198 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 03:00:22" (1/3) ... [2025-03-03 15:00:23,199 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@691acdf1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 03:00:23, skipping insertion in model container [2025-03-03 15:00:23,199 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:00:22" (2/3) ... [2025-03-03 15:00:23,199 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@691acdf1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 03:00:23, skipping insertion in model container [2025-03-03 15:00:23,199 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 03:00:23" (3/3) ... [2025-03-03 15:00:23,200 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_floodmax.3.1.ufo.BOUNDED-6.pals.c.v+cfa-reducer.c [2025-03-03 15:00:23,209 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 15:00:23,211 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_floodmax.3.1.ufo.BOUNDED-6.pals.c.v+cfa-reducer.c that has 1 procedures, 129 locations, 1 initial locations, 0 loop locations, and 1 error locations. [2025-03-03 15:00:23,249 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 15:00:23,257 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;@402e950f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 15:00:23,257 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 15:00:23,259 INFO L276 IsEmpty]: Start isEmpty. Operand has 129 states, 127 states have (on average 1.763779527559055) internal successors, (224), 128 states have internal predecessors, (224), 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-03-03 15:00:23,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-03-03 15:00:23,265 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:00:23,265 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] [2025-03-03 15:00:23,266 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:00:23,268 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:00:23,269 INFO L85 PathProgramCache]: Analyzing trace with hash 314063202, now seen corresponding path program 1 times [2025-03-03 15:00:23,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:00:23,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606877038] [2025-03-03 15:00:23,274 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:00:23,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:00:23,339 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-03 15:00:23,418 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-03 15:00:23,419 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:00:23,419 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:00:23,600 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:00:23,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:00:23,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [606877038] [2025-03-03 15:00:23,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [606877038] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:00:23,600 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:00:23,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:00:23,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2020026727] [2025-03-03 15:00:23,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:00:23,604 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:00:23,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:00:23,614 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:00:23,614 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:00:23,616 INFO L87 Difference]: Start difference. First operand has 129 states, 127 states have (on average 1.763779527559055) internal successors, (224), 128 states have internal predecessors, (224), 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 17.0) internal successors, (51), 3 states have internal predecessors, (51), 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-03-03 15:00:23,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:00:23,676 INFO L93 Difference]: Finished difference Result 282 states and 479 transitions. [2025-03-03 15:00:23,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:00:23,678 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2025-03-03 15:00:23,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:00:23,684 INFO L225 Difference]: With dead ends: 282 [2025-03-03 15:00:23,684 INFO L226 Difference]: Without dead ends: 195 [2025-03-03 15:00:23,687 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-03-03 15:00:23,689 INFO L435 NwaCegarLoop]: 224 mSDtfsCounter, 125 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 400 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:00:23,690 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 400 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:00:23,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2025-03-03 15:00:23,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 193. [2025-03-03 15:00:23,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 192 states have (on average 1.5989583333333333) internal successors, (307), 192 states have internal predecessors, (307), 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-03-03 15:00:23,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 307 transitions. [2025-03-03 15:00:23,716 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 307 transitions. Word has length 51 [2025-03-03 15:00:23,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:00:23,716 INFO L471 AbstractCegarLoop]: Abstraction has 193 states and 307 transitions. [2025-03-03 15:00:23,717 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 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-03-03 15:00:23,717 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 307 transitions. [2025-03-03 15:00:23,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-03-03 15:00:23,719 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:00:23,719 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] [2025-03-03 15:00:23,719 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 15:00:23,719 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:00:23,719 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:00:23,719 INFO L85 PathProgramCache]: Analyzing trace with hash -235111179, now seen corresponding path program 1 times [2025-03-03 15:00:23,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:00:23,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [698553368] [2025-03-03 15:00:23,720 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:00:23,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:00:23,740 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-03-03 15:00:23,755 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-03-03 15:00:23,755 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:00:23,755 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:00:23,828 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:00:23,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:00:23,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [698553368] [2025-03-03 15:00:23,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [698553368] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:00:23,828 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:00:23,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:00:23,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1146310393] [2025-03-03 15:00:23,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:00:23,830 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:00:23,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:00:23,831 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:00:23,831 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:00:23,831 INFO L87 Difference]: Start difference. First operand 193 states and 307 transitions. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 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-03-03 15:00:23,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:00:23,860 INFO L93 Difference]: Finished difference Result 469 states and 763 transitions. [2025-03-03 15:00:23,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:00:23,861 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 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 53 [2025-03-03 15:00:23,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:00:23,862 INFO L225 Difference]: With dead ends: 469 [2025-03-03 15:00:23,862 INFO L226 Difference]: Without dead ends: 324 [2025-03-03 15:00:23,863 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-03-03 15:00:23,863 INFO L435 NwaCegarLoop]: 196 mSDtfsCounter, 110 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 372 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:00:23,863 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 372 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:00:23,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2025-03-03 15:00:23,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 322. [2025-03-03 15:00:23,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 322 states, 321 states have (on average 1.6168224299065421) internal successors, (519), 321 states have internal predecessors, (519), 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-03-03 15:00:23,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 519 transitions. [2025-03-03 15:00:23,878 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 519 transitions. Word has length 53 [2025-03-03 15:00:23,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:00:23,879 INFO L471 AbstractCegarLoop]: Abstraction has 322 states and 519 transitions. [2025-03-03 15:00:23,879 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 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-03-03 15:00:23,879 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 519 transitions. [2025-03-03 15:00:23,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-03-03 15:00:23,880 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:00:23,880 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] [2025-03-03 15:00:23,880 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 15:00:23,880 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:00:23,881 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:00:23,881 INFO L85 PathProgramCache]: Analyzing trace with hash 408377762, now seen corresponding path program 1 times [2025-03-03 15:00:23,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:00:23,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118618860] [2025-03-03 15:00:23,881 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:00:23,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:00:23,899 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-03 15:00:23,923 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-03 15:00:23,923 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:00:23,923 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:00:24,017 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:00:24,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:00:24,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2118618860] [2025-03-03 15:00:24,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2118618860] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:00:24,019 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:00:24,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:00:24,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084610902] [2025-03-03 15:00:24,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:00:24,019 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:00:24,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:00:24,020 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:00:24,020 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:00:24,020 INFO L87 Difference]: Start difference. First operand 322 states and 519 transitions. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:00:24,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:00:24,047 INFO L93 Difference]: Finished difference Result 842 states and 1373 transitions. [2025-03-03 15:00:24,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:00:24,048 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 55 [2025-03-03 15:00:24,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:00:24,050 INFO L225 Difference]: With dead ends: 842 [2025-03-03 15:00:24,050 INFO L226 Difference]: Without dead ends: 568 [2025-03-03 15:00:24,051 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-03-03 15:00:24,051 INFO L435 NwaCegarLoop]: 196 mSDtfsCounter, 105 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 373 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:00:24,051 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 373 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:00:24,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 568 states. [2025-03-03 15:00:24,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 568 to 566. [2025-03-03 15:00:24,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 566 states, 565 states have (on average 1.6194690265486726) internal successors, (915), 565 states have internal predecessors, (915), 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-03-03 15:00:24,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 566 states to 566 states and 915 transitions. [2025-03-03 15:00:24,078 INFO L78 Accepts]: Start accepts. Automaton has 566 states and 915 transitions. Word has length 55 [2025-03-03 15:00:24,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:00:24,078 INFO L471 AbstractCegarLoop]: Abstraction has 566 states and 915 transitions. [2025-03-03 15:00:24,078 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:00:24,078 INFO L276 IsEmpty]: Start isEmpty. Operand 566 states and 915 transitions. [2025-03-03 15:00:24,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-03-03 15:00:24,081 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:00:24,081 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] [2025-03-03 15:00:24,081 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 15:00:24,081 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:00:24,082 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:00:24,082 INFO L85 PathProgramCache]: Analyzing trace with hash -1936495755, now seen corresponding path program 1 times [2025-03-03 15:00:24,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:00:24,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146724643] [2025-03-03 15:00:24,082 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:00:24,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:00:24,094 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-03 15:00:24,106 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-03 15:00:24,110 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:00:24,111 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:00:24,205 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:00:24,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:00:24,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146724643] [2025-03-03 15:00:24,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [146724643] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:00:24,205 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:00:24,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 15:00:24,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792893951] [2025-03-03 15:00:24,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:00:24,205 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:00:24,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:00:24,206 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:00:24,206 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:00:24,206 INFO L87 Difference]: Start difference. First operand 566 states and 915 transitions. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:00:24,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:00:24,350 INFO L93 Difference]: Finished difference Result 2446 states and 4041 transitions. [2025-03-03 15:00:24,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 15:00:24,350 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 57 [2025-03-03 15:00:24,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:00:24,356 INFO L225 Difference]: With dead ends: 2446 [2025-03-03 15:00:24,356 INFO L226 Difference]: Without dead ends: 1928 [2025-03-03 15:00:24,358 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-03-03 15:00:24,358 INFO L435 NwaCegarLoop]: 193 mSDtfsCounter, 850 mSDsluCounter, 1002 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 850 SdHoareTripleChecker+Valid, 1195 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:00:24,358 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [850 Valid, 1195 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 15:00:24,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1928 states. [2025-03-03 15:00:24,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1928 to 1017. [2025-03-03 15:00:24,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1017 states, 1016 states have (on average 1.6289370078740157) internal successors, (1655), 1016 states have internal predecessors, (1655), 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-03-03 15:00:24,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1017 states to 1017 states and 1655 transitions. [2025-03-03 15:00:24,392 INFO L78 Accepts]: Start accepts. Automaton has 1017 states and 1655 transitions. Word has length 57 [2025-03-03 15:00:24,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:00:24,393 INFO L471 AbstractCegarLoop]: Abstraction has 1017 states and 1655 transitions. [2025-03-03 15:00:24,393 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:00:24,393 INFO L276 IsEmpty]: Start isEmpty. Operand 1017 states and 1655 transitions. [2025-03-03 15:00:24,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-03-03 15:00:24,395 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:00:24,395 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] [2025-03-03 15:00:24,396 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 15:00:24,396 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:00:24,396 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:00:24,396 INFO L85 PathProgramCache]: Analyzing trace with hash 100052624, now seen corresponding path program 1 times [2025-03-03 15:00:24,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:00:24,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1648925060] [2025-03-03 15:00:24,397 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:00:24,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:00:24,410 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-03 15:00:24,431 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-03 15:00:24,431 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:00:24,431 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:00:24,494 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:00:24,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:00:24,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1648925060] [2025-03-03 15:00:24,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1648925060] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:00:24,495 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:00:24,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 15:00:24,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [736103106] [2025-03-03 15:00:24,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:00:24,496 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 15:00:24,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:00:24,496 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 15:00:24,496 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 15:00:24,496 INFO L87 Difference]: Start difference. First operand 1017 states and 1655 transitions. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:00:24,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:00:24,569 INFO L93 Difference]: Finished difference Result 2970 states and 4896 transitions. [2025-03-03 15:00:24,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 15:00:24,570 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2025-03-03 15:00:24,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:00:24,577 INFO L225 Difference]: With dead ends: 2970 [2025-03-03 15:00:24,577 INFO L226 Difference]: Without dead ends: 2001 [2025-03-03 15:00:24,579 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:00:24,581 INFO L435 NwaCegarLoop]: 191 mSDtfsCounter, 379 mSDsluCounter, 469 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 379 SdHoareTripleChecker+Valid, 660 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:00:24,581 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [379 Valid, 660 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:00:24,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2001 states. [2025-03-03 15:00:24,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2001 to 1500. [2025-03-03 15:00:24,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1500 states, 1499 states have (on average 1.6357571714476318) internal successors, (2452), 1499 states have internal predecessors, (2452), 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-03-03 15:00:24,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1500 states to 1500 states and 2452 transitions. [2025-03-03 15:00:24,625 INFO L78 Accepts]: Start accepts. Automaton has 1500 states and 2452 transitions. Word has length 58 [2025-03-03 15:00:24,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:00:24,625 INFO L471 AbstractCegarLoop]: Abstraction has 1500 states and 2452 transitions. [2025-03-03 15:00:24,625 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:00:24,625 INFO L276 IsEmpty]: Start isEmpty. Operand 1500 states and 2452 transitions. [2025-03-03 15:00:24,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-03-03 15:00:24,626 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:00:24,626 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] [2025-03-03 15:00:24,626 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 15:00:24,627 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:00:24,627 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:00:24,627 INFO L85 PathProgramCache]: Analyzing trace with hash 1578778962, now seen corresponding path program 1 times [2025-03-03 15:00:24,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:00:24,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297887272] [2025-03-03 15:00:24,629 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:00:24,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:00:24,643 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-03 15:00:24,656 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-03 15:00:24,656 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:00:24,657 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:00:24,697 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:00:24,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:00:24,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [297887272] [2025-03-03 15:00:24,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [297887272] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:00:24,699 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:00:24,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:00:24,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51020634] [2025-03-03 15:00:24,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:00:24,699 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:00:24,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:00:24,700 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:00:24,700 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:00:24,700 INFO L87 Difference]: Start difference. First operand 1500 states and 2452 transitions. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:00:24,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:00:24,727 INFO L93 Difference]: Finished difference Result 3035 states and 4988 transitions. [2025-03-03 15:00:24,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:00:24,727 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2025-03-03 15:00:24,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:00:24,735 INFO L225 Difference]: With dead ends: 3035 [2025-03-03 15:00:24,735 INFO L226 Difference]: Without dead ends: 2211 [2025-03-03 15:00:24,737 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-03-03 15:00:24,738 INFO L435 NwaCegarLoop]: 228 mSDtfsCounter, 106 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 400 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-03-03 15:00:24,738 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 400 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:00:24,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2211 states. [2025-03-03 15:00:24,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2211 to 2209. [2025-03-03 15:00:24,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2209 states, 2208 states have (on average 1.6304347826086956) internal successors, (3600), 2208 states have internal predecessors, (3600), 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-03-03 15:00:24,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2209 states to 2209 states and 3600 transitions. [2025-03-03 15:00:24,783 INFO L78 Accepts]: Start accepts. Automaton has 2209 states and 3600 transitions. Word has length 58 [2025-03-03 15:00:24,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:00:24,784 INFO L471 AbstractCegarLoop]: Abstraction has 2209 states and 3600 transitions. [2025-03-03 15:00:24,784 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:00:24,785 INFO L276 IsEmpty]: Start isEmpty. Operand 2209 states and 3600 transitions. [2025-03-03 15:00:24,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-03-03 15:00:24,785 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:00:24,785 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] [2025-03-03 15:00:24,786 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 15:00:24,787 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:00:24,787 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:00:24,787 INFO L85 PathProgramCache]: Analyzing trace with hash 1938462547, now seen corresponding path program 1 times [2025-03-03 15:00:24,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:00:24,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1454164142] [2025-03-03 15:00:24,788 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:00:24,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:00:24,799 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-03 15:00:24,811 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-03 15:00:24,812 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:00:24,812 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:00:24,854 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:00:24,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:00:24,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1454164142] [2025-03-03 15:00:24,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1454164142] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:00:24,854 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:00:24,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:00:24,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081089133] [2025-03-03 15:00:24,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:00:24,854 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:00:24,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:00:24,855 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:00:24,855 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:00:24,855 INFO L87 Difference]: Start difference. First operand 2209 states and 3600 transitions. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:00:24,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:00:24,890 INFO L93 Difference]: Finished difference Result 4151 states and 6806 transitions. [2025-03-03 15:00:24,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:00:24,890 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2025-03-03 15:00:24,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:00:24,899 INFO L225 Difference]: With dead ends: 4151 [2025-03-03 15:00:24,899 INFO L226 Difference]: Without dead ends: 2973 [2025-03-03 15:00:24,901 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-03-03 15:00:24,902 INFO L435 NwaCegarLoop]: 261 mSDtfsCounter, 111 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 432 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-03-03 15:00:24,903 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 432 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:00:24,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2973 states. [2025-03-03 15:00:24,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2973 to 2971. [2025-03-03 15:00:24,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2971 states, 2970 states have (on average 1.626936026936027) internal successors, (4832), 2970 states have internal predecessors, (4832), 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-03-03 15:00:24,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2971 states to 2971 states and 4832 transitions. [2025-03-03 15:00:24,954 INFO L78 Accepts]: Start accepts. Automaton has 2971 states and 4832 transitions. Word has length 58 [2025-03-03 15:00:24,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:00:24,954 INFO L471 AbstractCegarLoop]: Abstraction has 2971 states and 4832 transitions. [2025-03-03 15:00:24,954 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:00:24,954 INFO L276 IsEmpty]: Start isEmpty. Operand 2971 states and 4832 transitions. [2025-03-03 15:00:24,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-03-03 15:00:24,956 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:00:24,957 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] [2025-03-03 15:00:24,957 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 15:00:24,957 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:00:24,957 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:00:24,957 INFO L85 PathProgramCache]: Analyzing trace with hash 110418418, now seen corresponding path program 1 times [2025-03-03 15:00:24,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:00:24,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1101004487] [2025-03-03 15:00:24,957 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:00:24,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:00:24,969 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-03 15:00:24,977 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-03 15:00:24,977 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:00:24,977 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:00:25,014 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:00:25,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:00:25,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1101004487] [2025-03-03 15:00:25,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1101004487] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:00:25,015 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:00:25,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:00:25,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389727469] [2025-03-03 15:00:25,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:00:25,015 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:00:25,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:00:25,015 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:00:25,015 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:00:25,016 INFO L87 Difference]: Start difference. First operand 2971 states and 4832 transitions. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:00:25,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:00:25,062 INFO L93 Difference]: Finished difference Result 6393 states and 10544 transitions. [2025-03-03 15:00:25,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:00:25,063 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2025-03-03 15:00:25,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:00:25,074 INFO L225 Difference]: With dead ends: 6393 [2025-03-03 15:00:25,075 INFO L226 Difference]: Without dead ends: 4307 [2025-03-03 15:00:25,077 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-03-03 15:00:25,077 INFO L435 NwaCegarLoop]: 285 mSDtfsCounter, 116 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 455 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-03-03 15:00:25,077 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 455 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:00:25,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4307 states. [2025-03-03 15:00:25,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4307 to 4305. [2025-03-03 15:00:25,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4305 states, 4304 states have (on average 1.634061338289963) internal successors, (7033), 4304 states have internal predecessors, (7033), 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-03-03 15:00:25,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4305 states to 4305 states and 7033 transitions. [2025-03-03 15:00:25,143 INFO L78 Accepts]: Start accepts. Automaton has 4305 states and 7033 transitions. Word has length 58 [2025-03-03 15:00:25,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:00:25,144 INFO L471 AbstractCegarLoop]: Abstraction has 4305 states and 7033 transitions. [2025-03-03 15:00:25,144 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:00:25,144 INFO L276 IsEmpty]: Start isEmpty. Operand 4305 states and 7033 transitions. [2025-03-03 15:00:25,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-03-03 15:00:25,147 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:00:25,147 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] [2025-03-03 15:00:25,147 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 15:00:25,147 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:00:25,147 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:00:25,147 INFO L85 PathProgramCache]: Analyzing trace with hash -1191546440, now seen corresponding path program 1 times [2025-03-03 15:00:25,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:00:25,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1706778233] [2025-03-03 15:00:25,148 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:00:25,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:00:25,158 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-03-03 15:00:25,168 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-03-03 15:00:25,170 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:00:25,170 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:00:25,234 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:00:25,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:00:25,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1706778233] [2025-03-03 15:00:25,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1706778233] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:00:25,234 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:00:25,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 15:00:25,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [371531304] [2025-03-03 15:00:25,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:00:25,235 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 15:00:25,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:00:25,236 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 15:00:25,236 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 15:00:25,236 INFO L87 Difference]: Start difference. First operand 4305 states and 7033 transitions. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:00:25,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:00:25,365 INFO L93 Difference]: Finished difference Result 13696 states and 22476 transitions. [2025-03-03 15:00:25,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 15:00:25,366 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 59 [2025-03-03 15:00:25,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:00:25,398 INFO L225 Difference]: With dead ends: 13696 [2025-03-03 15:00:25,401 INFO L226 Difference]: Without dead ends: 9467 [2025-03-03 15:00:25,407 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:00:25,408 INFO L435 NwaCegarLoop]: 187 mSDtfsCounter, 377 mSDsluCounter, 471 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 377 SdHoareTripleChecker+Valid, 658 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:00:25,408 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [377 Valid, 658 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:00:25,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9467 states. [2025-03-03 15:00:25,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9467 to 6857. [2025-03-03 15:00:25,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6857 states, 6856 states have (on average 1.6270420070011669) internal successors, (11155), 6856 states have internal predecessors, (11155), 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-03-03 15:00:25,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6857 states to 6857 states and 11155 transitions. [2025-03-03 15:00:25,539 INFO L78 Accepts]: Start accepts. Automaton has 6857 states and 11155 transitions. Word has length 59 [2025-03-03 15:00:25,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:00:25,539 INFO L471 AbstractCegarLoop]: Abstraction has 6857 states and 11155 transitions. [2025-03-03 15:00:25,539 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:00:25,539 INFO L276 IsEmpty]: Start isEmpty. Operand 6857 states and 11155 transitions. [2025-03-03 15:00:25,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-03-03 15:00:25,540 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:00:25,540 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:00:25,540 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 15:00:25,540 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:00:25,541 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:00:25,541 INFO L85 PathProgramCache]: Analyzing trace with hash 1718466163, now seen corresponding path program 1 times [2025-03-03 15:00:25,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:00:25,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823817437] [2025-03-03 15:00:25,542 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:00:25,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:00:25,554 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-03-03 15:00:25,564 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-03-03 15:00:25,565 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:00:25,565 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:00:25,639 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:00:25,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:00:25,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [823817437] [2025-03-03 15:00:25,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [823817437] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:00:25,640 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:00:25,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 15:00:25,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [648624042] [2025-03-03 15:00:25,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:00:25,641 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 15:00:25,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:00:25,641 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 15:00:25,641 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 15:00:25,641 INFO L87 Difference]: Start difference. First operand 6857 states and 11155 transitions. Second operand has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:00:25,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:00:25,729 INFO L93 Difference]: Finished difference Result 21428 states and 34988 transitions. [2025-03-03 15:00:25,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 15:00:25,729 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2025-03-03 15:00:25,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:00:25,756 INFO L225 Difference]: With dead ends: 21428 [2025-03-03 15:00:25,756 INFO L226 Difference]: Without dead ends: 14647 [2025-03-03 15:00:25,767 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:00:25,767 INFO L435 NwaCegarLoop]: 188 mSDtfsCounter, 375 mSDsluCounter, 473 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 375 SdHoareTripleChecker+Valid, 661 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:00:25,768 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [375 Valid, 661 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:00:25,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14647 states. [2025-03-03 15:00:25,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14647 to 10709. [2025-03-03 15:00:25,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10709 states, 10708 states have (on average 1.6194434067986552) internal successors, (17341), 10708 states have internal predecessors, (17341), 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-03-03 15:00:25,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10709 states to 10709 states and 17341 transitions. [2025-03-03 15:00:25,985 INFO L78 Accepts]: Start accepts. Automaton has 10709 states and 17341 transitions. Word has length 60 [2025-03-03 15:00:25,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:00:25,985 INFO L471 AbstractCegarLoop]: Abstraction has 10709 states and 17341 transitions. [2025-03-03 15:00:25,986 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:00:25,986 INFO L276 IsEmpty]: Start isEmpty. Operand 10709 states and 17341 transitions. [2025-03-03 15:00:25,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-03-03 15:00:25,986 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:00:25,986 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:00:25,986 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 15:00:25,987 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:00:25,987 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:00:25,987 INFO L85 PathProgramCache]: Analyzing trace with hash -2064941387, now seen corresponding path program 1 times [2025-03-03 15:00:25,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:00:25,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881990370] [2025-03-03 15:00:25,987 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:00:25,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:00:25,998 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-03 15:00:26,007 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-03 15:00:26,007 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:00:26,007 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:00:26,147 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:00:26,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:00:26,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1881990370] [2025-03-03 15:00:26,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1881990370] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:00:26,148 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:00:26,148 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 15:00:26,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969225151] [2025-03-03 15:00:26,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:00:26,148 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:00:26,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:00:26,149 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:00:26,149 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:00:26,149 INFO L87 Difference]: Start difference. First operand 10709 states and 17341 transitions. Second operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 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-03-03 15:00:26,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:00:26,290 INFO L93 Difference]: Finished difference Result 21344 states and 34577 transitions. [2025-03-03 15:00:26,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 15:00:26,291 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 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-03-03 15:00:26,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:00:26,308 INFO L225 Difference]: With dead ends: 21344 [2025-03-03 15:00:26,308 INFO L226 Difference]: Without dead ends: 10711 [2025-03-03 15:00:26,320 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:00:26,321 INFO L435 NwaCegarLoop]: 193 mSDtfsCounter, 209 mSDsluCounter, 342 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 209 SdHoareTripleChecker+Valid, 535 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:00:26,322 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [209 Valid, 535 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 15:00:26,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10711 states. [2025-03-03 15:00:26,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10711 to 10709. [2025-03-03 15:00:26,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10709 states, 10708 states have (on average 1.6077698916697796) internal successors, (17216), 10708 states have internal predecessors, (17216), 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-03-03 15:00:26,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10709 states to 10709 states and 17216 transitions. [2025-03-03 15:00:26,515 INFO L78 Accepts]: Start accepts. Automaton has 10709 states and 17216 transitions. Word has length 62 [2025-03-03 15:00:26,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:00:26,515 INFO L471 AbstractCegarLoop]: Abstraction has 10709 states and 17216 transitions. [2025-03-03 15:00:26,515 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 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-03-03 15:00:26,515 INFO L276 IsEmpty]: Start isEmpty. Operand 10709 states and 17216 transitions. [2025-03-03 15:00:26,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-03-03 15:00:26,516 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:00:26,516 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-03-03 15:00:26,516 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-03 15:00:26,516 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:00:26,516 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:00:26,516 INFO L85 PathProgramCache]: Analyzing trace with hash 1535307746, now seen corresponding path program 1 times [2025-03-03 15:00:26,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:00:26,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [793167254] [2025-03-03 15:00:26,517 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:00:26,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:00:26,528 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-03 15:00:26,538 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-03 15:00:26,538 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:00:26,538 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:00:26,674 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:00:26,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:00:26,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [793167254] [2025-03-03 15:00:26,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [793167254] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:00:26,675 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:00:26,675 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 15:00:26,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [420940753] [2025-03-03 15:00:26,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:00:26,675 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:00:26,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:00:26,676 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:00:26,676 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:00:26,676 INFO L87 Difference]: Start difference. First operand 10709 states and 17216 transitions. Second operand has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 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-03-03 15:00:26,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:00:26,799 INFO L93 Difference]: Finished difference Result 30654 states and 49431 transitions. [2025-03-03 15:00:26,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 15:00:26,800 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 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-03-03 15:00:26,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:00:26,837 INFO L225 Difference]: With dead ends: 30654 [2025-03-03 15:00:26,837 INFO L226 Difference]: Without dead ends: 20021 [2025-03-03 15:00:26,855 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:00:26,856 INFO L435 NwaCegarLoop]: 188 mSDtfsCounter, 307 mSDsluCounter, 352 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 307 SdHoareTripleChecker+Valid, 540 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:00:26,856 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [307 Valid, 540 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:00:26,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20021 states. [2025-03-03 15:00:27,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20021 to 20019. [2025-03-03 15:00:27,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20019 states, 20018 states have (on average 1.5951143970426616) internal successors, (31931), 20018 states have internal predecessors, (31931), 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-03-03 15:00:27,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20019 states to 20019 states and 31931 transitions. [2025-03-03 15:00:27,154 INFO L78 Accepts]: Start accepts. Automaton has 20019 states and 31931 transitions. Word has length 65 [2025-03-03 15:00:27,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:00:27,154 INFO L471 AbstractCegarLoop]: Abstraction has 20019 states and 31931 transitions. [2025-03-03 15:00:27,155 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 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-03-03 15:00:27,155 INFO L276 IsEmpty]: Start isEmpty. Operand 20019 states and 31931 transitions. [2025-03-03 15:00:27,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-03-03 15:00:27,155 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:00:27,155 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-03-03 15:00:27,155 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-03 15:00:27,155 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:00:27,157 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:00:27,157 INFO L85 PathProgramCache]: Analyzing trace with hash 350855234, now seen corresponding path program 1 times [2025-03-03 15:00:27,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:00:27,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1699380026] [2025-03-03 15:00:27,157 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:00:27,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:00:27,243 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-03 15:00:27,265 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-03 15:00:27,265 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:00:27,265 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:00:27,470 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:00:27,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:00:27,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1699380026] [2025-03-03 15:00:27,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1699380026] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:00:27,470 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:00:27,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 15:00:27,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244572989] [2025-03-03 15:00:27,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:00:27,471 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:00:27,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:00:27,471 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:00:27,471 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:00:27,472 INFO L87 Difference]: Start difference. First operand 20019 states and 31931 transitions. Second operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 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-03-03 15:00:27,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:00:27,589 INFO L93 Difference]: Finished difference Result 20745 states and 33018 transitions. [2025-03-03 15:00:27,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 15:00:27,590 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 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-03-03 15:00:27,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:00:27,621 INFO L225 Difference]: With dead ends: 20745 [2025-03-03 15:00:27,621 INFO L226 Difference]: Without dead ends: 20743 [2025-03-03 15:00:27,627 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-03-03 15:00:27,628 INFO L435 NwaCegarLoop]: 195 mSDtfsCounter, 0 mSDsluCounter, 568 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 763 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:00:27,628 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 763 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:00:27,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20743 states. [2025-03-03 15:00:27,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20743 to 20743. [2025-03-03 15:00:27,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20743 states, 20742 states have (on average 1.5739080127277987) internal successors, (32646), 20742 states have internal predecessors, (32646), 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-03-03 15:00:27,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20743 states to 20743 states and 32646 transitions. [2025-03-03 15:00:27,932 INFO L78 Accepts]: Start accepts. Automaton has 20743 states and 32646 transitions. Word has length 66 [2025-03-03 15:00:27,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:00:27,932 INFO L471 AbstractCegarLoop]: Abstraction has 20743 states and 32646 transitions. [2025-03-03 15:00:27,932 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 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-03-03 15:00:27,932 INFO L276 IsEmpty]: Start isEmpty. Operand 20743 states and 32646 transitions. [2025-03-03 15:00:27,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-03-03 15:00:27,934 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:00:27,935 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:00:27,935 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-03 15:00:27,935 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:00:27,936 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:00:27,936 INFO L85 PathProgramCache]: Analyzing trace with hash -1676669316, now seen corresponding path program 1 times [2025-03-03 15:00:27,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:00:27,936 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649080946] [2025-03-03 15:00:27,936 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:00:27,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:00:27,978 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-03-03 15:00:27,990 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-03-03 15:00:27,990 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:00:27,990 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:00:28,088 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-03 15:00:28,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:00:28,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1649080946] [2025-03-03 15:00:28,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1649080946] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:00:28,089 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:00:28,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 15:00:28,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1680903145] [2025-03-03 15:00:28,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:00:28,089 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:00:28,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:00:28,090 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:00:28,090 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:00:28,090 INFO L87 Difference]: Start difference. First operand 20743 states and 32646 transitions. Second operand has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 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-03-03 15:00:28,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:00:28,287 INFO L93 Difference]: Finished difference Result 50551 states and 79848 transitions. [2025-03-03 15:00:28,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 15:00:28,288 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 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 87 [2025-03-03 15:00:28,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:00:28,363 INFO L225 Difference]: With dead ends: 50551 [2025-03-03 15:00:28,363 INFO L226 Difference]: Without dead ends: 40759 [2025-03-03 15:00:28,383 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-03 15:00:28,383 INFO L435 NwaCegarLoop]: 318 mSDtfsCounter, 484 mSDsluCounter, 584 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 484 SdHoareTripleChecker+Valid, 902 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:00:28,384 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [484 Valid, 902 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 15:00:28,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40759 states. [2025-03-03 15:00:28,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40759 to 31829. [2025-03-03 15:00:28,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31829 states, 31828 states have (on average 1.5726404423777807) internal successors, (50054), 31828 states have internal predecessors, (50054), 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-03-03 15:00:28,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31829 states to 31829 states and 50054 transitions. [2025-03-03 15:00:28,888 INFO L78 Accepts]: Start accepts. Automaton has 31829 states and 50054 transitions. Word has length 87 [2025-03-03 15:00:28,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:00:28,888 INFO L471 AbstractCegarLoop]: Abstraction has 31829 states and 50054 transitions. [2025-03-03 15:00:28,888 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 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-03-03 15:00:28,888 INFO L276 IsEmpty]: Start isEmpty. Operand 31829 states and 50054 transitions. [2025-03-03 15:00:28,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-03-03 15:00:28,890 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:00:28,890 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:00:28,890 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-03 15:00:28,890 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:00:28,890 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:00:28,891 INFO L85 PathProgramCache]: Analyzing trace with hash -1316985731, now seen corresponding path program 1 times [2025-03-03 15:00:28,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:00:28,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817133732] [2025-03-03 15:00:28,891 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:00:28,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:00:28,903 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-03-03 15:00:28,918 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-03-03 15:00:28,918 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:00:28,919 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:00:28,995 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-03 15:00:28,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:00:28,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [817133732] [2025-03-03 15:00:28,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [817133732] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:00:28,995 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:00:28,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 15:00:28,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1915602411] [2025-03-03 15:00:28,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:00:28,996 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:00:28,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:00:28,996 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:00:28,996 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:00:28,996 INFO L87 Difference]: Start difference. First operand 31829 states and 50054 transitions. Second operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 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-03-03 15:00:29,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:00:29,299 INFO L93 Difference]: Finished difference Result 54443 states and 86012 transitions. [2025-03-03 15:00:29,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 15:00:29,300 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 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 87 [2025-03-03 15:00:29,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:00:29,355 INFO L225 Difference]: With dead ends: 54443 [2025-03-03 15:00:29,355 INFO L226 Difference]: Without dead ends: 44651 [2025-03-03 15:00:29,368 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-03 15:00:29,368 INFO L435 NwaCegarLoop]: 318 mSDtfsCounter, 482 mSDsluCounter, 579 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 482 SdHoareTripleChecker+Valid, 897 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:00:29,368 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [482 Valid, 897 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:00:29,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44651 states. [2025-03-03 15:00:29,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44651 to 43061. [2025-03-03 15:00:29,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43061 states, 43060 states have (on average 1.573525313516024) internal successors, (67756), 43060 states have internal predecessors, (67756), 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-03-03 15:00:29,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43061 states to 43061 states and 67756 transitions. [2025-03-03 15:00:29,908 INFO L78 Accepts]: Start accepts. Automaton has 43061 states and 67756 transitions. Word has length 87 [2025-03-03 15:00:29,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:00:29,908 INFO L471 AbstractCegarLoop]: Abstraction has 43061 states and 67756 transitions. [2025-03-03 15:00:29,908 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 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-03-03 15:00:29,908 INFO L276 IsEmpty]: Start isEmpty. Operand 43061 states and 67756 transitions. [2025-03-03 15:00:29,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-03-03 15:00:29,910 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:00:29,910 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:00:29,910 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-03 15:00:29,911 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:00:29,911 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:00:29,911 INFO L85 PathProgramCache]: Analyzing trace with hash 1149937436, now seen corresponding path program 1 times [2025-03-03 15:00:29,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:00:29,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1198484530] [2025-03-03 15:00:29,912 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:00:29,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:00:29,926 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-03-03 15:00:29,937 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-03-03 15:00:29,937 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:00:29,937 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:00:30,044 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-03 15:00:30,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:00:30,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1198484530] [2025-03-03 15:00:30,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1198484530] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:00:30,046 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:00:30,046 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 15:00:30,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1409649798] [2025-03-03 15:00:30,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:00:30,046 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:00:30,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:00:30,047 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:00:30,047 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:00:30,047 INFO L87 Difference]: Start difference. First operand 43061 states and 67756 transitions. Second operand has 5 states, 5 states have (on average 17.2) internal successors, (86), 5 states have internal predecessors, (86), 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-03-03 15:00:30,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:00:30,384 INFO L93 Difference]: Finished difference Result 61057 states and 96640 transitions. [2025-03-03 15:00:30,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 15:00:30,384 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.2) internal successors, (86), 5 states have internal predecessors, (86), 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 87 [2025-03-03 15:00:30,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:00:30,460 INFO L225 Difference]: With dead ends: 61057 [2025-03-03 15:00:30,460 INFO L226 Difference]: Without dead ends: 51035 [2025-03-03 15:00:30,479 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-03 15:00:30,479 INFO L435 NwaCegarLoop]: 310 mSDtfsCounter, 484 mSDsluCounter, 549 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 484 SdHoareTripleChecker+Valid, 859 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:00:30,479 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [484 Valid, 859 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 15:00:30,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51035 states. [2025-03-03 15:00:30,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51035 to 49445. [2025-03-03 15:00:31,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49445 states, 49444 states have (on average 1.5764096755925896) internal successors, (77944), 49444 states have internal predecessors, (77944), 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-03-03 15:00:31,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49445 states to 49445 states and 77944 transitions. [2025-03-03 15:00:31,103 INFO L78 Accepts]: Start accepts. Automaton has 49445 states and 77944 transitions. Word has length 87 [2025-03-03 15:00:31,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:00:31,103 INFO L471 AbstractCegarLoop]: Abstraction has 49445 states and 77944 transitions. [2025-03-03 15:00:31,103 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.2) internal successors, (86), 5 states have internal predecessors, (86), 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-03-03 15:00:31,104 INFO L276 IsEmpty]: Start isEmpty. Operand 49445 states and 77944 transitions. [2025-03-03 15:00:31,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-03-03 15:00:31,107 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:00:31,107 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] [2025-03-03 15:00:31,107 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-03 15:00:31,107 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:00:31,108 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:00:31,108 INFO L85 PathProgramCache]: Analyzing trace with hash -691246774, now seen corresponding path program 1 times [2025-03-03 15:00:31,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:00:31,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719614510] [2025-03-03 15:00:31,108 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:00:31,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:00:31,122 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-03-03 15:00:31,143 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-03-03 15:00:31,146 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:00:31,146 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:00:31,221 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:00:31,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:00:31,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [719614510] [2025-03-03 15:00:31,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [719614510] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:00:31,222 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:00:31,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:00:31,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280640452] [2025-03-03 15:00:31,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:00:31,222 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:00:31,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:00:31,223 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:00:31,223 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:00:31,223 INFO L87 Difference]: Start difference. First operand 49445 states and 77944 transitions. Second operand has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 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-03-03 15:00:31,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:00:31,669 INFO L93 Difference]: Finished difference Result 92374 states and 146093 transitions. [2025-03-03 15:00:31,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:00:31,669 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 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 88 [2025-03-03 15:00:31,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:00:31,725 INFO L225 Difference]: With dead ends: 92374 [2025-03-03 15:00:31,726 INFO L226 Difference]: Without dead ends: 43005 [2025-03-03 15:00:31,749 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-03-03 15:00:31,749 INFO L435 NwaCegarLoop]: 242 mSDtfsCounter, 87 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 421 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:00:31,749 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 421 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:00:31,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43005 states. [2025-03-03 15:00:32,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43005 to 42999. [2025-03-03 15:00:32,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42999 states, 42998 states have (on average 1.5772361505186288) internal successors, (67818), 42998 states have internal predecessors, (67818), 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-03-03 15:00:32,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42999 states to 42999 states and 67818 transitions. [2025-03-03 15:00:32,189 INFO L78 Accepts]: Start accepts. Automaton has 42999 states and 67818 transitions. Word has length 88 [2025-03-03 15:00:32,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:00:32,189 INFO L471 AbstractCegarLoop]: Abstraction has 42999 states and 67818 transitions. [2025-03-03 15:00:32,189 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 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-03-03 15:00:32,189 INFO L276 IsEmpty]: Start isEmpty. Operand 42999 states and 67818 transitions. [2025-03-03 15:00:32,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-03-03 15:00:32,191 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:00:32,191 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:00:32,191 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-03 15:00:32,191 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:00:32,191 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:00:32,191 INFO L85 PathProgramCache]: Analyzing trace with hash 1290201033, now seen corresponding path program 1 times [2025-03-03 15:00:32,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:00:32,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [663053124] [2025-03-03 15:00:32,192 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:00:32,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:00:32,201 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-03-03 15:00:32,208 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-03-03 15:00:32,208 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:00:32,208 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:00:32,263 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-03 15:00:32,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:00:32,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [663053124] [2025-03-03 15:00:32,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [663053124] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:00:32,264 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:00:32,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 15:00:32,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192297631] [2025-03-03 15:00:32,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:00:32,264 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 15:00:32,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:00:32,264 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 15:00:32,264 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 15:00:32,264 INFO L87 Difference]: Start difference. First operand 42999 states and 67818 transitions. Second operand has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 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-03-03 15:00:32,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:00:32,434 INFO L93 Difference]: Finished difference Result 74132 states and 117287 transitions. [2025-03-03 15:00:32,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 15:00:32,435 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 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 88 [2025-03-03 15:00:32,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:00:32,695 INFO L225 Difference]: With dead ends: 74132 [2025-03-03 15:00:32,696 INFO L226 Difference]: Without dead ends: 57726 [2025-03-03 15:00:32,707 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 15:00:32,708 INFO L435 NwaCegarLoop]: 307 mSDtfsCounter, 212 mSDsluCounter, 367 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 212 SdHoareTripleChecker+Valid, 674 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:00:32,708 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [212 Valid, 674 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:00:32,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57726 states. [2025-03-03 15:00:33,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57726 to 56138. [2025-03-03 15:00:33,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56138 states, 56137 states have (on average 1.575146516557707) internal successors, (88424), 56137 states have internal predecessors, (88424), 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-03-03 15:00:33,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56138 states to 56138 states and 88424 transitions. [2025-03-03 15:00:33,344 INFO L78 Accepts]: Start accepts. Automaton has 56138 states and 88424 transitions. Word has length 88 [2025-03-03 15:00:33,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:00:33,344 INFO L471 AbstractCegarLoop]: Abstraction has 56138 states and 88424 transitions. [2025-03-03 15:00:33,344 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 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-03-03 15:00:33,344 INFO L276 IsEmpty]: Start isEmpty. Operand 56138 states and 88424 transitions. [2025-03-03 15:00:33,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-03-03 15:00:33,346 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:00:33,346 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] [2025-03-03 15:00:33,346 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-03 15:00:33,346 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:00:33,347 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:00:33,347 INFO L85 PathProgramCache]: Analyzing trace with hash -1526039925, now seen corresponding path program 1 times [2025-03-03 15:00:33,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:00:33,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [761557038] [2025-03-03 15:00:33,347 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:00:33,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:00:33,360 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-03-03 15:00:33,372 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-03-03 15:00:33,372 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:00:33,372 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:00:33,445 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:00:33,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:00:33,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [761557038] [2025-03-03 15:00:33,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [761557038] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:00:33,446 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:00:33,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:00:33,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31531309] [2025-03-03 15:00:33,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:00:33,447 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:00:33,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:00:33,447 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:00:33,447 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:00:33,447 INFO L87 Difference]: Start difference. First operand 56138 states and 88424 transitions. Second operand has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 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-03-03 15:00:33,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:00:33,654 INFO L93 Difference]: Finished difference Result 79847 states and 125908 transitions. [2025-03-03 15:00:33,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:00:33,654 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 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 88 [2025-03-03 15:00:33,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:00:33,686 INFO L225 Difference]: With dead ends: 79847 [2025-03-03 15:00:33,687 INFO L226 Difference]: Without dead ends: 23808 [2025-03-03 15:00:33,723 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-03-03 15:00:33,723 INFO L435 NwaCegarLoop]: 228 mSDtfsCounter, 66 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 393 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:00:33,723 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 393 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:00:33,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23808 states. [2025-03-03 15:00:34,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23808 to 23790. [2025-03-03 15:00:34,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23790 states, 23789 states have (on average 1.5702215309596872) internal successors, (37354), 23789 states have internal predecessors, (37354), 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-03-03 15:00:34,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23790 states to 23790 states and 37354 transitions. [2025-03-03 15:00:34,126 INFO L78 Accepts]: Start accepts. Automaton has 23790 states and 37354 transitions. Word has length 88 [2025-03-03 15:00:34,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:00:34,126 INFO L471 AbstractCegarLoop]: Abstraction has 23790 states and 37354 transitions. [2025-03-03 15:00:34,127 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 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-03-03 15:00:34,127 INFO L276 IsEmpty]: Start isEmpty. Operand 23790 states and 37354 transitions. [2025-03-03 15:00:34,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-03-03 15:00:34,128 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:00:34,128 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] [2025-03-03 15:00:34,128 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-03 15:00:34,128 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:00:34,129 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:00:34,129 INFO L85 PathProgramCache]: Analyzing trace with hash -1166356340, now seen corresponding path program 1 times [2025-03-03 15:00:34,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:00:34,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81337771] [2025-03-03 15:00:34,129 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:00:34,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:00:34,140 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-03-03 15:00:34,155 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-03-03 15:00:34,155 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:00:34,155 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:00:34,311 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:00:34,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:00:34,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [81337771] [2025-03-03 15:00:34,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [81337771] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:00:34,312 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:00:34,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:00:34,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [114265399] [2025-03-03 15:00:34,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:00:34,312 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:00:34,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:00:34,313 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:00:34,313 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:00:34,313 INFO L87 Difference]: Start difference. First operand 23790 states and 37354 transitions. Second operand has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 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-03-03 15:00:34,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:00:34,377 INFO L93 Difference]: Finished difference Result 33771 states and 53094 transitions. [2025-03-03 15:00:34,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:00:34,377 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 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 88 [2025-03-03 15:00:34,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:00:34,389 INFO L225 Difference]: With dead ends: 33771 [2025-03-03 15:00:34,390 INFO L226 Difference]: Without dead ends: 10080 [2025-03-03 15:00:34,403 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-03-03 15:00:34,405 INFO L435 NwaCegarLoop]: 214 mSDtfsCounter, 45 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 365 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:00:34,405 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 365 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:00:34,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10080 states. [2025-03-03 15:00:34,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10080 to 10026. [2025-03-03 15:00:34,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10026 states, 10025 states have (on average 1.5648877805486285) internal successors, (15688), 10025 states have internal predecessors, (15688), 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-03-03 15:00:34,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10026 states to 10026 states and 15688 transitions. [2025-03-03 15:00:34,500 INFO L78 Accepts]: Start accepts. Automaton has 10026 states and 15688 transitions. Word has length 88 [2025-03-03 15:00:34,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:00:34,501 INFO L471 AbstractCegarLoop]: Abstraction has 10026 states and 15688 transitions. [2025-03-03 15:00:34,501 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 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-03-03 15:00:34,501 INFO L276 IsEmpty]: Start isEmpty. Operand 10026 states and 15688 transitions. [2025-03-03 15:00:34,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-03-03 15:00:34,502 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:00:34,502 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:00:34,502 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-03 15:00:34,502 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:00:34,502 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:00:34,502 INFO L85 PathProgramCache]: Analyzing trace with hash 154875050, now seen corresponding path program 1 times [2025-03-03 15:00:34,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:00:34,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283408920] [2025-03-03 15:00:34,502 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:00:34,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:00:34,513 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-03-03 15:00:34,526 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-03-03 15:00:34,527 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:00:34,527 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:00:34,661 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-03 15:00:34,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:00:34,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [283408920] [2025-03-03 15:00:34,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [283408920] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:00:34,661 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:00:34,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 15:00:34,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1224612193] [2025-03-03 15:00:34,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:00:34,663 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 15:00:34,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:00:34,663 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 15:00:34,664 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 15:00:34,664 INFO L87 Difference]: Start difference. First operand 10026 states and 15688 transitions. Second operand has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 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-03-03 15:00:34,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:00:34,738 INFO L93 Difference]: Finished difference Result 24801 states and 38833 transitions. [2025-03-03 15:00:34,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 15:00:34,738 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 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 88 [2025-03-03 15:00:34,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:00:34,759 INFO L225 Difference]: With dead ends: 24801 [2025-03-03 15:00:34,760 INFO L226 Difference]: Without dead ends: 18491 [2025-03-03 15:00:34,769 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:00:34,770 INFO L435 NwaCegarLoop]: 243 mSDtfsCounter, 348 mSDsluCounter, 334 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 348 SdHoareTripleChecker+Valid, 577 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:00:34,770 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [348 Valid, 577 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:00:34,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18491 states. [2025-03-03 15:00:34,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18491 to 15863. [2025-03-03 15:00:34,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15863 states, 15862 states have (on average 1.5629176648594125) internal successors, (24791), 15862 states have internal predecessors, (24791), 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-03-03 15:00:34,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15863 states to 15863 states and 24791 transitions. [2025-03-03 15:00:34,920 INFO L78 Accepts]: Start accepts. Automaton has 15863 states and 24791 transitions. Word has length 88 [2025-03-03 15:00:34,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:00:34,920 INFO L471 AbstractCegarLoop]: Abstraction has 15863 states and 24791 transitions. [2025-03-03 15:00:34,920 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 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-03-03 15:00:34,921 INFO L276 IsEmpty]: Start isEmpty. Operand 15863 states and 24791 transitions. [2025-03-03 15:00:34,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-03-03 15:00:34,921 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:00:34,921 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:00:34,921 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-03 15:00:34,921 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:00:34,922 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:00:34,922 INFO L85 PathProgramCache]: Analyzing trace with hash 99274793, now seen corresponding path program 1 times [2025-03-03 15:00:34,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:00:34,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [833214433] [2025-03-03 15:00:34,922 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:00:34,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:00:34,934 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-03-03 15:00:34,958 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-03-03 15:00:34,958 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:00:34,958 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:00:35,151 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-03 15:00:35,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:00:35,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [833214433] [2025-03-03 15:00:35,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [833214433] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:00:35,151 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:00:35,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 15:00:35,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1661331746] [2025-03-03 15:00:35,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:00:35,152 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 15:00:35,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:00:35,153 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 15:00:35,153 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 15:00:35,153 INFO L87 Difference]: Start difference. First operand 15863 states and 24791 transitions. Second operand has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 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-03-03 15:00:35,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:00:35,263 INFO L93 Difference]: Finished difference Result 38168 states and 59873 transitions. [2025-03-03 15:00:35,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 15:00:35,264 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 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 88 [2025-03-03 15:00:35,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:00:35,302 INFO L225 Difference]: With dead ends: 38168 [2025-03-03 15:00:35,302 INFO L226 Difference]: Without dead ends: 28594 [2025-03-03 15:00:35,317 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:00:35,319 INFO L435 NwaCegarLoop]: 234 mSDtfsCounter, 359 mSDsluCounter, 336 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 359 SdHoareTripleChecker+Valid, 570 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:00:35,320 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [359 Valid, 570 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:00:35,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28594 states. [2025-03-03 15:00:35,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28594 to 25082. [2025-03-03 15:00:35,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25082 states, 25081 states have (on average 1.5627766038036761) internal successors, (39196), 25081 states have internal predecessors, (39196), 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-03-03 15:00:35,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25082 states to 25082 states and 39196 transitions. [2025-03-03 15:00:35,643 INFO L78 Accepts]: Start accepts. Automaton has 25082 states and 39196 transitions. Word has length 88 [2025-03-03 15:00:35,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:00:35,643 INFO L471 AbstractCegarLoop]: Abstraction has 25082 states and 39196 transitions. [2025-03-03 15:00:35,643 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 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-03-03 15:00:35,643 INFO L276 IsEmpty]: Start isEmpty. Operand 25082 states and 39196 transitions. [2025-03-03 15:00:35,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-03-03 15:00:35,644 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:00:35,644 INFO L218 NwaCegarLoop]: trace histogram [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-03-03 15:00:35,644 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-03 15:00:35,644 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:00:35,644 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:00:35,644 INFO L85 PathProgramCache]: Analyzing trace with hash -1070128825, now seen corresponding path program 1 times [2025-03-03 15:00:35,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:00:35,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [575346028] [2025-03-03 15:00:35,644 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:00:35,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:00:35,657 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-03-03 15:00:35,665 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-03-03 15:00:35,666 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:00:35,666 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:00:35,706 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-03 15:00:35,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:00:35,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [575346028] [2025-03-03 15:00:35,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [575346028] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:00:35,707 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:00:35,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:00:35,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1619414836] [2025-03-03 15:00:35,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:00:35,707 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:00:35,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:00:35,708 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:00:35,708 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:00:35,708 INFO L87 Difference]: Start difference. First operand 25082 states and 39196 transitions. Second operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 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-03-03 15:00:35,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:00:35,841 INFO L93 Difference]: Finished difference Result 56465 states and 88345 transitions. [2025-03-03 15:00:35,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:00:35,841 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 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 88 [2025-03-03 15:00:35,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:00:35,896 INFO L225 Difference]: With dead ends: 56465 [2025-03-03 15:00:35,897 INFO L226 Difference]: Without dead ends: 43839 [2025-03-03 15:00:35,918 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-03-03 15:00:35,919 INFO L435 NwaCegarLoop]: 203 mSDtfsCounter, 96 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 371 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:00:35,919 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 371 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:00:35,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43839 states. [2025-03-03 15:00:36,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43839 to 43705. [2025-03-03 15:00:36,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43705 states, 43704 states have (on average 1.5595368844956983) internal successors, (68158), 43704 states have internal predecessors, (68158), 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-03-03 15:00:36,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43705 states to 43705 states and 68158 transitions. [2025-03-03 15:00:36,471 INFO L78 Accepts]: Start accepts. Automaton has 43705 states and 68158 transitions. Word has length 88 [2025-03-03 15:00:36,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:00:36,471 INFO L471 AbstractCegarLoop]: Abstraction has 43705 states and 68158 transitions. [2025-03-03 15:00:36,471 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 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-03-03 15:00:36,471 INFO L276 IsEmpty]: Start isEmpty. Operand 43705 states and 68158 transitions. [2025-03-03 15:00:36,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-03-03 15:00:36,472 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:00:36,472 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-03 15:00:36,472 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-03 15:00:36,472 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:00:36,473 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:00:36,473 INFO L85 PathProgramCache]: Analyzing trace with hash -550283877, now seen corresponding path program 1 times [2025-03-03 15:00:36,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:00:36,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [344159882] [2025-03-03 15:00:36,473 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:00:36,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:00:36,485 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-03-03 15:00:36,494 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-03-03 15:00:36,494 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:00:36,494 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:00:36,540 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:00:36,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:00:36,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [344159882] [2025-03-03 15:00:36,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [344159882] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:00:36,540 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:00:36,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:00:36,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501393073] [2025-03-03 15:00:36,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:00:36,541 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:00:36,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:00:36,542 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:00:36,542 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:00:36,542 INFO L87 Difference]: Start difference. First operand 43705 states and 68158 transitions. Second operand has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 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-03-03 15:00:36,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:00:36,854 INFO L93 Difference]: Finished difference Result 128702 states and 200624 transitions. [2025-03-03 15:00:36,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:00:36,854 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 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 89 [2025-03-03 15:00:36,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:00:36,969 INFO L225 Difference]: With dead ends: 128702 [2025-03-03 15:00:36,970 INFO L226 Difference]: Without dead ends: 85062 [2025-03-03 15:00:37,016 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-03-03 15:00:37,017 INFO L435 NwaCegarLoop]: 249 mSDtfsCounter, 129 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 439 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:00:37,017 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 439 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:00:37,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85062 states. [2025-03-03 15:00:37,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85062 to 85060. [2025-03-03 15:00:37,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85060 states, 85059 states have (on average 1.547455295735901) internal successors, (131625), 85059 states have internal predecessors, (131625), 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-03-03 15:00:38,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85060 states to 85060 states and 131625 transitions. [2025-03-03 15:00:38,099 INFO L78 Accepts]: Start accepts. Automaton has 85060 states and 131625 transitions. Word has length 89 [2025-03-03 15:00:38,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:00:38,099 INFO L471 AbstractCegarLoop]: Abstraction has 85060 states and 131625 transitions. [2025-03-03 15:00:38,099 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 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-03-03 15:00:38,099 INFO L276 IsEmpty]: Start isEmpty. Operand 85060 states and 131625 transitions. [2025-03-03 15:00:38,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-03-03 15:00:38,100 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:00:38,100 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-03 15:00:38,100 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-03 15:00:38,100 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:00:38,101 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:00:38,101 INFO L85 PathProgramCache]: Analyzing trace with hash 1078639227, now seen corresponding path program 1 times [2025-03-03 15:00:38,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:00:38,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445571971] [2025-03-03 15:00:38,101 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:00:38,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:00:38,112 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-03-03 15:00:38,120 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-03-03 15:00:38,120 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:00:38,120 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:00:38,153 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:00:38,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:00:38,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [445571971] [2025-03-03 15:00:38,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [445571971] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:00:38,154 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:00:38,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:00:38,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902409064] [2025-03-03 15:00:38,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:00:38,154 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:00:38,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:00:38,154 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:00:38,154 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:00:38,155 INFO L87 Difference]: Start difference. First operand 85060 states and 131625 transitions. Second operand has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 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-03-03 15:00:38,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:00:38,836 INFO L93 Difference]: Finished difference Result 250355 states and 387188 transitions. [2025-03-03 15:00:38,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:00:38,837 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 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 89 [2025-03-03 15:00:38,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:00:39,075 INFO L225 Difference]: With dead ends: 250355 [2025-03-03 15:00:39,075 INFO L226 Difference]: Without dead ends: 165426 [2025-03-03 15:00:39,165 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-03-03 15:00:39,166 INFO L435 NwaCegarLoop]: 282 mSDtfsCounter, 147 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 472 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:00:39,166 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 472 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:00:39,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165426 states. [2025-03-03 15:00:41,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165426 to 165424. [2025-03-03 15:00:41,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165424 states, 165423 states have (on average 1.5347079910290589) internal successors, (253876), 165423 states have internal predecessors, (253876), 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-03-03 15:00:41,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165424 states to 165424 states and 253876 transitions. [2025-03-03 15:00:41,776 INFO L78 Accepts]: Start accepts. Automaton has 165424 states and 253876 transitions. Word has length 89 [2025-03-03 15:00:41,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:00:41,777 INFO L471 AbstractCegarLoop]: Abstraction has 165424 states and 253876 transitions. [2025-03-03 15:00:41,777 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 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-03-03 15:00:41,777 INFO L276 IsEmpty]: Start isEmpty. Operand 165424 states and 253876 transitions. [2025-03-03 15:00:41,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-03-03 15:00:41,781 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:00:41,781 INFO L218 NwaCegarLoop]: trace histogram [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, 1] [2025-03-03 15:00:41,781 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-03 15:00:41,781 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:00:41,782 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:00:41,782 INFO L85 PathProgramCache]: Analyzing trace with hash 353101040, now seen corresponding path program 1 times [2025-03-03 15:00:41,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:00:41,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1426801462] [2025-03-03 15:00:41,782 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:00:41,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:00:41,806 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-03 15:00:41,815 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-03 15:00:41,815 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:00:41,815 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:00:41,867 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-03 15:00:41,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:00:41,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1426801462] [2025-03-03 15:00:41,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1426801462] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:00:41,868 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:00:41,868 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 15:00:41,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908773387] [2025-03-03 15:00:41,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:00:41,868 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 15:00:41,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:00:41,868 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 15:00:41,869 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 15:00:41,869 INFO L87 Difference]: Start difference. First operand 165424 states and 253876 transitions. Second operand has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 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-03-03 15:00:42,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:00:42,605 INFO L93 Difference]: Finished difference Result 254822 states and 392255 transitions. [2025-03-03 15:00:42,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 15:00:42,605 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 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 92 [2025-03-03 15:00:42,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:00:42,839 INFO L225 Difference]: With dead ends: 254822 [2025-03-03 15:00:42,839 INFO L226 Difference]: Without dead ends: 182884 [2025-03-03 15:00:42,880 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 15:00:42,881 INFO L435 NwaCegarLoop]: 325 mSDtfsCounter, 208 mSDsluCounter, 370 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 208 SdHoareTripleChecker+Valid, 695 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:00:42,881 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [208 Valid, 695 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:00:42,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182884 states. [2025-03-03 15:00:44,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182884 to 181395. [2025-03-03 15:00:44,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181395 states, 181394 states have (on average 1.5336008908784193) internal successors, (278186), 181394 states have internal predecessors, (278186), 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-03-03 15:00:45,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181395 states to 181395 states and 278186 transitions. [2025-03-03 15:00:45,063 INFO L78 Accepts]: Start accepts. Automaton has 181395 states and 278186 transitions. Word has length 92 [2025-03-03 15:00:45,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:00:45,063 INFO L471 AbstractCegarLoop]: Abstraction has 181395 states and 278186 transitions. [2025-03-03 15:00:45,063 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 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-03-03 15:00:45,063 INFO L276 IsEmpty]: Start isEmpty. Operand 181395 states and 278186 transitions. [2025-03-03 15:00:45,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-03-03 15:00:45,064 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:00:45,064 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] [2025-03-03 15:00:45,064 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-03 15:00:45,064 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:00:45,065 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:00:45,066 INFO L85 PathProgramCache]: Analyzing trace with hash 1655326894, now seen corresponding path program 1 times [2025-03-03 15:00:45,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:00:45,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1596253519] [2025-03-03 15:00:45,066 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:00:45,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:00:45,084 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-03 15:00:45,099 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-03 15:00:45,100 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:00:45,101 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:00:45,134 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-03 15:00:45,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:00:45,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1596253519] [2025-03-03 15:00:45,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1596253519] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:00:45,135 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:00:45,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:00:45,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [786520559] [2025-03-03 15:00:45,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:00:45,135 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:00:45,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:00:45,135 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:00:45,135 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:00:45,135 INFO L87 Difference]: Start difference. First operand 181395 states and 278186 transitions. Second operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 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-03-03 15:00:46,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:00:46,149 INFO L93 Difference]: Finished difference Result 343439 states and 527372 transitions. [2025-03-03 15:00:46,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:00:46,150 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 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 92 [2025-03-03 15:00:46,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:00:46,469 INFO L225 Difference]: With dead ends: 343439 [2025-03-03 15:00:46,469 INFO L226 Difference]: Without dead ends: 218685 [2025-03-03 15:00:46,516 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-03-03 15:00:46,516 INFO L435 NwaCegarLoop]: 285 mSDtfsCounter, 79 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 465 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:00:46,517 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 465 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:00:46,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218685 states. [2025-03-03 15:00:48,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218685 to 215515. [2025-03-03 15:00:48,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215515 states, 215514 states have (on average 1.5201332628042725) internal successors, (327610), 215514 states have internal predecessors, (327610), 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-03-03 15:00:49,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215515 states to 215515 states and 327610 transitions. [2025-03-03 15:00:49,223 INFO L78 Accepts]: Start accepts. Automaton has 215515 states and 327610 transitions. Word has length 92 [2025-03-03 15:00:49,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:00:49,223 INFO L471 AbstractCegarLoop]: Abstraction has 215515 states and 327610 transitions. [2025-03-03 15:00:49,223 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 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-03-03 15:00:49,223 INFO L276 IsEmpty]: Start isEmpty. Operand 215515 states and 327610 transitions. [2025-03-03 15:00:49,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-03-03 15:00:49,224 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:00:49,224 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] [2025-03-03 15:00:49,224 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-03 15:00:49,224 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:00:49,224 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:00:49,224 INFO L85 PathProgramCache]: Analyzing trace with hash -1511708078, now seen corresponding path program 1 times [2025-03-03 15:00:49,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:00:49,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [251268917] [2025-03-03 15:00:49,224 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:00:49,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:00:49,233 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-03 15:00:49,244 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-03 15:00:49,244 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:00:49,245 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:00:49,312 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-03 15:00:49,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:00:49,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [251268917] [2025-03-03 15:00:49,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [251268917] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 15:00:49,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [820445148] [2025-03-03 15:00:49,312 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:00:49,312 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 15:00:49,312 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 15:00:49,314 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 15:00:49,316 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-03 15:00:49,406 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-03 15:00:49,458 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-03 15:00:49,458 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:00:49,458 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:00:49,462 INFO L256 TraceCheckSpWp]: Trace formula consists of 465 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-03 15:00:49,465 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 15:00:49,586 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-03-03 15:00:49,586 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 15:00:49,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [820445148] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:00:49,586 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 15:00:49,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2025-03-03 15:00:49,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1391401728] [2025-03-03 15:00:49,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:00:49,587 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 15:00:49,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:00:49,587 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 15:00:49,587 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:00:49,587 INFO L87 Difference]: Start difference. First operand 215515 states and 327610 transitions. Second operand has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 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-03-03 15:00:52,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:00:52,598 INFO L93 Difference]: Finished difference Result 1056026 states and 1603107 transitions. [2025-03-03 15:00:52,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 15:00:52,599 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 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 92 [2025-03-03 15:00:52,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:00:54,098 INFO L225 Difference]: With dead ends: 1056026 [2025-03-03 15:00:54,098 INFO L226 Difference]: Without dead ends: 840520 [2025-03-03 15:00:54,267 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-03 15:00:54,268 INFO L435 NwaCegarLoop]: 305 mSDtfsCounter, 543 mSDsluCounter, 472 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 543 SdHoareTripleChecker+Valid, 777 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:00:54,273 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [543 Valid, 777 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:00:55,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 840520 states. [2025-03-03 15:01:00,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 840520 to 420264. [2025-03-03 15:01:00,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 420264 states, 420263 states have (on average 1.5064614301044823) internal successors, (633110), 420263 states have internal predecessors, (633110), 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-03-03 15:01:01,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 420264 states to 420264 states and 633110 transitions. [2025-03-03 15:01:01,576 INFO L78 Accepts]: Start accepts. Automaton has 420264 states and 633110 transitions. Word has length 92 [2025-03-03 15:01:01,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:01:01,576 INFO L471 AbstractCegarLoop]: Abstraction has 420264 states and 633110 transitions. [2025-03-03 15:01:01,577 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 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-03-03 15:01:01,577 INFO L276 IsEmpty]: Start isEmpty. Operand 420264 states and 633110 transitions. [2025-03-03 15:01:01,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-03-03 15:01:01,578 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:01:01,578 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] [2025-03-03 15:01:01,585 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-03 15:01:01,783 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2025-03-03 15:01:01,783 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:01:01,783 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:01:01,783 INFO L85 PathProgramCache]: Analyzing trace with hash -1075790760, now seen corresponding path program 1 times [2025-03-03 15:01:01,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:01:01,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2125621776] [2025-03-03 15:01:01,784 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:01:01,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:01:01,795 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-03-03 15:01:01,800 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-03-03 15:01:01,800 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:01:01,800 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:01:01,820 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-03-03 15:01:01,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:01:01,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2125621776] [2025-03-03 15:01:01,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2125621776] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:01:01,820 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:01:01,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:01:01,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [634499802] [2025-03-03 15:01:01,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:01:01,821 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:01:01,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:01:01,822 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:01:01,822 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:01:01,822 INFO L87 Difference]: Start difference. First operand 420264 states and 633110 transitions. Second operand has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 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)