./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 8ffc122c88e19fa60ea50d5017c7f06bb9f1769c7e82b2428d0bede2356237c3 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 15:14:21,599 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 15:14:21,658 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 15:14:21,661 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 15:14:21,661 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 15:14:21,677 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 15:14:21,678 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 15:14:21,678 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 15:14:21,679 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 15:14:21,679 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 15:14:21,679 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 15:14:21,679 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 15:14:21,679 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 15:14:21,679 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 15:14:21,679 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 15:14:21,679 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 15:14:21,679 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 15:14:21,679 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 15:14:21,679 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 15:14:21,680 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 15:14:21,680 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 15:14:21,680 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 15:14:21,680 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 15:14:21,680 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 15:14:21,680 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 15:14:21,680 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 15:14:21,680 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 15:14:21,680 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 15:14:21,680 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 15:14:21,680 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 15:14:21,680 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 15:14:21,680 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 15:14:21,680 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 15:14:21,680 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 15:14:21,680 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 15:14:21,680 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 15:14:21,680 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 15:14:21,680 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 15:14:21,680 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 15:14:21,681 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 15:14:21,681 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 15:14:21,681 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 15:14:21,681 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 15:14:21,681 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 -> 8ffc122c88e19fa60ea50d5017c7f06bb9f1769c7e82b2428d0bede2356237c3 [2025-03-03 15:14:21,910 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 15:14:21,918 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 15:14:21,920 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 15:14:21,921 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 15:14:21,921 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 15:14:21,922 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2025-03-03 15:14:23,089 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/671dda7ec/be433855729e4ff2a6a98ef03f85eae6/FLAG5bd69af82 [2025-03-03 15:14:23,357 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 15:14:23,357 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2025-03-03 15:14:23,370 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/671dda7ec/be433855729e4ff2a6a98ef03f85eae6/FLAG5bd69af82 [2025-03-03 15:14:23,675 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/671dda7ec/be433855729e4ff2a6a98ef03f85eae6 [2025-03-03 15:14:23,677 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 15:14:23,678 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 15:14:23,680 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 15:14:23,680 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 15:14:23,684 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 15:14:23,685 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 03:14:23" (1/1) ... [2025-03-03 15:14:23,685 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6bd3e168 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:14:23, skipping insertion in model container [2025-03-03 15:14:23,686 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 03:14:23" (1/1) ... [2025-03-03 15:14:23,709 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 15:14:23,866 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.5.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c[5807,5820] [2025-03-03 15:14:23,888 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 15:14:23,906 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 15:14:23,947 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.5.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c[5807,5820] [2025-03-03 15:14:23,963 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 15:14:23,979 INFO L204 MainTranslator]: Completed translation [2025-03-03 15:14:23,980 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:14:23 WrapperNode [2025-03-03 15:14:23,980 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 15:14:23,981 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 15:14:23,981 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 15:14:23,981 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 15:14:23,985 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:14:23" (1/1) ... [2025-03-03 15:14:23,991 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:14:23" (1/1) ... [2025-03-03 15:14:24,009 INFO L138 Inliner]: procedures = 25, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 452 [2025-03-03 15:14:24,009 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 15:14:24,010 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 15:14:24,010 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 15:14:24,010 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 15:14:24,016 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:14:23" (1/1) ... [2025-03-03 15:14:24,016 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:14:23" (1/1) ... [2025-03-03 15:14:24,018 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:14:23" (1/1) ... [2025-03-03 15:14:24,028 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-03 15:14:24,028 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:14:23" (1/1) ... [2025-03-03 15:14:24,029 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:14:23" (1/1) ... [2025-03-03 15:14:24,033 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:14:23" (1/1) ... [2025-03-03 15:14:24,034 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:14:23" (1/1) ... [2025-03-03 15:14:24,035 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:14:23" (1/1) ... [2025-03-03 15:14:24,036 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:14:23" (1/1) ... [2025-03-03 15:14:24,037 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 15:14:24,038 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 15:14:24,038 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 15:14:24,038 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 15:14:24,039 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:14:23" (1/1) ... [2025-03-03 15:14:24,042 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 15:14:24,053 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 15:14:24,067 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 15:14:24,072 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 15:14:24,087 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 15:14:24,088 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 15:14:24,088 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 15:14:24,088 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 15:14:24,166 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 15:14:24,167 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 15:14:24,506 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L490: havoc main_~node2____CPAchecker_TMP_0~0#1; [2025-03-03 15:14:24,506 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L201: havoc main_~node2__m2~0#1; [2025-03-03 15:14:24,506 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L400: havoc main_~node4____CPAchecker_TMP_0~0#1; [2025-03-03 15:14:24,506 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L541: havoc main_~node1____CPAchecker_TMP_0~0#1; [2025-03-03 15:14:24,506 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L286: havoc main_~__tmp_1~0#1, main_~assert__arg~0#1;havoc main_~check__tmp~0#1; [2025-03-03 15:14:24,507 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L246: havoc main_~node5__m5~0#1; [2025-03-03 15:14:24,507 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L445: havoc main_~node3____CPAchecker_TMP_0~0#1; [2025-03-03 15:14:24,507 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L181: havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2025-03-03 15:14:24,507 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L231: havoc main_~node4__m4~0#1; [2025-03-03 15:14:24,507 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L355: havoc main_~node5____CPAchecker_TMP_0~0#1; [2025-03-03 15:14:24,507 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L216: havoc main_~node3__m3~0#1; [2025-03-03 15:14:24,532 INFO L? ?]: Removed 41 outVars from TransFormulas that were not future-live. [2025-03-03 15:14:24,533 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 15:14:24,542 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 15:14:24,543 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 15:14:24,544 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 03:14:24 BoogieIcfgContainer [2025-03-03 15:14:24,544 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 15:14:24,546 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 15:14:24,546 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 15:14:24,550 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 15:14:24,550 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 03:14:23" (1/3) ... [2025-03-03 15:14:24,550 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e3be946 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 03:14:24, skipping insertion in model container [2025-03-03 15:14:24,551 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:14:23" (2/3) ... [2025-03-03 15:14:24,551 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e3be946 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 03:14:24, skipping insertion in model container [2025-03-03 15:14:24,551 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 03:14:24" (3/3) ... [2025-03-03 15:14:24,552 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr.5.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2025-03-03 15:14:24,562 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 15:14:24,563 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_lcr.5.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c that has 1 procedures, 99 locations, 1 initial locations, 0 loop locations, and 1 error locations. [2025-03-03 15:14:24,599 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 15:14:24,609 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;@3df9d647, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 15:14:24,610 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 15:14:24,614 INFO L276 IsEmpty]: Start isEmpty. Operand has 99 states, 97 states have (on average 1.7216494845360826) internal successors, (167), 98 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:14:24,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-03-03 15:14:24,619 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:14:24,619 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:14:24,619 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:14:24,624 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:14:24,625 INFO L85 PathProgramCache]: Analyzing trace with hash -1987767872, now seen corresponding path program 1 times [2025-03-03 15:14:24,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:14:24,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1127179866] [2025-03-03 15:14:24,632 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:14:24,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:14:24,696 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-03-03 15:14:24,798 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-03-03 15:14:24,799 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:14:24,800 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:14:25,004 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:14:25,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:14:25,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1127179866] [2025-03-03 15:14:25,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1127179866] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:14:25,006 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:14:25,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:14:25,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [517476023] [2025-03-03 15:14:25,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:14:25,011 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:14:25,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:14:25,024 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:14:25,024 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:14:25,026 INFO L87 Difference]: Start difference. First operand has 99 states, 97 states have (on average 1.7216494845360826) internal successors, (167), 98 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:14:25,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:14:25,060 INFO L93 Difference]: Finished difference Result 221 states and 356 transitions. [2025-03-03 15:14:25,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:14:25,062 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2025-03-03 15:14:25,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:14:25,067 INFO L225 Difference]: With dead ends: 221 [2025-03-03 15:14:25,067 INFO L226 Difference]: Without dead ends: 150 [2025-03-03 15:14:25,069 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:14:25,070 INFO L435 NwaCegarLoop]: 230 mSDtfsCounter, 108 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 337 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:14:25,071 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 337 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:14:25,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2025-03-03 15:14:25,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 148. [2025-03-03 15:14:25,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 147 states have (on average 1.4625850340136055) internal successors, (215), 147 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:14:25,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 215 transitions. [2025-03-03 15:14:25,102 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 215 transitions. Word has length 60 [2025-03-03 15:14:25,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:14:25,102 INFO L471 AbstractCegarLoop]: Abstraction has 148 states and 215 transitions. [2025-03-03 15:14:25,102 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:14:25,103 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 215 transitions. [2025-03-03 15:14:25,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-03-03 15:14:25,104 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:14:25,105 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:14:25,105 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 15:14:25,105 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:14:25,105 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:14:25,105 INFO L85 PathProgramCache]: Analyzing trace with hash -1868022726, now seen corresponding path program 1 times [2025-03-03 15:14:25,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:14:25,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049637365] [2025-03-03 15:14:25,106 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:14:25,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:14:25,123 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-03-03 15:14:25,150 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-03-03 15:14:25,150 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:14:25,150 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:14:25,242 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:14:25,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:14:25,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1049637365] [2025-03-03 15:14:25,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1049637365] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:14:25,243 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:14:25,244 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:14:25,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1554007793] [2025-03-03 15:14:25,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:14:25,244 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:14:25,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:14:25,245 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:14:25,245 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:14:25,245 INFO L87 Difference]: Start difference. First operand 148 states and 215 transitions. Second operand has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:14:25,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:14:25,271 INFO L93 Difference]: Finished difference Result 360 states and 551 transitions. [2025-03-03 15:14:25,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:14:25,272 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61 [2025-03-03 15:14:25,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:14:25,273 INFO L225 Difference]: With dead ends: 360 [2025-03-03 15:14:25,273 INFO L226 Difference]: Without dead ends: 246 [2025-03-03 15:14:25,274 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:14:25,274 INFO L435 NwaCegarLoop]: 186 mSDtfsCounter, 78 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 287 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:14:25,275 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 287 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:14:25,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2025-03-03 15:14:25,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 244. [2025-03-03 15:14:25,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 244 states, 243 states have (on average 1.5102880658436213) internal successors, (367), 243 states have internal predecessors, (367), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:14:25,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 367 transitions. [2025-03-03 15:14:25,285 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 367 transitions. Word has length 61 [2025-03-03 15:14:25,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:14:25,285 INFO L471 AbstractCegarLoop]: Abstraction has 244 states and 367 transitions. [2025-03-03 15:14:25,285 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:14:25,285 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 367 transitions. [2025-03-03 15:14:25,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-03-03 15:14:25,286 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:14:25,286 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:14:25,286 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 15:14:25,286 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:14:25,286 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:14:25,287 INFO L85 PathProgramCache]: Analyzing trace with hash -1363346003, now seen corresponding path program 1 times [2025-03-03 15:14:25,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:14:25,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553266796] [2025-03-03 15:14:25,287 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:14:25,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:14:25,303 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-03 15:14:25,318 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-03 15:14:25,320 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:14:25,320 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:14:25,404 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:14:25,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:14:25,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1553266796] [2025-03-03 15:14:25,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1553266796] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:14:25,407 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:14:25,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:14:25,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [546398189] [2025-03-03 15:14:25,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:14:25,407 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:14:25,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:14:25,408 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:14:25,408 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:14:25,408 INFO L87 Difference]: Start difference. First operand 244 states and 367 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-03 15:14:25,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:14:25,431 INFO L93 Difference]: Finished difference Result 632 states and 981 transitions. [2025-03-03 15:14:25,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:14:25,435 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-03 15:14:25,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:14:25,436 INFO L225 Difference]: With dead ends: 632 [2025-03-03 15:14:25,436 INFO L226 Difference]: Without dead ends: 422 [2025-03-03 15:14:25,437 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:14:25,438 INFO L435 NwaCegarLoop]: 178 mSDtfsCounter, 73 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 283 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:14:25,438 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 283 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:14:25,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 422 states. [2025-03-03 15:14:25,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 422 to 420. [2025-03-03 15:14:25,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 420 states, 419 states have (on average 1.5346062052505967) internal successors, (643), 419 states have internal predecessors, (643), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:14:25,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 420 states to 420 states and 643 transitions. [2025-03-03 15:14:25,455 INFO L78 Accepts]: Start accepts. Automaton has 420 states and 643 transitions. Word has length 62 [2025-03-03 15:14:25,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:14:25,455 INFO L471 AbstractCegarLoop]: Abstraction has 420 states and 643 transitions. [2025-03-03 15:14:25,455 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-03 15:14:25,455 INFO L276 IsEmpty]: Start isEmpty. Operand 420 states and 643 transitions. [2025-03-03 15:14:25,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-03-03 15:14:25,458 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:14:25,458 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-03 15:14:25,458 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 15:14:25,458 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:14:25,459 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:14:25,459 INFO L85 PathProgramCache]: Analyzing trace with hash 1863214535, now seen corresponding path program 1 times [2025-03-03 15:14:25,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:14:25,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753767940] [2025-03-03 15:14:25,460 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:14:25,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:14:25,473 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-03 15:14:25,486 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-03 15:14:25,486 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:14:25,487 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:14:25,540 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:14:25,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:14:25,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [753767940] [2025-03-03 15:14:25,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [753767940] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:14:25,540 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:14:25,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:14:25,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1169968780] [2025-03-03 15:14:25,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:14:25,541 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:14:25,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:14:25,541 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:14:25,541 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:14:25,541 INFO L87 Difference]: Start difference. First operand 420 states and 643 transitions. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:14:25,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:14:25,566 INFO L93 Difference]: Finished difference Result 1128 states and 1757 transitions. [2025-03-03 15:14:25,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:14:25,566 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2025-03-03 15:14:25,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:14:25,569 INFO L225 Difference]: With dead ends: 1128 [2025-03-03 15:14:25,569 INFO L226 Difference]: Without dead ends: 742 [2025-03-03 15:14:25,570 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:14:25,570 INFO L435 NwaCegarLoop]: 170 mSDtfsCounter, 68 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 279 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:14:25,570 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 279 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:14:25,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 742 states. [2025-03-03 15:14:25,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 742 to 740. [2025-03-03 15:14:25,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 740 states, 739 states have (on average 1.5412719891745603) internal successors, (1139), 739 states have internal predecessors, (1139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:14:25,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 740 states to 740 states and 1139 transitions. [2025-03-03 15:14:25,585 INFO L78 Accepts]: Start accepts. Automaton has 740 states and 1139 transitions. Word has length 63 [2025-03-03 15:14:25,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:14:25,586 INFO L471 AbstractCegarLoop]: Abstraction has 740 states and 1139 transitions. [2025-03-03 15:14:25,586 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:14:25,586 INFO L276 IsEmpty]: Start isEmpty. Operand 740 states and 1139 transitions. [2025-03-03 15:14:25,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-03-03 15:14:25,587 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:14:25,587 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:14:25,587 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 15:14:25,587 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:14:25,587 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:14:25,588 INFO L85 PathProgramCache]: Analyzing trace with hash -584672614, now seen corresponding path program 1 times [2025-03-03 15:14:25,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:14:25,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542986165] [2025-03-03 15:14:25,588 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:14:25,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:14:25,599 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-03 15:14:25,609 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-03 15:14:25,612 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:14:25,612 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:14:25,748 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:14:25,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:14:25,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1542986165] [2025-03-03 15:14:25,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1542986165] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:14:25,749 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:14:25,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 15:14:25,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140813787] [2025-03-03 15:14:25,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:14:25,750 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 15:14:25,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:14:25,751 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 15:14:25,751 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-03 15:14:25,751 INFO L87 Difference]: Start difference. First operand 740 states and 1139 transitions. Second operand has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 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-03 15:14:25,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:14:25,996 INFO L93 Difference]: Finished difference Result 7800 states and 12189 transitions. [2025-03-03 15:14:25,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-03 15:14:25,997 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 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-03 15:14:25,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:14:26,020 INFO L225 Difference]: With dead ends: 7800 [2025-03-03 15:14:26,021 INFO L226 Difference]: Without dead ends: 7094 [2025-03-03 15:14:26,024 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2025-03-03 15:14:26,024 INFO L435 NwaCegarLoop]: 128 mSDtfsCounter, 986 mSDsluCounter, 2171 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 986 SdHoareTripleChecker+Valid, 2299 SdHoareTripleChecker+Invalid, 172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:14:26,024 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [986 Valid, 2299 Invalid, 172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 15:14:26,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7094 states. [2025-03-03 15:14:26,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7094 to 1444. [2025-03-03 15:14:26,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1444 states, 1443 states have (on average 1.5322245322245323) internal successors, (2211), 1443 states have internal predecessors, (2211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:14:26,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1444 states to 1444 states and 2211 transitions. [2025-03-03 15:14:26,099 INFO L78 Accepts]: Start accepts. Automaton has 1444 states and 2211 transitions. Word has length 64 [2025-03-03 15:14:26,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:14:26,099 INFO L471 AbstractCegarLoop]: Abstraction has 1444 states and 2211 transitions. [2025-03-03 15:14:26,099 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 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-03 15:14:26,100 INFO L276 IsEmpty]: Start isEmpty. Operand 1444 states and 2211 transitions. [2025-03-03 15:14:26,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-03-03 15:14:26,100 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:14:26,101 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:14:26,101 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 15:14:26,101 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:14:26,101 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:14:26,101 INFO L85 PathProgramCache]: Analyzing trace with hash 809215235, now seen corresponding path program 1 times [2025-03-03 15:14:26,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:14:26,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028376528] [2025-03-03 15:14:26,102 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:14:26,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:14:26,112 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-03 15:14:26,118 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-03 15:14:26,119 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:14:26,119 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:14:26,181 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:14:26,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:14:26,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1028376528] [2025-03-03 15:14:26,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1028376528] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:14:26,181 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:14:26,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:14:26,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565983578] [2025-03-03 15:14:26,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:14:26,182 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:14:26,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:14:26,182 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:14:26,182 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:14:26,183 INFO L87 Difference]: Start difference. First operand 1444 states and 2211 transitions. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:14:26,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:14:26,215 INFO L93 Difference]: Finished difference Result 4088 states and 6261 transitions. [2025-03-03 15:14:26,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:14:26,216 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2025-03-03 15:14:26,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:14:26,224 INFO L225 Difference]: With dead ends: 4088 [2025-03-03 15:14:26,224 INFO L226 Difference]: Without dead ends: 2678 [2025-03-03 15:14:26,227 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:14:26,227 INFO L435 NwaCegarLoop]: 129 mSDtfsCounter, 58 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 220 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:14:26,227 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 220 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:14:26,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2678 states. [2025-03-03 15:14:26,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2678 to 2644. [2025-03-03 15:14:26,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2644 states, 2643 states have (on average 1.5024593265228907) internal successors, (3971), 2643 states have internal predecessors, (3971), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:14:26,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2644 states to 2644 states and 3971 transitions. [2025-03-03 15:14:26,282 INFO L78 Accepts]: Start accepts. Automaton has 2644 states and 3971 transitions. Word has length 66 [2025-03-03 15:14:26,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:14:26,282 INFO L471 AbstractCegarLoop]: Abstraction has 2644 states and 3971 transitions. [2025-03-03 15:14:26,282 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:14:26,283 INFO L276 IsEmpty]: Start isEmpty. Operand 2644 states and 3971 transitions. [2025-03-03 15:14:26,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-03-03 15:14:26,283 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:14:26,283 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:14:26,284 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 15:14:26,284 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:14:26,284 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:14:26,284 INFO L85 PathProgramCache]: Analyzing trace with hash 810377084, now seen corresponding path program 1 times [2025-03-03 15:14:26,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:14:26,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1334928975] [2025-03-03 15:14:26,284 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:14:26,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:14:26,298 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-03 15:14:26,310 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-03 15:14:26,310 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:14:26,310 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:14:26,595 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:14:26,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:14:26,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1334928975] [2025-03-03 15:14:26,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1334928975] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:14:26,596 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:14:26,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 15:14:26,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666596263] [2025-03-03 15:14:26,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:14:26,596 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 15:14:26,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:14:26,597 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 15:14:26,597 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-03 15:14:26,597 INFO L87 Difference]: Start difference. First operand 2644 states and 3971 transitions. Second operand has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:14:26,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:14:26,769 INFO L93 Difference]: Finished difference Result 5256 states and 7909 transitions. [2025-03-03 15:14:26,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 15:14:26,769 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2025-03-03 15:14:26,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:14:26,776 INFO L225 Difference]: With dead ends: 5256 [2025-03-03 15:14:26,776 INFO L226 Difference]: Without dead ends: 2646 [2025-03-03 15:14:26,779 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2025-03-03 15:14:26,779 INFO L435 NwaCegarLoop]: 126 mSDtfsCounter, 86 mSDsluCounter, 475 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 601 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:14:26,779 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 601 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 15:14:26,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2646 states. [2025-03-03 15:14:26,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2646 to 2644. [2025-03-03 15:14:26,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2644 states, 2643 states have (on average 1.4903518728717366) internal successors, (3939), 2643 states have internal predecessors, (3939), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:14:26,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2644 states to 2644 states and 3939 transitions. [2025-03-03 15:14:26,833 INFO L78 Accepts]: Start accepts. Automaton has 2644 states and 3939 transitions. Word has length 66 [2025-03-03 15:14:26,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:14:26,833 INFO L471 AbstractCegarLoop]: Abstraction has 2644 states and 3939 transitions. [2025-03-03 15:14:26,834 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:14:26,834 INFO L276 IsEmpty]: Start isEmpty. Operand 2644 states and 3939 transitions. [2025-03-03 15:14:26,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-03-03 15:14:26,834 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:14:26,834 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-03 15:14:26,834 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 15:14:26,834 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:14:26,835 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:14:26,835 INFO L85 PathProgramCache]: Analyzing trace with hash -647158865, now seen corresponding path program 1 times [2025-03-03 15:14:26,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:14:26,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1489312733] [2025-03-03 15:14:26,835 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:14:26,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:14:26,844 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-03-03 15:14:26,858 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-03-03 15:14:26,858 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:14:26,858 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:14:27,023 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:14:27,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:14:27,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1489312733] [2025-03-03 15:14:27,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1489312733] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:14:27,024 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:14:27,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 15:14:27,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804996073] [2025-03-03 15:14:27,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:14:27,025 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:14:27,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:14:27,025 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:14:27,025 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:14:27,026 INFO L87 Difference]: Start difference. First operand 2644 states and 3939 transitions. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 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-03 15:14:27,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:14:27,051 INFO L93 Difference]: Finished difference Result 2710 states and 4036 transitions. [2025-03-03 15:14:27,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 15:14:27,051 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 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-03 15:14:27,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:14:27,057 INFO L225 Difference]: With dead ends: 2710 [2025-03-03 15:14:27,058 INFO L226 Difference]: Without dead ends: 2708 [2025-03-03 15:14:27,058 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:14:27,059 INFO L435 NwaCegarLoop]: 129 mSDtfsCounter, 0 mSDsluCounter, 376 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 505 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-03 15:14:27,061 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 505 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:14:27,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2708 states. [2025-03-03 15:14:27,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2708 to 2708. [2025-03-03 15:14:27,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2708 states, 2707 states have (on average 1.4728481714074622) internal successors, (3987), 2707 states have internal predecessors, (3987), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:14:27,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2708 states to 2708 states and 3987 transitions. [2025-03-03 15:14:27,099 INFO L78 Accepts]: Start accepts. Automaton has 2708 states and 3987 transitions. Word has length 67 [2025-03-03 15:14:27,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:14:27,099 INFO L471 AbstractCegarLoop]: Abstraction has 2708 states and 3987 transitions. [2025-03-03 15:14:27,099 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 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-03 15:14:27,101 INFO L276 IsEmpty]: Start isEmpty. Operand 2708 states and 3987 transitions. [2025-03-03 15:14:27,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-03-03 15:14:27,102 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:14:27,102 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-03 15:14:27,102 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 15:14:27,102 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:14:27,103 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:14:27,103 INFO L85 PathProgramCache]: Analyzing trace with hash 224761687, now seen corresponding path program 1 times [2025-03-03 15:14:27,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:14:27,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669004377] [2025-03-03 15:14:27,103 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:14:27,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:14:27,111 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-03-03 15:14:27,118 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-03-03 15:14:27,120 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:14:27,120 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:14:27,152 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:14:27,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:14:27,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [669004377] [2025-03-03 15:14:27,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [669004377] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:14:27,152 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:14:27,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:14:27,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [312314669] [2025-03-03 15:14:27,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:14:27,153 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:14:27,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:14:27,153 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:14:27,153 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:14:27,154 INFO L87 Difference]: Start difference. First operand 2708 states and 3987 transitions. Second operand has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:14:27,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:14:27,177 INFO L93 Difference]: Finished difference Result 5339 states and 7929 transitions. [2025-03-03 15:14:27,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:14:27,178 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2025-03-03 15:14:27,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:14:27,187 INFO L225 Difference]: With dead ends: 5339 [2025-03-03 15:14:27,187 INFO L226 Difference]: Without dead ends: 3864 [2025-03-03 15:14:27,189 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:14:27,189 INFO L435 NwaCegarLoop]: 206 mSDtfsCounter, 85 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 299 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:14:27,190 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 299 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:14:27,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3864 states. [2025-03-03 15:14:27,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3864 to 3862. [2025-03-03 15:14:27,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3862 states, 3861 states have (on average 1.4682724682724684) internal successors, (5669), 3861 states have internal predecessors, (5669), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:14:27,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3862 states to 3862 states and 5669 transitions. [2025-03-03 15:14:27,256 INFO L78 Accepts]: Start accepts. Automaton has 3862 states and 5669 transitions. Word has length 67 [2025-03-03 15:14:27,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:14:27,256 INFO L471 AbstractCegarLoop]: Abstraction has 3862 states and 5669 transitions. [2025-03-03 15:14:27,256 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:14:27,256 INFO L276 IsEmpty]: Start isEmpty. Operand 3862 states and 5669 transitions. [2025-03-03 15:14:27,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-03-03 15:14:27,258 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:14:27,258 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:14:27,258 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 15:14:27,258 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:14:27,258 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:14:27,259 INFO L85 PathProgramCache]: Analyzing trace with hash -821924727, now seen corresponding path program 1 times [2025-03-03 15:14:27,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:14:27,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [726123224] [2025-03-03 15:14:27,259 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:14:27,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:14:27,270 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-03 15:14:27,281 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-03 15:14:27,281 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:14:27,281 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:14:27,393 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-03 15:14:27,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:14:27,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [726123224] [2025-03-03 15:14:27,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [726123224] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:14:27,393 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:14:27,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 15:14:27,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214998192] [2025-03-03 15:14:27,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:14:27,394 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 15:14:27,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:14:27,394 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 15:14:27,394 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-03 15:14:27,395 INFO L87 Difference]: Start difference. First operand 3862 states and 5669 transitions. Second operand has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 7 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:14:27,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:14:27,569 INFO L93 Difference]: Finished difference Result 23714 states and 34859 transitions. [2025-03-03 15:14:27,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 15:14:27,569 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 7 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 94 [2025-03-03 15:14:27,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:14:27,619 INFO L225 Difference]: With dead ends: 23714 [2025-03-03 15:14:27,619 INFO L226 Difference]: Without dead ends: 19888 [2025-03-03 15:14:27,629 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-03-03 15:14:27,630 INFO L435 NwaCegarLoop]: 226 mSDtfsCounter, 766 mSDsluCounter, 866 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 766 SdHoareTripleChecker+Valid, 1092 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:14:27,631 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [766 Valid, 1092 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 15:14:27,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19888 states. [2025-03-03 15:14:27,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19888 to 7686. [2025-03-03 15:14:27,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7686 states, 7685 states have (on average 1.464281067013663) internal successors, (11253), 7685 states have internal predecessors, (11253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:14:27,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7686 states to 7686 states and 11253 transitions. [2025-03-03 15:14:27,814 INFO L78 Accepts]: Start accepts. Automaton has 7686 states and 11253 transitions. Word has length 94 [2025-03-03 15:14:27,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:14:27,814 INFO L471 AbstractCegarLoop]: Abstraction has 7686 states and 11253 transitions. [2025-03-03 15:14:27,814 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 7 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:14:27,814 INFO L276 IsEmpty]: Start isEmpty. Operand 7686 states and 11253 transitions. [2025-03-03 15:14:27,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-03-03 15:14:27,819 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:14:27,819 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:14:27,819 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 15:14:27,819 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:14:27,820 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:14:27,820 INFO L85 PathProgramCache]: Analyzing trace with hash 822624297, now seen corresponding path program 1 times [2025-03-03 15:14:27,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:14:27,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835719370] [2025-03-03 15:14:27,820 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:14:27,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:14:27,832 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-03 15:14:27,844 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-03 15:14:27,845 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:14:27,845 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:14:27,954 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-03 15:14:27,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:14:27,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [835719370] [2025-03-03 15:14:27,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [835719370] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:14:27,955 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:14:27,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 15:14:27,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505723731] [2025-03-03 15:14:27,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:14:27,955 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 15:14:27,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:14:27,955 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 15:14:27,956 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-03 15:14:27,956 INFO L87 Difference]: Start difference. First operand 7686 states and 11253 transitions. Second operand has 7 states, 7 states have (on average 12.428571428571429) internal successors, (87), 7 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:14:28,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:14:28,116 INFO L93 Difference]: Finished difference Result 27538 states and 40443 transitions. [2025-03-03 15:14:28,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 15:14:28,117 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.428571428571429) internal successors, (87), 7 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 94 [2025-03-03 15:14:28,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:14:28,148 INFO L225 Difference]: With dead ends: 27538 [2025-03-03 15:14:28,148 INFO L226 Difference]: Without dead ends: 23712 [2025-03-03 15:14:28,153 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-03-03 15:14:28,154 INFO L435 NwaCegarLoop]: 224 mSDtfsCounter, 803 mSDsluCounter, 745 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 803 SdHoareTripleChecker+Valid, 969 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:14:28,154 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [803 Valid, 969 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 15:14:28,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23712 states. [2025-03-03 15:14:28,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23712 to 13430. [2025-03-03 15:14:28,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13430 states, 13429 states have (on average 1.4587087646138952) internal successors, (19589), 13429 states have internal predecessors, (19589), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:14:28,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13430 states to 13430 states and 19589 transitions. [2025-03-03 15:14:28,403 INFO L78 Accepts]: Start accepts. Automaton has 13430 states and 19589 transitions. Word has length 94 [2025-03-03 15:14:28,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:14:28,403 INFO L471 AbstractCegarLoop]: Abstraction has 13430 states and 19589 transitions. [2025-03-03 15:14:28,403 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.428571428571429) internal successors, (87), 7 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:14:28,404 INFO L276 IsEmpty]: Start isEmpty. Operand 13430 states and 19589 transitions. [2025-03-03 15:14:28,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-03-03 15:14:28,405 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:14:28,406 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:14:28,406 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-03 15:14:28,406 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:14:28,406 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:14:28,406 INFO L85 PathProgramCache]: Analyzing trace with hash -1320623159, now seen corresponding path program 1 times [2025-03-03 15:14:28,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:14:28,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081677357] [2025-03-03 15:14:28,407 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:14:28,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:14:28,416 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-03 15:14:28,423 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-03 15:14:28,423 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:14:28,423 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:14:28,524 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-03-03 15:14:28,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:14:28,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2081677357] [2025-03-03 15:14:28,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2081677357] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:14:28,525 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:14:28,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 15:14:28,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603852483] [2025-03-03 15:14:28,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:14:28,526 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 15:14:28,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:14:28,526 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 15:14:28,526 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-03 15:14:28,527 INFO L87 Difference]: Start difference. First operand 13430 states and 19589 transitions. Second operand has 7 states, 7 states have (on average 12.285714285714286) internal successors, (86), 7 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:14:28,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:14:28,689 INFO L93 Difference]: Finished difference Result 31362 states and 46027 transitions. [2025-03-03 15:14:28,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 15:14:28,690 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.285714285714286) internal successors, (86), 7 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 94 [2025-03-03 15:14:28,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:14:28,728 INFO L225 Difference]: With dead ends: 31362 [2025-03-03 15:14:28,728 INFO L226 Difference]: Without dead ends: 27536 [2025-03-03 15:14:28,741 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-03-03 15:14:28,742 INFO L435 NwaCegarLoop]: 221 mSDtfsCounter, 859 mSDsluCounter, 738 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 859 SdHoareTripleChecker+Valid, 959 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:14:28,742 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [859 Valid, 959 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 15:14:28,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27536 states. [2025-03-03 15:14:28,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27536 to 17254. [2025-03-03 15:14:28,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17254 states, 17253 states have (on average 1.4590505998956702) internal successors, (25173), 17253 states have internal predecessors, (25173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:14:28,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17254 states to 17254 states and 25173 transitions. [2025-03-03 15:14:28,982 INFO L78 Accepts]: Start accepts. Automaton has 17254 states and 25173 transitions. Word has length 94 [2025-03-03 15:14:28,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:14:28,982 INFO L471 AbstractCegarLoop]: Abstraction has 17254 states and 25173 transitions. [2025-03-03 15:14:28,982 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.285714285714286) internal successors, (86), 7 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:14:28,983 INFO L276 IsEmpty]: Start isEmpty. Operand 17254 states and 25173 transitions. [2025-03-03 15:14:28,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-03-03 15:14:28,986 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:14:28,987 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:14:28,987 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-03 15:14:28,987 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:14:28,987 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:14:28,987 INFO L85 PathProgramCache]: Analyzing trace with hash -1112778903, now seen corresponding path program 1 times [2025-03-03 15:14:28,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:14:28,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [815637221] [2025-03-03 15:14:28,988 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:14:28,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:14:29,022 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-03 15:14:29,030 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-03 15:14:29,031 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:14:29,031 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:14:29,131 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-03-03 15:14:29,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:14:29,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [815637221] [2025-03-03 15:14:29,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [815637221] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:14:29,131 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:14:29,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 15:14:29,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128858153] [2025-03-03 15:14:29,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:14:29,131 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 15:14:29,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:14:29,131 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 15:14:29,131 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-03 15:14:29,132 INFO L87 Difference]: Start difference. First operand 17254 states and 25173 transitions. Second operand has 7 states, 7 states have (on average 12.142857142857142) internal successors, (85), 7 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:14:29,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:14:29,288 INFO L93 Difference]: Finished difference Result 35186 states and 51611 transitions. [2025-03-03 15:14:29,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 15:14:29,288 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.142857142857142) internal successors, (85), 7 states have internal predecessors, (85), 0 states have call successors, (0), 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 94 [2025-03-03 15:14:29,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:14:29,336 INFO L225 Difference]: With dead ends: 35186 [2025-03-03 15:14:29,336 INFO L226 Difference]: Without dead ends: 31360 [2025-03-03 15:14:29,348 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-03-03 15:14:29,348 INFO L435 NwaCegarLoop]: 229 mSDtfsCounter, 779 mSDsluCounter, 823 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 779 SdHoareTripleChecker+Valid, 1052 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:14:29,348 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [779 Valid, 1052 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 15:14:29,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31360 states. [2025-03-03 15:14:29,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31360 to 21078. [2025-03-03 15:14:29,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21078 states, 21077 states have (on average 1.4592683968306686) internal successors, (30757), 21077 states have internal predecessors, (30757), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:14:29,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21078 states to 21078 states and 30757 transitions. [2025-03-03 15:14:29,643 INFO L78 Accepts]: Start accepts. Automaton has 21078 states and 30757 transitions. Word has length 94 [2025-03-03 15:14:29,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:14:29,643 INFO L471 AbstractCegarLoop]: Abstraction has 21078 states and 30757 transitions. [2025-03-03 15:14:29,643 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.142857142857142) internal successors, (85), 7 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:14:29,644 INFO L276 IsEmpty]: Start isEmpty. Operand 21078 states and 30757 transitions. [2025-03-03 15:14:29,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-03-03 15:14:29,647 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:14:29,648 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:14:29,648 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-03 15:14:29,648 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:14:29,649 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:14:29,649 INFO L85 PathProgramCache]: Analyzing trace with hash -1431352112, now seen corresponding path program 1 times [2025-03-03 15:14:29,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:14:29,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [807220447] [2025-03-03 15:14:29,649 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:14:29,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:14:29,660 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-03 15:14:29,668 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-03 15:14:29,668 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:14:29,668 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:14:29,772 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-03 15:14:29,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:14:29,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [807220447] [2025-03-03 15:14:29,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [807220447] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:14:29,773 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:14:29,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 15:14:29,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908379986] [2025-03-03 15:14:29,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:14:29,773 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 15:14:29,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:14:29,773 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 15:14:29,773 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-03 15:14:29,773 INFO L87 Difference]: Start difference. First operand 21078 states and 30757 transitions. Second operand has 7 states, 7 states have (on average 13.428571428571429) internal successors, (94), 7 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:14:29,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:14:29,970 INFO L93 Difference]: Finished difference Result 36610 states and 53739 transitions. [2025-03-03 15:14:29,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 15:14:29,972 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.428571428571429) internal successors, (94), 7 states have internal predecessors, (94), 0 states have call successors, (0), 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 95 [2025-03-03 15:14:29,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:14:30,020 INFO L225 Difference]: With dead ends: 36610 [2025-03-03 15:14:30,020 INFO L226 Difference]: Without dead ends: 33984 [2025-03-03 15:14:30,028 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-03-03 15:14:30,029 INFO L435 NwaCegarLoop]: 231 mSDtfsCounter, 759 mSDsluCounter, 994 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 759 SdHoareTripleChecker+Valid, 1225 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:14:30,029 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [759 Valid, 1225 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 15:14:30,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33984 states. [2025-03-03 15:14:30,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33984 to 23702. [2025-03-03 15:14:30,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23702 states, 23701 states have (on average 1.461077591662799) internal successors, (34629), 23701 states have internal predecessors, (34629), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:14:30,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23702 states to 23702 states and 34629 transitions. [2025-03-03 15:14:30,364 INFO L78 Accepts]: Start accepts. Automaton has 23702 states and 34629 transitions. Word has length 95 [2025-03-03 15:14:30,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:14:30,364 INFO L471 AbstractCegarLoop]: Abstraction has 23702 states and 34629 transitions. [2025-03-03 15:14:30,364 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.428571428571429) internal successors, (94), 7 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:14:30,364 INFO L276 IsEmpty]: Start isEmpty. Operand 23702 states and 34629 transitions. [2025-03-03 15:14:30,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-03-03 15:14:30,368 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:14:30,368 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:14:30,368 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-03 15:14:30,369 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:14:30,369 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:14:30,369 INFO L85 PathProgramCache]: Analyzing trace with hash 1104882405, now seen corresponding path program 1 times [2025-03-03 15:14:30,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:14:30,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1007620757] [2025-03-03 15:14:30,369 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:14:30,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:14:30,383 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-03 15:14:30,395 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-03 15:14:30,395 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:14:30,396 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:14:30,462 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:14:30,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:14:30,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1007620757] [2025-03-03 15:14:30,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1007620757] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:14:30,463 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:14:30,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:14:30,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [99349338] [2025-03-03 15:14:30,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:14:30,463 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:14:30,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:14:30,464 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:14:30,464 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:14:30,464 INFO L87 Difference]: Start difference. First operand 23702 states and 34629 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-03 15:14:30,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:14:30,553 INFO L93 Difference]: Finished difference Result 40800 states and 59848 transitions. [2025-03-03 15:14:30,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:14:30,553 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-03 15:14:30,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:14:30,580 INFO L225 Difference]: With dead ends: 40800 [2025-03-03 15:14:30,580 INFO L226 Difference]: Without dead ends: 17134 [2025-03-03 15:14:30,601 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:14:30,602 INFO L435 NwaCegarLoop]: 172 mSDtfsCounter, 62 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 288 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:14:30,602 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 288 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:14:30,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17134 states. [2025-03-03 15:14:30,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17134 to 17132. [2025-03-03 15:14:30,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17132 states, 17131 states have (on average 1.4619695289241725) internal successors, (25045), 17131 states have internal predecessors, (25045), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:14:30,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17132 states to 17132 states and 25045 transitions. [2025-03-03 15:14:30,803 INFO L78 Accepts]: Start accepts. Automaton has 17132 states and 25045 transitions. Word has length 96 [2025-03-03 15:14:30,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:14:30,803 INFO L471 AbstractCegarLoop]: Abstraction has 17132 states and 25045 transitions. [2025-03-03 15:14:30,803 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-03 15:14:30,803 INFO L276 IsEmpty]: Start isEmpty. Operand 17132 states and 25045 transitions. [2025-03-03 15:14:30,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-03-03 15:14:30,806 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:14:30,806 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:14:30,806 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-03 15:14:30,806 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:14:30,807 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:14:30,807 INFO L85 PathProgramCache]: Analyzing trace with hash -62448018, now seen corresponding path program 1 times [2025-03-03 15:14:30,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:14:30,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616284185] [2025-03-03 15:14:30,807 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:14:30,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:14:30,817 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-03 15:14:30,834 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-03 15:14:30,836 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:14:30,836 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:14:31,088 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 14 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:14:31,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:14:31,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [616284185] [2025-03-03 15:14:31,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [616284185] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 15:14:31,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [182515335] [2025-03-03 15:14:31,089 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:14:31,089 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 15:14:31,090 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 15:14:31,092 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 15:14:31,093 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-03 15:14:31,162 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-03 15:14:31,209 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-03 15:14:31,209 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:14:31,209 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:14:31,212 INFO L256 TraceCheckSpWp]: Trace formula consists of 442 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-03 15:14:31,217 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 15:14:31,753 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:14:31,753 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 15:14:32,427 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:14:32,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [182515335] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 15:14:32,427 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 15:14:32,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 24 [2025-03-03 15:14:32,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [746607048] [2025-03-03 15:14:32,427 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 15:14:32,428 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-03-03 15:14:32,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:14:32,428 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-03-03 15:14:32,428 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=527, Unknown=0, NotChecked=0, Total=600 [2025-03-03 15:14:32,429 INFO L87 Difference]: Start difference. First operand 17132 states and 25045 transitions. Second operand has 25 states, 25 states have (on average 10.12) internal successors, (253), 24 states have internal predecessors, (253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:14:36,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:14:36,181 INFO L93 Difference]: Finished difference Result 149415 states and 216819 transitions. [2025-03-03 15:14:36,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2025-03-03 15:14:36,182 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 10.12) internal successors, (253), 24 states have internal predecessors, (253), 0 states have call successors, (0), 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-03 15:14:36,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:14:36,346 INFO L225 Difference]: With dead ends: 149415 [2025-03-03 15:14:36,347 INFO L226 Difference]: Without dead ends: 132327 [2025-03-03 15:14:36,387 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 295 GetRequests, 176 SyntacticMatches, 0 SemanticMatches, 119 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4615 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=2339, Invalid=12181, Unknown=0, NotChecked=0, Total=14520 [2025-03-03 15:14:36,388 INFO L435 NwaCegarLoop]: 169 mSDtfsCounter, 4815 mSDsluCounter, 1659 mSDsCounter, 0 mSdLazyCounter, 2974 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4815 SdHoareTripleChecker+Valid, 1828 SdHoareTripleChecker+Invalid, 3013 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 2974 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-03 15:14:36,389 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4815 Valid, 1828 Invalid, 3013 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 2974 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-03 15:14:36,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132327 states. [2025-03-03 15:14:37,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132327 to 84991. [2025-03-03 15:14:37,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84991 states, 84990 states have (on average 1.436698435110013) internal successors, (122105), 84990 states have internal predecessors, (122105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:14:37,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84991 states to 84991 states and 122105 transitions. [2025-03-03 15:14:37,681 INFO L78 Accepts]: Start accepts. Automaton has 84991 states and 122105 transitions. Word has length 96 [2025-03-03 15:14:37,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:14:37,681 INFO L471 AbstractCegarLoop]: Abstraction has 84991 states and 122105 transitions. [2025-03-03 15:14:37,681 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 10.12) internal successors, (253), 24 states have internal predecessors, (253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:14:37,681 INFO L276 IsEmpty]: Start isEmpty. Operand 84991 states and 122105 transitions. [2025-03-03 15:14:37,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-03-03 15:14:37,686 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:14:37,686 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:14:37,694 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-03 15:14:37,887 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,SelfDestructingSolverStorable15 [2025-03-03 15:14:37,887 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:14:37,888 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:14:37,888 INFO L85 PathProgramCache]: Analyzing trace with hash -439282324, now seen corresponding path program 1 times [2025-03-03 15:14:37,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:14:37,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1682701636] [2025-03-03 15:14:37,888 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:14:37,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:14:37,897 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-03 15:14:37,915 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-03 15:14:37,915 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:14:37,916 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:14:38,257 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 10 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:14:38,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:14:38,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1682701636] [2025-03-03 15:14:38,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1682701636] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 15:14:38,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1031535478] [2025-03-03 15:14:38,257 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:14:38,257 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 15:14:38,257 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 15:14:38,259 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-03 15:14:38,260 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-03 15:14:38,319 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-03 15:14:38,358 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-03 15:14:38,358 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:14:38,359 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:14:38,363 INFO L256 TraceCheckSpWp]: Trace formula consists of 447 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-03 15:14:38,365 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 15:14:38,728 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 10 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:14:38,729 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 15:14:39,149 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 10 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:14:39,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1031535478] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 15:14:39,149 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 15:14:39,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 20 [2025-03-03 15:14:39,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [385482931] [2025-03-03 15:14:39,150 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 15:14:39,150 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-03 15:14:39,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:14:39,150 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-03 15:14:39,151 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=350, Unknown=0, NotChecked=0, Total=420 [2025-03-03 15:14:39,151 INFO L87 Difference]: Start difference. First operand 84991 states and 122105 transitions. Second operand has 21 states, 21 states have (on average 10.047619047619047) internal successors, (211), 20 states have internal predecessors, (211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:14:40,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:14:40,684 INFO L93 Difference]: Finished difference Result 422548 states and 606190 transitions. [2025-03-03 15:14:40,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-03 15:14:40,684 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 10.047619047619047) internal successors, (211), 20 states have internal predecessors, (211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 97 [2025-03-03 15:14:40,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:14:41,230 INFO L225 Difference]: With dead ends: 422548 [2025-03-03 15:14:41,230 INFO L226 Difference]: Without dead ends: 337595 [2025-03-03 15:14:41,290 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 182 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 265 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=353, Invalid=1129, Unknown=0, NotChecked=0, Total=1482 [2025-03-03 15:14:41,290 INFO L435 NwaCegarLoop]: 126 mSDtfsCounter, 2384 mSDsluCounter, 1037 mSDsCounter, 0 mSdLazyCounter, 1125 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2384 SdHoareTripleChecker+Valid, 1163 SdHoareTripleChecker+Invalid, 1142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 1125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 15:14:41,290 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2384 Valid, 1163 Invalid, 1142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 1125 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 15:14:41,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337595 states. [2025-03-03 15:14:43,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337595 to 200309. [2025-03-03 15:14:43,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200309 states, 200308 states have (on average 1.4250803762206203) internal successors, (285455), 200308 states have internal predecessors, (285455), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:14:44,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200309 states to 200309 states and 285455 transitions. [2025-03-03 15:14:44,158 INFO L78 Accepts]: Start accepts. Automaton has 200309 states and 285455 transitions. Word has length 97 [2025-03-03 15:14:44,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:14:44,159 INFO L471 AbstractCegarLoop]: Abstraction has 200309 states and 285455 transitions. [2025-03-03 15:14:44,159 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 10.047619047619047) internal successors, (211), 20 states have internal predecessors, (211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:14:44,160 INFO L276 IsEmpty]: Start isEmpty. Operand 200309 states and 285455 transitions. [2025-03-03 15:14:44,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-03-03 15:14:44,166 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:14:44,166 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:14:44,177 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-03 15:14:44,366 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,SelfDestructingSolverStorable16 [2025-03-03 15:14:44,366 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:14:44,367 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:14:44,367 INFO L85 PathProgramCache]: Analyzing trace with hash 276725521, now seen corresponding path program 1 times [2025-03-03 15:14:44,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:14:44,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1800633985] [2025-03-03 15:14:44,367 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:14:44,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:14:44,377 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-03 15:14:44,382 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-03 15:14:44,382 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:14:44,382 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:14:44,406 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-03 15:14:44,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:14:44,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1800633985] [2025-03-03 15:14:44,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1800633985] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:14:44,406 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:14:44,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:14:44,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1256347819] [2025-03-03 15:14:44,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:14:44,407 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:14:44,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:14:44,407 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:14:44,407 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:14:44,407 INFO L87 Difference]: Start difference. First operand 200309 states and 285455 transitions. Second operand has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:14:45,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:14:45,706 INFO L93 Difference]: Finished difference Result 371183 states and 529596 transitions. [2025-03-03 15:14:45,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:14:45,707 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 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 98 [2025-03-03 15:14:45,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:14:45,854 INFO L225 Difference]: With dead ends: 371183 [2025-03-03 15:14:45,854 INFO L226 Difference]: Without dead ends: 170998 [2025-03-03 15:14:45,894 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:14:45,894 INFO L435 NwaCegarLoop]: 124 mSDtfsCounter, 92 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 15:14:45,894 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 188 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 15:14:45,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170998 states. [2025-03-03 15:14:47,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170998 to 170998. [2025-03-03 15:14:47,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170998 states, 170997 states have (on average 1.4175921214992075) internal successors, (242404), 170997 states have internal predecessors, (242404), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:14:47,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170998 states to 170998 states and 242404 transitions. [2025-03-03 15:14:47,782 INFO L78 Accepts]: Start accepts. Automaton has 170998 states and 242404 transitions. Word has length 98 [2025-03-03 15:14:47,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:14:47,782 INFO L471 AbstractCegarLoop]: Abstraction has 170998 states and 242404 transitions. [2025-03-03 15:14:47,782 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:14:47,782 INFO L276 IsEmpty]: Start isEmpty. Operand 170998 states and 242404 transitions. [2025-03-03 15:14:47,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-03-03 15:14:47,789 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:14:47,789 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:14:47,790 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-03 15:14:47,790 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:14:47,790 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:14:47,793 INFO L85 PathProgramCache]: Analyzing trace with hash -1904270802, now seen corresponding path program 1 times [2025-03-03 15:14:47,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:14:47,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1600840201] [2025-03-03 15:14:47,794 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:14:47,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:14:47,807 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-03 15:14:47,812 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-03 15:14:47,812 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:14:47,812 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:14:47,845 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-03 15:14:47,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:14:47,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1600840201] [2025-03-03 15:14:47,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1600840201] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:14:47,846 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:14:47,846 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:14:47,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1219558241] [2025-03-03 15:14:47,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:14:47,847 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:14:47,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:14:47,847 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:14:47,847 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:14:47,848 INFO L87 Difference]: Start difference. First operand 170998 states and 242404 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-03 15:14:48,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:14:48,585 INFO L93 Difference]: Finished difference Result 275708 states and 391933 transitions. [2025-03-03 15:14:48,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:14:48,586 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 98 [2025-03-03 15:14:48,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:14:48,709 INFO L225 Difference]: With dead ends: 275708 [2025-03-03 15:14:48,709 INFO L226 Difference]: Without dead ends: 104810 [2025-03-03 15:14:48,802 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:14:48,802 INFO L435 NwaCegarLoop]: 91 mSDtfsCounter, 71 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:14:48,802 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 123 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:14:48,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104810 states. [2025-03-03 15:14:50,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104810 to 104810. [2025-03-03 15:14:50,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104810 states, 104809 states have (on average 1.4160425154328349) internal successors, (148414), 104809 states have internal predecessors, (148414), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:14:50,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104810 states to 104810 states and 148414 transitions. [2025-03-03 15:14:50,243 INFO L78 Accepts]: Start accepts. Automaton has 104810 states and 148414 transitions. Word has length 98 [2025-03-03 15:14:50,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:14:50,244 INFO L471 AbstractCegarLoop]: Abstraction has 104810 states and 148414 transitions. [2025-03-03 15:14:50,244 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-03 15:14:50,244 INFO L276 IsEmpty]: Start isEmpty. Operand 104810 states and 148414 transitions. [2025-03-03 15:14:50,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-03-03 15:14:50,247 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:14:50,247 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:14:50,247 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-03 15:14:50,248 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:14:50,248 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:14:50,248 INFO L85 PathProgramCache]: Analyzing trace with hash 1138624582, now seen corresponding path program 1 times [2025-03-03 15:14:50,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:14:50,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688550244] [2025-03-03 15:14:50,248 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:14:50,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:14:50,261 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-03 15:14:50,271 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-03 15:14:50,271 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:14:50,271 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:14:50,424 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:14:50,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:14:50,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1688550244] [2025-03-03 15:14:50,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1688550244] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 15:14:50,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2101140862] [2025-03-03 15:14:50,425 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:14:50,425 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 15:14:50,425 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 15:14:50,427 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-03 15:14:50,429 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-03 15:14:50,494 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-03 15:14:50,536 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-03 15:14:50,536 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:14:50,536 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:14:50,540 INFO L256 TraceCheckSpWp]: Trace formula consists of 449 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-03 15:14:50,542 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 15:14:50,862 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:14:50,863 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 15:14:51,535 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:14:51,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2101140862] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 15:14:51,536 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 15:14:51,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 25 [2025-03-03 15:14:51,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1420766292] [2025-03-03 15:14:51,536 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 15:14:51,536 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-03-03 15:14:51,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:14:51,537 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-03-03 15:14:51,537 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=556, Unknown=0, NotChecked=0, Total=650 [2025-03-03 15:14:51,537 INFO L87 Difference]: Start difference. First operand 104810 states and 148414 transitions. Second operand has 26 states, 26 states have (on average 10.692307692307692) internal successors, (278), 25 states have internal predecessors, (278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:14:57,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:14:57,367 INFO L93 Difference]: Finished difference Result 1346900 states and 1887490 transitions. [2025-03-03 15:14:57,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 126 states. [2025-03-03 15:14:57,368 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 10.692307692307692) internal successors, (278), 25 states have internal predecessors, (278), 0 states have call successors, (0), 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 98 [2025-03-03 15:14:57,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:14:59,522 INFO L225 Difference]: With dead ends: 1346900 [2025-03-03 15:14:59,523 INFO L226 Difference]: Without dead ends: 1242144 [2025-03-03 15:14:59,629 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 327 GetRequests, 179 SyntacticMatches, 0 SemanticMatches, 148 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8117 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=3422, Invalid=18928, Unknown=0, NotChecked=0, Total=22350 [2025-03-03 15:14:59,630 INFO L435 NwaCegarLoop]: 99 mSDtfsCounter, 4534 mSDsluCounter, 1502 mSDsCounter, 0 mSdLazyCounter, 1966 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4534 SdHoareTripleChecker+Valid, 1601 SdHoareTripleChecker+Invalid, 2018 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 1966 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-03 15:14:59,630 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4534 Valid, 1601 Invalid, 2018 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 1966 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-03 15:15:00,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1242144 states. [2025-03-03 15:15:08,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1242144 to 608632. [2025-03-03 15:15:09,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 608632 states, 608631 states have (on average 1.3942290156104438) internal successors, (848571), 608631 states have internal predecessors, (848571), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)