./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c.v+cfa-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c.v+cfa-reducer.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4d2ad25966f5b06d930031b35708c7035a644982dad73f08910281a8c7df501a --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 15:05:24,321 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 15:05:24,384 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:24,388 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 15:05:24,391 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 15:05:24,412 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 15:05:24,414 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 15:05:24,414 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 15:05:24,414 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 15:05:24,414 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 15:05:24,415 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 15:05:24,415 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 15:05:24,415 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 15:05:24,415 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 15:05:24,415 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 15:05:24,415 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 15:05:24,416 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 15:05:24,416 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 15:05:24,416 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 15:05:24,416 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 15:05:24,416 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 15:05:24,416 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 15:05:24,416 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 15:05:24,416 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 15:05:24,416 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 15:05:24,416 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 15:05:24,417 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 15:05:24,417 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 15:05:24,417 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 15:05:24,417 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 15:05:24,417 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 15:05:24,417 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 15:05:24,417 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 15:05:24,417 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 15:05:24,418 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 15:05:24,418 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 15:05:24,418 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 15:05:24,418 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 15:05:24,418 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 15:05:24,418 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 15:05:24,418 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 15:05:24,418 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 15:05:24,418 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 15:05:24,418 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 -> 4d2ad25966f5b06d930031b35708c7035a644982dad73f08910281a8c7df501a [2025-03-03 15:05:24,637 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 15:05:24,643 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 15:05:24,644 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 15:05:24,645 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 15:05:24,646 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 15:05:24,646 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.2.ufo.BOUNDED-6.pals.c.v+cfa-reducer.c [2025-03-03 15:05:25,765 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9030ab16f/6f9f66659f784fb685e3f58fc7466dbc/FLAGc2a51de41 [2025-03-03 15:05:26,054 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 15:05:26,054 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c.v+cfa-reducer.c [2025-03-03 15:05:26,064 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9030ab16f/6f9f66659f784fb685e3f58fc7466dbc/FLAGc2a51de41 [2025-03-03 15:05:26,347 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9030ab16f/6f9f66659f784fb685e3f58fc7466dbc [2025-03-03 15:05:26,350 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 15:05:26,351 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 15:05:26,352 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 15:05:26,352 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 15:05:26,355 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 15:05:26,355 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 03:05:26" (1/1) ... [2025-03-03 15:05:26,356 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@21801b7b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:05:26, skipping insertion in model container [2025-03-03 15:05:26,356 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 03:05:26" (1/1) ... [2025-03-03 15:05:26,378 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 15:05:26,515 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.2.ufo.BOUNDED-6.pals.c.v+cfa-reducer.c[4373,4386] [2025-03-03 15:05:26,528 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 15:05:26,543 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 15:05:26,576 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.2.ufo.BOUNDED-6.pals.c.v+cfa-reducer.c[4373,4386] [2025-03-03 15:05:26,592 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 15:05:26,612 INFO L204 MainTranslator]: Completed translation [2025-03-03 15:05:26,613 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:05:26 WrapperNode [2025-03-03 15:05:26,613 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 15:05:26,614 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 15:05:26,614 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 15:05:26,614 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 15:05:26,619 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:26" (1/1) ... [2025-03-03 15:05:26,632 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:26" (1/1) ... [2025-03-03 15:05:26,657 INFO L138 Inliner]: procedures = 22, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 353 [2025-03-03 15:05:26,658 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 15:05:26,658 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 15:05:26,661 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 15:05:26,661 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 15:05:26,667 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:26" (1/1) ... [2025-03-03 15:05:26,667 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:26" (1/1) ... [2025-03-03 15:05:26,669 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:26" (1/1) ... [2025-03-03 15:05:26,692 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:26,692 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:26" (1/1) ... [2025-03-03 15:05:26,692 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:26" (1/1) ... [2025-03-03 15:05:26,696 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:26" (1/1) ... [2025-03-03 15:05:26,700 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:26" (1/1) ... [2025-03-03 15:05:26,701 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:26" (1/1) ... [2025-03-03 15:05:26,702 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:26" (1/1) ... [2025-03-03 15:05:26,703 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 15:05:26,708 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 15:05:26,708 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 15:05:26,708 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 15:05:26,709 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:05:26" (1/1) ... [2025-03-03 15:05:26,714 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 15:05:26,723 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 15:05:26,735 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:26,740 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:26,757 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 15:05:26,758 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 15:05:26,758 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 15:05:26,758 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 15:05:26,832 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 15:05:26,833 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 15:05:27,122 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L152: havoc main_~node2__m2~0#1; [2025-03-03 15:05:27,122 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L170: havoc main_~node3__m3~0#1; [2025-03-03 15:05:27,122 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L385: havoc main_~node2____CPAchecker_TMP_1~0#1; [2025-03-03 15:05:27,122 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L443: havoc main_~node1____CPAchecker_TMP_0~0#1; [2025-03-03 15:05:27,122 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L271: havoc main_~node3____CPAchecker_TMP_0~0#1; [2025-03-03 15:05:27,122 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L133: havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2025-03-03 15:05:27,122 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L216: havoc main_~main____CPAchecker_TMP_0~0#1;havoc main_~__tmp_1~0#1, main_~assert__arg~0#1;havoc main_~check__tmp~0#1; [2025-03-03 15:05:27,122 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L299: havoc main_~node3____CPAchecker_TMP_1~0#1; [2025-03-03 15:05:27,122 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L357: havoc main_~node2____CPAchecker_TMP_0~0#1; [2025-03-03 15:05:27,143 INFO L? ?]: Removed 35 outVars from TransFormulas that were not future-live. [2025-03-03 15:05:27,143 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 15:05:27,153 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 15:05:27,155 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 15:05:27,155 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 03:05:27 BoogieIcfgContainer [2025-03-03 15:05:27,155 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 15:05:27,157 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 15:05:27,157 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 15:05:27,161 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 15:05:27,161 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 03:05:26" (1/3) ... [2025-03-03 15:05:27,162 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40480e72 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 03:05:27, skipping insertion in model container [2025-03-03 15:05:27,162 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:05:26" (2/3) ... [2025-03-03 15:05:27,163 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40480e72 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 03:05:27, skipping insertion in model container [2025-03-03 15:05:27,163 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 03:05:27" (3/3) ... [2025-03-03 15:05:27,164 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c.v+cfa-reducer.c [2025-03-03 15:05:27,177 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 15:05:27,180 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c.v+cfa-reducer.c that has 1 procedures, 80 locations, 1 initial locations, 0 loop locations, and 1 error locations. [2025-03-03 15:05:27,220 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 15:05:27,229 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;@4db92265, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 15:05:27,229 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 15:05:27,233 INFO L276 IsEmpty]: Start isEmpty. Operand has 80 states, 78 states have (on average 1.6923076923076923) internal successors, (132), 79 states have internal predecessors, (132), 0 states have call successors, (0), 0 states 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:27,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-03-03 15:05:27,237 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:05:27,238 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] [2025-03-03 15:05:27,238 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:05:27,241 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:05:27,242 INFO L85 PathProgramCache]: Analyzing trace with hash 183013381, now seen corresponding path program 1 times [2025-03-03 15:05:27,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:05:27,247 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [945656246] [2025-03-03 15:05:27,247 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:05:27,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:05:27,315 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-03 15:05:27,355 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-03 15:05:27,356 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:05:27,356 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:05:27,512 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:27,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:05:27,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [945656246] [2025-03-03 15:05:27,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [945656246] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:05:27,514 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:05:27,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:05:27,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317727914] [2025-03-03 15:05:27,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:05:27,519 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:05:27,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:05:27,534 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:05:27,534 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:05:27,537 INFO L87 Difference]: Start difference. First operand has 80 states, 78 states have (on average 1.6923076923076923) internal successors, (132), 79 states have internal predecessors, (132), 0 states have call successors, (0), 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.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states 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:27,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:05:27,588 INFO L93 Difference]: Finished difference Result 184 states and 294 transitions. [2025-03-03 15:05:27,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:05:27,592 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 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 37 [2025-03-03 15:05:27,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:05:27,601 INFO L225 Difference]: With dead ends: 184 [2025-03-03 15:05:27,602 INFO L226 Difference]: Without dead ends: 118 [2025-03-03 15:05:27,607 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:27,610 INFO L435 NwaCegarLoop]: 172 mSDtfsCounter, 85 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 263 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:27,611 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 263 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:27,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2025-03-03 15:05:27,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 116. [2025-03-03 15:05:27,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 115 states have (on average 1.4956521739130435) internal successors, (172), 115 states have internal predecessors, (172), 0 states have call successors, (0), 0 states 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:27,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 172 transitions. [2025-03-03 15:05:27,641 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 172 transitions. Word has length 37 [2025-03-03 15:05:27,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:05:27,641 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 172 transitions. [2025-03-03 15:05:27,641 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states 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:27,641 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 172 transitions. [2025-03-03 15:05:27,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-03-03 15:05:27,642 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:05:27,642 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:27,642 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 15:05:27,643 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:05:27,643 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:05:27,643 INFO L85 PathProgramCache]: Analyzing trace with hash -1198162152, now seen corresponding path program 1 times [2025-03-03 15:05:27,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:05:27,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [26693943] [2025-03-03 15:05:27,643 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:05:27,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:05:27,667 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-03 15:05:27,681 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-03 15:05:27,682 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:05:27,682 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:05:27,773 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:27,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:05:27,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [26693943] [2025-03-03 15:05:27,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [26693943] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:05:27,774 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:05:27,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:05:27,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1339826776] [2025-03-03 15:05:27,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:05:27,775 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:05:27,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:05:27,776 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:05:27,776 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:05:27,776 INFO L87 Difference]: Start difference. First operand 116 states and 172 transitions. 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:27,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:05:27,805 INFO L93 Difference]: Finished difference Result 276 states and 424 transitions. [2025-03-03 15:05:27,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:05:27,806 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:27,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:05:27,807 INFO L225 Difference]: With dead ends: 276 [2025-03-03 15:05:27,807 INFO L226 Difference]: Without dead ends: 180 [2025-03-03 15:05:27,808 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:27,808 INFO L435 NwaCegarLoop]: 130 mSDtfsCounter, 69 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 213 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:27,809 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 213 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:27,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2025-03-03 15:05:27,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 178. [2025-03-03 15:05:27,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 177 states have (on average 1.5197740112994351) internal successors, (269), 177 states have internal predecessors, (269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:05:27,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 269 transitions. [2025-03-03 15:05:27,820 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 269 transitions. Word has length 38 [2025-03-03 15:05:27,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:05:27,820 INFO L471 AbstractCegarLoop]: Abstraction has 178 states and 269 transitions. [2025-03-03 15:05:27,821 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:27,821 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 269 transitions. [2025-03-03 15:05:27,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-03-03 15:05:27,822 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:05:27,822 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:27,822 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 15:05:27,822 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:05:27,823 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:05:27,823 INFO L85 PathProgramCache]: Analyzing trace with hash -378604481, now seen corresponding path program 1 times [2025-03-03 15:05:27,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:05:27,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1258050158] [2025-03-03 15:05:27,823 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:05:27,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:05:27,836 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-03 15:05:27,847 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-03 15:05:27,848 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:05:27,848 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:05:27,947 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:27,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:05:27,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1258050158] [2025-03-03 15:05:27,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1258050158] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:05:27,947 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:05:27,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 15:05:27,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702862518] [2025-03-03 15:05:27,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:05:27,947 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:05:27,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:05:27,948 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:05:27,948 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:05:27,948 INFO L87 Difference]: Start difference. First operand 178 states and 269 transitions. Second operand has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 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:28,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:05:28,040 INFO L93 Difference]: Finished difference Result 810 states and 1265 transitions. [2025-03-03 15:05:28,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 15:05:28,041 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 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:28,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:05:28,045 INFO L225 Difference]: With dead ends: 810 [2025-03-03 15:05:28,045 INFO L226 Difference]: Without dead ends: 652 [2025-03-03 15:05:28,046 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:28,049 INFO L435 NwaCegarLoop]: 108 mSDtfsCounter, 447 mSDsluCounter, 512 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 447 SdHoareTripleChecker+Valid, 620 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.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:05:28,050 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [447 Valid, 620 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 15:05:28,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 652 states. [2025-03-03 15:05:28,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 652 to 334. [2025-03-03 15:05:28,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 334 states, 333 states have (on average 1.5285285285285286) internal successors, (509), 333 states have internal predecessors, (509), 0 states have call successors, (0), 0 states 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,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 509 transitions. [2025-03-03 15:05:28,066 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 509 transitions. Word has length 39 [2025-03-03 15:05:28,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:05:28,067 INFO L471 AbstractCegarLoop]: Abstraction has 334 states and 509 transitions. [2025-03-03 15:05:28,067 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 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:28,067 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 509 transitions. [2025-03-03 15:05:28,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-03-03 15:05:28,068 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:05:28,068 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:28,068 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 15:05:28,068 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:05:28,068 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:05:28,068 INFO L85 PathProgramCache]: Analyzing trace with hash 1149118344, now seen corresponding path program 1 times [2025-03-03 15:05:28,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:05:28,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995689722] [2025-03-03 15:05:28,069 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:05:28,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:05:28,078 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-03 15:05:28,093 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-03 15:05:28,095 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:05:28,095 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:05:28,211 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:28,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:05:28,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [995689722] [2025-03-03 15:05:28,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [995689722] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:05:28,212 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:05:28,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 15:05:28,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049920811] [2025-03-03 15:05:28,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:05:28,212 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:05:28,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:05:28,213 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:05:28,213 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:05:28,213 INFO L87 Difference]: Start difference. First operand 334 states and 509 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:28,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:05:28,267 INFO L93 Difference]: Finished difference Result 1164 states and 1792 transitions. [2025-03-03 15:05:28,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 15:05:28,270 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:28,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:05:28,273 INFO L225 Difference]: With dead ends: 1164 [2025-03-03 15:05:28,273 INFO L226 Difference]: Without dead ends: 850 [2025-03-03 15:05:28,276 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:28,278 INFO L435 NwaCegarLoop]: 164 mSDtfsCounter, 293 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 293 SdHoareTripleChecker+Valid, 303 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:05:28,278 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [293 Valid, 303 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:05:28,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 850 states. [2025-03-03 15:05:28,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 850 to 846. [2025-03-03 15:05:28,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 846 states, 845 states have (on average 1.5301775147928993) internal successors, (1293), 845 states have internal predecessors, (1293), 0 states have call successors, (0), 0 states 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,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 846 states to 846 states and 1293 transitions. [2025-03-03 15:05:28,316 INFO L78 Accepts]: Start accepts. Automaton has 846 states and 1293 transitions. Word has length 40 [2025-03-03 15:05:28,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:05:28,316 INFO L471 AbstractCegarLoop]: Abstraction has 846 states and 1293 transitions. [2025-03-03 15:05:28,317 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:28,317 INFO L276 IsEmpty]: Start isEmpty. Operand 846 states and 1293 transitions. [2025-03-03 15:05:28,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-03-03 15:05:28,317 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:05:28,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] [2025-03-03 15:05:28,318 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 15:05:28,318 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:05:28,318 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:05:28,318 INFO L85 PathProgramCache]: Analyzing trace with hash -1470608040, now seen corresponding path program 1 times [2025-03-03 15:05:28,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:05:28,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [282847874] [2025-03-03 15:05:28,318 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:05:28,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:05:28,331 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-03 15:05:28,340 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-03 15:05:28,340 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:05:28,340 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:05:28,377 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:28,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:05:28,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [282847874] [2025-03-03 15:05:28,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [282847874] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:05:28,377 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:05:28,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:05:28,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1510403049] [2025-03-03 15:05:28,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:05:28,378 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:05:28,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:05:28,378 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:05:28,378 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:05:28,378 INFO L87 Difference]: Start difference. First operand 846 states and 1293 transitions. Second operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 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:28,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:05:28,403 INFO L93 Difference]: Finished difference Result 2234 states and 3407 transitions. [2025-03-03 15:05:28,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:05:28,404 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 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:28,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:05:28,410 INFO L225 Difference]: With dead ends: 2234 [2025-03-03 15:05:28,411 INFO L226 Difference]: Without dead ends: 1408 [2025-03-03 15:05:28,412 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:28,413 INFO L435 NwaCegarLoop]: 178 mSDtfsCounter, 78 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 261 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:28,413 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 261 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:28,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1408 states. [2025-03-03 15:05:28,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1408 to 1406. [2025-03-03 15:05:28,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1406 states, 1405 states have (on average 1.5010676156583629) internal successors, (2109), 1405 states have internal predecessors, (2109), 0 states have call successors, (0), 0 states 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,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1406 states to 1406 states and 2109 transitions. [2025-03-03 15:05:28,443 INFO L78 Accepts]: Start accepts. Automaton has 1406 states and 2109 transitions. Word has length 40 [2025-03-03 15:05:28,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:05:28,443 INFO L471 AbstractCegarLoop]: Abstraction has 1406 states and 2109 transitions. [2025-03-03 15:05:28,444 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 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:28,444 INFO L276 IsEmpty]: Start isEmpty. Operand 1406 states and 2109 transitions. [2025-03-03 15:05:28,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-03-03 15:05:28,444 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:05:28,445 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:28,445 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 15:05:28,445 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:05:28,445 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:05:28,445 INFO L85 PathProgramCache]: Analyzing trace with hash 499656874, now seen corresponding path program 1 times [2025-03-03 15:05:28,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:05:28,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001927536] [2025-03-03 15:05:28,445 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:05:28,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:05:28,454 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-03 15:05:28,464 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-03 15:05:28,464 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:05:28,465 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:05:28,684 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:28,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:05:28,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2001927536] [2025-03-03 15:05:28,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2001927536] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:05:28,684 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:05:28,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 15:05:28,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [521239180] [2025-03-03 15:05:28,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:05:28,685 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:05:28,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:05:28,685 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:05:28,685 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:05:28,685 INFO L87 Difference]: Start difference. First operand 1406 states and 2109 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 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:28,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:05:28,712 INFO L93 Difference]: Finished difference Result 1504 states and 2254 transitions. [2025-03-03 15:05:28,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 15:05:28,713 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 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:28,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:05:28,718 INFO L225 Difference]: With dead ends: 1504 [2025-03-03 15:05:28,718 INFO L226 Difference]: Without dead ends: 1502 [2025-03-03 15:05:28,718 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:28,719 INFO L435 NwaCegarLoop]: 107 mSDtfsCounter, 0 mSDsluCounter, 310 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 417 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:05:28,719 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 417 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:05:28,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1502 states. [2025-03-03 15:05:28,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1502 to 1502. [2025-03-03 15:05:28,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1502 states, 1501 states have (on average 1.469020652898068) internal successors, (2205), 1501 states have internal predecessors, (2205), 0 states have call successors, (0), 0 states 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,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1502 states to 1502 states and 2205 transitions. [2025-03-03 15:05:28,751 INFO L78 Accepts]: Start accepts. Automaton has 1502 states and 2205 transitions. Word has length 42 [2025-03-03 15:05:28,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:05:28,752 INFO L471 AbstractCegarLoop]: Abstraction has 1502 states and 2205 transitions. [2025-03-03 15:05:28,752 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 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:28,752 INFO L276 IsEmpty]: Start isEmpty. Operand 1502 states and 2205 transitions. [2025-03-03 15:05:28,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-03-03 15:05:28,753 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:05:28,753 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:28,753 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 15:05:28,753 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:05:28,753 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:05:28,753 INFO L85 PathProgramCache]: Analyzing trace with hash -1685737475, now seen corresponding path program 1 times [2025-03-03 15:05:28,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:05:28,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [331838529] [2025-03-03 15:05:28,753 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:05:28,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:05:28,764 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-03 15:05:28,772 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-03 15:05:28,772 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:05:28,772 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:05:28,800 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:28,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:05:28,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [331838529] [2025-03-03 15:05:28,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [331838529] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:05:28,801 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:05:28,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:05:28,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [724101696] [2025-03-03 15:05:28,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:05:28,801 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:05:28,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:05:28,802 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:05:28,802 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:05:28,802 INFO L87 Difference]: Start difference. First operand 1502 states and 2205 transitions. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 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:28,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:05:28,825 INFO L93 Difference]: Finished difference Result 3576 states and 5253 transitions. [2025-03-03 15:05:28,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:05:28,826 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 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:28,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:05:28,832 INFO L225 Difference]: With dead ends: 3576 [2025-03-03 15:05:28,832 INFO L226 Difference]: Without dead ends: 2094 [2025-03-03 15:05:28,834 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:28,835 INFO L435 NwaCegarLoop]: 110 mSDtfsCounter, 59 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:05:28,835 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 197 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:05:28,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2094 states. [2025-03-03 15:05:28,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2094 to 2092. [2025-03-03 15:05:28,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2092 states, 2091 states have (on average 1.4571975131516022) internal successors, (3047), 2091 states have internal predecessors, (3047), 0 states have call successors, (0), 0 states 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,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2092 states to 2092 states and 3047 transitions. [2025-03-03 15:05:28,869 INFO L78 Accepts]: Start accepts. Automaton has 2092 states and 3047 transitions. Word has length 43 [2025-03-03 15:05:28,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:05:28,869 INFO L471 AbstractCegarLoop]: Abstraction has 2092 states and 3047 transitions. [2025-03-03 15:05:28,869 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 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:28,869 INFO L276 IsEmpty]: Start isEmpty. Operand 2092 states and 3047 transitions. [2025-03-03 15:05:28,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-03-03 15:05:28,870 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:05:28,871 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] [2025-03-03 15:05:28,871 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 15:05:28,871 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:05:28,871 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:05:28,871 INFO L85 PathProgramCache]: Analyzing trace with hash -673323972, now seen corresponding path program 1 times [2025-03-03 15:05:28,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:05:28,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044979469] [2025-03-03 15:05:28,872 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:05:28,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:05:28,881 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-03-03 15:05:28,897 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-03-03 15:05:28,897 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:05:28,897 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:05:29,012 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-03 15:05:29,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:05:29,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1044979469] [2025-03-03 15:05:29,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1044979469] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 15:05:29,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [913995609] [2025-03-03 15:05:29,012 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:05:29,012 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 15:05:29,013 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 15:05:29,015 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:29,017 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:29,077 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-03-03 15:05:29,111 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-03-03 15:05:29,111 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:05:29,111 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:05:29,113 INFO L256 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-03 15:05:29,117 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 15:05:29,526 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:29,526 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 15:05:30,016 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:30,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [913995609] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 15:05:30,016 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 15:05:30,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 8, 7] total 15 [2025-03-03 15:05:30,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [537930889] [2025-03-03 15:05:30,017 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 15:05:30,017 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-03 15:05:30,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:05:30,018 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-03 15:05:30,018 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=135, Unknown=0, NotChecked=0, Total=210 [2025-03-03 15:05:30,018 INFO L87 Difference]: Start difference. First operand 2092 states and 3047 transitions. Second operand has 15 states, 15 states have (on average 11.2) internal successors, (168), 15 states have internal predecessors, (168), 0 states have call successors, (0), 0 states 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:30,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:05:30,580 INFO L93 Difference]: Finished difference Result 7387 states and 10761 transitions. [2025-03-03 15:05:30,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-03 15:05:30,580 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 11.2) internal successors, (168), 15 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2025-03-03 15:05:30,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:05:30,595 INFO L225 Difference]: With dead ends: 7387 [2025-03-03 15:05:30,595 INFO L226 Difference]: Without dead ends: 5317 [2025-03-03 15:05:30,600 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 258 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=268, Invalid=602, Unknown=0, NotChecked=0, Total=870 [2025-03-03 15:05:30,600 INFO L435 NwaCegarLoop]: 154 mSDtfsCounter, 1510 mSDsluCounter, 1193 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1510 SdHoareTripleChecker+Valid, 1347 SdHoareTripleChecker+Invalid, 214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 15:05:30,601 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1510 Valid, 1347 Invalid, 214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 15:05:30,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5317 states. [2025-03-03 15:05:30,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5317 to 5065. [2025-03-03 15:05:30,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5065 states, 5064 states have (on average 1.4381911532385465) internal successors, (7283), 5064 states have internal predecessors, (7283), 0 states have call successors, (0), 0 states 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:30,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5065 states to 5065 states and 7283 transitions. [2025-03-03 15:05:30,711 INFO L78 Accepts]: Start accepts. Automaton has 5065 states and 7283 transitions. Word has length 60 [2025-03-03 15:05:30,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:05:30,712 INFO L471 AbstractCegarLoop]: Abstraction has 5065 states and 7283 transitions. [2025-03-03 15:05:30,712 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 11.2) internal successors, (168), 15 states have internal predecessors, (168), 0 states have call successors, (0), 0 states 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:30,712 INFO L276 IsEmpty]: Start isEmpty. Operand 5065 states and 7283 transitions. [2025-03-03 15:05:30,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-03-03 15:05:30,713 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:05:30,713 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] [2025-03-03 15:05:30,721 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-03 15:05:30,914 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:30,914 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:05:30,915 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:05:30,915 INFO L85 PathProgramCache]: Analyzing trace with hash -1124761256, now seen corresponding path program 1 times [2025-03-03 15:05:30,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:05:30,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1422368091] [2025-03-03 15:05:30,915 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:05:30,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:05:30,927 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-03-03 15:05:30,936 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-03-03 15:05:30,936 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:05:30,936 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:05:30,973 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:30,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:05:30,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1422368091] [2025-03-03 15:05:30,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1422368091] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:05:30,973 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:05:30,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:05:30,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208160722] [2025-03-03 15:05:30,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:05:30,974 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:05:30,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:05:30,974 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:05:30,974 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:05:30,974 INFO L87 Difference]: Start difference. First operand 5065 states and 7283 transitions. Second operand has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:05:31,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:05:31,024 INFO L93 Difference]: Finished difference Result 11656 states and 16734 transitions. [2025-03-03 15:05:31,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:05:31,025 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61 [2025-03-03 15:05:31,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:05:31,048 INFO L225 Difference]: With dead ends: 11656 [2025-03-03 15:05:31,048 INFO L226 Difference]: Without dead ends: 8160 [2025-03-03 15:05:31,054 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:31,055 INFO L435 NwaCegarLoop]: 111 mSDtfsCounter, 56 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 214 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:31,055 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 214 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:31,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8160 states. [2025-03-03 15:05:31,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8160 to 8158. [2025-03-03 15:05:31,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8158 states, 8157 states have (on average 1.4198847615544932) internal successors, (11582), 8157 states have internal predecessors, (11582), 0 states have call successors, (0), 0 states 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,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8158 states to 8158 states and 11582 transitions. [2025-03-03 15:05:31,255 INFO L78 Accepts]: Start accepts. Automaton has 8158 states and 11582 transitions. Word has length 61 [2025-03-03 15:05:31,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:05:31,255 INFO L471 AbstractCegarLoop]: Abstraction has 8158 states and 11582 transitions. [2025-03-03 15:05:31,255 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:05:31,255 INFO L276 IsEmpty]: Start isEmpty. Operand 8158 states and 11582 transitions. [2025-03-03 15:05:31,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-03-03 15:05:31,257 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:05:31,257 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] [2025-03-03 15:05:31,257 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 15:05:31,257 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:05:31,258 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:05:31,258 INFO L85 PathProgramCache]: Analyzing trace with hash -1459473550, now seen corresponding path program 1 times [2025-03-03 15:05:31,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:05:31,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019188305] [2025-03-03 15:05:31,258 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:05:31,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:05:31,270 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-03-03 15:05:31,276 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-03-03 15:05:31,277 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:05:31,277 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:05:31,305 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:31,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:05:31,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019188305] [2025-03-03 15:05:31,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2019188305] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:05:31,306 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:05:31,306 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:05:31,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [127416082] [2025-03-03 15:05:31,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:05:31,306 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:05:31,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:05:31,307 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:05:31,307 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:05:31,307 INFO L87 Difference]: Start difference. First operand 8158 states and 11582 transitions. Second operand has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:05:31,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:05:31,370 INFO L93 Difference]: Finished difference Result 18452 states and 25993 transitions. [2025-03-03 15:05:31,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:05:31,371 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61 [2025-03-03 15:05:31,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:05:31,400 INFO L225 Difference]: With dead ends: 18452 [2025-03-03 15:05:31,401 INFO L226 Difference]: Without dead ends: 11955 [2025-03-03 15:05:31,410 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:31,411 INFO L435 NwaCegarLoop]: 132 mSDtfsCounter, 56 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 227 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:31,411 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 227 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:31,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11955 states. [2025-03-03 15:05:31,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11955 to 11671. [2025-03-03 15:05:31,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11671 states, 11670 states have (on average 1.3923736075407027) internal successors, (16249), 11670 states have internal predecessors, (16249), 0 states have call successors, (0), 0 states 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,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11671 states to 11671 states and 16249 transitions. [2025-03-03 15:05:31,624 INFO L78 Accepts]: Start accepts. Automaton has 11671 states and 16249 transitions. Word has length 61 [2025-03-03 15:05:31,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:05:31,625 INFO L471 AbstractCegarLoop]: Abstraction has 11671 states and 16249 transitions. [2025-03-03 15:05:31,625 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:05:31,625 INFO L276 IsEmpty]: Start isEmpty. Operand 11671 states and 16249 transitions. [2025-03-03 15:05:31,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-03-03 15:05:31,627 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:05:31,627 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] [2025-03-03 15:05:31,627 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 15:05:31,627 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:05:31,628 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:05:31,628 INFO L85 PathProgramCache]: Analyzing trace with hash -2061499764, now seen corresponding path program 1 times [2025-03-03 15:05:31,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:05:31,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1876124586] [2025-03-03 15:05:31,630 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:05:31,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:05:31,639 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-03-03 15:05:31,644 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-03-03 15:05:31,645 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:05:31,645 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:05:31,716 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:31,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:05:31,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1876124586] [2025-03-03 15:05:31,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1876124586] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:05:31,716 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:05:31,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 15:05:31,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1061231592] [2025-03-03 15:05:31,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:05:31,717 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:05:31,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:05:31,717 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:05:31,717 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:05:31,717 INFO L87 Difference]: Start difference. First operand 11671 states and 16249 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:05:31,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:05:31,863 INFO L93 Difference]: Finished difference Result 22952 states and 32165 transitions. [2025-03-03 15:05:31,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 15:05:31,863 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61 [2025-03-03 15:05:31,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:05:31,901 INFO L225 Difference]: With dead ends: 22952 [2025-03-03 15:05:31,901 INFO L226 Difference]: Without dead ends: 19594 [2025-03-03 15:05:31,909 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:31,910 INFO L435 NwaCegarLoop]: 188 mSDtfsCounter, 312 mSDsluCounter, 310 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 312 SdHoareTripleChecker+Valid, 498 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:05:31,910 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [312 Valid, 498 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:05:31,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19594 states. [2025-03-03 15:05:32,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19594 to 14885. [2025-03-03 15:05:32,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14885 states, 14884 states have (on average 1.3854474603601183) internal successors, (20621), 14884 states have internal predecessors, (20621), 0 states have call successors, (0), 0 states 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:32,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14885 states to 14885 states and 20621 transitions. [2025-03-03 15:05:32,182 INFO L78 Accepts]: Start accepts. Automaton has 14885 states and 20621 transitions. Word has length 61 [2025-03-03 15:05:32,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:05:32,182 INFO L471 AbstractCegarLoop]: Abstraction has 14885 states and 20621 transitions. [2025-03-03 15:05:32,182 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:05:32,182 INFO L276 IsEmpty]: Start isEmpty. Operand 14885 states and 20621 transitions. [2025-03-03 15:05:32,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-03-03 15:05:32,185 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:05:32,185 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] [2025-03-03 15:05:32,185 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-03 15:05:32,185 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:05:32,185 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:05:32,185 INFO L85 PathProgramCache]: Analyzing trace with hash -1180556170, now seen corresponding path program 1 times [2025-03-03 15:05:32,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:05:32,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [927742115] [2025-03-03 15:05:32,186 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:05:32,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:05:32,196 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-03-03 15:05:32,203 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-03-03 15:05:32,203 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:05:32,203 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:05:32,273 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:32,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:05:32,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [927742115] [2025-03-03 15:05:32,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [927742115] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:05:32,274 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:05:32,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 15:05:32,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776539194] [2025-03-03 15:05:32,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:05:32,274 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:05:32,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:05:32,274 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:05:32,275 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:05:32,275 INFO L87 Difference]: Start difference. First operand 14885 states and 20621 transitions. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:05:32,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:05:32,368 INFO L93 Difference]: Finished difference Result 27396 states and 38321 transitions. [2025-03-03 15:05:32,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 15:05:32,368 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61 [2025-03-03 15:05:32,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:05:32,408 INFO L225 Difference]: With dead ends: 27396 [2025-03-03 15:05:32,409 INFO L226 Difference]: Without dead ends: 22722 [2025-03-03 15:05:32,422 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:32,422 INFO L435 NwaCegarLoop]: 200 mSDtfsCounter, 309 mSDsluCounter, 342 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 309 SdHoareTripleChecker+Valid, 542 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:05:32,422 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [309 Valid, 542 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:05:32,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22722 states. [2025-03-03 15:05:32,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22722 to 19382. [2025-03-03 15:05:32,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19382 states, 19381 states have (on average 1.3828491821887416) internal successors, (26801), 19381 states have internal predecessors, (26801), 0 states have call successors, (0), 0 states 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:32,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19382 states to 19382 states and 26801 transitions. [2025-03-03 15:05:32,770 INFO L78 Accepts]: Start accepts. Automaton has 19382 states and 26801 transitions. Word has length 61 [2025-03-03 15:05:32,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:05:32,770 INFO L471 AbstractCegarLoop]: Abstraction has 19382 states and 26801 transitions. [2025-03-03 15:05:32,771 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:05:32,771 INFO L276 IsEmpty]: Start isEmpty. Operand 19382 states and 26801 transitions. [2025-03-03 15:05:32,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-03-03 15:05:32,772 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:05:32,773 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] [2025-03-03 15:05:32,773 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-03 15:05:32,773 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:05:32,773 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:05:32,773 INFO L85 PathProgramCache]: Analyzing trace with hash -1284343595, now seen corresponding path program 1 times [2025-03-03 15:05:32,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:05:32,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700317234] [2025-03-03 15:05:32,774 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:05:32,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:05:32,785 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-03 15:05:32,790 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-03 15:05:32,791 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:05:32,791 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:05:32,901 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:32,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:05:32,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1700317234] [2025-03-03 15:05:32,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1700317234] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:05:32,902 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:05:32,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 15:05:32,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1106172396] [2025-03-03 15:05:32,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:05:32,902 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:05:32,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:05:32,902 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:05:32,902 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:05:32,903 INFO L87 Difference]: Start difference. First operand 19382 states and 26801 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:05:32,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:05:32,998 INFO L93 Difference]: Finished difference Result 32770 states and 45740 transitions. [2025-03-03 15:05:32,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 15:05:32,999 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2025-03-03 15:05:32,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:05:33,043 INFO L225 Difference]: With dead ends: 32770 [2025-03-03 15:05:33,043 INFO L226 Difference]: Without dead ends: 27189 [2025-03-03 15:05:33,058 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:33,059 INFO L435 NwaCegarLoop]: 198 mSDtfsCounter, 307 mSDsluCounter, 308 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 307 SdHoareTripleChecker+Valid, 506 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:05:33,059 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [307 Valid, 506 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:05:33,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27189 states. [2025-03-03 15:05:33,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27189 to 23109. [2025-03-03 15:05:33,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23109 states, 23108 states have (on average 1.3815128959667649) internal successors, (31924), 23108 states have internal predecessors, (31924), 0 states have call successors, (0), 0 states 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:33,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23109 states to 23109 states and 31924 transitions. [2025-03-03 15:05:33,372 INFO L78 Accepts]: Start accepts. Automaton has 23109 states and 31924 transitions. Word has length 62 [2025-03-03 15:05:33,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:05:33,372 INFO L471 AbstractCegarLoop]: Abstraction has 23109 states and 31924 transitions. [2025-03-03 15:05:33,372 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:05:33,372 INFO L276 IsEmpty]: Start isEmpty. Operand 23109 states and 31924 transitions. [2025-03-03 15:05:33,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-03-03 15:05:33,377 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:05:33,377 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:33,378 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-03 15:05:33,378 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:05:33,378 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:05:33,378 INFO L85 PathProgramCache]: Analyzing trace with hash -59031886, now seen corresponding path program 1 times [2025-03-03 15:05:33,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:05:33,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [571828980] [2025-03-03 15:05:33,379 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:05:33,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:05:33,387 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-03 15:05:33,398 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-03 15:05:33,398 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:05:33,399 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:05:33,500 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:33,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:05:33,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [571828980] [2025-03-03 15:05:33,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [571828980] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:05:33,501 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:05:33,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:05:33,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1437047743] [2025-03-03 15:05:33,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:05:33,502 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:05:33,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:05:33,502 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:05:33,502 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:05:33,502 INFO L87 Difference]: Start difference. First operand 23109 states and 31924 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:33,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:05:33,578 INFO L93 Difference]: Finished difference Result 41505 states and 56989 transitions. [2025-03-03 15:05:33,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:05:33,579 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:33,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:05:33,616 INFO L225 Difference]: With dead ends: 41505 [2025-03-03 15:05:33,617 INFO L226 Difference]: Without dead ends: 23508 [2025-03-03 15:05:33,638 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:33,638 INFO L435 NwaCegarLoop]: 167 mSDtfsCounter, 56 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 262 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:33,638 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 262 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:33,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23508 states. [2025-03-03 15:05:33,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23508 to 21953. [2025-03-03 15:05:33,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21953 states, 21952 states have (on average 1.3650236880466473) internal successors, (29965), 21952 states have internal predecessors, (29965), 0 states have call successors, (0), 0 states 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:33,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21953 states to 21953 states and 29965 transitions. [2025-03-03 15:05:33,921 INFO L78 Accepts]: Start accepts. Automaton has 21953 states and 29965 transitions. Word has length 64 [2025-03-03 15:05:33,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:05:33,922 INFO L471 AbstractCegarLoop]: Abstraction has 21953 states and 29965 transitions. [2025-03-03 15:05:33,922 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:33,922 INFO L276 IsEmpty]: Start isEmpty. Operand 21953 states and 29965 transitions. [2025-03-03 15:05:33,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-03-03 15:05:33,924 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:05:33,924 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] [2025-03-03 15:05:33,924 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-03 15:05:33,925 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:05:33,925 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:05:33,925 INFO L85 PathProgramCache]: Analyzing trace with hash -210875692, now seen corresponding path program 1 times [2025-03-03 15:05:33,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:05:33,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011315191] [2025-03-03 15:05:33,925 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:05:33,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:05:33,934 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-03 15:05:33,943 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-03 15:05:33,944 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:05:33,944 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:05:34,033 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:34,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:05:34,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1011315191] [2025-03-03 15:05:34,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1011315191] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 15:05:34,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [672069151] [2025-03-03 15:05:34,034 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:05:34,034 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 15:05:34,034 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 15:05:34,036 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:34,037 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:34,095 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-03 15:05:34,130 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-03 15:05:34,130 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:05:34,130 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:05:34,131 INFO L256 TraceCheckSpWp]: Trace formula consists of 321 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-03 15:05:34,133 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 15:05:34,300 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:34,300 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 15:05:34,396 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:34,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [672069151] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 15:05:34,397 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 15:05:34,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2025-03-03 15:05:34,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [26038094] [2025-03-03 15:05:34,397 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 15:05:34,397 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-03 15:05:34,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:05:34,398 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-03 15:05:34,398 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2025-03-03 15:05:34,398 INFO L87 Difference]: Start difference. First operand 21953 states and 29965 transitions. Second operand has 11 states, 11 states have (on average 10.090909090909092) internal successors, (111), 10 states have internal predecessors, (111), 0 states have call successors, (0), 0 states 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:34,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:05:34,734 INFO L93 Difference]: Finished difference Result 49044 states and 67404 transitions. [2025-03-03 15:05:34,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 15:05:34,735 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 10.090909090909092) internal successors, (111), 10 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2025-03-03 15:05:34,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:05:34,788 INFO L225 Difference]: With dead ends: 49044 [2025-03-03 15:05:34,789 INFO L226 Difference]: Without dead ends: 29391 [2025-03-03 15:05:34,811 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 122 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:34,812 INFO L435 NwaCegarLoop]: 65 mSDtfsCounter, 696 mSDsluCounter, 299 mSDsCounter, 0 mSdLazyCounter, 259 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 696 SdHoareTripleChecker+Valid, 364 SdHoareTripleChecker+Invalid, 275 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 259 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 15:05:34,813 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [696 Valid, 364 Invalid, 275 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 259 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 15:05:34,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29391 states. [2025-03-03 15:05:35,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29391 to 22033. [2025-03-03 15:05:35,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22033 states, 22032 states have (on average 1.3721859114015977) internal successors, (30232), 22032 states have internal predecessors, (30232), 0 states have call successors, (0), 0 states 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:35,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22033 states to 22033 states and 30232 transitions. [2025-03-03 15:05:35,238 INFO L78 Accepts]: Start accepts. Automaton has 22033 states and 30232 transitions. Word has length 66 [2025-03-03 15:05:35,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:05:35,238 INFO L471 AbstractCegarLoop]: Abstraction has 22033 states and 30232 transitions. [2025-03-03 15:05:35,239 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.090909090909092) internal successors, (111), 10 states have internal predecessors, (111), 0 states have call successors, (0), 0 states 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:35,239 INFO L276 IsEmpty]: Start isEmpty. Operand 22033 states and 30232 transitions. [2025-03-03 15:05:35,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-03-03 15:05:35,240 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:05:35,241 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:35,247 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-03 15:05:35,445 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:35,445 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:05:35,445 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:05:35,445 INFO L85 PathProgramCache]: Analyzing trace with hash -506099627, now seen corresponding path program 1 times [2025-03-03 15:05:35,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:05:35,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [878980593] [2025-03-03 15:05:35,446 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:05:35,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:05:35,453 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-03-03 15:05:35,460 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-03-03 15:05:35,460 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:05:35,460 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:05:35,534 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:35,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:05:35,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [878980593] [2025-03-03 15:05:35,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [878980593] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 15:05:35,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1901954560] [2025-03-03 15:05:35,534 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:05:35,534 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 15:05:35,534 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 15:05:35,536 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:35,538 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:35,596 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-03-03 15:05:35,624 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-03-03 15:05:35,624 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:05:35,624 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:05:35,626 INFO L256 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-03 15:05:35,627 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 15:05:35,800 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:35,801 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 15:05:35,885 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:35,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1901954560] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 15:05:35,885 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 15:05:35,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2025-03-03 15:05:35,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1162191687] [2025-03-03 15:05:35,885 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 15:05:35,885 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-03 15:05:35,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:05:35,886 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-03 15:05:35,886 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2025-03-03 15:05:35,886 INFO L87 Difference]: Start difference. First operand 22033 states and 30232 transitions. Second operand has 11 states, 11 states have (on average 10.545454545454545) internal successors, (116), 10 states have internal predecessors, (116), 0 states have call successors, (0), 0 states 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:36,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:05:36,138 INFO L93 Difference]: Finished difference Result 48969 states and 67391 transitions. [2025-03-03 15:05:36,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 15:05:36,138 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 10.545454545454545) internal successors, (116), 10 states have internal predecessors, (116), 0 states have call successors, (0), 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:36,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:05:36,272 INFO L225 Difference]: With dead ends: 48969 [2025-03-03 15:05:36,273 INFO L226 Difference]: Without dead ends: 33699 [2025-03-03 15:05:36,280 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 124 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:36,281 INFO L435 NwaCegarLoop]: 68 mSDtfsCounter, 999 mSDsluCounter, 219 mSDsCounter, 0 mSdLazyCounter, 219 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 999 SdHoareTripleChecker+Valid, 287 SdHoareTripleChecker+Invalid, 235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 219 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:05:36,281 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [999 Valid, 287 Invalid, 235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 219 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 15:05:36,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33699 states. [2025-03-03 15:05:36,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33699 to 26206. [2025-03-03 15:05:36,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26206 states, 26205 states have (on average 1.3681740125930166) internal successors, (35853), 26205 states have internal predecessors, (35853), 0 states have call successors, (0), 0 states 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:36,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26206 states to 26206 states and 35853 transitions. [2025-03-03 15:05:36,529 INFO L78 Accepts]: Start accepts. Automaton has 26206 states and 35853 transitions. Word has length 67 [2025-03-03 15:05:36,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:05:36,529 INFO L471 AbstractCegarLoop]: Abstraction has 26206 states and 35853 transitions. [2025-03-03 15:05:36,529 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.545454545454545) internal successors, (116), 10 states have internal predecessors, (116), 0 states have call successors, (0), 0 states 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:36,529 INFO L276 IsEmpty]: Start isEmpty. Operand 26206 states and 35853 transitions. [2025-03-03 15:05:36,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-03-03 15:05:36,531 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:05:36,531 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:36,538 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:36,732 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:36,732 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:05:36,732 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:05:36,733 INFO L85 PathProgramCache]: Analyzing trace with hash -1438123593, now seen corresponding path program 1 times [2025-03-03 15:05:36,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:05:36,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025471519] [2025-03-03 15:05:36,733 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:05:36,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:05:36,742 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-03-03 15:05:36,756 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-03-03 15:05:36,756 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:05:36,756 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:05:36,849 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:36,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:05:36,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2025471519] [2025-03-03 15:05:36,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2025471519] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 15:05:36,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1300851496] [2025-03-03 15:05:36,849 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:05:36,849 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 15:05:36,849 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 15:05:36,851 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:36,852 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:36,900 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-03-03 15:05:36,925 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-03-03 15:05:36,925 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:05:36,925 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:05:36,927 INFO L256 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-03 15:05:36,928 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 15:05:37,057 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:37,057 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 15:05:37,122 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:37,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1300851496] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 15:05:37,123 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 15:05:37,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2025-03-03 15:05:37,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632349140] [2025-03-03 15:05:37,123 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 15:05:37,123 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-03 15:05:37,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:05:37,123 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-03 15:05:37,123 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2025-03-03 15:05:37,124 INFO L87 Difference]: Start difference. First operand 26206 states and 35853 transitions. Second operand has 11 states, 11 states have (on average 10.272727272727273) internal successors, (113), 10 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:05:37,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:05:37,417 INFO L93 Difference]: Finished difference Result 52643 states and 71973 transitions. [2025-03-03 15:05:37,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 15:05:37,417 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 10.272727272727273) internal successors, (113), 10 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2025-03-03 15:05:37,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:05:37,452 INFO L225 Difference]: With dead ends: 52643 [2025-03-03 15:05:37,452 INFO L226 Difference]: Without dead ends: 30097 [2025-03-03 15:05:37,471 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 124 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:37,471 INFO L435 NwaCegarLoop]: 72 mSDtfsCounter, 810 mSDsluCounter, 228 mSDsCounter, 0 mSdLazyCounter, 203 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 810 SdHoareTripleChecker+Valid, 300 SdHoareTripleChecker+Invalid, 213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 15:05:37,472 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [810 Valid, 300 Invalid, 213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 203 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 15:05:37,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30097 states. [2025-03-03 15:05:37,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30097 to 26650. [2025-03-03 15:05:37,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26650 states, 26649 states have (on average 1.3619272768208939) internal successors, (36294), 26649 states have internal predecessors, (36294), 0 states have call successors, (0), 0 states 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,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26650 states to 26650 states and 36294 transitions. [2025-03-03 15:05:37,752 INFO L78 Accepts]: Start accepts. Automaton has 26650 states and 36294 transitions. Word has length 67 [2025-03-03 15:05:37,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:05:37,752 INFO L471 AbstractCegarLoop]: Abstraction has 26650 states and 36294 transitions. [2025-03-03 15:05:37,752 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.272727272727273) internal successors, (113), 10 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:05:37,752 INFO L276 IsEmpty]: Start isEmpty. Operand 26650 states and 36294 transitions. [2025-03-03 15:05:37,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-03-03 15:05:37,754 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:05:37,754 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:37,760 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:37,955 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:37,955 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:05:37,955 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:05:37,955 INFO L85 PathProgramCache]: Analyzing trace with hash 499624089, now seen corresponding path program 1 times [2025-03-03 15:05:37,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:05:37,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [377059263] [2025-03-03 15:05:37,955 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:05:37,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:05:37,963 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-03 15:05:37,979 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-03 15:05:37,980 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:05:37,980 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:05:38,252 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:38,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:05:38,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [377059263] [2025-03-03 15:05:38,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [377059263] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 15:05:38,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1285969451] [2025-03-03 15:05:38,253 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:05:38,253 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 15:05:38,253 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 15:05:38,255 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:38,257 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:38,311 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-03 15:05:38,343 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-03 15:05:38,344 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:05:38,344 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:05:38,345 INFO L256 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-03 15:05:38,347 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 15:05:38,714 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:38,714 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 15:05:39,233 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:39,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1285969451] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 15:05:39,233 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 15:05:39,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 20 [2025-03-03 15:05:39,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432289583] [2025-03-03 15:05:39,233 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 15:05:39,234 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-03 15:05:39,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:05:39,234 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-03 15:05:39,234 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=347, Unknown=0, NotChecked=0, Total=420 [2025-03-03 15:05:39,234 INFO L87 Difference]: Start difference. First operand 26650 states and 36294 transitions. Second operand has 21 states, 21 states have (on average 7.761904761904762) internal successors, (163), 20 states have internal predecessors, (163), 0 states have call successors, (0), 0 states 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:40,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:05:40,340 INFO L93 Difference]: Finished difference Result 121085 states and 164973 transitions. [2025-03-03 15:05:40,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-03-03 15:05:40,340 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 7.761904761904762) internal successors, (163), 20 states have internal predecessors, (163), 0 states have call successors, (0), 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:40,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:05:40,441 INFO L225 Difference]: With dead ends: 121085 [2025-03-03 15:05:40,442 INFO L226 Difference]: Without dead ends: 94533 [2025-03-03 15:05:40,483 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 126 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:40,483 INFO L435 NwaCegarLoop]: 121 mSDtfsCounter, 1415 mSDsluCounter, 1036 mSDsCounter, 0 mSdLazyCounter, 1188 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1415 SdHoareTripleChecker+Valid, 1157 SdHoareTripleChecker+Invalid, 1214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 1188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 15:05:40,483 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1415 Valid, 1157 Invalid, 1214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 1188 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 15:05:40,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94533 states. [2025-03-03 15:05:41,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94533 to 57761. [2025-03-03 15:05:41,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57761 states, 57760 states have (on average 1.3534452908587258) internal successors, (78175), 57760 states have internal predecessors, (78175), 0 states have call successors, (0), 0 states 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:41,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57761 states to 57761 states and 78175 transitions. [2025-03-03 15:05:41,362 INFO L78 Accepts]: Start accepts. Automaton has 57761 states and 78175 transitions. Word has length 69 [2025-03-03 15:05:41,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:05:41,362 INFO L471 AbstractCegarLoop]: Abstraction has 57761 states and 78175 transitions. [2025-03-03 15:05:41,362 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 7.761904761904762) internal successors, (163), 20 states have internal predecessors, (163), 0 states have call successors, (0), 0 states 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:41,362 INFO L276 IsEmpty]: Start isEmpty. Operand 57761 states and 78175 transitions. [2025-03-03 15:05:41,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-03-03 15:05:41,365 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:05:41,365 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:41,373 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-03 15:05:41,565 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:41,566 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:05:41,566 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:05:41,567 INFO L85 PathProgramCache]: Analyzing trace with hash -102402125, now seen corresponding path program 1 times [2025-03-03 15:05:41,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:05:41,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457969609] [2025-03-03 15:05:41,567 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:05:41,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:05:41,574 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-03 15:05:41,590 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-03 15:05:41,590 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:05:41,590 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:05:41,776 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:41,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:05:41,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [457969609] [2025-03-03 15:05:41,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [457969609] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 15:05:41,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [239520082] [2025-03-03 15:05:41,777 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:05:41,777 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 15:05:41,777 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 15:05:41,779 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:41,781 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:41,832 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-03 15:05:41,863 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-03 15:05:41,863 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:05:41,863 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:05:41,865 INFO L256 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-03 15:05:41,868 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 15:05:42,598 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:42,598 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 15:05:43,127 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:43,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [239520082] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 15:05:43,127 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 15:05:43,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 12, 12] total 30 [2025-03-03 15:05:43,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [367294798] [2025-03-03 15:05:43,127 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 15:05:43,127 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-03-03 15:05:43,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:05:43,128 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-03-03 15:05:43,128 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=775, Unknown=0, NotChecked=0, Total=870 [2025-03-03 15:05:43,128 INFO L87 Difference]: Start difference. First operand 57761 states and 78175 transitions. Second operand has 30 states, 30 states have (on average 6.466666666666667) internal successors, (194), 30 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:59,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:05:59,706 INFO L93 Difference]: Finished difference Result 535368 states and 712261 transitions. [2025-03-03 15:05:59,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 311 states. [2025-03-03 15:05:59,707 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 6.466666666666667) internal successors, (194), 30 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) Word has length 69 [2025-03-03 15:05:59,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:06:00,298 INFO L225 Difference]: With dead ends: 535368 [2025-03-03 15:06:00,298 INFO L226 Difference]: Without dead ends: 477634 [2025-03-03 15:06:00,370 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 454 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 336 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50056 ImplicationChecksByTransitivity, 11.1s TimeCoverageRelationStatistics Valid=14810, Invalid=99096, Unknown=0, NotChecked=0, Total=113906 [2025-03-03 15:06:00,371 INFO L435 NwaCegarLoop]: 275 mSDtfsCounter, 7654 mSDsluCounter, 5123 mSDsCounter, 0 mSdLazyCounter, 8565 mSolverCounterSat, 105 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7654 SdHoareTripleChecker+Valid, 5398 SdHoareTripleChecker+Invalid, 8670 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 105 IncrementalHoareTripleChecker+Valid, 8565 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2025-03-03 15:06:00,371 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7654 Valid, 5398 Invalid, 8670 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [105 Valid, 8565 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2025-03-03 15:06:00,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 477634 states. [2025-03-03 15:06:03,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 477634 to 127123. [2025-03-03 15:06:03,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127123 states, 127122 states have (on average 1.3364484510942245) internal successors, (169892), 127122 states have internal predecessors, (169892), 0 states have call successors, (0), 0 states 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:06:03,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127123 states to 127123 states and 169892 transitions. [2025-03-03 15:06:03,595 INFO L78 Accepts]: Start accepts. Automaton has 127123 states and 169892 transitions. Word has length 69 [2025-03-03 15:06:03,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:06:03,595 INFO L471 AbstractCegarLoop]: Abstraction has 127123 states and 169892 transitions. [2025-03-03 15:06:03,595 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 6.466666666666667) internal successors, (194), 30 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:06:03,595 INFO L276 IsEmpty]: Start isEmpty. Operand 127123 states and 169892 transitions. [2025-03-03 15:06:03,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-03-03 15:06:03,599 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:06:03,599 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:06:03,605 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-03 15:06:03,799 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:06:03,800 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:06:03,800 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:06:03,800 INFO L85 PathProgramCache]: Analyzing trace with hash -257169125, now seen corresponding path program 1 times [2025-03-03 15:06:03,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:06:03,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788631340] [2025-03-03 15:06:03,800 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:06:03,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:06:03,807 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-03 15:06:03,811 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-03 15:06:03,811 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:06:03,811 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:06:03,829 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:06:03,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:06:03,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1788631340] [2025-03-03 15:06:03,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1788631340] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:06:03,829 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:06:03,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:06:03,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [854542973] [2025-03-03 15:06:03,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:06:03,830 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:06:03,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:06:03,830 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:06:03,830 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:06:03,831 INFO L87 Difference]: Start difference. First operand 127123 states and 169892 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:06:04,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:06:04,641 INFO L93 Difference]: Finished difference Result 230318 states and 307886 transitions. [2025-03-03 15:06:04,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:06:04,644 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 70 [2025-03-03 15:06:04,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:06:04,841 INFO L225 Difference]: With dead ends: 230318 [2025-03-03 15:06:04,841 INFO L226 Difference]: Without dead ends: 107168 [2025-03-03 15:06:04,915 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:06:04,918 INFO L435 NwaCegarLoop]: 84 mSDtfsCounter, 74 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 120 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:06:04,918 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 120 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:06:04,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107168 states. [2025-03-03 15:06:05,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107168 to 105373. [2025-03-03 15:06:06,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105373 states, 105372 states have (on average 1.31752268154728) internal successors, (138830), 105372 states have internal predecessors, (138830), 0 states have call successors, (0), 0 states 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:06:06,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105373 states to 105373 states and 138830 transitions. [2025-03-03 15:06:06,145 INFO L78 Accepts]: Start accepts. Automaton has 105373 states and 138830 transitions. Word has length 70 [2025-03-03 15:06:06,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:06:06,145 INFO L471 AbstractCegarLoop]: Abstraction has 105373 states and 138830 transitions. [2025-03-03 15:06:06,145 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:06:06,145 INFO L276 IsEmpty]: Start isEmpty. Operand 105373 states and 138830 transitions. [2025-03-03 15:06:06,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-03-03 15:06:06,148 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:06:06,148 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:06:06,148 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-03 15:06:06,148 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:06:06,148 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:06:06,149 INFO L85 PathProgramCache]: Analyzing trace with hash -1846588244, now seen corresponding path program 1 times [2025-03-03 15:06:06,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:06:06,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81920997] [2025-03-03 15:06:06,149 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:06:06,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:06:06,156 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-03 15:06:06,161 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-03 15:06:06,161 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:06:06,162 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:06:06,178 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-03 15:06:06,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:06:06,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [81920997] [2025-03-03 15:06:06,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [81920997] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:06:06,179 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:06:06,179 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:06:06,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [232337133] [2025-03-03 15:06:06,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:06:06,179 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:06:06,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:06:06,179 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:06:06,179 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:06:06,180 INFO L87 Difference]: Start difference. First operand 105373 states and 138830 transitions. Second operand has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:06:06,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:06:06,904 INFO L93 Difference]: Finished difference Result 221029 states and 290859 transitions. [2025-03-03 15:06:06,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:06:06,905 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 71 [2025-03-03 15:06:06,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:06:07,140 INFO L225 Difference]: With dead ends: 221029 [2025-03-03 15:06:07,141 INFO L226 Difference]: Without dead ends: 193542 [2025-03-03 15:06:07,173 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:06:07,174 INFO L435 NwaCegarLoop]: 101 mSDtfsCounter, 62 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:06:07,174 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 187 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:06:07,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193542 states. [2025-03-03 15:06:08,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193542 to 116052. [2025-03-03 15:06:08,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116052 states, 116051 states have (on average 1.3125091554575143) internal successors, (152318), 116051 states have internal predecessors, (152318), 0 states have call successors, (0), 0 states 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:06:08,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116052 states to 116052 states and 152318 transitions. [2025-03-03 15:06:08,881 INFO L78 Accepts]: Start accepts. Automaton has 116052 states and 152318 transitions. Word has length 71 [2025-03-03 15:06:08,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:06:08,882 INFO L471 AbstractCegarLoop]: Abstraction has 116052 states and 152318 transitions. [2025-03-03 15:06:08,882 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:06:08,882 INFO L276 IsEmpty]: Start isEmpty. Operand 116052 states and 152318 transitions. [2025-03-03 15:06:08,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-03-03 15:06:08,884 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:06:08,884 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:06:08,884 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-03 15:06:08,884 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:06:08,885 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:06:08,885 INFO L85 PathProgramCache]: Analyzing trace with hash 1315277456, now seen corresponding path program 1 times [2025-03-03 15:06:08,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:06:08,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427299123] [2025-03-03 15:06:08,885 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:06:08,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:06:08,892 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-03 15:06:08,918 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-03 15:06:08,922 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:06:08,922 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:06:09,370 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:06:09,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:06:09,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [427299123] [2025-03-03 15:06:09,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [427299123] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 15:06:09,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1462055133] [2025-03-03 15:06:09,371 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:06:09,371 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 15:06:09,371 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 15:06:09,372 INFO L229 MonitoredProcess]: Starting monitored process 8 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:06:09,373 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-03 15:06:09,426 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-03 15:06:09,459 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-03 15:06:09,459 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:06:09,459 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:06:09,461 INFO L256 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 41 conjuncts are in the unsatisfiable core [2025-03-03 15:06:09,463 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 15:06:10,984 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:06:10,984 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 15:06:12,362 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:06:12,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1462055133] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 15:06:12,362 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 15:06:12,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 23, 20] total 52 [2025-03-03 15:06:12,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226906466] [2025-03-03 15:06:12,362 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 15:06:12,362 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2025-03-03 15:06:12,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:06:12,363 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2025-03-03 15:06:12,363 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=353, Invalid=2299, Unknown=0, NotChecked=0, Total=2652 [2025-03-03 15:06:12,363 INFO L87 Difference]: Start difference. First operand 116052 states and 152318 transitions. Second operand has 52 states, 52 states have (on average 3.7115384615384617) internal successors, (193), 52 states have internal predecessors, (193), 0 states have call successors, (0), 0 states 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:06:45,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:06:45,723 INFO L93 Difference]: Finished difference Result 679265 states and 886190 transitions. [2025-03-03 15:06:45,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 387 states. [2025-03-03 15:06:45,725 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 52 states have (on average 3.7115384615384617) internal successors, (193), 52 states have internal predecessors, (193), 0 states have call successors, (0), 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:06:45,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:06:46,901 INFO L225 Difference]: With dead ends: 679265 [2025-03-03 15:06:46,901 INFO L226 Difference]: Without dead ends: 617334 [2025-03-03 15:06:46,964 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 537 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 433 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81162 ImplicationChecksByTransitivity, 27.9s TimeCoverageRelationStatistics Valid=26446, Invalid=162344, Unknown=0, NotChecked=0, Total=188790 [2025-03-03 15:06:46,965 INFO L435 NwaCegarLoop]: 353 mSDtfsCounter, 15969 mSDsluCounter, 6891 mSDsCounter, 0 mSdLazyCounter, 6874 mSolverCounterSat, 221 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15969 SdHoareTripleChecker+Valid, 7244 SdHoareTripleChecker+Invalid, 7095 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 221 IncrementalHoareTripleChecker+Valid, 6874 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2025-03-03 15:06:46,965 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15969 Valid, 7244 Invalid, 7095 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [221 Valid, 6874 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2025-03-03 15:06:47,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617334 states. [2025-03-03 15:06:50,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617334 to 167155. [2025-03-03 15:06:50,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167155 states, 167154 states have (on average 1.319992342390849) internal successors, (220642), 167154 states have internal predecessors, (220642), 0 states have call successors, (0), 0 states 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:06:51,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167155 states to 167155 states and 220642 transitions. [2025-03-03 15:06:51,132 INFO L78 Accepts]: Start accepts. Automaton has 167155 states and 220642 transitions. Word has length 71 [2025-03-03 15:06:51,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:06:51,132 INFO L471 AbstractCegarLoop]: Abstraction has 167155 states and 220642 transitions. [2025-03-03 15:06:51,132 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 52 states have (on average 3.7115384615384617) internal successors, (193), 52 states have internal predecessors, (193), 0 states have call successors, (0), 0 states 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:06:51,132 INFO L276 IsEmpty]: Start isEmpty. Operand 167155 states and 220642 transitions. [2025-03-03 15:06:51,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-03-03 15:06:51,135 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:06:51,135 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:06:51,141 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-03 15:06:51,335 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 15:06:51,336 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:06:51,336 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:06:51,336 INFO L85 PathProgramCache]: Analyzing trace with hash -376535949, now seen corresponding path program 1 times [2025-03-03 15:06:51,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:06:51,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578373678] [2025-03-03 15:06:51,336 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:06:51,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:06:51,346 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-03-03 15:06:51,350 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-03-03 15:06:51,350 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:06:51,350 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:06:51,371 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-03 15:06:51,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:06:51,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1578373678] [2025-03-03 15:06:51,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1578373678] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:06:51,372 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:06:51,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:06:51,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [923607972] [2025-03-03 15:06:51,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:06:51,373 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:06:51,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:06:51,373 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:06:51,373 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:06:51,373 INFO L87 Difference]: Start difference. First operand 167155 states and 220642 transitions. Second operand has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)