./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 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_lcr.4.ufo.UNBOUNDED.pals.c.v+nlh-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 e328965cea0bb66eb9fefef2406463fafd513fe2a95976e689a71eb96c010564 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 19:32:51,181 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 19:32:51,232 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 19:32:51,235 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 19:32:51,238 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 19:32:51,259 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 19:32:51,260 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 19:32:51,260 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 19:32:51,261 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 19:32:51,261 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 19:32:51,262 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 19:32:51,262 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 19:32:51,262 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 19:32:51,262 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 19:32:51,262 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 19:32:51,263 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 19:32:51,263 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 19:32:51,263 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 19:32:51,263 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 19:32:51,263 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 19:32:51,263 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 19:32:51,264 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 19:32:51,264 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 19:32:51,264 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 19:32:51,264 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 19:32:51,264 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 19:32:51,264 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 19:32:51,264 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 19:32:51,264 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 19:32:51,264 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 19:32:51,265 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 19:32:51,265 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 19:32:51,265 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 19:32:51,265 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 19:32:51,265 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 19:32:51,265 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 19:32:51,265 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 19:32:51,265 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 19:32:51,265 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 19:32:51,265 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 19:32:51,265 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 19:32:51,265 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 19:32:51,265 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 19:32:51,266 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 -> e328965cea0bb66eb9fefef2406463fafd513fe2a95976e689a71eb96c010564 [2025-03-16 19:32:51,483 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 19:32:51,491 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 19:32:51,493 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 19:32:51,494 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 19:32:51,494 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 19:32:51,496 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2025-03-16 19:32:52,600 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/631f331c7/bcbad1acb892406b953a73764edcba3c/FLAG9cc38c995 [2025-03-16 19:32:52,928 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 19:32:52,935 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2025-03-16 19:32:52,942 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/631f331c7/bcbad1acb892406b953a73764edcba3c/FLAG9cc38c995 [2025-03-16 19:32:53,175 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/631f331c7/bcbad1acb892406b953a73764edcba3c [2025-03-16 19:32:53,177 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 19:32:53,178 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 19:32:53,179 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 19:32:53,179 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 19:32:53,182 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 19:32:53,183 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 07:32:53" (1/1) ... [2025-03-16 19:32:53,183 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5fa8593b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:32:53, skipping insertion in model container [2025-03-16 19:32:53,183 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 07:32:53" (1/1) ... [2025-03-16 19:32:53,204 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 19:32:53,329 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_lcr.4.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c[6636,6649] [2025-03-16 19:32:53,361 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 19:32:53,370 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 19:32:53,402 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_lcr.4.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c[6636,6649] [2025-03-16 19:32:53,427 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 19:32:53,445 INFO L204 MainTranslator]: Completed translation [2025-03-16 19:32:53,446 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:32:53 WrapperNode [2025-03-16 19:32:53,446 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 19:32:53,447 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 19:32:53,447 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 19:32:53,447 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 19:32:53,451 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:32:53" (1/1) ... [2025-03-16 19:32:53,457 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:32:53" (1/1) ... [2025-03-16 19:32:53,475 INFO L138 Inliner]: procedures = 24, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 559 [2025-03-16 19:32:53,476 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 19:32:53,476 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 19:32:53,476 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 19:32:53,476 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 19:32:53,482 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:32:53" (1/1) ... [2025-03-16 19:32:53,482 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:32:53" (1/1) ... [2025-03-16 19:32:53,484 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:32:53" (1/1) ... [2025-03-16 19:32:53,499 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-16 19:32:53,502 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:32:53" (1/1) ... [2025-03-16 19:32:53,504 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:32:53" (1/1) ... [2025-03-16 19:32:53,513 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:32:53" (1/1) ... [2025-03-16 19:32:53,514 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:32:53" (1/1) ... [2025-03-16 19:32:53,515 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:32:53" (1/1) ... [2025-03-16 19:32:53,516 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:32:53" (1/1) ... [2025-03-16 19:32:53,517 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 19:32:53,518 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 19:32:53,518 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 19:32:53,518 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 19:32:53,519 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:32:53" (1/1) ... [2025-03-16 19:32:53,522 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 19:32:53,530 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 19:32:53,540 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-16 19:32:53,542 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-16 19:32:53,556 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 19:32:53,557 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 19:32:53,557 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 19:32:53,557 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 19:32:53,638 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 19:32:53,639 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 19:32:54,028 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L452: havoc main_~node4____CPAchecker_TMP_0~1#1;havoc main_~node4__m4~2#1; [2025-03-16 19:32:54,028 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L358: havoc main_~node1__m1~2#1;havoc main_~__tmp_2~0#1, main_~assert__arg~1#1;havoc main_~check__tmp~1#1;havoc main_~node4__m4~1#1;havoc main_~node3__m3~1#1;havoc main_~node2__m2~1#1;havoc main_~node1__m1~1#1;havoc main_~__tmp_1~0#1, main_~assert__arg~0#1;havoc main_~check__tmp~0#1;havoc main_~node4____CPAchecker_TMP_0~0#1;havoc main_~node4__m4~0#1;havoc main_~node3____CPAchecker_TMP_0~0#1;havoc main_~node3__m3~0#1;havoc main_~node2____CPAchecker_TMP_0~0#1;havoc main_~node2__m2~0#1;havoc main_~node1____CPAchecker_TMP_0~0#1;havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2025-03-16 19:32:54,028 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L393: havoc main_~node3__m3~2#1; [2025-03-16 19:32:54,028 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L542: havoc main_~node2____CPAchecker_TMP_0~1#1; [2025-03-16 19:32:54,029 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L592: havoc main_~node1____CPAchecker_TMP_0~1#1; [2025-03-16 19:32:54,029 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L378: havoc main_~node2__m2~2#1; [2025-03-16 19:32:54,029 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L497: havoc main_~node3____CPAchecker_TMP_0~1#1; [2025-03-16 19:32:54,052 INFO L? ?]: Removed 68 outVars from TransFormulas that were not future-live. [2025-03-16 19:32:54,053 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 19:32:54,063 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 19:32:54,063 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 19:32:54,063 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 07:32:54 BoogieIcfgContainer [2025-03-16 19:32:54,063 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 19:32:54,065 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 19:32:54,065 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 19:32:54,068 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 19:32:54,068 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 07:32:53" (1/3) ... [2025-03-16 19:32:54,069 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d71623d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 07:32:54, skipping insertion in model container [2025-03-16 19:32:54,069 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:32:53" (2/3) ... [2025-03-16 19:32:54,069 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d71623d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 07:32:54, skipping insertion in model container [2025-03-16 19:32:54,069 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 07:32:54" (3/3) ... [2025-03-16 19:32:54,070 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr.4.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2025-03-16 19:32:54,079 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 19:32:54,080 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_lcr.4.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c that has 1 procedures, 122 locations, 1 initial locations, 0 loop locations, and 1 error locations. [2025-03-16 19:32:54,115 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 19:32:54,122 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;@6f73118a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 19:32:54,122 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 19:32:54,137 INFO L276 IsEmpty]: Start isEmpty. Operand has 122 states, 120 states have (on average 1.75) internal successors, (210), 121 states have internal predecessors, (210), 0 states have call successors, (0), 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-16 19:32:54,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-03-16 19:32:54,141 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:32:54,142 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-16 19:32:54,142 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:32:54,145 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:32:54,146 INFO L85 PathProgramCache]: Analyzing trace with hash -808370191, now seen corresponding path program 1 times [2025-03-16 19:32:54,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:32:54,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732693861] [2025-03-16 19:32:54,151 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:32:54,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:32:54,216 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-03-16 19:32:54,294 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-03-16 19:32:54,294 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:32:54,294 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:32:54,653 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-16 19:32:54,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:32:54,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1732693861] [2025-03-16 19:32:54,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1732693861] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:32:54,655 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:32:54,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 19:32:54,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613435545] [2025-03-16 19:32:54,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:32:54,658 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 19:32:54,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:32:54,671 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 19:32:54,672 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 19:32:54,674 INFO L87 Difference]: Start difference. First operand has 122 states, 120 states have (on average 1.75) internal successors, (210), 121 states have internal predecessors, (210), 0 states have call successors, (0), 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 6 states, 6 states have (on average 10.0) internal successors, (60), 6 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-16 19:32:54,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:32:54,919 INFO L93 Difference]: Finished difference Result 587 states and 942 transitions. [2025-03-16 19:32:54,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 19:32:54,921 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 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-16 19:32:54,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:32:54,928 INFO L225 Difference]: With dead ends: 587 [2025-03-16 19:32:54,930 INFO L226 Difference]: Without dead ends: 517 [2025-03-16 19:32:54,933 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-03-16 19:32:54,934 INFO L435 NwaCegarLoop]: 493 mSDtfsCounter, 816 mSDsluCounter, 1424 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 816 SdHoareTripleChecker+Valid, 1917 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:32:54,934 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [816 Valid, 1917 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:32:54,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 517 states. [2025-03-16 19:32:54,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 517 to 185. [2025-03-16 19:32:54,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 184 states have (on average 1.4619565217391304) internal successors, (269), 184 states have internal predecessors, (269), 0 states have call successors, (0), 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-16 19:32:54,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 269 transitions. [2025-03-16 19:32:54,979 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 269 transitions. Word has length 60 [2025-03-16 19:32:54,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:32:54,980 INFO L471 AbstractCegarLoop]: Abstraction has 185 states and 269 transitions. [2025-03-16 19:32:54,980 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 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-16 19:32:54,980 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 269 transitions. [2025-03-16 19:32:54,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-03-16 19:32:54,981 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:32:54,981 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-16 19:32:54,981 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 19:32:54,981 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:32:54,981 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:32:54,982 INFO L85 PathProgramCache]: Analyzing trace with hash -2020623691, now seen corresponding path program 1 times [2025-03-16 19:32:54,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:32:54,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032473316] [2025-03-16 19:32:54,982 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:32:54,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:32:54,994 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-16 19:32:55,010 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-16 19:32:55,010 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:32:55,010 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:32:55,160 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-16 19:32:55,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:32:55,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2032473316] [2025-03-16 19:32:55,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2032473316] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:32:55,160 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:32:55,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 19:32:55,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245107346] [2025-03-16 19:32:55,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:32:55,161 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 19:32:55,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:32:55,161 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 19:32:55,161 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-16 19:32:55,162 INFO L87 Difference]: Start difference. First operand 185 states and 269 transitions. Second operand has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 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-16 19:32:55,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:32:55,270 INFO L93 Difference]: Finished difference Result 663 states and 1020 transitions. [2025-03-16 19:32:55,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 19:32:55,270 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 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-16 19:32:55,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:32:55,272 INFO L225 Difference]: With dead ends: 663 [2025-03-16 19:32:55,272 INFO L226 Difference]: Without dead ends: 561 [2025-03-16 19:32:55,273 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-03-16 19:32:55,273 INFO L435 NwaCegarLoop]: 472 mSDtfsCounter, 527 mSDsluCounter, 668 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 527 SdHoareTripleChecker+Valid, 1140 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:32:55,273 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [527 Valid, 1140 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:32:55,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 561 states. [2025-03-16 19:32:55,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 561 to 296. [2025-03-16 19:32:55,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 296 states, 295 states have (on average 1.5084745762711864) internal successors, (445), 295 states have internal predecessors, (445), 0 states have call successors, (0), 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-16 19:32:55,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 445 transitions. [2025-03-16 19:32:55,288 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 445 transitions. Word has length 62 [2025-03-16 19:32:55,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:32:55,288 INFO L471 AbstractCegarLoop]: Abstraction has 296 states and 445 transitions. [2025-03-16 19:32:55,288 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 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-16 19:32:55,288 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 445 transitions. [2025-03-16 19:32:55,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-03-16 19:32:55,289 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:32:55,289 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-16 19:32:55,289 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 19:32:55,289 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:32:55,290 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:32:55,290 INFO L85 PathProgramCache]: Analyzing trace with hash 58428589, now seen corresponding path program 1 times [2025-03-16 19:32:55,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:32:55,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2104394929] [2025-03-16 19:32:55,290 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:32:55,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:32:55,303 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-16 19:32:55,320 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-16 19:32:55,321 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:32:55,321 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:32:55,478 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-16 19:32:55,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:32:55,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2104394929] [2025-03-16 19:32:55,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2104394929] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:32:55,479 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:32:55,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 19:32:55,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [901014251] [2025-03-16 19:32:55,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:32:55,479 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 19:32:55,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:32:55,480 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 19:32:55,480 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-16 19:32:55,480 INFO L87 Difference]: Start difference. First operand 296 states and 445 transitions. Second operand has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 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-16 19:32:55,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:32:55,581 INFO L93 Difference]: Finished difference Result 774 states and 1196 transitions. [2025-03-16 19:32:55,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 19:32:55,581 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 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-16 19:32:55,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:32:55,584 INFO L225 Difference]: With dead ends: 774 [2025-03-16 19:32:55,584 INFO L226 Difference]: Without dead ends: 672 [2025-03-16 19:32:55,584 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-03-16 19:32:55,585 INFO L435 NwaCegarLoop]: 393 mSDtfsCounter, 518 mSDsluCounter, 696 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 518 SdHoareTripleChecker+Valid, 1089 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:32:55,585 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [518 Valid, 1089 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:32:55,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 672 states. [2025-03-16 19:32:55,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 672 to 457. [2025-03-16 19:32:55,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 457 states, 456 states have (on average 1.5350877192982457) internal successors, (700), 456 states have internal predecessors, (700), 0 states have call successors, (0), 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-16 19:32:55,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 457 states to 457 states and 700 transitions. [2025-03-16 19:32:55,600 INFO L78 Accepts]: Start accepts. Automaton has 457 states and 700 transitions. Word has length 62 [2025-03-16 19:32:55,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:32:55,600 INFO L471 AbstractCegarLoop]: Abstraction has 457 states and 700 transitions. [2025-03-16 19:32:55,600 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 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-16 19:32:55,601 INFO L276 IsEmpty]: Start isEmpty. Operand 457 states and 700 transitions. [2025-03-16 19:32:55,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-03-16 19:32:55,603 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:32:55,603 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-16 19:32:55,604 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 19:32:55,604 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:32:55,604 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:32:55,605 INFO L85 PathProgramCache]: Analyzing trace with hash 1360641461, now seen corresponding path program 1 times [2025-03-16 19:32:55,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:32:55,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088273261] [2025-03-16 19:32:55,605 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:32:55,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:32:55,616 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-16 19:32:55,625 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-16 19:32:55,625 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:32:55,625 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:32:55,745 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-16 19:32:55,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:32:55,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1088273261] [2025-03-16 19:32:55,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1088273261] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:32:55,745 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:32:55,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 19:32:55,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [504654636] [2025-03-16 19:32:55,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:32:55,746 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 19:32:55,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:32:55,748 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 19:32:55,748 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-16 19:32:55,748 INFO L87 Difference]: Start difference. First operand 457 states and 700 transitions. Second operand has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 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-16 19:32:55,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:32:55,839 INFO L93 Difference]: Finished difference Result 880 states and 1364 transitions. [2025-03-16 19:32:55,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 19:32:55,839 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 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-16 19:32:55,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:32:55,842 INFO L225 Difference]: With dead ends: 880 [2025-03-16 19:32:55,842 INFO L226 Difference]: Without dead ends: 778 [2025-03-16 19:32:55,843 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-03-16 19:32:55,843 INFO L435 NwaCegarLoop]: 314 mSDtfsCounter, 595 mSDsluCounter, 564 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 595 SdHoareTripleChecker+Valid, 878 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:32:55,846 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [595 Valid, 878 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:32:55,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 778 states. [2025-03-16 19:32:55,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 778 to 563. [2025-03-16 19:32:55,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 563 states, 562 states have (on average 1.5444839857651245) internal successors, (868), 562 states have internal predecessors, (868), 0 states have call successors, (0), 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-16 19:32:55,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 563 states to 563 states and 868 transitions. [2025-03-16 19:32:55,864 INFO L78 Accepts]: Start accepts. Automaton has 563 states and 868 transitions. Word has length 62 [2025-03-16 19:32:55,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:32:55,865 INFO L471 AbstractCegarLoop]: Abstraction has 563 states and 868 transitions. [2025-03-16 19:32:55,865 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 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-16 19:32:55,865 INFO L276 IsEmpty]: Start isEmpty. Operand 563 states and 868 transitions. [2025-03-16 19:32:55,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-03-16 19:32:55,866 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:32:55,868 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-16 19:32:55,868 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 19:32:55,868 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:32:55,868 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:32:55,868 INFO L85 PathProgramCache]: Analyzing trace with hash -689411667, now seen corresponding path program 1 times [2025-03-16 19:32:55,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:32:55,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1886823569] [2025-03-16 19:32:55,868 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:32:55,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:32:55,881 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-16 19:32:55,890 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-16 19:32:55,891 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:32:55,891 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:32:56,021 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-16 19:32:56,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:32:56,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1886823569] [2025-03-16 19:32:56,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1886823569] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:32:56,022 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:32:56,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 19:32:56,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836695989] [2025-03-16 19:32:56,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:32:56,022 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 19:32:56,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:32:56,022 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 19:32:56,022 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-16 19:32:56,022 INFO L87 Difference]: Start difference. First operand 563 states and 868 transitions. Second operand has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 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-16 19:32:56,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:32:56,120 INFO L93 Difference]: Finished difference Result 981 states and 1524 transitions. [2025-03-16 19:32:56,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 19:32:56,120 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 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-16 19:32:56,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:32:56,124 INFO L225 Difference]: With dead ends: 981 [2025-03-16 19:32:56,124 INFO L226 Difference]: Without dead ends: 879 [2025-03-16 19:32:56,126 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-03-16 19:32:56,127 INFO L435 NwaCegarLoop]: 236 mSDtfsCounter, 667 mSDsluCounter, 707 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 667 SdHoareTripleChecker+Valid, 943 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:32:56,127 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [667 Valid, 943 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:32:56,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 879 states. [2025-03-16 19:32:56,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 879 to 664. [2025-03-16 19:32:56,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 664 states, 663 states have (on average 1.55052790346908) internal successors, (1028), 663 states have internal predecessors, (1028), 0 states have call successors, (0), 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-16 19:32:56,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 664 states to 664 states and 1028 transitions. [2025-03-16 19:32:56,148 INFO L78 Accepts]: Start accepts. Automaton has 664 states and 1028 transitions. Word has length 62 [2025-03-16 19:32:56,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:32:56,148 INFO L471 AbstractCegarLoop]: Abstraction has 664 states and 1028 transitions. [2025-03-16 19:32:56,148 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 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-16 19:32:56,148 INFO L276 IsEmpty]: Start isEmpty. Operand 664 states and 1028 transitions. [2025-03-16 19:32:56,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-03-16 19:32:56,150 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:32:56,150 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-16 19:32:56,151 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-16 19:32:56,151 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:32:56,151 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:32:56,151 INFO L85 PathProgramCache]: Analyzing trace with hash 584310458, now seen corresponding path program 1 times [2025-03-16 19:32:56,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:32:56,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1634336628] [2025-03-16 19:32:56,151 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:32:56,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:32:56,172 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-16 19:32:56,180 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-16 19:32:56,181 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:32:56,181 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:32:56,219 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-16 19:32:56,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:32:56,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1634336628] [2025-03-16 19:32:56,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1634336628] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:32:56,220 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:32:56,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:32:56,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1374950371] [2025-03-16 19:32:56,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:32:56,220 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:32:56,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:32:56,221 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:32:56,221 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:32:56,221 INFO L87 Difference]: Start difference. First operand 664 states and 1028 transitions. Second operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:32:56,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:32:56,251 INFO L93 Difference]: Finished difference Result 1697 states and 2655 transitions. [2025-03-16 19:32:56,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:32:56,252 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2025-03-16 19:32:56,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:32:56,255 INFO L225 Difference]: With dead ends: 1697 [2025-03-16 19:32:56,255 INFO L226 Difference]: Without dead ends: 1145 [2025-03-16 19:32:56,256 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-16 19:32:56,257 INFO L435 NwaCegarLoop]: 228 mSDtfsCounter, 68 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 379 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:32:56,257 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 379 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:32:56,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1145 states. [2025-03-16 19:32:56,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1145 to 1121. [2025-03-16 19:32:56,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1121 states, 1120 states have (on average 1.5383928571428571) internal successors, (1723), 1120 states have internal predecessors, (1723), 0 states have call successors, (0), 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-16 19:32:56,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1121 states to 1121 states and 1723 transitions. [2025-03-16 19:32:56,281 INFO L78 Accepts]: Start accepts. Automaton has 1121 states and 1723 transitions. Word has length 62 [2025-03-16 19:32:56,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:32:56,281 INFO L471 AbstractCegarLoop]: Abstraction has 1121 states and 1723 transitions. [2025-03-16 19:32:56,281 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:32:56,281 INFO L276 IsEmpty]: Start isEmpty. Operand 1121 states and 1723 transitions. [2025-03-16 19:32:56,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-03-16 19:32:56,282 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:32:56,282 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-16 19:32:56,282 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-16 19:32:56,282 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:32:56,282 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:32:56,283 INFO L85 PathProgramCache]: Analyzing trace with hash 585472307, now seen corresponding path program 1 times [2025-03-16 19:32:56,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:32:56,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138828891] [2025-03-16 19:32:56,283 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:32:56,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:32:56,295 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-16 19:32:56,303 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-16 19:32:56,303 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:32:56,303 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:32:56,475 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-16 19:32:56,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:32:56,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2138828891] [2025-03-16 19:32:56,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2138828891] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:32:56,476 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:32:56,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 19:32:56,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [270222313] [2025-03-16 19:32:56,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:32:56,476 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 19:32:56,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:32:56,476 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 19:32:56,476 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-16 19:32:56,476 INFO L87 Difference]: Start difference. First operand 1121 states and 1723 transitions. Second operand has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 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-16 19:32:56,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:32:56,575 INFO L93 Difference]: Finished difference Result 2132 states and 3295 transitions. [2025-03-16 19:32:56,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 19:32:56,576 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 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-16 19:32:56,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:32:56,579 INFO L225 Difference]: With dead ends: 2132 [2025-03-16 19:32:56,579 INFO L226 Difference]: Without dead ends: 1123 [2025-03-16 19:32:56,580 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2025-03-16 19:32:56,581 INFO L435 NwaCegarLoop]: 157 mSDtfsCounter, 300 mSDsluCounter, 297 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 300 SdHoareTripleChecker+Valid, 454 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:32:56,581 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [300 Valid, 454 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:32:56,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1123 states. [2025-03-16 19:32:56,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1123 to 1121. [2025-03-16 19:32:56,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1121 states, 1120 states have (on average 1.5330357142857143) internal successors, (1717), 1120 states have internal predecessors, (1717), 0 states have call successors, (0), 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-16 19:32:56,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1121 states to 1121 states and 1717 transitions. [2025-03-16 19:32:56,603 INFO L78 Accepts]: Start accepts. Automaton has 1121 states and 1717 transitions. Word has length 62 [2025-03-16 19:32:56,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:32:56,603 INFO L471 AbstractCegarLoop]: Abstraction has 1121 states and 1717 transitions. [2025-03-16 19:32:56,603 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 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-16 19:32:56,603 INFO L276 IsEmpty]: Start isEmpty. Operand 1121 states and 1717 transitions. [2025-03-16 19:32:56,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-03-16 19:32:56,604 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:32:56,604 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:32:56,604 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-16 19:32:56,604 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:32:56,605 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:32:56,605 INFO L85 PathProgramCache]: Analyzing trace with hash 938526754, now seen corresponding path program 1 times [2025-03-16 19:32:56,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:32:56,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [94662727] [2025-03-16 19:32:56,605 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:32:56,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:32:56,617 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-16 19:32:56,628 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-16 19:32:56,628 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:32:56,628 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:32:56,686 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-16 19:32:56,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:32:56,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [94662727] [2025-03-16 19:32:56,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [94662727] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:32:56,687 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:32:56,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 19:32:56,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [428624025] [2025-03-16 19:32:56,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:32:56,687 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 19:32:56,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:32:56,688 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 19:32:56,688 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:32:56,688 INFO L87 Difference]: Start difference. First operand 1121 states and 1717 transitions. Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 4 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:32:56,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:32:56,782 INFO L93 Difference]: Finished difference Result 2214 states and 3405 transitions. [2025-03-16 19:32:56,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 19:32:56,783 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 4 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2025-03-16 19:32:56,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:32:56,786 INFO L225 Difference]: With dead ends: 2214 [2025-03-16 19:32:56,786 INFO L226 Difference]: Without dead ends: 1121 [2025-03-16 19:32:56,788 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-16 19:32:56,788 INFO L435 NwaCegarLoop]: 86 mSDtfsCounter, 455 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 455 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:32:56,788 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [455 Valid, 90 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:32:56,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1121 states. [2025-03-16 19:32:56,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1121 to 1121. [2025-03-16 19:32:56,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1121 states, 1120 states have (on average 1.5125) internal successors, (1694), 1120 states have internal predecessors, (1694), 0 states have call successors, (0), 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-16 19:32:56,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1121 states to 1121 states and 1694 transitions. [2025-03-16 19:32:56,825 INFO L78 Accepts]: Start accepts. Automaton has 1121 states and 1694 transitions. Word has length 63 [2025-03-16 19:32:56,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:32:56,825 INFO L471 AbstractCegarLoop]: Abstraction has 1121 states and 1694 transitions. [2025-03-16 19:32:56,826 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 4 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:32:56,827 INFO L276 IsEmpty]: Start isEmpty. Operand 1121 states and 1694 transitions. [2025-03-16 19:32:56,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-03-16 19:32:56,827 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:32:56,827 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:32:56,829 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-16 19:32:56,829 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:32:56,830 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:32:56,830 INFO L85 PathProgramCache]: Analyzing trace with hash 296026442, now seen corresponding path program 1 times [2025-03-16 19:32:56,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:32:56,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327689758] [2025-03-16 19:32:56,830 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:32:56,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:32:56,841 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-16 19:32:56,851 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-16 19:32:56,851 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:32:56,851 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:32:56,909 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-16 19:32:56,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:32:56,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327689758] [2025-03-16 19:32:56,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [327689758] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:32:56,909 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:32:56,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 19:32:56,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702669324] [2025-03-16 19:32:56,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:32:56,910 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 19:32:56,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:32:56,910 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 19:32:56,911 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:32:56,911 INFO L87 Difference]: Start difference. First operand 1121 states and 1694 transitions. Second operand has 5 states, 5 states have (on average 12.8) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:32:56,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:32:56,998 INFO L93 Difference]: Finished difference Result 2202 states and 3345 transitions. [2025-03-16 19:32:56,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 19:32:56,998 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2025-03-16 19:32:56,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:32:57,001 INFO L225 Difference]: With dead ends: 2202 [2025-03-16 19:32:57,001 INFO L226 Difference]: Without dead ends: 1121 [2025-03-16 19:32:57,003 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-16 19:32:57,005 INFO L435 NwaCegarLoop]: 86 mSDtfsCounter, 415 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 415 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:32:57,005 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [415 Valid, 114 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:32:57,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1121 states. [2025-03-16 19:32:57,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1121 to 1121. [2025-03-16 19:32:57,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1121 states, 1120 states have (on average 1.4919642857142856) internal successors, (1671), 1120 states have internal predecessors, (1671), 0 states have call successors, (0), 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-16 19:32:57,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1121 states to 1121 states and 1671 transitions. [2025-03-16 19:32:57,024 INFO L78 Accepts]: Start accepts. Automaton has 1121 states and 1671 transitions. Word has length 64 [2025-03-16 19:32:57,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:32:57,025 INFO L471 AbstractCegarLoop]: Abstraction has 1121 states and 1671 transitions. [2025-03-16 19:32:57,025 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:32:57,025 INFO L276 IsEmpty]: Start isEmpty. Operand 1121 states and 1671 transitions. [2025-03-16 19:32:57,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-03-16 19:32:57,026 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:32:57,026 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-16 19:32:57,027 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-16 19:32:57,027 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:32:57,027 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:32:57,027 INFO L85 PathProgramCache]: Analyzing trace with hash -1764976186, now seen corresponding path program 1 times [2025-03-16 19:32:57,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:32:57,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [609136085] [2025-03-16 19:32:57,028 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:32:57,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:32:57,039 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-16 19:32:57,057 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-16 19:32:57,057 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:32:57,057 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:32:57,106 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-16 19:32:57,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:32:57,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [609136085] [2025-03-16 19:32:57,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [609136085] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:32:57,106 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:32:57,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 19:32:57,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114486583] [2025-03-16 19:32:57,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:32:57,107 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 19:32:57,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:32:57,107 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 19:32:57,107 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:32:57,108 INFO L87 Difference]: Start difference. First operand 1121 states and 1671 transitions. Second operand has 5 states, 5 states have (on average 13.0) internal successors, (65), 4 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-16 19:32:57,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:32:57,193 INFO L93 Difference]: Finished difference Result 2210 states and 3309 transitions. [2025-03-16 19:32:57,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 19:32:57,193 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 4 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-16 19:32:57,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:32:57,196 INFO L225 Difference]: With dead ends: 2210 [2025-03-16 19:32:57,196 INFO L226 Difference]: Without dead ends: 1121 [2025-03-16 19:32:57,197 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-16 19:32:57,198 INFO L435 NwaCegarLoop]: 86 mSDtfsCounter, 431 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 431 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:32:57,198 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [431 Valid, 98 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:32:57,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1121 states. [2025-03-16 19:32:57,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1121 to 1121. [2025-03-16 19:32:57,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1121 states, 1120 states have (on average 1.4714285714285715) internal successors, (1648), 1120 states have internal predecessors, (1648), 0 states have call successors, (0), 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-16 19:32:57,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1121 states to 1121 states and 1648 transitions. [2025-03-16 19:32:57,216 INFO L78 Accepts]: Start accepts. Automaton has 1121 states and 1648 transitions. Word has length 65 [2025-03-16 19:32:57,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:32:57,216 INFO L471 AbstractCegarLoop]: Abstraction has 1121 states and 1648 transitions. [2025-03-16 19:32:57,216 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 4 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-16 19:32:57,217 INFO L276 IsEmpty]: Start isEmpty. Operand 1121 states and 1648 transitions. [2025-03-16 19:32:57,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-03-16 19:32:57,217 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:32:57,217 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-16 19:32:57,217 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-16 19:32:57,217 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:32:57,218 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:32:57,218 INFO L85 PathProgramCache]: Analyzing trace with hash -19759542, now seen corresponding path program 1 times [2025-03-16 19:32:57,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:32:57,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2136238475] [2025-03-16 19:32:57,218 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:32:57,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:32:57,227 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-16 19:32:57,234 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-16 19:32:57,234 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:32:57,234 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:32:57,280 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-16 19:32:57,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:32:57,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2136238475] [2025-03-16 19:32:57,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2136238475] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:32:57,280 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:32:57,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 19:32:57,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1547767522] [2025-03-16 19:32:57,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:32:57,281 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 19:32:57,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:32:57,281 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 19:32:57,281 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:32:57,281 INFO L87 Difference]: Start difference. First operand 1121 states and 1648 transitions. Second operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 4 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-16 19:32:57,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:32:57,363 INFO L93 Difference]: Finished difference Result 2206 states and 3259 transitions. [2025-03-16 19:32:57,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 19:32:57,363 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 4 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-16 19:32:57,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:32:57,366 INFO L225 Difference]: With dead ends: 2206 [2025-03-16 19:32:57,366 INFO L226 Difference]: Without dead ends: 1121 [2025-03-16 19:32:57,367 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-16 19:32:57,368 INFO L435 NwaCegarLoop]: 86 mSDtfsCounter, 413 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 413 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:32:57,368 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [413 Valid, 106 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:32:57,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1121 states. [2025-03-16 19:32:57,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1121 to 1121. [2025-03-16 19:32:57,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1121 states, 1120 states have (on average 1.4508928571428572) internal successors, (1625), 1120 states have internal predecessors, (1625), 0 states have call successors, (0), 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-16 19:32:57,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1121 states to 1121 states and 1625 transitions. [2025-03-16 19:32:57,385 INFO L78 Accepts]: Start accepts. Automaton has 1121 states and 1625 transitions. Word has length 66 [2025-03-16 19:32:57,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:32:57,385 INFO L471 AbstractCegarLoop]: Abstraction has 1121 states and 1625 transitions. [2025-03-16 19:32:57,386 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 4 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-16 19:32:57,386 INFO L276 IsEmpty]: Start isEmpty. Operand 1121 states and 1625 transitions. [2025-03-16 19:32:57,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-03-16 19:32:57,386 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:32:57,386 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:32:57,386 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-16 19:32:57,386 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:32:57,387 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:32:57,387 INFO L85 PathProgramCache]: Analyzing trace with hash 633418346, now seen corresponding path program 1 times [2025-03-16 19:32:57,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:32:57,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1830007435] [2025-03-16 19:32:57,387 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:32:57,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:32:57,395 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-03-16 19:32:57,428 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-03-16 19:32:57,428 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:32:57,428 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:32:57,631 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-16 19:32:57,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:32:57,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1830007435] [2025-03-16 19:32:57,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1830007435] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:32:57,631 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:32:57,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 19:32:57,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637601732] [2025-03-16 19:32:57,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:32:57,632 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 19:32:57,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:32:57,632 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 19:32:57,632 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-16 19:32:57,632 INFO L87 Difference]: Start difference. First operand 1121 states and 1625 transitions. Second operand has 8 states, 8 states have (on average 8.375) internal successors, (67), 7 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:32:57,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:32:57,902 INFO L93 Difference]: Finished difference Result 3184 states and 4645 transitions. [2025-03-16 19:32:57,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 19:32:57,902 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.375) internal successors, (67), 7 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2025-03-16 19:32:57,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:32:57,908 INFO L225 Difference]: With dead ends: 3184 [2025-03-16 19:32:57,908 INFO L226 Difference]: Without dead ends: 2135 [2025-03-16 19:32:57,909 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2025-03-16 19:32:57,910 INFO L435 NwaCegarLoop]: 81 mSDtfsCounter, 580 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 330 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 580 SdHoareTripleChecker+Valid, 369 SdHoareTripleChecker+Invalid, 331 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 330 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 19:32:57,910 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [580 Valid, 369 Invalid, 331 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 330 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 19:32:57,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2135 states. [2025-03-16 19:32:57,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2135 to 1121. [2025-03-16 19:32:57,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1121 states, 1120 states have (on average 1.45) internal successors, (1624), 1120 states have internal predecessors, (1624), 0 states have call successors, (0), 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-16 19:32:57,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1121 states to 1121 states and 1624 transitions. [2025-03-16 19:32:57,932 INFO L78 Accepts]: Start accepts. Automaton has 1121 states and 1624 transitions. Word has length 67 [2025-03-16 19:32:57,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:32:57,933 INFO L471 AbstractCegarLoop]: Abstraction has 1121 states and 1624 transitions. [2025-03-16 19:32:57,933 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.375) internal successors, (67), 7 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:32:57,933 INFO L276 IsEmpty]: Start isEmpty. Operand 1121 states and 1624 transitions. [2025-03-16 19:32:57,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-03-16 19:32:57,934 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:32:57,934 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:32:57,934 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-16 19:32:57,934 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:32:57,934 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:32:57,934 INFO L85 PathProgramCache]: Analyzing trace with hash -2151550, now seen corresponding path program 1 times [2025-03-16 19:32:57,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:32:57,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [958761697] [2025-03-16 19:32:57,935 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:32:57,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:32:57,943 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-16 19:32:57,953 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-16 19:32:57,953 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:32:57,953 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:32:58,123 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-16 19:32:58,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:32:58,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [958761697] [2025-03-16 19:32:58,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [958761697] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:32:58,123 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:32:58,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-16 19:32:58,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299376432] [2025-03-16 19:32:58,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:32:58,124 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-16 19:32:58,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:32:58,124 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-16 19:32:58,124 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-03-16 19:32:58,125 INFO L87 Difference]: Start difference. First operand 1121 states and 1624 transitions. Second operand has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:32:58,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:32:58,464 INFO L93 Difference]: Finished difference Result 3258 states and 4736 transitions. [2025-03-16 19:32:58,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-16 19:32:58,465 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2025-03-16 19:32:58,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:32:58,470 INFO L225 Difference]: With dead ends: 3258 [2025-03-16 19:32:58,470 INFO L226 Difference]: Without dead ends: 2214 [2025-03-16 19:32:58,471 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=95, Invalid=285, Unknown=0, NotChecked=0, Total=380 [2025-03-16 19:32:58,472 INFO L435 NwaCegarLoop]: 99 mSDtfsCounter, 398 mSDsluCounter, 401 mSDsCounter, 0 mSdLazyCounter, 476 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 398 SdHoareTripleChecker+Valid, 500 SdHoareTripleChecker+Invalid, 480 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 476 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 19:32:58,472 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [398 Valid, 500 Invalid, 480 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 476 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 19:32:58,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2214 states. [2025-03-16 19:32:58,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2214 to 1121. [2025-03-16 19:32:58,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1121 states, 1120 states have (on average 1.4482142857142857) internal successors, (1622), 1120 states have internal predecessors, (1622), 0 states have call successors, (0), 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-16 19:32:58,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1121 states to 1121 states and 1622 transitions. [2025-03-16 19:32:58,495 INFO L78 Accepts]: Start accepts. Automaton has 1121 states and 1622 transitions. Word has length 68 [2025-03-16 19:32:58,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:32:58,495 INFO L471 AbstractCegarLoop]: Abstraction has 1121 states and 1622 transitions. [2025-03-16 19:32:58,495 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:32:58,495 INFO L276 IsEmpty]: Start isEmpty. Operand 1121 states and 1622 transitions. [2025-03-16 19:32:58,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-03-16 19:32:58,496 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:32:58,496 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:32:58,496 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-16 19:32:58,496 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:32:58,496 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:32:58,497 INFO L85 PathProgramCache]: Analyzing trace with hash -1849473751, now seen corresponding path program 1 times [2025-03-16 19:32:58,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:32:58,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [700141810] [2025-03-16 19:32:58,497 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:32:58,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:32:58,506 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-16 19:32:58,513 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-16 19:32:58,514 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:32:58,514 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:32:58,705 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-16 19:32:58,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:32:58,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [700141810] [2025-03-16 19:32:58,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [700141810] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:32:58,706 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:32:58,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-16 19:32:58,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764230406] [2025-03-16 19:32:58,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:32:58,706 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-16 19:32:58,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:32:58,707 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-16 19:32:58,707 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-03-16 19:32:58,707 INFO L87 Difference]: Start difference. First operand 1121 states and 1622 transitions. Second operand has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:32:59,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:32:59,040 INFO L93 Difference]: Finished difference Result 3213 states and 4662 transitions. [2025-03-16 19:32:59,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-16 19:32:59,041 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2025-03-16 19:32:59,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:32:59,046 INFO L225 Difference]: With dead ends: 3213 [2025-03-16 19:32:59,046 INFO L226 Difference]: Without dead ends: 2199 [2025-03-16 19:32:59,047 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=95, Invalid=285, Unknown=0, NotChecked=0, Total=380 [2025-03-16 19:32:59,047 INFO L435 NwaCegarLoop]: 81 mSDtfsCounter, 406 mSDsluCounter, 331 mSDsCounter, 0 mSdLazyCounter, 386 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 406 SdHoareTripleChecker+Valid, 412 SdHoareTripleChecker+Invalid, 390 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 386 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 19:32:59,048 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [406 Valid, 412 Invalid, 390 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 386 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 19:32:59,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2199 states. [2025-03-16 19:32:59,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2199 to 1121. [2025-03-16 19:32:59,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1121 states, 1120 states have (on average 1.44375) internal successors, (1617), 1120 states have internal predecessors, (1617), 0 states have call successors, (0), 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-16 19:32:59,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1121 states to 1121 states and 1617 transitions. [2025-03-16 19:32:59,073 INFO L78 Accepts]: Start accepts. Automaton has 1121 states and 1617 transitions. Word has length 68 [2025-03-16 19:32:59,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:32:59,073 INFO L471 AbstractCegarLoop]: Abstraction has 1121 states and 1617 transitions. [2025-03-16 19:32:59,073 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:32:59,073 INFO L276 IsEmpty]: Start isEmpty. Operand 1121 states and 1617 transitions. [2025-03-16 19:32:59,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-03-16 19:32:59,074 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:32:59,074 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:32:59,074 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-16 19:32:59,074 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:32:59,075 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:32:59,075 INFO L85 PathProgramCache]: Analyzing trace with hash -15695863, now seen corresponding path program 1 times [2025-03-16 19:32:59,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:32:59,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1057244210] [2025-03-16 19:32:59,075 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:32:59,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:32:59,086 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-16 19:32:59,102 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-16 19:32:59,102 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:32:59,102 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:32:59,280 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-16 19:32:59,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:32:59,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1057244210] [2025-03-16 19:32:59,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1057244210] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:32:59,281 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:32:59,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-16 19:32:59,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344727686] [2025-03-16 19:32:59,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:32:59,281 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-16 19:32:59,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:32:59,282 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-16 19:32:59,282 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-16 19:32:59,282 INFO L87 Difference]: Start difference. First operand 1121 states and 1617 transitions. Second operand has 9 states, 9 states have (on average 7.666666666666667) internal successors, (69), 8 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:32:59,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:32:59,652 INFO L93 Difference]: Finished difference Result 3243 states and 4697 transitions. [2025-03-16 19:32:59,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-16 19:32:59,652 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.666666666666667) internal successors, (69), 8 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2025-03-16 19:32:59,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:32:59,656 INFO L225 Difference]: With dead ends: 3243 [2025-03-16 19:32:59,657 INFO L226 Difference]: Without dead ends: 2209 [2025-03-16 19:32:59,657 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=108, Invalid=312, Unknown=0, NotChecked=0, Total=420 [2025-03-16 19:32:59,658 INFO L435 NwaCegarLoop]: 93 mSDtfsCounter, 607 mSDsluCounter, 378 mSDsCounter, 0 mSdLazyCounter, 436 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 607 SdHoareTripleChecker+Valid, 471 SdHoareTripleChecker+Invalid, 440 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 436 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 19:32:59,658 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [607 Valid, 471 Invalid, 440 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 436 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 19:32:59,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2209 states. [2025-03-16 19:32:59,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2209 to 1121. [2025-03-16 19:32:59,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1121 states, 1120 states have (on average 1.4401785714285715) internal successors, (1613), 1120 states have internal predecessors, (1613), 0 states have call successors, (0), 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-16 19:32:59,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1121 states to 1121 states and 1613 transitions. [2025-03-16 19:32:59,674 INFO L78 Accepts]: Start accepts. Automaton has 1121 states and 1613 transitions. Word has length 69 [2025-03-16 19:32:59,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:32:59,674 INFO L471 AbstractCegarLoop]: Abstraction has 1121 states and 1613 transitions. [2025-03-16 19:32:59,675 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.666666666666667) internal successors, (69), 8 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:32:59,675 INFO L276 IsEmpty]: Start isEmpty. Operand 1121 states and 1613 transitions. [2025-03-16 19:32:59,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-03-16 19:32:59,675 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:32:59,675 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:32:59,675 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-16 19:32:59,675 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:32:59,676 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:32:59,676 INFO L85 PathProgramCache]: Analyzing trace with hash 2112048385, now seen corresponding path program 1 times [2025-03-16 19:32:59,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:32:59,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1579092403] [2025-03-16 19:32:59,676 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:32:59,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:32:59,684 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-16 19:32:59,703 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-16 19:32:59,704 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:32:59,704 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:33:00,163 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-16 19:33:00,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:33:00,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1579092403] [2025-03-16 19:33:00,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1579092403] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:33:00,164 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:33:00,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-16 19:33:00,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886602444] [2025-03-16 19:33:00,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:33:00,164 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-16 19:33:00,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:33:00,164 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-16 19:33:00,164 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2025-03-16 19:33:00,164 INFO L87 Difference]: Start difference. First operand 1121 states and 1613 transitions. Second operand has 13 states, 13 states have (on average 5.384615384615385) internal successors, (70), 12 states have internal predecessors, (70), 0 states have call successors, (0), 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-16 19:33:00,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:33:00,699 INFO L93 Difference]: Finished difference Result 2528 states and 3669 transitions. [2025-03-16 19:33:00,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-16 19:33:00,699 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.384615384615385) internal successors, (70), 12 states have internal predecessors, (70), 0 states have call successors, (0), 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 70 [2025-03-16 19:33:00,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:33:00,703 INFO L225 Difference]: With dead ends: 2528 [2025-03-16 19:33:00,703 INFO L226 Difference]: Without dead ends: 2138 [2025-03-16 19:33:00,704 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=142, Invalid=458, Unknown=0, NotChecked=0, Total=600 [2025-03-16 19:33:00,705 INFO L435 NwaCegarLoop]: 206 mSDtfsCounter, 570 mSDsluCounter, 1238 mSDsCounter, 0 mSdLazyCounter, 350 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 570 SdHoareTripleChecker+Valid, 1444 SdHoareTripleChecker+Invalid, 350 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 350 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 19:33:00,705 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [570 Valid, 1444 Invalid, 350 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 350 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 19:33:00,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2138 states. [2025-03-16 19:33:00,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2138 to 1105. [2025-03-16 19:33:00,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1105 states, 1104 states have (on average 1.4393115942028984) internal successors, (1589), 1104 states have internal predecessors, (1589), 0 states have call successors, (0), 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-16 19:33:00,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1105 states to 1105 states and 1589 transitions. [2025-03-16 19:33:00,728 INFO L78 Accepts]: Start accepts. Automaton has 1105 states and 1589 transitions. Word has length 70 [2025-03-16 19:33:00,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:33:00,728 INFO L471 AbstractCegarLoop]: Abstraction has 1105 states and 1589 transitions. [2025-03-16 19:33:00,728 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.384615384615385) internal successors, (70), 12 states have internal predecessors, (70), 0 states have call successors, (0), 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-16 19:33:00,728 INFO L276 IsEmpty]: Start isEmpty. Operand 1105 states and 1589 transitions. [2025-03-16 19:33:00,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-03-16 19:33:00,729 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:33:00,729 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:33:00,729 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-16 19:33:00,729 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:33:00,730 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:33:00,730 INFO L85 PathProgramCache]: Analyzing trace with hash 138774017, now seen corresponding path program 1 times [2025-03-16 19:33:00,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:33:00,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2018127320] [2025-03-16 19:33:00,730 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:33:00,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:33:00,739 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-16 19:33:00,758 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-16 19:33:00,758 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:33:00,758 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:33:01,439 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-16 19:33:01,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:33:01,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2018127320] [2025-03-16 19:33:01,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2018127320] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:33:01,439 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:33:01,439 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2025-03-16 19:33:01,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [576245468] [2025-03-16 19:33:01,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:33:01,440 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-16 19:33:01,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:33:01,440 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-16 19:33:01,440 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=265, Unknown=0, NotChecked=0, Total=306 [2025-03-16 19:33:01,440 INFO L87 Difference]: Start difference. First operand 1105 states and 1589 transitions. Second operand has 18 states, 18 states have (on average 3.888888888888889) internal successors, (70), 17 states have internal predecessors, (70), 0 states have call successors, (0), 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-16 19:33:02,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:33:02,680 INFO L93 Difference]: Finished difference Result 3535 states and 5139 transitions. [2025-03-16 19:33:02,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-16 19:33:02,680 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.888888888888889) internal successors, (70), 17 states have internal predecessors, (70), 0 states have call successors, (0), 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 70 [2025-03-16 19:33:02,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:33:02,687 INFO L225 Difference]: With dead ends: 3535 [2025-03-16 19:33:02,687 INFO L226 Difference]: Without dead ends: 3165 [2025-03-16 19:33:02,688 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 136 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=265, Invalid=925, Unknown=0, NotChecked=0, Total=1190 [2025-03-16 19:33:02,688 INFO L435 NwaCegarLoop]: 178 mSDtfsCounter, 1267 mSDsluCounter, 1677 mSDsCounter, 0 mSdLazyCounter, 817 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1267 SdHoareTripleChecker+Valid, 1855 SdHoareTripleChecker+Invalid, 818 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 817 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 19:33:02,688 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1267 Valid, 1855 Invalid, 818 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 817 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 19:33:02,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3165 states. [2025-03-16 19:33:02,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3165 to 1125. [2025-03-16 19:33:02,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1125 states, 1124 states have (on average 1.4341637010676156) internal successors, (1612), 1124 states have internal predecessors, (1612), 0 states have call successors, (0), 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-16 19:33:02,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1125 states to 1125 states and 1612 transitions. [2025-03-16 19:33:02,706 INFO L78 Accepts]: Start accepts. Automaton has 1125 states and 1612 transitions. Word has length 70 [2025-03-16 19:33:02,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:33:02,706 INFO L471 AbstractCegarLoop]: Abstraction has 1125 states and 1612 transitions. [2025-03-16 19:33:02,707 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.888888888888889) internal successors, (70), 17 states have internal predecessors, (70), 0 states have call successors, (0), 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-16 19:33:02,707 INFO L276 IsEmpty]: Start isEmpty. Operand 1125 states and 1612 transitions. [2025-03-16 19:33:02,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-03-16 19:33:02,707 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:33:02,707 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:33:02,707 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-16 19:33:02,708 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:33:02,708 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:33:02,708 INFO L85 PathProgramCache]: Analyzing trace with hash 297985833, now seen corresponding path program 1 times [2025-03-16 19:33:02,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:33:02,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736716289] [2025-03-16 19:33:02,708 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:33:02,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:33:02,716 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-16 19:33:02,726 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-16 19:33:02,726 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:33:02,726 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:33:03,095 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-16 19:33:03,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:33:03,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [736716289] [2025-03-16 19:33:03,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [736716289] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:33:03,095 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:33:03,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-16 19:33:03,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044105235] [2025-03-16 19:33:03,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:33:03,096 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-16 19:33:03,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:33:03,096 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-16 19:33:03,096 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2025-03-16 19:33:03,096 INFO L87 Difference]: Start difference. First operand 1125 states and 1612 transitions. Second operand has 12 states, 12 states have (on average 5.833333333333333) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 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-16 19:33:03,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:33:03,501 INFO L93 Difference]: Finished difference Result 4527 states and 6589 transitions. [2025-03-16 19:33:03,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-16 19:33:03,501 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.833333333333333) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 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 70 [2025-03-16 19:33:03,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:33:03,514 INFO L225 Difference]: With dead ends: 4527 [2025-03-16 19:33:03,514 INFO L226 Difference]: Without dead ends: 4137 [2025-03-16 19:33:03,516 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=135, Invalid=327, Unknown=0, NotChecked=0, Total=462 [2025-03-16 19:33:03,516 INFO L435 NwaCegarLoop]: 225 mSDtfsCounter, 998 mSDsluCounter, 1190 mSDsCounter, 0 mSdLazyCounter, 300 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 998 SdHoareTripleChecker+Valid, 1415 SdHoareTripleChecker+Invalid, 300 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 300 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 19:33:03,516 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [998 Valid, 1415 Invalid, 300 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 300 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 19:33:03,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4137 states. [2025-03-16 19:33:03,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4137 to 1104. [2025-03-16 19:33:03,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1104 states, 1103 states have (on average 1.4369900271985494) internal successors, (1585), 1103 states have internal predecessors, (1585), 0 states have call successors, (0), 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-16 19:33:03,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1104 states to 1104 states and 1585 transitions. [2025-03-16 19:33:03,538 INFO L78 Accepts]: Start accepts. Automaton has 1104 states and 1585 transitions. Word has length 70 [2025-03-16 19:33:03,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:33:03,538 INFO L471 AbstractCegarLoop]: Abstraction has 1104 states and 1585 transitions. [2025-03-16 19:33:03,538 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.833333333333333) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 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-16 19:33:03,538 INFO L276 IsEmpty]: Start isEmpty. Operand 1104 states and 1585 transitions. [2025-03-16 19:33:03,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-03-16 19:33:03,538 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:33:03,538 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:33:03,538 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-16 19:33:03,539 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:33:03,539 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:33:03,539 INFO L85 PathProgramCache]: Analyzing trace with hash -1425434481, now seen corresponding path program 1 times [2025-03-16 19:33:03,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:33:03,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2036781225] [2025-03-16 19:33:03,539 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:33:03,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:33:03,548 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-16 19:33:03,567 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-16 19:33:03,570 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:33:03,571 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:33:04,525 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-16 19:33:04,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:33:04,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2036781225] [2025-03-16 19:33:04,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2036781225] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:33:04,526 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:33:04,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2025-03-16 19:33:04,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1778766578] [2025-03-16 19:33:04,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:33:04,527 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-03-16 19:33:04,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:33:04,527 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-03-16 19:33:04,528 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=632, Unknown=0, NotChecked=0, Total=702 [2025-03-16 19:33:04,528 INFO L87 Difference]: Start difference. First operand 1104 states and 1585 transitions. Second operand has 27 states, 27 states have (on average 2.6296296296296298) internal successors, (71), 26 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:33:06,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:33:06,422 INFO L93 Difference]: Finished difference Result 5549 states and 8084 transitions. [2025-03-16 19:33:06,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-03-16 19:33:06,422 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 2.6296296296296298) internal successors, (71), 26 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 71 [2025-03-16 19:33:06,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:33:06,429 INFO L225 Difference]: With dead ends: 5549 [2025-03-16 19:33:06,429 INFO L226 Difference]: Without dead ends: 5180 [2025-03-16 19:33:06,431 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 331 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=373, Invalid=1979, Unknown=0, NotChecked=0, Total=2352 [2025-03-16 19:33:06,431 INFO L435 NwaCegarLoop]: 269 mSDtfsCounter, 1379 mSDsluCounter, 3717 mSDsCounter, 0 mSdLazyCounter, 2541 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1379 SdHoareTripleChecker+Valid, 3986 SdHoareTripleChecker+Invalid, 2541 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2541 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:33:06,431 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1379 Valid, 3986 Invalid, 2541 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2541 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-16 19:33:06,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5180 states. [2025-03-16 19:33:06,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5180 to 1113. [2025-03-16 19:33:06,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1113 states, 1112 states have (on average 1.435251798561151) internal successors, (1596), 1112 states have internal predecessors, (1596), 0 states have call successors, (0), 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-16 19:33:06,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1113 states to 1113 states and 1596 transitions. [2025-03-16 19:33:06,455 INFO L78 Accepts]: Start accepts. Automaton has 1113 states and 1596 transitions. Word has length 71 [2025-03-16 19:33:06,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:33:06,455 INFO L471 AbstractCegarLoop]: Abstraction has 1113 states and 1596 transitions. [2025-03-16 19:33:06,455 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 2.6296296296296298) internal successors, (71), 26 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:33:06,455 INFO L276 IsEmpty]: Start isEmpty. Operand 1113 states and 1596 transitions. [2025-03-16 19:33:06,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-03-16 19:33:06,455 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:33:06,455 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:33:06,455 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-16 19:33:06,456 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:33:06,456 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:33:06,456 INFO L85 PathProgramCache]: Analyzing trace with hash 310226618, now seen corresponding path program 1 times [2025-03-16 19:33:06,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:33:06,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [161455827] [2025-03-16 19:33:06,456 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:33:06,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:33:06,464 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-16 19:33:06,474 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-16 19:33:06,475 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:33:06,475 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:33:06,532 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-16 19:33:06,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:33:06,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [161455827] [2025-03-16 19:33:06,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [161455827] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:33:06,533 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:33:06,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 19:33:06,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [823696992] [2025-03-16 19:33:06,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:33:06,533 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 19:33:06,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:33:06,533 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 19:33:06,534 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 19:33:06,534 INFO L87 Difference]: Start difference. First operand 1113 states and 1596 transitions. Second operand has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:33:06,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:33:06,556 INFO L93 Difference]: Finished difference Result 2525 states and 3665 transitions. [2025-03-16 19:33:06,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 19:33:06,557 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 71 [2025-03-16 19:33:06,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:33:06,559 INFO L225 Difference]: With dead ends: 2525 [2025-03-16 19:33:06,559 INFO L226 Difference]: Without dead ends: 1516 [2025-03-16 19:33:06,560 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 19:33:06,560 INFO L435 NwaCegarLoop]: 144 mSDtfsCounter, 73 mSDsluCounter, 210 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 354 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:33:06,561 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 354 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:33:06,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1516 states. [2025-03-16 19:33:06,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1516 to 1505. [2025-03-16 19:33:06,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1505 states, 1504 states have (on average 1.4328457446808511) internal successors, (2155), 1504 states have internal predecessors, (2155), 0 states have call successors, (0), 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-16 19:33:06,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1505 states to 1505 states and 2155 transitions. [2025-03-16 19:33:06,574 INFO L78 Accepts]: Start accepts. Automaton has 1505 states and 2155 transitions. Word has length 71 [2025-03-16 19:33:06,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:33:06,574 INFO L471 AbstractCegarLoop]: Abstraction has 1505 states and 2155 transitions. [2025-03-16 19:33:06,574 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:33:06,574 INFO L276 IsEmpty]: Start isEmpty. Operand 1505 states and 2155 transitions. [2025-03-16 19:33:06,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-03-16 19:33:06,574 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:33:06,574 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:33:06,575 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-16 19:33:06,575 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:33:06,575 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:33:06,575 INFO L85 PathProgramCache]: Analyzing trace with hash 342430689, now seen corresponding path program 1 times [2025-03-16 19:33:06,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:33:06,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916875116] [2025-03-16 19:33:06,575 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:33:06,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:33:06,582 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-16 19:33:06,591 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-16 19:33:06,591 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:33:06,591 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:33:06,703 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-16 19:33:06,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:33:06,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1916875116] [2025-03-16 19:33:06,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1916875116] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:33:06,703 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:33:06,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 19:33:06,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697299056] [2025-03-16 19:33:06,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:33:06,704 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 19:33:06,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:33:06,704 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 19:33:06,704 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:33:06,704 INFO L87 Difference]: Start difference. First operand 1505 states and 2155 transitions. Second operand has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:33:06,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:33:06,722 INFO L93 Difference]: Finished difference Result 1517 states and 2171 transitions. [2025-03-16 19:33:06,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 19:33:06,722 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 71 [2025-03-16 19:33:06,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:33:06,724 INFO L225 Difference]: With dead ends: 1517 [2025-03-16 19:33:06,724 INFO L226 Difference]: Without dead ends: 1515 [2025-03-16 19:33:06,725 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-16 19:33:06,726 INFO L435 NwaCegarLoop]: 148 mSDtfsCounter, 0 mSDsluCounter, 433 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 581 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:33:06,726 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 581 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:33:06,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1515 states. [2025-03-16 19:33:06,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1515 to 1515. [2025-03-16 19:33:06,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1515 states, 1514 states have (on average 1.4227212681638044) internal successors, (2154), 1514 states have internal predecessors, (2154), 0 states have call successors, (0), 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-16 19:33:06,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1515 states to 1515 states and 2154 transitions. [2025-03-16 19:33:06,740 INFO L78 Accepts]: Start accepts. Automaton has 1515 states and 2154 transitions. Word has length 71 [2025-03-16 19:33:06,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:33:06,740 INFO L471 AbstractCegarLoop]: Abstraction has 1515 states and 2154 transitions. [2025-03-16 19:33:06,740 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:33:06,740 INFO L276 IsEmpty]: Start isEmpty. Operand 1515 states and 2154 transitions. [2025-03-16 19:33:06,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-03-16 19:33:06,740 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:33:06,741 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:33:06,741 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-16 19:33:06,741 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:33:06,741 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:33:06,741 INFO L85 PathProgramCache]: Analyzing trace with hash -406189145, now seen corresponding path program 1 times [2025-03-16 19:33:06,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:33:06,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595902540] [2025-03-16 19:33:06,741 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:33:06,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:33:06,748 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-16 19:33:06,760 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-16 19:33:06,760 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:33:06,760 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:33:07,112 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-16 19:33:07,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:33:07,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595902540] [2025-03-16 19:33:07,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [595902540] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:33:07,112 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:33:07,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-16 19:33:07,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1265013512] [2025-03-16 19:33:07,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:33:07,113 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-16 19:33:07,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:33:07,113 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-16 19:33:07,113 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2025-03-16 19:33:07,113 INFO L87 Difference]: Start difference. First operand 1515 states and 2154 transitions. Second operand has 13 states, 13 states have (on average 5.461538461538462) internal successors, (71), 12 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:33:07,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:33:07,618 INFO L93 Difference]: Finished difference Result 3483 states and 4991 transitions. [2025-03-16 19:33:07,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-16 19:33:07,619 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.461538461538462) internal successors, (71), 12 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 71 [2025-03-16 19:33:07,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:33:07,623 INFO L225 Difference]: With dead ends: 3483 [2025-03-16 19:33:07,623 INFO L226 Difference]: Without dead ends: 2935 [2025-03-16 19:33:07,624 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=142, Invalid=458, Unknown=0, NotChecked=0, Total=600 [2025-03-16 19:33:07,625 INFO L435 NwaCegarLoop]: 184 mSDtfsCounter, 657 mSDsluCounter, 1197 mSDsCounter, 0 mSdLazyCounter, 374 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 657 SdHoareTripleChecker+Valid, 1381 SdHoareTripleChecker+Invalid, 374 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 374 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 19:33:07,628 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [657 Valid, 1381 Invalid, 374 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 374 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 19:33:07,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2935 states. [2025-03-16 19:33:07,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2935 to 1497. [2025-03-16 19:33:07,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1497 states, 1496 states have (on average 1.4237967914438503) internal successors, (2130), 1496 states have internal predecessors, (2130), 0 states have call successors, (0), 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-16 19:33:07,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1497 states to 1497 states and 2130 transitions. [2025-03-16 19:33:07,644 INFO L78 Accepts]: Start accepts. Automaton has 1497 states and 2130 transitions. Word has length 71 [2025-03-16 19:33:07,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:33:07,644 INFO L471 AbstractCegarLoop]: Abstraction has 1497 states and 2130 transitions. [2025-03-16 19:33:07,644 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.461538461538462) internal successors, (71), 12 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:33:07,645 INFO L276 IsEmpty]: Start isEmpty. Operand 1497 states and 2130 transitions. [2025-03-16 19:33:07,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-03-16 19:33:07,645 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:33:07,645 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:33:07,645 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-16 19:33:07,645 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:33:07,645 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:33:07,645 INFO L85 PathProgramCache]: Analyzing trace with hash 499934849, now seen corresponding path program 1 times [2025-03-16 19:33:07,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:33:07,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1109483714] [2025-03-16 19:33:07,646 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:33:07,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:33:07,654 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-03-16 19:33:07,673 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-03-16 19:33:07,673 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:33:07,673 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:33:08,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-16 19:33:08,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:33:08,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1109483714] [2025-03-16 19:33:08,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1109483714] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:33:08,014 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:33:08,014 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-16 19:33:08,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599788059] [2025-03-16 19:33:08,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:33:08,015 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-16 19:33:08,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:33:08,015 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-16 19:33:08,015 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2025-03-16 19:33:08,015 INFO L87 Difference]: Start difference. First operand 1497 states and 2130 transitions. Second operand has 13 states, 13 states have (on average 5.538461538461538) internal successors, (72), 12 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:33:08,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:33:08,538 INFO L93 Difference]: Finished difference Result 3465 states and 4967 transitions. [2025-03-16 19:33:08,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-16 19:33:08,539 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.538461538461538) internal successors, (72), 12 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 72 [2025-03-16 19:33:08,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:33:08,542 INFO L225 Difference]: With dead ends: 3465 [2025-03-16 19:33:08,543 INFO L226 Difference]: Without dead ends: 2909 [2025-03-16 19:33:08,544 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=142, Invalid=458, Unknown=0, NotChecked=0, Total=600 [2025-03-16 19:33:08,544 INFO L435 NwaCegarLoop]: 196 mSDtfsCounter, 542 mSDsluCounter, 1169 mSDsCounter, 0 mSdLazyCounter, 348 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 542 SdHoareTripleChecker+Valid, 1365 SdHoareTripleChecker+Invalid, 348 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 348 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 19:33:08,544 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [542 Valid, 1365 Invalid, 348 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 348 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 19:33:08,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2909 states. [2025-03-16 19:33:08,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2909 to 1478. [2025-03-16 19:33:08,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1478 states, 1477 states have (on average 1.4258632362897765) internal successors, (2106), 1477 states have internal predecessors, (2106), 0 states have call successors, (0), 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-16 19:33:08,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1478 states to 1478 states and 2106 transitions. [2025-03-16 19:33:08,571 INFO L78 Accepts]: Start accepts. Automaton has 1478 states and 2106 transitions. Word has length 72 [2025-03-16 19:33:08,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:33:08,571 INFO L471 AbstractCegarLoop]: Abstraction has 1478 states and 2106 transitions. [2025-03-16 19:33:08,571 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.538461538461538) internal successors, (72), 12 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:33:08,572 INFO L276 IsEmpty]: Start isEmpty. Operand 1478 states and 2106 transitions. [2025-03-16 19:33:08,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-03-16 19:33:08,573 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:33:08,573 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:33:08,573 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-16 19:33:08,573 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:33:08,573 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:33:08,574 INFO L85 PathProgramCache]: Analyzing trace with hash -301473756, now seen corresponding path program 1 times [2025-03-16 19:33:08,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:33:08,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1446212731] [2025-03-16 19:33:08,574 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:33:08,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:33:08,586 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-16 19:33:08,595 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-16 19:33:08,595 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:33:08,595 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:33:08,666 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:33:08,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:33:08,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1446212731] [2025-03-16 19:33:08,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1446212731] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:33:08,666 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:33:08,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 19:33:08,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [672584878] [2025-03-16 19:33:08,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:33:08,667 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 19:33:08,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:33:08,667 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 19:33:08,667 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-16 19:33:08,667 INFO L87 Difference]: Start difference. First operand 1478 states and 2106 transitions. Second operand has 7 states, 7 states have (on average 13.714285714285714) internal successors, (96), 6 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:33:08,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:33:08,871 INFO L93 Difference]: Finished difference Result 4735 states and 6875 transitions. [2025-03-16 19:33:08,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 19:33:08,872 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.714285714285714) internal successors, (96), 6 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 96 [2025-03-16 19:33:08,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:33:08,877 INFO L225 Difference]: With dead ends: 4735 [2025-03-16 19:33:08,877 INFO L226 Difference]: Without dead ends: 3324 [2025-03-16 19:33:08,878 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2025-03-16 19:33:08,879 INFO L435 NwaCegarLoop]: 106 mSDtfsCounter, 649 mSDsluCounter, 238 mSDsCounter, 0 mSdLazyCounter, 286 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 649 SdHoareTripleChecker+Valid, 344 SdHoareTripleChecker+Invalid, 297 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 286 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 19:33:08,879 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [649 Valid, 344 Invalid, 297 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 286 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 19:33:08,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3324 states. [2025-03-16 19:33:08,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3324 to 2304. [2025-03-16 19:33:08,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2304 states, 2303 states have (on average 1.4324793747286149) internal successors, (3299), 2303 states have internal predecessors, (3299), 0 states have call successors, (0), 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-16 19:33:08,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2304 states to 2304 states and 3299 transitions. [2025-03-16 19:33:08,899 INFO L78 Accepts]: Start accepts. Automaton has 2304 states and 3299 transitions. Word has length 96 [2025-03-16 19:33:08,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:33:08,899 INFO L471 AbstractCegarLoop]: Abstraction has 2304 states and 3299 transitions. [2025-03-16 19:33:08,899 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.714285714285714) internal successors, (96), 6 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:33:08,899 INFO L276 IsEmpty]: Start isEmpty. Operand 2304 states and 3299 transitions. [2025-03-16 19:33:08,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-03-16 19:33:08,900 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:33:08,900 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:33:08,900 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-16 19:33:08,900 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:33:08,900 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:33:08,900 INFO L85 PathProgramCache]: Analyzing trace with hash -955910908, now seen corresponding path program 1 times [2025-03-16 19:33:08,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:33:08,901 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544353504] [2025-03-16 19:33:08,901 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:33:08,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:33:08,909 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-16 19:33:08,915 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-16 19:33:08,915 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:33:08,915 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:33:08,977 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:33:08,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:33:08,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1544353504] [2025-03-16 19:33:08,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1544353504] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:33:08,978 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:33:08,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 19:33:08,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [97901522] [2025-03-16 19:33:08,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:33:08,978 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 19:33:08,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:33:08,978 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 19:33:08,978 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-16 19:33:08,979 INFO L87 Difference]: Start difference. First operand 2304 states and 3299 transitions. Second operand has 7 states, 7 states have (on average 13.714285714285714) internal successors, (96), 6 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:33:09,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:33:09,156 INFO L93 Difference]: Finished difference Result 8422 states and 12231 transitions. [2025-03-16 19:33:09,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 19:33:09,156 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.714285714285714) internal successors, (96), 6 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 96 [2025-03-16 19:33:09,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:33:09,166 INFO L225 Difference]: With dead ends: 8422 [2025-03-16 19:33:09,166 INFO L226 Difference]: Without dead ends: 6203 [2025-03-16 19:33:09,169 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2025-03-16 19:33:09,169 INFO L435 NwaCegarLoop]: 82 mSDtfsCounter, 801 mSDsluCounter, 193 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 801 SdHoareTripleChecker+Valid, 275 SdHoareTripleChecker+Invalid, 225 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:33:09,170 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [801 Valid, 275 Invalid, 225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 209 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:33:09,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6203 states. [2025-03-16 19:33:09,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6203 to 4941. [2025-03-16 19:33:09,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4941 states, 4940 states have (on average 1.4356275303643724) internal successors, (7092), 4940 states have internal predecessors, (7092), 0 states have call successors, (0), 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-16 19:33:09,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4941 states to 4941 states and 7092 transitions. [2025-03-16 19:33:09,217 INFO L78 Accepts]: Start accepts. Automaton has 4941 states and 7092 transitions. Word has length 96 [2025-03-16 19:33:09,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:33:09,218 INFO L471 AbstractCegarLoop]: Abstraction has 4941 states and 7092 transitions. [2025-03-16 19:33:09,218 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.714285714285714) internal successors, (96), 6 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:33:09,218 INFO L276 IsEmpty]: Start isEmpty. Operand 4941 states and 7092 transitions. [2025-03-16 19:33:09,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-03-16 19:33:09,218 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:33:09,219 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, 1, 1, 1, 1] [2025-03-16 19:33:09,219 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-16 19:33:09,219 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:33:09,219 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:33:09,219 INFO L85 PathProgramCache]: Analyzing trace with hash 294601378, now seen corresponding path program 1 times [2025-03-16 19:33:09,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:33:09,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [139414155] [2025-03-16 19:33:09,220 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:33:09,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:33:09,231 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-16 19:33:09,237 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-16 19:33:09,237 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:33:09,237 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:33:09,313 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:33:09,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:33:09,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [139414155] [2025-03-16 19:33:09,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [139414155] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:33:09,314 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:33:09,314 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 19:33:09,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [34022007] [2025-03-16 19:33:09,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:33:09,314 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 19:33:09,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:33:09,315 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 19:33:09,315 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-16 19:33:09,315 INFO L87 Difference]: Start difference. First operand 4941 states and 7092 transitions. Second operand has 7 states, 7 states have (on average 13.714285714285714) internal successors, (96), 6 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:33:09,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:33:09,498 INFO L93 Difference]: Finished difference Result 16333 states and 23610 transitions. [2025-03-16 19:33:09,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 19:33:09,498 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.714285714285714) internal successors, (96), 6 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 96 [2025-03-16 19:33:09,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:33:09,513 INFO L225 Difference]: With dead ends: 16333 [2025-03-16 19:33:09,514 INFO L226 Difference]: Without dead ends: 11477 [2025-03-16 19:33:09,520 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2025-03-16 19:33:09,521 INFO L435 NwaCegarLoop]: 82 mSDtfsCounter, 716 mSDsluCounter, 191 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 716 SdHoareTripleChecker+Valid, 273 SdHoareTripleChecker+Invalid, 218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:33:09,522 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [716 Valid, 273 Invalid, 218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 202 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:33:09,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11477 states. [2025-03-16 19:33:09,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11477 to 10635. [2025-03-16 19:33:09,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10635 states, 10634 states have (on average 1.4355839759262743) internal successors, (15266), 10634 states have internal predecessors, (15266), 0 states have call successors, (0), 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-16 19:33:09,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10635 states to 10635 states and 15266 transitions. [2025-03-16 19:33:09,631 INFO L78 Accepts]: Start accepts. Automaton has 10635 states and 15266 transitions. Word has length 96 [2025-03-16 19:33:09,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:33:09,631 INFO L471 AbstractCegarLoop]: Abstraction has 10635 states and 15266 transitions. [2025-03-16 19:33:09,631 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.714285714285714) internal successors, (96), 6 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:33:09,631 INFO L276 IsEmpty]: Start isEmpty. Operand 10635 states and 15266 transitions. [2025-03-16 19:33:09,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-03-16 19:33:09,632 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:33:09,632 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:33:09,633 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-16 19:33:09,636 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:33:09,637 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:33:09,637 INFO L85 PathProgramCache]: Analyzing trace with hash -1109772232, now seen corresponding path program 1 times [2025-03-16 19:33:09,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:33:09,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950311988] [2025-03-16 19:33:09,637 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:33:09,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:33:09,652 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-16 19:33:09,660 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-16 19:33:09,660 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:33:09,660 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:33:09,699 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:33:09,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:33:09,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1950311988] [2025-03-16 19:33:09,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1950311988] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:33:09,699 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:33:09,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:33:09,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1929954756] [2025-03-16 19:33:09,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:33:09,699 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:33:09,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:33:09,700 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:33:09,700 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:33:09,700 INFO L87 Difference]: Start difference. First operand 10635 states and 15266 transitions. Second operand has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:33:09,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:33:09,735 INFO L93 Difference]: Finished difference Result 18775 states and 26972 transitions. [2025-03-16 19:33:09,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:33:09,735 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 96 [2025-03-16 19:33:09,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:33:09,753 INFO L225 Difference]: With dead ends: 18775 [2025-03-16 19:33:09,753 INFO L226 Difference]: Without dead ends: 10152 [2025-03-16 19:33:09,760 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-16 19:33:09,761 INFO L435 NwaCegarLoop]: 198 mSDtfsCounter, 65 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 319 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:33:09,761 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 319 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:33:09,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10152 states. [2025-03-16 19:33:09,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10152 to 10150. [2025-03-16 19:33:09,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10150 states, 10149 states have (on average 1.421617893388511) internal successors, (14428), 10149 states have internal predecessors, (14428), 0 states have call successors, (0), 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-16 19:33:09,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10150 states to 10150 states and 14428 transitions. [2025-03-16 19:33:09,842 INFO L78 Accepts]: Start accepts. Automaton has 10150 states and 14428 transitions. Word has length 96 [2025-03-16 19:33:09,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:33:09,842 INFO L471 AbstractCegarLoop]: Abstraction has 10150 states and 14428 transitions. [2025-03-16 19:33:09,842 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:33:09,842 INFO L276 IsEmpty]: Start isEmpty. Operand 10150 states and 14428 transitions. [2025-03-16 19:33:09,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2025-03-16 19:33:09,844 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:33:09,844 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:33:09,844 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-16 19:33:09,844 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:33:09,845 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:33:09,845 INFO L85 PathProgramCache]: Analyzing trace with hash 1165755045, now seen corresponding path program 1 times [2025-03-16 19:33:09,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:33:09,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [310585019] [2025-03-16 19:33:09,845 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:33:09,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:33:09,876 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-03-16 19:33:09,885 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-03-16 19:33:09,885 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:33:09,885 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:33:09,936 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-03-16 19:33:09,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:33:09,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [310585019] [2025-03-16 19:33:09,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [310585019] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:33:09,937 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:33:09,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:33:09,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602946683] [2025-03-16 19:33:09,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:33:09,937 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:33:09,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:33:09,937 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:33:09,937 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:33:09,937 INFO L87 Difference]: Start difference. First operand 10150 states and 14428 transitions. Second operand has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 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-16 19:33:09,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:33:09,973 INFO L93 Difference]: Finished difference Result 19330 states and 27414 transitions. [2025-03-16 19:33:09,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:33:09,973 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 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 120 [2025-03-16 19:33:09,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:33:09,987 INFO L225 Difference]: With dead ends: 19330 [2025-03-16 19:33:09,987 INFO L226 Difference]: Without dead ends: 9261 [2025-03-16 19:33:09,995 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-16 19:33:09,996 INFO L435 NwaCegarLoop]: 186 mSDtfsCounter, 61 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 313 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:33:09,996 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 313 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:33:10,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9261 states. [2025-03-16 19:33:10,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9261 to 8989. [2025-03-16 19:33:10,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8989 states, 8988 states have (on average 1.4049844236760125) internal successors, (12628), 8988 states have internal predecessors, (12628), 0 states have call successors, (0), 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-16 19:33:10,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8989 states to 8989 states and 12628 transitions. [2025-03-16 19:33:10,070 INFO L78 Accepts]: Start accepts. Automaton has 8989 states and 12628 transitions. Word has length 120 [2025-03-16 19:33:10,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:33:10,070 INFO L471 AbstractCegarLoop]: Abstraction has 8989 states and 12628 transitions. [2025-03-16 19:33:10,070 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 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-16 19:33:10,071 INFO L276 IsEmpty]: Start isEmpty. Operand 8989 states and 12628 transitions. [2025-03-16 19:33:10,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-03-16 19:33:10,072 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:33:10,072 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:33:10,073 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-16 19:33:10,073 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:33:10,073 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:33:10,073 INFO L85 PathProgramCache]: Analyzing trace with hash 956141101, now seen corresponding path program 1 times [2025-03-16 19:33:10,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:33:10,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1478936] [2025-03-16 19:33:10,073 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:33:10,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:33:10,087 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-16 19:33:10,097 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-16 19:33:10,098 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:33:10,098 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:33:10,154 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-03-16 19:33:10,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:33:10,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1478936] [2025-03-16 19:33:10,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1478936] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:33:10,155 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:33:10,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:33:10,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72705361] [2025-03-16 19:33:10,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:33:10,155 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:33:10,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:33:10,156 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:33:10,156 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:33:10,157 INFO L87 Difference]: Start difference. First operand 8989 states and 12628 transitions. Second operand has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 0 states have call successors, (0), 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-16 19:33:10,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:33:10,190 INFO L93 Difference]: Finished difference Result 17023 states and 23834 transitions. [2025-03-16 19:33:10,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:33:10,191 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 0 states have call successors, (0), 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 121 [2025-03-16 19:33:10,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:33:10,200 INFO L225 Difference]: With dead ends: 17023 [2025-03-16 19:33:10,200 INFO L226 Difference]: Without dead ends: 8109 [2025-03-16 19:33:10,207 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-16 19:33:10,208 INFO L435 NwaCegarLoop]: 180 mSDtfsCounter, 54 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 313 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:33:10,208 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 313 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:33:10,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8109 states. [2025-03-16 19:33:10,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8109 to 7855. [2025-03-16 19:33:10,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7855 states, 7854 states have (on average 1.3832442067736186) internal successors, (10864), 7854 states have internal predecessors, (10864), 0 states have call successors, (0), 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-16 19:33:10,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7855 states to 7855 states and 10864 transitions. [2025-03-16 19:33:10,275 INFO L78 Accepts]: Start accepts. Automaton has 7855 states and 10864 transitions. Word has length 121 [2025-03-16 19:33:10,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:33:10,275 INFO L471 AbstractCegarLoop]: Abstraction has 7855 states and 10864 transitions. [2025-03-16 19:33:10,275 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 0 states have call successors, (0), 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-16 19:33:10,275 INFO L276 IsEmpty]: Start isEmpty. Operand 7855 states and 10864 transitions. [2025-03-16 19:33:10,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-03-16 19:33:10,276 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:33:10,277 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 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, 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-16 19:33:10,277 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-03-16 19:33:10,277 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:33:10,277 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:33:10,277 INFO L85 PathProgramCache]: Analyzing trace with hash -1893807686, now seen corresponding path program 1 times [2025-03-16 19:33:10,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:33:10,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [586114534] [2025-03-16 19:33:10,277 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:33:10,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:33:10,305 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-16 19:33:10,313 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-16 19:33:10,313 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:33:10,313 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:33:10,363 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-16 19:33:10,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:33:10,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [586114534] [2025-03-16 19:33:10,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [586114534] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:33:10,363 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:33:10,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:33:10,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1559230241] [2025-03-16 19:33:10,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:33:10,364 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:33:10,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:33:10,364 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:33:10,364 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:33:10,364 INFO L87 Difference]: Start difference. First operand 7855 states and 10864 transitions. Second operand has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 0 states have call successors, (0), 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-16 19:33:10,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:33:10,401 INFO L93 Difference]: Finished difference Result 22491 states and 30922 transitions. [2025-03-16 19:33:10,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:33:10,402 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 0 states have call successors, (0), 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 122 [2025-03-16 19:33:10,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:33:10,421 INFO L225 Difference]: With dead ends: 22491 [2025-03-16 19:33:10,421 INFO L226 Difference]: Without dead ends: 14711 [2025-03-16 19:33:10,430 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-16 19:33:10,430 INFO L435 NwaCegarLoop]: 176 mSDtfsCounter, 47 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 315 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:33:10,432 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 315 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:33:10,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14711 states. [2025-03-16 19:33:10,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14711 to 13533. [2025-03-16 19:33:10,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13533 states, 13532 states have (on average 1.363878214602424) internal successors, (18456), 13532 states have internal predecessors, (18456), 0 states have call successors, (0), 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-16 19:33:10,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13533 states to 13533 states and 18456 transitions. [2025-03-16 19:33:10,563 INFO L78 Accepts]: Start accepts. Automaton has 13533 states and 18456 transitions. Word has length 122 [2025-03-16 19:33:10,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:33:10,563 INFO L471 AbstractCegarLoop]: Abstraction has 13533 states and 18456 transitions. [2025-03-16 19:33:10,564 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 0 states have call successors, (0), 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-16 19:33:10,564 INFO L276 IsEmpty]: Start isEmpty. Operand 13533 states and 18456 transitions. [2025-03-16 19:33:10,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-03-16 19:33:10,565 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:33:10,565 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 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, 1, 1, 1, 1, 1, 1, 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-16 19:33:10,566 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-03-16 19:33:10,566 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:33:10,566 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:33:10,566 INFO L85 PathProgramCache]: Analyzing trace with hash -665295711, now seen corresponding path program 1 times [2025-03-16 19:33:10,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:33:10,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089577708] [2025-03-16 19:33:10,566 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:33:10,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:33:10,577 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-03-16 19:33:10,584 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-03-16 19:33:10,584 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:33:10,584 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:33:10,623 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:33:10,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:33:10,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2089577708] [2025-03-16 19:33:10,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2089577708] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:33:10,624 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:33:10,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:33:10,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658360369] [2025-03-16 19:33:10,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:33:10,624 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:33:10,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:33:10,625 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:33:10,625 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:33:10,625 INFO L87 Difference]: Start difference. First operand 13533 states and 18456 transitions. Second operand has 3 states, 3 states have (on average 41.0) internal successors, (123), 3 states have internal predecessors, (123), 0 states have call successors, (0), 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-16 19:33:10,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:33:10,668 INFO L93 Difference]: Finished difference Result 23637 states and 32179 transitions. [2025-03-16 19:33:10,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:33:10,668 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.0) internal successors, (123), 3 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 123 [2025-03-16 19:33:10,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:33:10,682 INFO L225 Difference]: With dead ends: 23637 [2025-03-16 19:33:10,682 INFO L226 Difference]: Without dead ends: 10179 [2025-03-16 19:33:10,690 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-16 19:33:10,691 INFO L435 NwaCegarLoop]: 184 mSDtfsCounter, 69 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 292 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-16 19:33:10,691 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 292 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:33:10,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10179 states. [2025-03-16 19:33:10,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10179 to 10009. [2025-03-16 19:33:10,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10009 states, 10008 states have (on average 1.34052757793765) internal successors, (13416), 10008 states have internal predecessors, (13416), 0 states have call successors, (0), 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-16 19:33:10,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10009 states to 10009 states and 13416 transitions. [2025-03-16 19:33:10,817 INFO L78 Accepts]: Start accepts. Automaton has 10009 states and 13416 transitions. Word has length 123 [2025-03-16 19:33:10,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:33:10,818 INFO L471 AbstractCegarLoop]: Abstraction has 10009 states and 13416 transitions. [2025-03-16 19:33:10,818 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.0) internal successors, (123), 3 states have internal predecessors, (123), 0 states have call successors, (0), 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-16 19:33:10,818 INFO L276 IsEmpty]: Start isEmpty. Operand 10009 states and 13416 transitions. [2025-03-16 19:33:10,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-03-16 19:33:10,819 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:33:10,819 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:33:10,819 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-03-16 19:33:10,819 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:33:10,820 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:33:10,820 INFO L85 PathProgramCache]: Analyzing trace with hash -1473594187, now seen corresponding path program 1 times [2025-03-16 19:33:10,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:33:10,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803807490] [2025-03-16 19:33:10,820 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:33:10,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:33:10,830 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-03-16 19:33:10,840 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-03-16 19:33:10,840 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:33:10,840 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:33:11,120 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 15 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:33:11,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:33:11,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [803807490] [2025-03-16 19:33:11,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [803807490] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 19:33:11,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1804573578] [2025-03-16 19:33:11,121 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:33:11,121 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 19:33:11,121 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 19:33:11,123 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-16 19:33:11,125 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-16 19:33:11,205 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-03-16 19:33:11,252 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-03-16 19:33:11,252 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:33:11,252 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:33:11,255 INFO L256 TraceCheckSpWp]: Trace formula consists of 508 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-03-16 19:33:11,262 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 19:33:12,138 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 13 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:33:12,138 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 19:33:13,347 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 13 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:33:13,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1804573578] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 19:33:13,348 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 19:33:13,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 31 [2025-03-16 19:33:13,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1153848505] [2025-03-16 19:33:13,348 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 19:33:13,348 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-03-16 19:33:13,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:33:13,349 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-03-16 19:33:13,349 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=876, Unknown=0, NotChecked=0, Total=992 [2025-03-16 19:33:13,349 INFO L87 Difference]: Start difference. First operand 10009 states and 13416 transitions. Second operand has 32 states, 32 states have (on average 10.90625) internal successors, (349), 31 states have internal predecessors, (349), 0 states have call successors, (0), 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-16 19:33:21,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:33:21,597 INFO L93 Difference]: Finished difference Result 106143 states and 142438 transitions. [2025-03-16 19:33:21,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 157 states. [2025-03-16 19:33:21,597 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 10.90625) internal successors, (349), 31 states have internal predecessors, (349), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 123 [2025-03-16 19:33:21,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:33:21,707 INFO L225 Difference]: With dead ends: 106143 [2025-03-16 19:33:21,707 INFO L226 Difference]: Without dead ends: 96241 [2025-03-16 19:33:21,743 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 410 GetRequests, 225 SyntacticMatches, 0 SemanticMatches, 185 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11306 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=5048, Invalid=29734, Unknown=0, NotChecked=0, Total=34782 [2025-03-16 19:33:21,744 INFO L435 NwaCegarLoop]: 137 mSDtfsCounter, 3328 mSDsluCounter, 2197 mSDsCounter, 0 mSdLazyCounter, 3070 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3328 SdHoareTripleChecker+Valid, 2334 SdHoareTripleChecker+Invalid, 3148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 3070 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-16 19:33:21,744 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3328 Valid, 2334 Invalid, 3148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 3070 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-16 19:33:21,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96241 states. [2025-03-16 19:33:22,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96241 to 57736. [2025-03-16 19:33:22,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57736 states, 57735 states have (on average 1.3284489477786439) internal successors, (76698), 57735 states have internal predecessors, (76698), 0 states have call successors, (0), 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-16 19:33:22,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57736 states to 57736 states and 76698 transitions. [2025-03-16 19:33:22,584 INFO L78 Accepts]: Start accepts. Automaton has 57736 states and 76698 transitions. Word has length 123 [2025-03-16 19:33:22,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:33:22,584 INFO L471 AbstractCegarLoop]: Abstraction has 57736 states and 76698 transitions. [2025-03-16 19:33:22,584 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 10.90625) internal successors, (349), 31 states have internal predecessors, (349), 0 states have call successors, (0), 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-16 19:33:22,584 INFO L276 IsEmpty]: Start isEmpty. Operand 57736 states and 76698 transitions. [2025-03-16 19:33:22,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-03-16 19:33:22,590 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:33:22,590 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 19:33:22,598 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-16 19:33:22,791 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,SelfDestructingSolverStorable31 [2025-03-16 19:33:22,791 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:33:22,791 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:33:22,792 INFO L85 PathProgramCache]: Analyzing trace with hash -848152442, now seen corresponding path program 1 times [2025-03-16 19:33:22,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:33:22,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202871718] [2025-03-16 19:33:22,792 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:33:22,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:33:22,801 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-03-16 19:33:22,812 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-03-16 19:33:22,812 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:33:22,812 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:33:23,158 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 13 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:33:23,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:33:23,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1202871718] [2025-03-16 19:33:23,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1202871718] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 19:33:23,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [781340723] [2025-03-16 19:33:23,159 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:33:23,159 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 19:33:23,159 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 19:33:23,160 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 19:33:23,161 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-16 19:33:23,237 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-03-16 19:33:23,280 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-03-16 19:33:23,280 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:33:23,280 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:33:23,282 INFO L256 TraceCheckSpWp]: Trace formula consists of 513 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-03-16 19:33:23,285 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 19:33:23,777 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 15 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:33:23,777 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 19:33:24,609 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 15 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:33:24,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [781340723] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 19:33:24,609 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 19:33:24,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 11] total 29 [2025-03-16 19:33:24,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1711950428] [2025-03-16 19:33:24,609 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 19:33:24,609 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-03-16 19:33:24,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:33:24,610 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-03-16 19:33:24,610 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=776, Unknown=0, NotChecked=0, Total=870 [2025-03-16 19:33:24,610 INFO L87 Difference]: Start difference. First operand 57736 states and 76698 transitions. Second operand has 30 states, 30 states have (on average 10.933333333333334) internal successors, (328), 29 states have internal predecessors, (328), 0 states have call successors, (0), 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-16 19:33:29,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:33:29,919 INFO L93 Difference]: Finished difference Result 490049 states and 646808 transitions. [2025-03-16 19:33:29,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2025-03-16 19:33:29,920 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 10.933333333333334) internal successors, (328), 29 states have internal predecessors, (328), 0 states have call successors, (0), 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 124 [2025-03-16 19:33:29,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:33:30,634 INFO L225 Difference]: With dead ends: 490049 [2025-03-16 19:33:30,634 INFO L226 Difference]: Without dead ends: 432660 [2025-03-16 19:33:30,756 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 350 GetRequests, 228 SyntacticMatches, 0 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4276 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=2397, Invalid=12855, Unknown=0, NotChecked=0, Total=15252 [2025-03-16 19:33:30,757 INFO L435 NwaCegarLoop]: 167 mSDtfsCounter, 3077 mSDsluCounter, 2518 mSDsCounter, 0 mSdLazyCounter, 3743 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3077 SdHoareTripleChecker+Valid, 2685 SdHoareTripleChecker+Invalid, 3817 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 3743 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-16 19:33:30,757 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3077 Valid, 2685 Invalid, 3817 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 3743 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-16 19:33:30,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 432660 states. [2025-03-16 19:33:34,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 432660 to 294372. [2025-03-16 19:33:34,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 294372 states, 294371 states have (on average 1.3215636051105577) internal successors, (389030), 294371 states have internal predecessors, (389030), 0 states have call successors, (0), 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-16 19:33:35,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294372 states to 294372 states and 389030 transitions. [2025-03-16 19:33:35,065 INFO L78 Accepts]: Start accepts. Automaton has 294372 states and 389030 transitions. Word has length 124 [2025-03-16 19:33:35,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:33:35,069 INFO L471 AbstractCegarLoop]: Abstraction has 294372 states and 389030 transitions. [2025-03-16 19:33:35,070 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 10.933333333333334) internal successors, (328), 29 states have internal predecessors, (328), 0 states have call successors, (0), 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-16 19:33:35,070 INFO L276 IsEmpty]: Start isEmpty. Operand 294372 states and 389030 transitions. [2025-03-16 19:33:35,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2025-03-16 19:33:35,090 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:33:35,090 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 19:33:35,097 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-16 19:33:35,290 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2025-03-16 19:33:35,291 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:33:35,291 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:33:35,291 INFO L85 PathProgramCache]: Analyzing trace with hash 2036875470, now seen corresponding path program 1 times [2025-03-16 19:33:35,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:33:35,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895103781] [2025-03-16 19:33:35,291 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:33:35,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:33:35,301 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-03-16 19:33:35,309 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-03-16 19:33:35,309 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:33:35,309 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:33:35,496 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 11 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:33:35,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:33:35,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1895103781] [2025-03-16 19:33:35,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1895103781] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 19:33:35,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [504957561] [2025-03-16 19:33:35,497 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:33:35,497 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 19:33:35,497 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 19:33:35,507 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 19:33:35,512 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-16 19:33:35,612 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-03-16 19:33:35,651 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-03-16 19:33:35,652 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:33:35,652 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:33:35,654 INFO L256 TraceCheckSpWp]: Trace formula consists of 511 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-03-16 19:33:35,656 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 19:33:36,412 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 11 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:33:36,412 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 19:33:37,203 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 11 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:33:37,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [504957561] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 19:33:37,203 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 19:33:37,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 11, 11] total 24 [2025-03-16 19:33:37,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615036783] [2025-03-16 19:33:37,203 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 19:33:37,208 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-16 19:33:37,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:33:37,208 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-16 19:33:37,208 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=471, Unknown=0, NotChecked=0, Total=552 [2025-03-16 19:33:37,209 INFO L87 Difference]: Start difference. First operand 294372 states and 389030 transitions. Second operand has 24 states, 24 states have (on average 13.375) internal successors, (321), 24 states have internal predecessors, (321), 0 states have call successors, (0), 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-16 19:33:42,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:33:42,357 INFO L93 Difference]: Finished difference Result 1248519 states and 1657047 transitions. [2025-03-16 19:33:42,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2025-03-16 19:33:42,365 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 13.375) internal successors, (321), 24 states have internal predecessors, (321), 0 states have call successors, (0), 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 126 [2025-03-16 19:33:42,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:33:44,396 INFO L225 Difference]: With dead ends: 1248519 [2025-03-16 19:33:44,396 INFO L226 Difference]: Without dead ends: 1076061 [2025-03-16 19:33:44,768 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 297 GetRequests, 238 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 789 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=776, Invalid=2884, Unknown=0, NotChecked=0, Total=3660 [2025-03-16 19:33:44,768 INFO L435 NwaCegarLoop]: 178 mSDtfsCounter, 1217 mSDsluCounter, 1864 mSDsCounter, 0 mSdLazyCounter, 2060 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1217 SdHoareTripleChecker+Valid, 2042 SdHoareTripleChecker+Invalid, 2077 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 2060 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-16 19:33:44,768 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1217 Valid, 2042 Invalid, 2077 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 2060 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-16 19:33:45,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1076061 states. [2025-03-16 19:33:51,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1076061 to 243606. [2025-03-16 19:33:51,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 243606 states, 243605 states have (on average 1.3297099813222224) internal successors, (323924), 243605 states have internal predecessors, (323924), 0 states have call successors, (0), 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-16 19:33:51,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243606 states to 243606 states and 323924 transitions. [2025-03-16 19:33:51,880 INFO L78 Accepts]: Start accepts. Automaton has 243606 states and 323924 transitions. Word has length 126 [2025-03-16 19:33:51,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:33:51,881 INFO L471 AbstractCegarLoop]: Abstraction has 243606 states and 323924 transitions. [2025-03-16 19:33:51,881 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 13.375) internal successors, (321), 24 states have internal predecessors, (321), 0 states have call successors, (0), 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-16 19:33:51,881 INFO L276 IsEmpty]: Start isEmpty. Operand 243606 states and 323924 transitions. [2025-03-16 19:33:51,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2025-03-16 19:33:51,894 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:33:51,894 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 19:33:51,901 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-16 19:33:52,098 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 19:33:52,098 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:33:52,099 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:33:52,099 INFO L85 PathProgramCache]: Analyzing trace with hash 1536160398, now seen corresponding path program 1 times [2025-03-16 19:33:52,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:33:52,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868287427] [2025-03-16 19:33:52,099 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:33:52,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:33:52,109 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-03-16 19:33:52,117 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-03-16 19:33:52,117 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:33:52,117 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:33:52,304 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 9 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:33:52,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:33:52,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1868287427] [2025-03-16 19:33:52,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1868287427] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 19:33:52,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1819893293] [2025-03-16 19:33:52,304 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:33:52,304 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 19:33:52,304 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 19:33:52,311 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 19:33:52,320 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-16 19:33:52,443 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-03-16 19:33:52,487 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-03-16 19:33:52,488 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:33:52,488 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:33:52,493 INFO L256 TraceCheckSpWp]: Trace formula consists of 511 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-03-16 19:33:52,497 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 19:33:53,904 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 9 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:33:53,904 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 19:33:54,866 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 9 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:33:54,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1819893293] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 19:33:54,866 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 19:33:54,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 16, 15] total 35 [2025-03-16 19:33:54,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [305496842] [2025-03-16 19:33:54,866 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 19:33:54,867 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-03-16 19:33:54,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:33:54,867 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-03-16 19:33:54,867 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=1042, Unknown=0, NotChecked=0, Total=1190 [2025-03-16 19:33:54,868 INFO L87 Difference]: Start difference. First operand 243606 states and 323924 transitions. Second operand has 35 states, 35 states have (on average 10.285714285714286) internal successors, (360), 35 states have internal predecessors, (360), 0 states have call successors, (0), 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-16 19:34:03,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:34:03,477 INFO L93 Difference]: Finished difference Result 1194371 states and 1577282 transitions. [2025-03-16 19:34:03,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 121 states. [2025-03-16 19:34:03,478 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 10.285714285714286) internal successors, (360), 35 states have internal predecessors, (360), 0 states have call successors, (0), 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 126 [2025-03-16 19:34:03,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:34:05,032 INFO L225 Difference]: With dead ends: 1194371 [2025-03-16 19:34:05,033 INFO L226 Difference]: Without dead ends: 1093833 [2025-03-16 19:34:05,280 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 378 GetRequests, 227 SyntacticMatches, 0 SemanticMatches, 151 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8378 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=4100, Invalid=19156, Unknown=0, NotChecked=0, Total=23256 [2025-03-16 19:34:05,281 INFO L435 NwaCegarLoop]: 170 mSDtfsCounter, 3249 mSDsluCounter, 2745 mSDsCounter, 0 mSdLazyCounter, 3810 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3249 SdHoareTripleChecker+Valid, 2915 SdHoareTripleChecker+Invalid, 3904 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 3810 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-03-16 19:34:05,281 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3249 Valid, 2915 Invalid, 3904 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 3810 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-03-16 19:34:06,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1093833 states.