./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.3.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-var-start-time.3.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 4ac9738018cdb6c628ad42533cfecc5c9af778919d271278199945a85d10a362 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 15:05:02,503 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 15:05:02,547 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 15:05:02,554 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 15:05:02,554 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 15:05:02,580 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 15:05:02,582 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 15:05:02,582 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 15:05:02,582 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 15:05:02,582 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 15:05:02,583 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 15:05:02,583 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 15:05:02,583 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 15:05:02,583 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 15:05:02,584 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 15:05:02,584 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 15:05:02,584 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 15:05:02,584 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 15:05:02,584 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 15:05:02,584 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 15:05:02,584 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 15:05:02,584 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 15:05:02,585 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 15:05:02,585 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 15:05:02,585 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 15:05:02,585 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 15:05:02,585 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 15:05:02,585 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 15:05:02,585 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 15:05:02,585 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 15:05:02,585 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 15:05:02,585 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 15:05:02,586 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 15:05:02,586 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 15:05:02,586 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 15:05:02,586 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 15:05:02,586 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 15:05:02,586 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 15:05:02,586 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 15:05:02,586 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 15:05:02,586 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 15:05:02,586 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 15:05:02,586 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 15:05:02,586 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 -> 4ac9738018cdb6c628ad42533cfecc5c9af778919d271278199945a85d10a362 [2025-03-03 15:05:02,836 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 15:05:02,846 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 15:05:02,848 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 15:05:02,849 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 15:05:02,850 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 15:05:02,851 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.3.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2025-03-03 15:05:04,023 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3431a2e93/aea4b59e107a46958e897417d7357774/FLAG872289621 [2025-03-03 15:05:04,312 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 15:05:04,312 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.3.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2025-03-03 15:05:04,322 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3431a2e93/aea4b59e107a46958e897417d7357774/FLAG872289621 [2025-03-03 15:05:04,335 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3431a2e93/aea4b59e107a46958e897417d7357774 [2025-03-03 15:05:04,336 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 15:05:04,337 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 15:05:04,338 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 15:05:04,339 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 15:05:04,341 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 15:05:04,342 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 03:05:04" (1/1) ... [2025-03-03 15:05:04,342 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@394efba3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:05:04, skipping insertion in model container [2025-03-03 15:05:04,343 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 03:05:04" (1/1) ... [2025-03-03 15:05:04,360 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 15:05:04,487 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-var-start-time.3.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c[4411,4424] [2025-03-03 15:05:04,511 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 15:05:04,520 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 15:05:04,550 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-var-start-time.3.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c[4411,4424] [2025-03-03 15:05:04,557 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 15:05:04,572 INFO L204 MainTranslator]: Completed translation [2025-03-03 15:05:04,573 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:05:04 WrapperNode [2025-03-03 15:05:04,573 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 15:05:04,574 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 15:05:04,575 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 15:05:04,575 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 15:05:04,579 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:05:04" (1/1) ... [2025-03-03 15:05:04,586 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:05:04" (1/1) ... [2025-03-03 15:05:04,613 INFO L138 Inliner]: procedures = 23, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 362 [2025-03-03 15:05:04,613 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 15:05:04,614 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 15:05:04,614 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 15:05:04,614 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 15:05:04,620 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:05:04" (1/1) ... [2025-03-03 15:05:04,620 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:05:04" (1/1) ... [2025-03-03 15:05:04,623 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:05:04" (1/1) ... [2025-03-03 15:05:04,643 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:05:04,647 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:05:04" (1/1) ... [2025-03-03 15:05:04,647 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:05:04" (1/1) ... [2025-03-03 15:05:04,656 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:05:04" (1/1) ... [2025-03-03 15:05:04,657 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:05:04" (1/1) ... [2025-03-03 15:05:04,659 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:05:04" (1/1) ... [2025-03-03 15:05:04,662 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:05:04" (1/1) ... [2025-03-03 15:05:04,664 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 15:05:04,666 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 15:05:04,666 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 15:05:04,666 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 15:05:04,667 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:05:04" (1/1) ... [2025-03-03 15:05:04,671 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 15:05:04,681 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 15:05:04,694 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:05:04,696 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:05:04,715 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 15:05:04,716 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 15:05:04,716 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 15:05:04,716 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 15:05:04,784 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 15:05:04,786 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 15:05:05,084 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L449: havoc main_~node1____CPAchecker_TMP_0~0#1; [2025-03-03 15:05:05,085 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L385: havoc main_~node2____CPAchecker_TMP_1~0#1; [2025-03-03 15:05:05,085 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L154: havoc main_~node2__m2~0#1; [2025-03-03 15:05:05,085 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L477: havoc main_~node1____CPAchecker_TMP_1~0#1; [2025-03-03 15:05:05,085 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L271: havoc main_~node3____CPAchecker_TMP_0~0#1; [2025-03-03 15:05:05,085 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L172: havoc main_~node3__m3~0#1; [2025-03-03 15:05:05,085 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L131: havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2025-03-03 15:05:05,085 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L207: havoc main_~__tmp_1~0#1, main_~assert__arg~0#1;havoc main_~check__tmp~0#1; [2025-03-03 15:05:05,085 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L299: havoc main_~node3____CPAchecker_TMP_1~0#1; [2025-03-03 15:05:05,085 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L357: havoc main_~node2____CPAchecker_TMP_0~0#1; [2025-03-03 15:05:05,104 INFO L? ?]: Removed 35 outVars from TransFormulas that were not future-live. [2025-03-03 15:05:05,105 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 15:05:05,115 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 15:05:05,115 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 15:05:05,116 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 03:05:05 BoogieIcfgContainer [2025-03-03 15:05:05,116 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 15:05:05,118 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 15:05:05,118 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 15:05:05,122 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 15:05:05,122 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 03:05:04" (1/3) ... [2025-03-03 15:05:05,123 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a5dd73e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 03:05:05, skipping insertion in model container [2025-03-03 15:05:05,123 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:05:04" (2/3) ... [2025-03-03 15:05:05,123 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a5dd73e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 03:05:05, skipping insertion in model container [2025-03-03 15:05:05,123 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 03:05:05" (3/3) ... [2025-03-03 15:05:05,124 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.3.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2025-03-03 15:05:05,137 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 15:05:05,139 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_lcr-var-start-time.3.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c that has 1 procedures, 87 locations, 1 initial locations, 0 loop locations, and 1 error locations. [2025-03-03 15:05:05,181 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 15:05:05,193 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;@779e1fdd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 15:05:05,194 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 15:05:05,198 INFO L276 IsEmpty]: Start isEmpty. Operand has 87 states, 85 states have (on average 1.6705882352941177) internal successors, (142), 86 states have internal predecessors, (142), 0 states have call successors, (0), 0 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:05:05,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-03-03 15:05:05,202 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:05:05,203 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:05:05,204 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:05:05,208 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:05:05,210 INFO L85 PathProgramCache]: Analyzing trace with hash 1942179841, now seen corresponding path program 1 times [2025-03-03 15:05:05,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:05:05,217 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [715672466] [2025-03-03 15:05:05,217 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:05:05,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:05:05,287 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-03 15:05:05,327 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-03 15:05:05,328 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:05:05,328 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:05:05,477 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:05:05,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:05:05,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [715672466] [2025-03-03 15:05:05,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [715672466] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:05:05,478 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:05:05,478 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:05:05,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605373478] [2025-03-03 15:05:05,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:05:05,482 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:05:05,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:05:05,499 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:05:05,500 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:05:05,501 INFO L87 Difference]: Start difference. First operand has 87 states, 85 states have (on average 1.6705882352941177) internal successors, (142), 86 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:05:05,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:05:05,549 INFO L93 Difference]: Finished difference Result 205 states and 324 transitions. [2025-03-03 15:05:05,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:05:05,552 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2025-03-03 15:05:05,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:05:05,558 INFO L225 Difference]: With dead ends: 205 [2025-03-03 15:05:05,560 INFO L226 Difference]: Without dead ends: 132 [2025-03-03 15:05:05,563 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:05:05,566 INFO L435 NwaCegarLoop]: 182 mSDtfsCounter, 94 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 283 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:05:05,567 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 283 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:05:05,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2025-03-03 15:05:05,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 130. [2025-03-03 15:05:05,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 129 states have (on average 1.503875968992248) internal successors, (194), 129 states have internal predecessors, (194), 0 states have call successors, (0), 0 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:05:05,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 194 transitions. [2025-03-03 15:05:05,598 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 194 transitions. Word has length 38 [2025-03-03 15:05:05,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:05:05,598 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 194 transitions. [2025-03-03 15:05:05,598 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:05:05,598 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 194 transitions. [2025-03-03 15:05:05,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-03-03 15:05:05,599 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:05:05,599 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:05:05,599 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 15:05:05,599 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:05:05,600 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:05:05,600 INFO L85 PathProgramCache]: Analyzing trace with hash 1796390494, now seen corresponding path program 1 times [2025-03-03 15:05:05,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:05:05,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348618188] [2025-03-03 15:05:05,600 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:05:05,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:05:05,631 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-03 15:05:05,653 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-03 15:05:05,653 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:05:05,653 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:05:05,750 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:05:05,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:05:05,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348618188] [2025-03-03 15:05:05,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1348618188] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:05:05,750 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:05:05,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:05:05,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1061152624] [2025-03-03 15:05:05,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:05:05,752 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:05:05,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:05:05,752 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:05:05,752 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:05:05,753 INFO L87 Difference]: Start difference. First operand 130 states and 194 transitions. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:05:05,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:05:05,792 INFO L93 Difference]: Finished difference Result 318 states and 490 transitions. [2025-03-03 15:05:05,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:05:05,793 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2025-03-03 15:05:05,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:05:05,796 INFO L225 Difference]: With dead ends: 318 [2025-03-03 15:05:05,797 INFO L226 Difference]: Without dead ends: 208 [2025-03-03 15:05:05,797 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:05:05,800 INFO L435 NwaCegarLoop]: 141 mSDtfsCounter, 79 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 235 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:05:05,800 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 235 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:05:05,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2025-03-03 15:05:05,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 206. [2025-03-03 15:05:05,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 205 states have (on average 1.526829268292683) internal successors, (313), 205 states have internal predecessors, (313), 0 states have call successors, (0), 0 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:05:05,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 313 transitions. [2025-03-03 15:05:05,820 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 313 transitions. Word has length 39 [2025-03-03 15:05:05,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:05:05,820 INFO L471 AbstractCegarLoop]: Abstraction has 206 states and 313 transitions. [2025-03-03 15:05:05,820 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:05:05,821 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 313 transitions. [2025-03-03 15:05:05,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-03-03 15:05:05,821 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:05:05,821 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] [2025-03-03 15:05:05,822 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 15:05:05,822 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:05:05,822 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:05:05,822 INFO L85 PathProgramCache]: Analyzing trace with hash -2036753029, now seen corresponding path program 1 times [2025-03-03 15:05:05,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:05:05,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200819795] [2025-03-03 15:05:05,822 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:05:05,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:05:05,838 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-03 15:05:05,858 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-03 15:05:05,860 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:05:05,861 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:05:05,951 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:05:05,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:05:05,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1200819795] [2025-03-03 15:05:05,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1200819795] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:05:05,951 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:05:05,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 15:05:05,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699920456] [2025-03-03 15:05:05,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:05:05,952 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:05:05,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:05:05,952 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:05:05,952 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:05:05,953 INFO L87 Difference]: Start difference. First operand 206 states and 313 transitions. Second operand has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 0 states have call successors, (0), 0 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:05:06,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:05:06,026 INFO L93 Difference]: Finished difference Result 950 states and 1485 transitions. [2025-03-03 15:05:06,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 15:05:06,027 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 0 states have call successors, (0), 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 40 [2025-03-03 15:05:06,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:05:06,031 INFO L225 Difference]: With dead ends: 950 [2025-03-03 15:05:06,031 INFO L226 Difference]: Without dead ends: 764 [2025-03-03 15:05:06,032 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-03 15:05:06,032 INFO L435 NwaCegarLoop]: 119 mSDtfsCounter, 501 mSDsluCounter, 578 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 501 SdHoareTripleChecker+Valid, 697 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:05:06,032 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [501 Valid, 697 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:05:06,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 764 states. [2025-03-03 15:05:06,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 764 to 390. [2025-03-03 15:05:06,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 390 states, 389 states have (on average 1.5347043701799485) internal successors, (597), 389 states have internal predecessors, (597), 0 states have call successors, (0), 0 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:05:06,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 597 transitions. [2025-03-03 15:05:06,057 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 597 transitions. Word has length 40 [2025-03-03 15:05:06,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:05:06,058 INFO L471 AbstractCegarLoop]: Abstraction has 390 states and 597 transitions. [2025-03-03 15:05:06,058 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 0 states have call successors, (0), 0 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:05:06,058 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 597 transitions. [2025-03-03 15:05:06,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-03-03 15:05:06,058 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:05:06,058 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:05:06,059 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 15:05:06,059 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:05:06,059 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:05:06,059 INFO L85 PathProgramCache]: Analyzing trace with hash 1286120846, now seen corresponding path program 1 times [2025-03-03 15:05:06,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:05:06,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987112949] [2025-03-03 15:05:06,059 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:05:06,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:05:06,068 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-03 15:05:06,083 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-03 15:05:06,084 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:05:06,084 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:05:06,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:05:06,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:05:06,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987112949] [2025-03-03 15:05:06,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1987112949] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:05:06,182 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:05:06,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 15:05:06,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1920366421] [2025-03-03 15:05:06,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:05:06,182 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:05:06,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:05:06,183 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:05:06,183 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:05:06,183 INFO L87 Difference]: Start difference. First operand 390 states and 597 transitions. Second operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:05:06,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:05:06,245 INFO L93 Difference]: Finished difference Result 1348 states and 2080 transitions. [2025-03-03 15:05:06,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 15:05:06,248 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2025-03-03 15:05:06,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:05:06,254 INFO L225 Difference]: With dead ends: 1348 [2025-03-03 15:05:06,254 INFO L226 Difference]: Without dead ends: 978 [2025-03-03 15:05:06,256 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:05:06,256 INFO L435 NwaCegarLoop]: 186 mSDtfsCounter, 275 mSDsluCounter, 219 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 275 SdHoareTripleChecker+Valid, 405 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:05:06,256 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [275 Valid, 405 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:05:06,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 978 states. [2025-03-03 15:05:06,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 978 to 974. [2025-03-03 15:05:06,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 974 states, 973 states have (on average 1.5344295991778005) internal successors, (1493), 973 states have internal predecessors, (1493), 0 states have call successors, (0), 0 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:05:06,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 974 states to 974 states and 1493 transitions. [2025-03-03 15:05:06,314 INFO L78 Accepts]: Start accepts. Automaton has 974 states and 1493 transitions. Word has length 41 [2025-03-03 15:05:06,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:05:06,315 INFO L471 AbstractCegarLoop]: Abstraction has 974 states and 1493 transitions. [2025-03-03 15:05:06,315 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:05:06,316 INFO L276 IsEmpty]: Start isEmpty. Operand 974 states and 1493 transitions. [2025-03-03 15:05:06,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-03-03 15:05:06,318 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:05:06,318 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:05:06,318 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 15:05:06,318 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:05:06,319 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:05:06,320 INFO L85 PathProgramCache]: Analyzing trace with hash 158631239, now seen corresponding path program 1 times [2025-03-03 15:05:06,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:05:06,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2128467439] [2025-03-03 15:05:06,320 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:05:06,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:05:06,333 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-03 15:05:06,343 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-03 15:05:06,344 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:05:06,344 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:05:06,380 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:05:06,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:05:06,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2128467439] [2025-03-03 15:05:06,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2128467439] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:05:06,380 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:05:06,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:05:06,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1887951642] [2025-03-03 15:05:06,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:05:06,381 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:05:06,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:05:06,381 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:05:06,381 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:05:06,381 INFO L87 Difference]: Start difference. First operand 974 states and 1493 transitions. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:05:06,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:05:06,406 INFO L93 Difference]: Finished difference Result 2490 states and 3807 transitions. [2025-03-03 15:05:06,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:05:06,406 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2025-03-03 15:05:06,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:05:06,412 INFO L225 Difference]: With dead ends: 2490 [2025-03-03 15:05:06,412 INFO L226 Difference]: Without dead ends: 1536 [2025-03-03 15:05:06,413 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:05:06,414 INFO L435 NwaCegarLoop]: 189 mSDtfsCounter, 86 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 275 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:05:06,414 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 275 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:05:06,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1536 states. [2025-03-03 15:05:06,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1536 to 1534. [2025-03-03 15:05:06,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1534 states, 1533 states have (on average 1.5061969993476843) internal successors, (2309), 1533 states have internal predecessors, (2309), 0 states have call successors, (0), 0 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:05:06,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1534 states to 1534 states and 2309 transitions. [2025-03-03 15:05:06,449 INFO L78 Accepts]: Start accepts. Automaton has 1534 states and 2309 transitions. Word has length 42 [2025-03-03 15:05:06,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:05:06,449 INFO L471 AbstractCegarLoop]: Abstraction has 1534 states and 2309 transitions. [2025-03-03 15:05:06,449 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:05:06,450 INFO L276 IsEmpty]: Start isEmpty. Operand 1534 states and 2309 transitions. [2025-03-03 15:05:06,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-03-03 15:05:06,450 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:05:06,450 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] [2025-03-03 15:05:06,450 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 15:05:06,451 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:05:06,451 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:05:06,451 INFO L85 PathProgramCache]: Analyzing trace with hash -984926864, now seen corresponding path program 1 times [2025-03-03 15:05:06,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:05:06,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1589381313] [2025-03-03 15:05:06,451 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:05:06,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:05:06,460 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-03 15:05:06,473 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-03 15:05:06,475 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:05:06,475 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:05:06,680 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:05:06,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:05:06,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1589381313] [2025-03-03 15:05:06,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1589381313] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:05:06,681 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:05:06,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 15:05:06,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1551444715] [2025-03-03 15:05:06,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:05:06,681 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:05:06,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:05:06,681 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:05:06,682 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:05:06,682 INFO L87 Difference]: Start difference. First operand 1534 states and 2309 transitions. Second operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 0 states have call successors, (0), 0 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:05:06,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:05:06,708 INFO L93 Difference]: Finished difference Result 1632 states and 2454 transitions. [2025-03-03 15:05:06,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 15:05:06,709 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 0 states have call successors, (0), 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 43 [2025-03-03 15:05:06,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:05:06,714 INFO L225 Difference]: With dead ends: 1632 [2025-03-03 15:05:06,714 INFO L226 Difference]: Without dead ends: 1630 [2025-03-03 15:05:06,714 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:05:06,715 INFO L435 NwaCegarLoop]: 118 mSDtfsCounter, 0 mSDsluCounter, 344 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 462 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:05:06,715 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 462 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:05:06,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1630 states. [2025-03-03 15:05:06,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1630 to 1630. [2025-03-03 15:05:06,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1630 states, 1629 states have (on average 1.476365868631062) internal successors, (2405), 1629 states have internal predecessors, (2405), 0 states have call successors, (0), 0 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:05:06,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1630 states to 1630 states and 2405 transitions. [2025-03-03 15:05:06,748 INFO L78 Accepts]: Start accepts. Automaton has 1630 states and 2405 transitions. Word has length 43 [2025-03-03 15:05:06,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:05:06,748 INFO L471 AbstractCegarLoop]: Abstraction has 1630 states and 2405 transitions. [2025-03-03 15:05:06,749 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 0 states have call successors, (0), 0 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:05:06,749 INFO L276 IsEmpty]: Start isEmpty. Operand 1630 states and 2405 transitions. [2025-03-03 15:05:06,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-03-03 15:05:06,749 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:05:06,751 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] [2025-03-03 15:05:06,751 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 15:05:06,752 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:05:06,752 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:05:06,752 INFO L85 PathProgramCache]: Analyzing trace with hash -463193159, now seen corresponding path program 1 times [2025-03-03 15:05:06,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:05:06,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1125341842] [2025-03-03 15:05:06,752 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:05:06,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:05:06,765 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-03 15:05:06,775 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-03 15:05:06,775 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:05:06,775 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:05:06,822 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:05:06,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:05:06,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1125341842] [2025-03-03 15:05:06,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1125341842] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:05:06,822 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:05:06,822 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:05:06,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1930134520] [2025-03-03 15:05:06,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:05:06,822 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:05:06,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:05:06,823 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:05:06,823 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:05:06,823 INFO L87 Difference]: Start difference. First operand 1630 states and 2405 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 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:05:06,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:05:06,855 INFO L93 Difference]: Finished difference Result 3952 states and 5841 transitions. [2025-03-03 15:05:06,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:05:06,855 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 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 44 [2025-03-03 15:05:06,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:05:06,862 INFO L225 Difference]: With dead ends: 3952 [2025-03-03 15:05:06,862 INFO L226 Difference]: Without dead ends: 2342 [2025-03-03 15:05:06,866 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:05:06,867 INFO L435 NwaCegarLoop]: 120 mSDtfsCounter, 68 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 216 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:05:06,867 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 216 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:05:06,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2342 states. [2025-03-03 15:05:06,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2342 to 2320. [2025-03-03 15:05:06,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2320 states, 2319 states have (on average 1.4639931004743423) internal successors, (3395), 2319 states have internal predecessors, (3395), 0 states have call successors, (0), 0 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:05:06,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2320 states to 2320 states and 3395 transitions. [2025-03-03 15:05:06,909 INFO L78 Accepts]: Start accepts. Automaton has 2320 states and 3395 transitions. Word has length 44 [2025-03-03 15:05:06,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:05:06,909 INFO L471 AbstractCegarLoop]: Abstraction has 2320 states and 3395 transitions. [2025-03-03 15:05:06,909 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 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:05:06,909 INFO L276 IsEmpty]: Start isEmpty. Operand 2320 states and 3395 transitions. [2025-03-03 15:05:06,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-03-03 15:05:06,911 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:05:06,911 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:05:06,911 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 15:05:06,911 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:05:06,911 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:05:06,912 INFO L85 PathProgramCache]: Analyzing trace with hash 1185335861, now seen corresponding path program 1 times [2025-03-03 15:05:06,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:05:06,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549911330] [2025-03-03 15:05:06,912 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:05:06,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:05:06,922 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-03 15:05:06,950 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-03 15:05:06,950 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:05:06,950 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:05:07,244 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:05:07,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:05:07,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549911330] [2025-03-03 15:05:07,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [549911330] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 15:05:07,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1996569479] [2025-03-03 15:05:07,245 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:05:07,245 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 15:05:07,245 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 15:05:07,247 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:05:07,248 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:05:07,298 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-03 15:05:07,334 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-03 15:05:07,334 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:05:07,334 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:05:07,336 INFO L256 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-03-03 15:05:07,349 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 15:05:07,954 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:05:07,954 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 15:05:08,517 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:05:08,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1996569479] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 15:05:08,518 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 15:05:08,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11, 9] total 26 [2025-03-03 15:05:08,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89343173] [2025-03-03 15:05:08,519 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 15:05:08,519 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-03-03 15:05:08,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:05:08,520 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-03-03 15:05:08,521 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=524, Unknown=0, NotChecked=0, Total=650 [2025-03-03 15:05:08,521 INFO L87 Difference]: Start difference. First operand 2320 states and 3395 transitions. Second operand has 26 states, 26 states have (on average 6.923076923076923) internal successors, (180), 26 states have internal predecessors, (180), 0 states have call successors, (0), 0 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:05:13,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:05:13,173 INFO L93 Difference]: Finished difference Result 14880 states and 21687 transitions. [2025-03-03 15:05:13,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2025-03-03 15:05:13,173 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 6.923076923076923) internal successors, (180), 26 states have internal predecessors, (180), 0 states have call successors, (0), 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:05:13,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:05:13,207 INFO L225 Difference]: With dead ends: 14880 [2025-03-03 15:05:13,208 INFO L226 Difference]: Without dead ends: 12582 [2025-03-03 15:05:13,216 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 238 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6346 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=3216, Invalid=13554, Unknown=0, NotChecked=0, Total=16770 [2025-03-03 15:05:13,216 INFO L435 NwaCegarLoop]: 129 mSDtfsCounter, 7159 mSDsluCounter, 1493 mSDsCounter, 0 mSdLazyCounter, 2018 mSolverCounterSat, 210 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7159 SdHoareTripleChecker+Valid, 1622 SdHoareTripleChecker+Invalid, 2228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 210 IncrementalHoareTripleChecker+Valid, 2018 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-03 15:05:13,216 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7159 Valid, 1622 Invalid, 2228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [210 Valid, 2018 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-03 15:05:13,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12582 states. [2025-03-03 15:05:13,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12582 to 10260. [2025-03-03 15:05:13,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10260 states, 10259 states have (on average 1.43815186665367) internal successors, (14754), 10259 states have internal predecessors, (14754), 0 states have call successors, (0), 0 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:05:13,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10260 states to 10260 states and 14754 transitions. [2025-03-03 15:05:13,428 INFO L78 Accepts]: Start accepts. Automaton has 10260 states and 14754 transitions. Word has length 63 [2025-03-03 15:05:13,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:05:13,429 INFO L471 AbstractCegarLoop]: Abstraction has 10260 states and 14754 transitions. [2025-03-03 15:05:13,429 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 6.923076923076923) internal successors, (180), 26 states have internal predecessors, (180), 0 states have call successors, (0), 0 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:05:13,429 INFO L276 IsEmpty]: Start isEmpty. Operand 10260 states and 14754 transitions. [2025-03-03 15:05:13,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-03-03 15:05:13,431 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:05:13,431 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:05:13,438 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:05:13,631 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 15:05:13,631 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:05:13,632 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:05:13,632 INFO L85 PathProgramCache]: Analyzing trace with hash 659118657, now seen corresponding path program 1 times [2025-03-03 15:05:13,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:05:13,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [60582602] [2025-03-03 15:05:13,632 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:05:13,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:05:13,643 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-03 15:05:13,653 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-03 15:05:13,653 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:05:13,653 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:05:13,692 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:05:13,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:05:13,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [60582602] [2025-03-03 15:05:13,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [60582602] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:05:13,692 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:05:13,692 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:05:13,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [935149250] [2025-03-03 15:05:13,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:05:13,693 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:05:13,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:05:13,693 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:05:13,693 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:05:13,693 INFO L87 Difference]: Start difference. First operand 10260 states and 14754 transitions. Second operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:05:13,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:05:13,745 INFO L93 Difference]: Finished difference Result 23535 states and 33741 transitions. [2025-03-03 15:05:13,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:05:13,747 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2025-03-03 15:05:13,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:05:13,790 INFO L225 Difference]: With dead ends: 23535 [2025-03-03 15:05:13,790 INFO L226 Difference]: Without dead ends: 16231 [2025-03-03 15:05:13,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:05:13,803 INFO L435 NwaCegarLoop]: 122 mSDtfsCounter, 64 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 228 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:05:13,803 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 228 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:05:13,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16231 states. [2025-03-03 15:05:14,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16231 to 16229. [2025-03-03 15:05:14,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16229 states, 16228 states have (on average 1.4163790978555584) internal successors, (22985), 16228 states have internal predecessors, (22985), 0 states have call successors, (0), 0 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:05:14,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16229 states to 16229 states and 22985 transitions. [2025-03-03 15:05:14,049 INFO L78 Accepts]: Start accepts. Automaton has 16229 states and 22985 transitions. Word has length 64 [2025-03-03 15:05:14,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:05:14,049 INFO L471 AbstractCegarLoop]: Abstraction has 16229 states and 22985 transitions. [2025-03-03 15:05:14,049 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:05:14,049 INFO L276 IsEmpty]: Start isEmpty. Operand 16229 states and 22985 transitions. [2025-03-03 15:05:14,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-03-03 15:05:14,052 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:05:14,052 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:05:14,052 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 15:05:14,052 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:05:14,052 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:05:14,052 INFO L85 PathProgramCache]: Analyzing trace with hash 2076036191, now seen corresponding path program 1 times [2025-03-03 15:05:14,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:05:14,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1060340778] [2025-03-03 15:05:14,052 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:05:14,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:05:14,063 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-03 15:05:14,068 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-03 15:05:14,068 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:05:14,068 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:05:14,128 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-03 15:05:14,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:05:14,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1060340778] [2025-03-03 15:05:14,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1060340778] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:05:14,128 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:05:14,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 15:05:14,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1820857721] [2025-03-03 15:05:14,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:05:14,129 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:05:14,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:05:14,129 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:05:14,129 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:05:14,129 INFO L87 Difference]: Start difference. First operand 16229 states and 22985 transitions. Second operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:05:14,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:05:14,276 INFO L93 Difference]: Finished difference Result 32606 states and 46559 transitions. [2025-03-03 15:05:14,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 15:05:14,277 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2025-03-03 15:05:14,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:05:14,320 INFO L225 Difference]: With dead ends: 32606 [2025-03-03 15:05:14,320 INFO L226 Difference]: Without dead ends: 26048 [2025-03-03 15:05:14,334 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-03 15:05:14,334 INFO L435 NwaCegarLoop]: 221 mSDtfsCounter, 348 mSDsluCounter, 384 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 348 SdHoareTripleChecker+Valid, 605 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:05:14,335 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [348 Valid, 605 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:05:14,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26048 states. [2025-03-03 15:05:14,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26048 to 22574. [2025-03-03 15:05:14,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22574 states, 22573 states have (on average 1.4124396402782085) internal successors, (31883), 22573 states have internal predecessors, (31883), 0 states have call successors, (0), 0 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:05:14,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22574 states to 22574 states and 31883 transitions. [2025-03-03 15:05:14,757 INFO L78 Accepts]: Start accepts. Automaton has 22574 states and 31883 transitions. Word has length 64 [2025-03-03 15:05:14,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:05:14,757 INFO L471 AbstractCegarLoop]: Abstraction has 22574 states and 31883 transitions. [2025-03-03 15:05:14,757 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:05:14,757 INFO L276 IsEmpty]: Start isEmpty. Operand 22574 states and 31883 transitions. [2025-03-03 15:05:14,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-03-03 15:05:14,759 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:05:14,759 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:05:14,760 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 15:05:14,760 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:05:14,761 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:05:14,761 INFO L85 PathProgramCache]: Analyzing trace with hash 1474009977, now seen corresponding path program 1 times [2025-03-03 15:05:14,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:05:14,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419795572] [2025-03-03 15:05:14,762 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:05:14,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:05:14,773 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-03 15:05:14,785 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-03 15:05:14,785 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:05:14,785 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:05:14,814 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:05:14,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:05:14,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [419795572] [2025-03-03 15:05:14,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [419795572] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:05:14,814 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:05:14,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:05:14,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236389762] [2025-03-03 15:05:14,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:05:14,814 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:05:14,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:05:14,815 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:05:14,815 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:05:14,815 INFO L87 Difference]: Start difference. First operand 22574 states and 31883 transitions. Second operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:05:14,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:05:14,885 INFO L93 Difference]: Finished difference Result 36997 states and 52141 transitions. [2025-03-03 15:05:14,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:05:14,885 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2025-03-03 15:05:14,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:05:14,924 INFO L225 Difference]: With dead ends: 36997 [2025-03-03 15:05:14,924 INFO L226 Difference]: Without dead ends: 22755 [2025-03-03 15:05:14,940 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:05:14,941 INFO L435 NwaCegarLoop]: 171 mSDtfsCounter, 68 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 277 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:05:14,942 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 277 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:05:14,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22755 states. [2025-03-03 15:05:15,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22755 to 20393. [2025-03-03 15:05:15,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20393 states, 20392 states have (on average 1.3891722244017262) internal successors, (28328), 20392 states have internal predecessors, (28328), 0 states have call successors, (0), 0 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:05:15,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20393 states to 20393 states and 28328 transitions. [2025-03-03 15:05:15,254 INFO L78 Accepts]: Start accepts. Automaton has 20393 states and 28328 transitions. Word has length 64 [2025-03-03 15:05:15,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:05:15,254 INFO L471 AbstractCegarLoop]: Abstraction has 20393 states and 28328 transitions. [2025-03-03 15:05:15,254 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:05:15,255 INFO L276 IsEmpty]: Start isEmpty. Operand 20393 states and 28328 transitions. [2025-03-03 15:05:15,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-03-03 15:05:15,256 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:05:15,256 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:05:15,256 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-03 15:05:15,257 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:05:15,258 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:05:15,258 INFO L85 PathProgramCache]: Analyzing trace with hash 2012182625, now seen corresponding path program 1 times [2025-03-03 15:05:15,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:05:15,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385367563] [2025-03-03 15:05:15,258 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:05:15,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:05:15,271 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-03 15:05:15,279 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-03 15:05:15,279 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:05:15,279 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:05:15,343 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-03 15:05:15,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:05:15,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [385367563] [2025-03-03 15:05:15,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [385367563] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:05:15,343 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:05:15,343 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 15:05:15,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586179213] [2025-03-03 15:05:15,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:05:15,344 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:05:15,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:05:15,344 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:05:15,344 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:05:15,344 INFO L87 Difference]: Start difference. First operand 20393 states and 28328 transitions. Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 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:05:15,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:05:15,514 INFO L93 Difference]: Finished difference Result 36729 states and 51590 transitions. [2025-03-03 15:05:15,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 15:05:15,514 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 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 64 [2025-03-03 15:05:15,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:05:15,559 INFO L225 Difference]: With dead ends: 36729 [2025-03-03 15:05:15,559 INFO L226 Difference]: Without dead ends: 29562 [2025-03-03 15:05:15,572 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-03 15:05:15,573 INFO L435 NwaCegarLoop]: 217 mSDtfsCounter, 348 mSDsluCounter, 348 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 348 SdHoareTripleChecker+Valid, 565 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:05:15,573 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [348 Valid, 565 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:05:15,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29562 states. [2025-03-03 15:05:15,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29562 to 26054. [2025-03-03 15:05:15,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26054 states, 26053 states have (on average 1.3849460714696964) internal successors, (36082), 26053 states have internal predecessors, (36082), 0 states have call successors, (0), 0 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:05:15,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26054 states to 26054 states and 36082 transitions. [2025-03-03 15:05:15,896 INFO L78 Accepts]: Start accepts. Automaton has 26054 states and 36082 transitions. Word has length 64 [2025-03-03 15:05:15,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:05:15,896 INFO L471 AbstractCegarLoop]: Abstraction has 26054 states and 36082 transitions. [2025-03-03 15:05:15,896 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 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:05:15,896 INFO L276 IsEmpty]: Start isEmpty. Operand 26054 states and 36082 transitions. [2025-03-03 15:05:15,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-03-03 15:05:15,898 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:05:15,898 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:05:15,898 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-03 15:05:15,898 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:05:15,898 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:05:15,898 INFO L85 PathProgramCache]: Analyzing trace with hash -1340148121, now seen corresponding path program 1 times [2025-03-03 15:05:15,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:05:15,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1786714682] [2025-03-03 15:05:15,898 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:05:15,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:05:15,905 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-03 15:05:15,909 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-03 15:05:15,909 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:05:15,909 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:05:15,959 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-03 15:05:15,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:05:15,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1786714682] [2025-03-03 15:05:15,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1786714682] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:05:15,960 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:05:15,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 15:05:15,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [440581301] [2025-03-03 15:05:15,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:05:15,960 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:05:15,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:05:15,960 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:05:15,960 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:05:15,961 INFO L87 Difference]: Start difference. First operand 26054 states and 36082 transitions. Second operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:05:16,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:05:16,143 INFO L93 Difference]: Finished difference Result 36376 states and 50918 transitions. [2025-03-03 15:05:16,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 15:05:16,143 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2025-03-03 15:05:16,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:05:16,194 INFO L225 Difference]: With dead ends: 36376 [2025-03-03 15:05:16,194 INFO L226 Difference]: Without dead ends: 32910 [2025-03-03 15:05:16,208 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-03 15:05:16,210 INFO L435 NwaCegarLoop]: 211 mSDtfsCounter, 353 mSDsluCounter, 364 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 353 SdHoareTripleChecker+Valid, 575 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:05:16,210 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [353 Valid, 575 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:05:16,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32910 states. [2025-03-03 15:05:16,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32910 to 29412. [2025-03-03 15:05:16,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29412 states, 29411 states have (on average 1.3868960592975417) internal successors, (40790), 29411 states have internal predecessors, (40790), 0 states have call successors, (0), 0 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:05:16,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29412 states to 29412 states and 40790 transitions. [2025-03-03 15:05:16,671 INFO L78 Accepts]: Start accepts. Automaton has 29412 states and 40790 transitions. Word has length 65 [2025-03-03 15:05:16,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:05:16,671 INFO L471 AbstractCegarLoop]: Abstraction has 29412 states and 40790 transitions. [2025-03-03 15:05:16,671 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:05:16,671 INFO L276 IsEmpty]: Start isEmpty. Operand 29412 states and 40790 transitions. [2025-03-03 15:05:16,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-03-03 15:05:16,673 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:05:16,673 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:05:16,674 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-03 15:05:16,674 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:05:16,674 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:05:16,674 INFO L85 PathProgramCache]: Analyzing trace with hash -921362609, now seen corresponding path program 1 times [2025-03-03 15:05:16,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:05:16,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1403876973] [2025-03-03 15:05:16,674 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:05:16,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:05:16,683 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-03-03 15:05:16,688 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-03-03 15:05:16,688 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:05:16,688 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:05:16,715 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:05:16,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:05:16,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1403876973] [2025-03-03 15:05:16,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1403876973] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:05:16,716 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:05:16,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:05:16,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521267402] [2025-03-03 15:05:16,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:05:16,716 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:05:16,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:05:16,716 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:05:16,716 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:05:16,717 INFO L87 Difference]: Start difference. First operand 29412 states and 40790 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:05:16,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:05:16,931 INFO L93 Difference]: Finished difference Result 71917 states and 99365 transitions. [2025-03-03 15:05:16,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:05:16,933 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:05:16,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:05:16,994 INFO L225 Difference]: With dead ends: 71917 [2025-03-03 15:05:16,994 INFO L226 Difference]: Without dead ends: 44382 [2025-03-03 15:05:17,020 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:05:17,021 INFO L435 NwaCegarLoop]: 161 mSDtfsCounter, 64 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 267 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:05:17,021 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 267 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:05:17,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44382 states. [2025-03-03 15:05:17,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44382 to 42552. [2025-03-03 15:05:17,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42552 states, 42551 states have (on average 1.3662428615073676) internal successors, (58135), 42551 states have internal predecessors, (58135), 0 states have call successors, (0), 0 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:05:17,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42552 states to 42552 states and 58135 transitions. [2025-03-03 15:05:17,506 INFO L78 Accepts]: Start accepts. Automaton has 42552 states and 58135 transitions. Word has length 67 [2025-03-03 15:05:17,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:05:17,506 INFO L471 AbstractCegarLoop]: Abstraction has 42552 states and 58135 transitions. [2025-03-03 15:05:17,506 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:05:17,507 INFO L276 IsEmpty]: Start isEmpty. Operand 42552 states and 58135 transitions. [2025-03-03 15:05:17,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-03-03 15:05:17,510 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:05:17,510 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:05:17,510 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-03 15:05:17,511 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:05:17,512 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:05:17,512 INFO L85 PathProgramCache]: Analyzing trace with hash -183660597, now seen corresponding path program 1 times [2025-03-03 15:05:17,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:05:17,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1582225888] [2025-03-03 15:05:17,512 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:05:17,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:05:17,523 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-03 15:05:17,532 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-03 15:05:17,532 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:05:17,532 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:05:17,612 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:05:17,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:05:17,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1582225888] [2025-03-03 15:05:17,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1582225888] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 15:05:17,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [788009000] [2025-03-03 15:05:17,613 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:05:17,613 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 15:05:17,613 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 15:05:17,615 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:05:17,617 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:05:17,668 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-03 15:05:17,696 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-03 15:05:17,696 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:05:17,696 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:05:17,697 INFO L256 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-03 15:05:17,699 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 15:05:17,863 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:05:17,863 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 15:05:17,956 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:05:17,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [788009000] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 15:05:17,957 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 15:05:17,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2025-03-03 15:05:17,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1318234711] [2025-03-03 15:05:17,957 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 15:05:17,957 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-03 15:05:17,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:05:17,958 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-03 15:05:17,958 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2025-03-03 15:05:17,958 INFO L87 Difference]: Start difference. First operand 42552 states and 58135 transitions. Second operand has 11 states, 11 states have (on average 10.909090909090908) internal successors, (120), 10 states have internal predecessors, (120), 0 states have call successors, (0), 0 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:05:18,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:05:18,272 INFO L93 Difference]: Finished difference Result 84994 states and 116356 transitions. [2025-03-03 15:05:18,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 15:05:18,272 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 10.909090909090908) internal successors, (120), 10 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2025-03-03 15:05:18,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:05:18,373 INFO L225 Difference]: With dead ends: 84994 [2025-03-03 15:05:18,374 INFO L226 Difference]: Without dead ends: 64572 [2025-03-03 15:05:18,406 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 128 SyntacticMatches, 5 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=166, Unknown=0, NotChecked=0, Total=240 [2025-03-03 15:05:18,407 INFO L435 NwaCegarLoop]: 77 mSDtfsCounter, 1170 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 205 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1170 SdHoareTripleChecker+Valid, 252 SdHoareTripleChecker+Invalid, 223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:05:18,408 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1170 Valid, 252 Invalid, 223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 205 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 15:05:18,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64572 states. [2025-03-03 15:05:19,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64572 to 50490. [2025-03-03 15:05:19,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50490 states, 50489 states have (on average 1.3624551882588287) internal successors, (68789), 50489 states have internal predecessors, (68789), 0 states have call successors, (0), 0 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:05:19,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50490 states to 50490 states and 68789 transitions. [2025-03-03 15:05:19,428 INFO L78 Accepts]: Start accepts. Automaton has 50490 states and 68789 transitions. Word has length 69 [2025-03-03 15:05:19,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:05:19,428 INFO L471 AbstractCegarLoop]: Abstraction has 50490 states and 68789 transitions. [2025-03-03 15:05:19,428 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.909090909090908) internal successors, (120), 10 states have internal predecessors, (120), 0 states have call successors, (0), 0 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:05:19,429 INFO L276 IsEmpty]: Start isEmpty. Operand 50490 states and 68789 transitions. [2025-03-03 15:05:19,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-03-03 15:05:19,435 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:05:19,436 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:05:19,449 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:05:19,636 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,SelfDestructingSolverStorable14 [2025-03-03 15:05:19,637 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:05:19,638 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:05:19,638 INFO L85 PathProgramCache]: Analyzing trace with hash -630074835, now seen corresponding path program 1 times [2025-03-03 15:05:19,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:05:19,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [34045076] [2025-03-03 15:05:19,639 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:05:19,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:05:19,655 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-03 15:05:19,667 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-03 15:05:19,667 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:05:19,667 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:05:19,759 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:05:19,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:05:19,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [34045076] [2025-03-03 15:05:19,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [34045076] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 15:05:19,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1186775145] [2025-03-03 15:05:19,760 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:05:19,760 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 15:05:19,760 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 15:05:19,762 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:05:19,764 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:05:19,810 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-03 15:05:19,834 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-03 15:05:19,834 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:05:19,834 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:05:19,835 INFO L256 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-03 15:05:19,837 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 15:05:19,978 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:05:19,978 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 15:05:20,045 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:05:20,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1186775145] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 15:05:20,046 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 15:05:20,046 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2025-03-03 15:05:20,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1119606256] [2025-03-03 15:05:20,046 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 15:05:20,046 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-03 15:05:20,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:05:20,047 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-03 15:05:20,047 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2025-03-03 15:05:20,047 INFO L87 Difference]: Start difference. First operand 50490 states and 68789 transitions. Second operand has 11 states, 11 states have (on average 10.636363636363637) internal successors, (117), 10 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:05:20,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:05:20,388 INFO L93 Difference]: Finished difference Result 107464 states and 146118 transitions. [2025-03-03 15:05:20,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 15:05:20,388 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 10.636363636363637) internal successors, (117), 10 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2025-03-03 15:05:20,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:05:20,454 INFO L225 Difference]: With dead ends: 107464 [2025-03-03 15:05:20,454 INFO L226 Difference]: Without dead ends: 58253 [2025-03-03 15:05:20,490 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 128 SyntacticMatches, 5 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2025-03-03 15:05:20,491 INFO L435 NwaCegarLoop]: 79 mSDtfsCounter, 964 mSDsluCounter, 300 mSDsCounter, 0 mSdLazyCounter, 260 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 964 SdHoareTripleChecker+Valid, 379 SdHoareTripleChecker+Invalid, 271 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 260 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:05:20,491 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [964 Valid, 379 Invalid, 271 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 260 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 15:05:20,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58253 states. [2025-03-03 15:05:20,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58253 to 51478. [2025-03-03 15:05:20,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51478 states, 51477 states have (on average 1.3557899644501428) internal successors, (69792), 51477 states have internal predecessors, (69792), 0 states have call successors, (0), 0 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:05:21,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51478 states to 51478 states and 69792 transitions. [2025-03-03 15:05:21,040 INFO L78 Accepts]: Start accepts. Automaton has 51478 states and 69792 transitions. Word has length 69 [2025-03-03 15:05:21,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:05:21,040 INFO L471 AbstractCegarLoop]: Abstraction has 51478 states and 69792 transitions. [2025-03-03 15:05:21,040 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.636363636363637) internal successors, (117), 10 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:05:21,040 INFO L276 IsEmpty]: Start isEmpty. Operand 51478 states and 69792 transitions. [2025-03-03 15:05:21,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-03-03 15:05:21,042 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:05:21,042 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:05:21,048 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-03 15:05:21,242 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 15:05:21,243 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:05:21,243 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:05:21,243 INFO L85 PathProgramCache]: Analyzing trace with hash 536545247, now seen corresponding path program 1 times [2025-03-03 15:05:21,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:05:21,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [742735543] [2025-03-03 15:05:21,243 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:05:21,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:05:21,250 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-03 15:05:21,256 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-03 15:05:21,256 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:05:21,256 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:05:21,314 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:05:21,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:05:21,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [742735543] [2025-03-03 15:05:21,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [742735543] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 15:05:21,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1522493474] [2025-03-03 15:05:21,315 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:05:21,315 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 15:05:21,315 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 15:05:21,317 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 15:05:21,319 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-03 15:05:21,364 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-03 15:05:21,393 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-03 15:05:21,394 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:05:21,394 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:05:21,395 INFO L256 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-03 15:05:21,399 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 15:05:21,534 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:05:21,536 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 15:05:21,608 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:05:21,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1522493474] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 15:05:21,609 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 15:05:21,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2025-03-03 15:05:21,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28008132] [2025-03-03 15:05:21,609 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 15:05:21,609 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-03 15:05:21,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:05:21,610 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-03 15:05:21,610 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2025-03-03 15:05:21,610 INFO L87 Difference]: Start difference. First operand 51478 states and 69792 transitions. Second operand has 11 states, 11 states have (on average 10.818181818181818) internal successors, (119), 10 states have internal predecessors, (119), 0 states have call successors, (0), 0 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:05:22,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:05:22,113 INFO L93 Difference]: Finished difference Result 138400 states and 188664 transitions. [2025-03-03 15:05:22,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 15:05:22,114 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 10.818181818181818) internal successors, (119), 10 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 70 [2025-03-03 15:05:22,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:05:22,230 INFO L225 Difference]: With dead ends: 138400 [2025-03-03 15:05:22,230 INFO L226 Difference]: Without dead ends: 91315 [2025-03-03 15:05:22,269 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 130 SyntacticMatches, 5 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=166, Unknown=0, NotChecked=0, Total=240 [2025-03-03 15:05:22,269 INFO L435 NwaCegarLoop]: 72 mSDtfsCounter, 1218 mSDsluCounter, 250 mSDsCounter, 0 mSdLazyCounter, 242 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1218 SdHoareTripleChecker+Valid, 322 SdHoareTripleChecker+Invalid, 264 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 242 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:05:22,270 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1218 Valid, 322 Invalid, 264 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 242 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 15:05:22,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91315 states. [2025-03-03 15:05:23,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91315 to 59739. [2025-03-03 15:05:23,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59739 states, 59738 states have (on average 1.3581472429609294) internal successors, (81133), 59738 states have internal predecessors, (81133), 0 states have call successors, (0), 0 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:05:23,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59739 states to 59739 states and 81133 transitions. [2025-03-03 15:05:23,212 INFO L78 Accepts]: Start accepts. Automaton has 59739 states and 81133 transitions. Word has length 70 [2025-03-03 15:05:23,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:05:23,212 INFO L471 AbstractCegarLoop]: Abstraction has 59739 states and 81133 transitions. [2025-03-03 15:05:23,212 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.818181818181818) internal successors, (119), 10 states have internal predecessors, (119), 0 states have call successors, (0), 0 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:05:23,212 INFO L276 IsEmpty]: Start isEmpty. Operand 59739 states and 81133 transitions. [2025-03-03 15:05:23,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-03-03 15:05:23,215 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:05:23,215 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:05:23,221 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-03 15:05:23,415 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-03-03 15:05:23,415 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:05:23,416 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:05:23,416 INFO L85 PathProgramCache]: Analyzing trace with hash 1173042191, now seen corresponding path program 1 times [2025-03-03 15:05:23,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:05:23,416 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246165377] [2025-03-03 15:05:23,416 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:05:23,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:05:23,425 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-03 15:05:23,444 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-03 15:05:23,444 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:05:23,444 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:05:23,642 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:05:23,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:05:23,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1246165377] [2025-03-03 15:05:23,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1246165377] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 15:05:23,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1191924992] [2025-03-03 15:05:23,642 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:05:23,643 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 15:05:23,643 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 15:05:23,645 INFO L229 MonitoredProcess]: Starting monitored process 6 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:05:23,646 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-03 15:05:23,693 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-03 15:05:23,721 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-03 15:05:23,722 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:05:23,722 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:05:23,723 INFO L256 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-03 15:05:23,724 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 15:05:24,014 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:05:24,014 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 15:05:24,528 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:05:24,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1191924992] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 15:05:24,528 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 15:05:24,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 20 [2025-03-03 15:05:24,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715436695] [2025-03-03 15:05:24,528 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 15:05:24,528 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-03 15:05:24,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:05:24,529 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-03 15:05:24,529 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=347, Unknown=0, NotChecked=0, Total=420 [2025-03-03 15:05:24,530 INFO L87 Difference]: Start difference. First operand 59739 states and 81133 transitions. Second operand has 21 states, 21 states have (on average 7.9523809523809526) internal successors, (167), 20 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:05:25,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:05:25,804 INFO L93 Difference]: Finished difference Result 277817 states and 376350 transitions. [2025-03-03 15:05:25,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-03-03 15:05:25,805 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 7.9523809523809526) internal successors, (167), 20 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) Word has length 71 [2025-03-03 15:05:25,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:05:26,121 INFO L225 Difference]: With dead ends: 277817 [2025-03-03 15:05:26,121 INFO L226 Difference]: Without dead ends: 218215 [2025-03-03 15:05:26,167 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 357 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=449, Invalid=1357, Unknown=0, NotChecked=0, Total=1806 [2025-03-03 15:05:26,167 INFO L435 NwaCegarLoop]: 133 mSDtfsCounter, 1728 mSDsluCounter, 1075 mSDsCounter, 0 mSdLazyCounter, 1143 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1728 SdHoareTripleChecker+Valid, 1208 SdHoareTripleChecker+Invalid, 1172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 1143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 15:05:26,167 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1728 Valid, 1208 Invalid, 1172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 1143 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 15:05:26,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218215 states. [2025-03-03 15:05:27,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218215 to 133085. [2025-03-03 15:05:27,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133085 states, 133084 states have (on average 1.3479456583811729) internal successors, (179390), 133084 states have internal predecessors, (179390), 0 states have call successors, (0), 0 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:05:28,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133085 states to 133085 states and 179390 transitions. [2025-03-03 15:05:28,077 INFO L78 Accepts]: Start accepts. Automaton has 133085 states and 179390 transitions. Word has length 71 [2025-03-03 15:05:28,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:05:28,077 INFO L471 AbstractCegarLoop]: Abstraction has 133085 states and 179390 transitions. [2025-03-03 15:05:28,077 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 7.9523809523809526) internal successors, (167), 20 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:05:28,077 INFO L276 IsEmpty]: Start isEmpty. Operand 133085 states and 179390 transitions. [2025-03-03 15:05:28,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-03-03 15:05:28,081 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:05:28,081 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:05:28,087 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-03 15:05:28,281 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-03-03 15:05:28,282 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:05:28,282 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:05:28,282 INFO L85 PathProgramCache]: Analyzing trace with hash 571015977, now seen corresponding path program 1 times [2025-03-03 15:05:28,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:05:28,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1510539390] [2025-03-03 15:05:28,282 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:05:28,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:05:28,289 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-03 15:05:28,304 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-03 15:05:28,304 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:05:28,304 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:05:28,724 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:05:28,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:05:28,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1510539390] [2025-03-03 15:05:28,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1510539390] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 15:05:28,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [457573111] [2025-03-03 15:05:28,725 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:05:28,725 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 15:05:28,726 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 15:05:28,727 INFO L229 MonitoredProcess]: Starting monitored process 7 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:05:28,729 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-03 15:05:28,791 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-03 15:05:28,821 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-03 15:05:28,821 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:05:28,821 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:05:28,823 INFO L256 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-03 15:05:28,825 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 15:05:29,130 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:05:29,130 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 15:05:29,472 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:05:29,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [457573111] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 15:05:29,472 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 15:05:29,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 20 [2025-03-03 15:05:29,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [733727494] [2025-03-03 15:05:29,473 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 15:05:29,473 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-03 15:05:29,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:05:29,474 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-03 15:05:29,474 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=350, Unknown=0, NotChecked=0, Total=420 [2025-03-03 15:05:29,474 INFO L87 Difference]: Start difference. First operand 133085 states and 179390 transitions. Second operand has 21 states, 21 states have (on average 7.285714285714286) internal successors, (153), 20 states have internal predecessors, (153), 0 states have call successors, (0), 0 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:05:31,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:05:31,868 INFO L93 Difference]: Finished difference Result 633363 states and 852797 transitions. [2025-03-03 15:05:31,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-03-03 15:05:31,868 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 7.285714285714286) internal successors, (153), 20 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 71 [2025-03-03 15:05:31,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:05:32,637 INFO L225 Difference]: With dead ends: 633363 [2025-03-03 15:05:32,637 INFO L226 Difference]: Without dead ends: 500289 [2025-03-03 15:05:32,724 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 317 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=428, Invalid=1294, Unknown=0, NotChecked=0, Total=1722 [2025-03-03 15:05:32,724 INFO L435 NwaCegarLoop]: 192 mSDtfsCounter, 1692 mSDsluCounter, 1323 mSDsCounter, 0 mSdLazyCounter, 1355 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1692 SdHoareTripleChecker+Valid, 1515 SdHoareTripleChecker+Invalid, 1380 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 1355 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 15:05:32,728 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1692 Valid, 1515 Invalid, 1380 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 1355 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 15:05:33,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 500289 states. [2025-03-03 15:05:36,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 500289 to 286355. [2025-03-03 15:05:37,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 286355 states, 286354 states have (on average 1.3365868819712663) internal successors, (382737), 286354 states have internal predecessors, (382737), 0 states have call successors, (0), 0 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:05:37,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286355 states to 286355 states and 382737 transitions. [2025-03-03 15:05:37,644 INFO L78 Accepts]: Start accepts. Automaton has 286355 states and 382737 transitions. Word has length 71 [2025-03-03 15:05:37,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:05:37,644 INFO L471 AbstractCegarLoop]: Abstraction has 286355 states and 382737 transitions. [2025-03-03 15:05:37,644 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 7.285714285714286) internal successors, (153), 20 states have internal predecessors, (153), 0 states have call successors, (0), 0 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:05:37,644 INFO L276 IsEmpty]: Start isEmpty. Operand 286355 states and 382737 transitions. [2025-03-03 15:05:37,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-03-03 15:05:37,650 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:05:37,650 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:05:37,657 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-03 15:05:37,851 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 15:05:37,851 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:05:37,851 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:05:37,851 INFO L85 PathProgramCache]: Analyzing trace with hash 656169309, now seen corresponding path program 1 times [2025-03-03 15:05:37,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:05:37,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [473855752] [2025-03-03 15:05:37,851 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:05:37,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:05:37,860 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-03-03 15:05:37,865 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-03-03 15:05:37,866 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:05:37,866 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:05:37,887 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:05:37,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:05:37,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [473855752] [2025-03-03 15:05:37,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [473855752] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:05:37,888 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:05:37,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:05:37,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406990624] [2025-03-03 15:05:37,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:05:37,888 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:05:37,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:05:37,889 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:05:37,889 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:05:37,889 INFO L87 Difference]: Start difference. First operand 286355 states and 382737 transitions. Second operand has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:05:39,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:05:39,247 INFO L93 Difference]: Finished difference Result 379681 states and 507474 transitions. [2025-03-03 15:05:39,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:05:39,248 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 72 [2025-03-03 15:05:39,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:05:39,632 INFO L225 Difference]: With dead ends: 379681 [2025-03-03 15:05:39,632 INFO L226 Difference]: Without dead ends: 253864 [2025-03-03 15:05:39,750 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:05:39,750 INFO L435 NwaCegarLoop]: 193 mSDtfsCounter, 62 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 297 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:05:39,750 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 297 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:05:39,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253864 states. [2025-03-03 15:05:42,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253864 to 253843. [2025-03-03 15:05:42,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 253843 states, 253842 states have (on average 1.3205261540643392) internal successors, (335205), 253842 states have internal predecessors, (335205), 0 states have call successors, (0), 0 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:05:43,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253843 states to 253843 states and 335205 transitions. [2025-03-03 15:05:43,100 INFO L78 Accepts]: Start accepts. Automaton has 253843 states and 335205 transitions. Word has length 72 [2025-03-03 15:05:43,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:05:43,100 INFO L471 AbstractCegarLoop]: Abstraction has 253843 states and 335205 transitions. [2025-03-03 15:05:43,100 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:05:43,100 INFO L276 IsEmpty]: Start isEmpty. Operand 253843 states and 335205 transitions. [2025-03-03 15:05:43,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-03-03 15:05:43,107 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:05:43,107 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:05:43,108 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-03 15:05:43,108 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:05:43,108 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:05:43,108 INFO L85 PathProgramCache]: Analyzing trace with hash 1098774681, now seen corresponding path program 1 times [2025-03-03 15:05:43,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:05:43,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1498579243] [2025-03-03 15:05:43,108 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:05:43,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:05:43,130 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-03-03 15:05:43,137 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-03-03 15:05:43,137 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:05:43,137 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:05:43,167 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:05:43,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:05:43,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1498579243] [2025-03-03 15:05:43,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1498579243] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:05:43,168 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:05:43,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:05:43,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186970902] [2025-03-03 15:05:43,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:05:43,168 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:05:43,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:05:43,169 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:05:43,169 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:05:43,169 INFO L87 Difference]: Start difference. First operand 253843 states and 335205 transitions. Second operand has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:05:43,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:05:43,951 INFO L93 Difference]: Finished difference Result 310796 states and 409782 transitions. [2025-03-03 15:05:43,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:05:43,955 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 72 [2025-03-03 15:05:43,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:05:44,689 INFO L225 Difference]: With dead ends: 310796 [2025-03-03 15:05:44,689 INFO L226 Difference]: Without dead ends: 223582 [2025-03-03 15:05:44,744 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:05:44,744 INFO L435 NwaCegarLoop]: 172 mSDtfsCounter, 62 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 276 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:05:44,744 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 276 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:05:44,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223582 states. [2025-03-03 15:05:46,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223582 to 223580. [2025-03-03 15:05:46,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 223580 states, 223579 states have (on average 1.3021437612655928) internal successors, (291132), 223579 states have internal predecessors, (291132), 0 states have call successors, (0), 0 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:05:46,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223580 states to 223580 states and 291132 transitions. [2025-03-03 15:05:46,821 INFO L78 Accepts]: Start accepts. Automaton has 223580 states and 291132 transitions. Word has length 72 [2025-03-03 15:05:46,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:05:46,821 INFO L471 AbstractCegarLoop]: Abstraction has 223580 states and 291132 transitions. [2025-03-03 15:05:46,822 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:05:46,822 INFO L276 IsEmpty]: Start isEmpty. Operand 223580 states and 291132 transitions. [2025-03-03 15:05:46,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-03-03 15:05:46,827 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:05:46,827 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:05:46,827 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-03 15:05:46,829 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:05:46,830 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:05:46,830 INFO L85 PathProgramCache]: Analyzing trace with hash 1839571117, now seen corresponding path program 1 times [2025-03-03 15:05:46,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:05:46,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [131327210] [2025-03-03 15:05:46,830 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:05:46,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:05:46,836 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-03-03 15:05:46,839 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-03-03 15:05:46,840 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:05:46,840 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:05:46,852 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-03 15:05:46,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:05:46,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [131327210] [2025-03-03 15:05:46,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [131327210] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:05:46,853 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:05:46,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:05:46,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905667037] [2025-03-03 15:05:46,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:05:46,853 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:05:46,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:05:46,853 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:05:46,853 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:05:46,853 INFO L87 Difference]: Start difference. First operand 223580 states and 291132 transitions. Second operand has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:05:48,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:05:48,056 INFO L93 Difference]: Finished difference Result 402869 states and 525407 transitions. [2025-03-03 15:05:48,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:05:48,057 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 72 [2025-03-03 15:05:48,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:05:48,287 INFO L225 Difference]: With dead ends: 402869 [2025-03-03 15:05:48,287 INFO L226 Difference]: Without dead ends: 179739 [2025-03-03 15:05:48,407 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:05:48,409 INFO L435 NwaCegarLoop]: 84 mSDtfsCounter, 78 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:05:48,409 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 103 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:05:48,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179739 states. [2025-03-03 15:05:50,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179739 to 178743. [2025-03-03 15:05:50,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178743 states, 178742 states have (on average 1.2932494880889773) internal successors, (231158), 178742 states have internal predecessors, (231158), 0 states have call successors, (0), 0 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:05:50,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178743 states to 178743 states and 231158 transitions. [2025-03-03 15:05:50,553 INFO L78 Accepts]: Start accepts. Automaton has 178743 states and 231158 transitions. Word has length 72 [2025-03-03 15:05:50,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:05:50,553 INFO L471 AbstractCegarLoop]: Abstraction has 178743 states and 231158 transitions. [2025-03-03 15:05:50,553 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:05:50,553 INFO L276 IsEmpty]: Start isEmpty. Operand 178743 states and 231158 transitions. [2025-03-03 15:05:50,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-03-03 15:05:50,557 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:05:50,557 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:05:50,557 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-03 15:05:50,557 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:05:50,558 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:05:50,558 INFO L85 PathProgramCache]: Analyzing trace with hash 1383289901, now seen corresponding path program 1 times [2025-03-03 15:05:50,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:05:50,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2053825115] [2025-03-03 15:05:50,558 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:05:50,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:05:50,564 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-03-03 15:05:50,569 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-03-03 15:05:50,569 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:05:50,570 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:05:50,586 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-03 15:05:50,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:05:50,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2053825115] [2025-03-03 15:05:50,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2053825115] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:05:50,586 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:05:50,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:05:50,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904243642] [2025-03-03 15:05:50,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:05:50,587 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:05:50,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:05:50,587 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:05:50,587 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:05:50,587 INFO L87 Difference]: Start difference. First operand 178743 states and 231158 transitions. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:05:51,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:05:51,490 INFO L93 Difference]: Finished difference Result 333747 states and 432248 transitions. [2025-03-03 15:05:51,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:05:51,491 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 72 [2025-03-03 15:05:51,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:05:51,677 INFO L225 Difference]: With dead ends: 333747 [2025-03-03 15:05:51,677 INFO L226 Difference]: Without dead ends: 155646 [2025-03-03 15:05:51,753 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:05:51,754 INFO L435 NwaCegarLoop]: 90 mSDtfsCounter, 83 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:05:51,754 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 126 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:05:51,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155646 states.