./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.3.2.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.3.2.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b9a6c0b24d5d607558501714a91a15c3c9ad61c83cb06d37fa1f6444538df81a --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 15:01:03,707 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 15:01:03,760 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 15:01:03,766 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 15:01:03,767 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 15:01:03,783 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 15:01:03,783 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 15:01:03,784 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 15:01:03,784 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 15:01:03,784 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 15:01:03,784 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 15:01:03,784 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 15:01:03,784 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 15:01:03,784 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 15:01:03,784 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 15:01:03,784 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 15:01:03,784 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 15:01:03,784 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 15:01:03,784 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 15:01:03,784 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 15:01:03,785 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 15:01:03,785 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 15:01:03,785 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 15:01:03,785 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 15:01:03,785 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 15:01:03,785 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 15:01:03,785 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 15:01:03,785 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 15:01:03,785 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 15:01:03,785 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 15:01:03,785 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 15:01:03,785 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 15:01:03,785 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 15:01:03,785 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 15:01:03,785 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 15:01:03,785 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 15:01:03,785 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 15:01:03,785 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 15:01:03,785 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 15:01:03,785 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 15:01:03,786 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 15:01:03,786 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 15:01:03,786 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 15:01:03,786 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 -> b9a6c0b24d5d607558501714a91a15c3c9ad61c83cb06d37fa1f6444538df81a [2025-03-03 15:01:04,005 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 15:01:04,013 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 15:01:04,014 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 15:01:04,016 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 15:01:04,016 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 15:01:04,017 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.3.2.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2025-03-03 15:01:05,167 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/72a99880e/11e23681ce7d4b9fb0370ae260ce4759/FLAGc8a84451c [2025-03-03 15:01:05,435 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 15:01:05,435 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.3.2.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2025-03-03 15:01:05,449 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/72a99880e/11e23681ce7d4b9fb0370ae260ce4759/FLAGc8a84451c [2025-03-03 15:01:05,761 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/72a99880e/11e23681ce7d4b9fb0370ae260ce4759 [2025-03-03 15:01:05,763 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 15:01:05,764 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 15:01:05,765 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 15:01:05,765 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 15:01:05,768 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 15:01:05,768 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 03:01:05" (1/1) ... [2025-03-03 15:01:05,769 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@655775e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:01:05, skipping insertion in model container [2025-03-03 15:01:05,769 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 03:01:05" (1/1) ... [2025-03-03 15:01:05,791 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 15:01:05,960 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.3.2.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c[7349,7362] [2025-03-03 15:01:05,993 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 15:01:06,008 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 15:01:06,045 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.3.2.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c[7349,7362] [2025-03-03 15:01:06,064 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 15:01:06,077 INFO L204 MainTranslator]: Completed translation [2025-03-03 15:01:06,077 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:01:06 WrapperNode [2025-03-03 15:01:06,078 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 15:01:06,079 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 15:01:06,079 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 15:01:06,079 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 15:01:06,083 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:01:06" (1/1) ... [2025-03-03 15:01:06,090 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:01:06" (1/1) ... [2025-03-03 15:01:06,116 INFO L138 Inliner]: procedures = 23, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 634 [2025-03-03 15:01:06,117 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 15:01:06,117 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 15:01:06,117 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 15:01:06,117 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 15:01:06,124 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:01:06" (1/1) ... [2025-03-03 15:01:06,124 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:01:06" (1/1) ... [2025-03-03 15:01:06,131 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:01:06" (1/1) ... [2025-03-03 15:01:06,148 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:01:06,149 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:01:06" (1/1) ... [2025-03-03 15:01:06,149 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:01:06" (1/1) ... [2025-03-03 15:01:06,159 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:01:06" (1/1) ... [2025-03-03 15:01:06,164 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:01:06" (1/1) ... [2025-03-03 15:01:06,166 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:01:06" (1/1) ... [2025-03-03 15:01:06,167 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:01:06" (1/1) ... [2025-03-03 15:01:06,173 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 15:01:06,174 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 15:01:06,174 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 15:01:06,175 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 15:01:06,175 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:01:06" (1/1) ... [2025-03-03 15:01:06,181 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 15:01:06,190 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 15:01:06,204 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:01:06,206 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:01:06,225 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 15:01:06,226 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 15:01:06,226 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 15:01:06,226 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 15:01:06,319 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 15:01:06,320 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 15:01:06,747 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L382: havoc main_~__tmp_1~0#1, main_~assert__arg~0#1;havoc main_~check__tmp~0#1; [2025-03-03 15:01:06,747 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L634: havoc main_~node2____CPAchecker_TMP_1~0#1;havoc main_~node2____CPAchecker_TMP_0~0#1; [2025-03-03 15:01:06,747 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L740: havoc main_~node1____CPAchecker_TMP_1~0#1;havoc main_~node1____CPAchecker_TMP_0~0#1; [2025-03-03 15:01:06,747 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L113: havoc main_~init__r121~0#1, main_~init__r131~0#1, main_~init__r211~0#1, main_~init__r231~0#1, main_~init__r311~0#1, main_~init__r321~0#1, main_~init__r122~0#1, main_~init__tmp~0#1, main_~init__r132~0#1, main_~init__tmp___0~0#1, main_~init__r212~0#1, main_~init__tmp___1~0#1, main_~init__r232~0#1, main_~init__tmp___2~0#1, main_~init__r312~0#1, main_~init__tmp___3~0#1, main_~init__r322~0#1, main_~init__tmp___4~0#1, main_~init__tmp___5~0#1; [2025-03-03 15:01:06,747 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L528: havoc main_~node3____CPAchecker_TMP_1~0#1;havoc main_~node3____CPAchecker_TMP_0~0#1; [2025-03-03 15:01:06,781 INFO L? ?]: Removed 47 outVars from TransFormulas that were not future-live. [2025-03-03 15:01:06,781 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 15:01:06,791 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 15:01:06,792 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 15:01:06,793 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 03:01:06 BoogieIcfgContainer [2025-03-03 15:01:06,793 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 15:01:06,795 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 15:01:06,795 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 15:01:06,799 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 15:01:06,799 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 03:01:05" (1/3) ... [2025-03-03 15:01:06,800 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11dd5ace and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 03:01:06, skipping insertion in model container [2025-03-03 15:01:06,800 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:01:06" (2/3) ... [2025-03-03 15:01:06,801 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11dd5ace and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 03:01:06, skipping insertion in model container [2025-03-03 15:01:06,801 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 03:01:06" (3/3) ... [2025-03-03 15:01:06,802 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_floodmax.3.2.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2025-03-03 15:01:06,813 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 15:01:06,816 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_floodmax.3.2.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c that has 1 procedures, 140 locations, 1 initial locations, 0 loop locations, and 1 error locations. [2025-03-03 15:01:06,862 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 15:01:06,873 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;@4a061542, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 15:01:06,873 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 15:01:06,878 INFO L276 IsEmpty]: Start isEmpty. Operand has 140 states, 138 states have (on average 1.7608695652173914) internal successors, (243), 139 states have internal predecessors, (243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:01:06,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-03-03 15:01:06,885 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:01:06,886 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:01:06,886 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:01:06,891 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:01:06,891 INFO L85 PathProgramCache]: Analyzing trace with hash -1866442793, now seen corresponding path program 1 times [2025-03-03 15:01:06,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:01:06,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041551289] [2025-03-03 15:01:06,897 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:01:06,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:01:06,963 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-03 15:01:07,058 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-03 15:01:07,059 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:01:07,059 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:01:07,309 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:01:07,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:01:07,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1041551289] [2025-03-03 15:01:07,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1041551289] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:01:07,318 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:01:07,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:01:07,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [689168439] [2025-03-03 15:01:07,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:01:07,321 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:01:07,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:01:07,333 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:01:07,334 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:01:07,336 INFO L87 Difference]: Start difference. First operand has 140 states, 138 states have (on average 1.7608695652173914) internal successors, (243), 139 states have internal predecessors, (243), 0 states have call successors, (0), 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 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:01:07,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:01:07,420 INFO L93 Difference]: Finished difference Result 303 states and 512 transitions. [2025-03-03 15:01:07,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:01:07,424 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 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 56 [2025-03-03 15:01:07,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:01:07,431 INFO L225 Difference]: With dead ends: 303 [2025-03-03 15:01:07,431 INFO L226 Difference]: Without dead ends: 211 [2025-03-03 15:01:07,434 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:01:07,436 INFO L435 NwaCegarLoop]: 238 mSDtfsCounter, 138 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 419 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:01:07,437 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 419 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 15:01:07,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2025-03-03 15:01:07,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 208. [2025-03-03 15:01:07,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 207 states have (on average 1.5797101449275361) internal successors, (327), 207 states have internal predecessors, (327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:01:07,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 327 transitions. [2025-03-03 15:01:07,465 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 327 transitions. Word has length 56 [2025-03-03 15:01:07,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:01:07,465 INFO L471 AbstractCegarLoop]: Abstraction has 208 states and 327 transitions. [2025-03-03 15:01:07,465 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:01:07,465 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 327 transitions. [2025-03-03 15:01:07,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-03-03 15:01:07,466 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:01:07,466 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:01:07,467 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 15:01:07,467 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:01:07,468 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:01:07,468 INFO L85 PathProgramCache]: Analyzing trace with hash -951345654, now seen corresponding path program 1 times [2025-03-03 15:01:07,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:01:07,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [807976903] [2025-03-03 15:01:07,468 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:01:07,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:01:07,480 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-03 15:01:07,509 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-03 15:01:07,509 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:01:07,509 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:01:07,617 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:01:07,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:01:07,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [807976903] [2025-03-03 15:01:07,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [807976903] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:01:07,618 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:01:07,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:01:07,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016487982] [2025-03-03 15:01:07,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:01:07,619 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:01:07,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:01:07,620 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:01:07,620 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:01:07,621 INFO L87 Difference]: Start difference. First operand 208 states and 327 transitions. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:01:07,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:01:07,664 INFO L93 Difference]: Finished difference Result 502 states and 811 transitions. [2025-03-03 15:01:07,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:01:07,664 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2025-03-03 15:01:07,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:01:07,669 INFO L225 Difference]: With dead ends: 502 [2025-03-03 15:01:07,669 INFO L226 Difference]: Without dead ends: 348 [2025-03-03 15:01:07,669 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:01:07,670 INFO L435 NwaCegarLoop]: 209 mSDtfsCounter, 118 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 391 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:01:07,670 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 391 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:01:07,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2025-03-03 15:01:07,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 344. [2025-03-03 15:01:07,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 344 states, 343 states have (on average 1.6005830903790088) internal successors, (549), 343 states have internal predecessors, (549), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:01:07,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 549 transitions. [2025-03-03 15:01:07,694 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 549 transitions. Word has length 58 [2025-03-03 15:01:07,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:01:07,695 INFO L471 AbstractCegarLoop]: Abstraction has 344 states and 549 transitions. [2025-03-03 15:01:07,695 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:01:07,695 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 549 transitions. [2025-03-03 15:01:07,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-03-03 15:01:07,698 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:01:07,698 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:01:07,698 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 15:01:07,699 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:01:07,700 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:01:07,700 INFO L85 PathProgramCache]: Analyzing trace with hash 268630423, now seen corresponding path program 1 times [2025-03-03 15:01:07,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:01:07,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [92225008] [2025-03-03 15:01:07,700 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:01:07,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:01:07,714 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-03-03 15:01:07,763 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-03-03 15:01:07,763 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:01:07,764 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:01:07,856 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:01:07,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:01:07,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [92225008] [2025-03-03 15:01:07,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [92225008] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:01:07,857 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:01:07,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:01:07,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503893203] [2025-03-03 15:01:07,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:01:07,857 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:01:07,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:01:07,858 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:01:07,858 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:01:07,858 INFO L87 Difference]: Start difference. First operand 344 states and 549 transitions. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:01:07,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:01:07,881 INFO L93 Difference]: Finished difference Result 896 states and 1451 transitions. [2025-03-03 15:01:07,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:01:07,882 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2025-03-03 15:01:07,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:01:07,884 INFO L225 Difference]: With dead ends: 896 [2025-03-03 15:01:07,884 INFO L226 Difference]: Without dead ends: 606 [2025-03-03 15:01:07,885 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:01:07,885 INFO L435 NwaCegarLoop]: 209 mSDtfsCounter, 113 mSDsluCounter, 183 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 392 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:01:07,886 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 392 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:01:07,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 606 states. [2025-03-03 15:01:07,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 606 to 600. [2025-03-03 15:01:07,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 600 states, 599 states have (on average 1.6043405676126878) internal successors, (961), 599 states have internal predecessors, (961), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:01:07,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 600 states and 961 transitions. [2025-03-03 15:01:07,908 INFO L78 Accepts]: Start accepts. Automaton has 600 states and 961 transitions. Word has length 60 [2025-03-03 15:01:07,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:01:07,909 INFO L471 AbstractCegarLoop]: Abstraction has 600 states and 961 transitions. [2025-03-03 15:01:07,909 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:01:07,910 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 961 transitions. [2025-03-03 15:01:07,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-03-03 15:01:07,913 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:01:07,913 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:01:07,913 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 15:01:07,913 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:01:07,914 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:01:07,914 INFO L85 PathProgramCache]: Analyzing trace with hash -341305846, now seen corresponding path program 1 times [2025-03-03 15:01:07,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:01:07,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1142149950] [2025-03-03 15:01:07,914 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:01:07,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:01:07,934 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-03 15:01:07,948 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-03 15:01:07,951 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:01:07,951 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:01:08,077 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:01:08,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:01:08,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1142149950] [2025-03-03 15:01:08,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1142149950] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:01:08,078 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:01:08,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 15:01:08,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1142342749] [2025-03-03 15:01:08,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:01:08,078 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:01:08,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:01:08,079 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:01:08,079 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:01:08,079 INFO L87 Difference]: Start difference. First operand 600 states and 961 transitions. Second operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:01:08,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:01:08,249 INFO L93 Difference]: Finished difference Result 2588 states and 4247 transitions. [2025-03-03 15:01:08,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 15:01:08,250 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2025-03-03 15:01:08,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:01:08,259 INFO L225 Difference]: With dead ends: 2588 [2025-03-03 15:01:08,260 INFO L226 Difference]: Without dead ends: 2042 [2025-03-03 15:01:08,261 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-03-03 15:01:08,262 INFO L435 NwaCegarLoop]: 214 mSDtfsCounter, 803 mSDsluCounter, 1313 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 803 SdHoareTripleChecker+Valid, 1527 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:01:08,262 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [803 Valid, 1527 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 15:01:08,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2042 states. [2025-03-03 15:01:08,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2042 to 1077. [2025-03-03 15:01:08,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1077 states, 1076 states have (on average 1.6161710037174721) internal successors, (1739), 1076 states have internal predecessors, (1739), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:01:08,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1077 states to 1077 states and 1739 transitions. [2025-03-03 15:01:08,302 INFO L78 Accepts]: Start accepts. Automaton has 1077 states and 1739 transitions. Word has length 62 [2025-03-03 15:01:08,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:01:08,303 INFO L471 AbstractCegarLoop]: Abstraction has 1077 states and 1739 transitions. [2025-03-03 15:01:08,303 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:01:08,303 INFO L276 IsEmpty]: Start isEmpty. Operand 1077 states and 1739 transitions. [2025-03-03 15:01:08,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-03-03 15:01:08,304 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:01:08,305 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:01:08,305 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 15:01:08,305 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:01:08,305 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:01:08,306 INFO L85 PathProgramCache]: Analyzing trace with hash -1988667811, now seen corresponding path program 1 times [2025-03-03 15:01:08,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:01:08,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691740942] [2025-03-03 15:01:08,306 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:01:08,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:01:08,318 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-03 15:01:08,330 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-03 15:01:08,330 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:01:08,330 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:01:08,405 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:01:08,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:01:08,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [691740942] [2025-03-03 15:01:08,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [691740942] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:01:08,406 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:01:08,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 15:01:08,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1267689774] [2025-03-03 15:01:08,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:01:08,406 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 15:01:08,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:01:08,407 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 15:01:08,407 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 15:01:08,407 INFO L87 Difference]: Start difference. First operand 1077 states and 1739 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:01:08,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:01:08,477 INFO L93 Difference]: Finished difference Result 3142 states and 5146 transitions. [2025-03-03 15:01:08,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 15:01:08,477 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2025-03-03 15:01:08,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:01:08,483 INFO L225 Difference]: With dead ends: 3142 [2025-03-03 15:01:08,483 INFO L226 Difference]: Without dead ends: 2119 [2025-03-03 15:01:08,484 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:01:08,485 INFO L435 NwaCegarLoop]: 211 mSDtfsCounter, 402 mSDsluCounter, 505 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 402 SdHoareTripleChecker+Valid, 716 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:01:08,485 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [402 Valid, 716 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:01:08,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2119 states. [2025-03-03 15:01:08,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2119 to 1589. [2025-03-03 15:01:08,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1589 states, 1588 states have (on average 1.6246851385390428) internal successors, (2580), 1588 states have internal predecessors, (2580), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:01:08,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1589 states to 1589 states and 2580 transitions. [2025-03-03 15:01:08,513 INFO L78 Accepts]: Start accepts. Automaton has 1589 states and 2580 transitions. Word has length 63 [2025-03-03 15:01:08,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:01:08,514 INFO L471 AbstractCegarLoop]: Abstraction has 1589 states and 2580 transitions. [2025-03-03 15:01:08,514 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:01:08,514 INFO L276 IsEmpty]: Start isEmpty. Operand 1589 states and 2580 transitions. [2025-03-03 15:01:08,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-03-03 15:01:08,515 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:01:08,515 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:01:08,515 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 15:01:08,516 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:01:08,516 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:01:08,516 INFO L85 PathProgramCache]: Analyzing trace with hash -1517370547, now seen corresponding path program 1 times [2025-03-03 15:01:08,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:01:08,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [947274661] [2025-03-03 15:01:08,518 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:01:08,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:01:08,528 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-03 15:01:08,537 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-03 15:01:08,538 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:01:08,538 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:01:08,607 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:01:08,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:01:08,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [947274661] [2025-03-03 15:01:08,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [947274661] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:01:08,608 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:01:08,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 15:01:08,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394436556] [2025-03-03 15:01:08,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:01:08,609 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 15:01:08,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:01:08,609 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 15:01:08,609 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 15:01:08,609 INFO L87 Difference]: Start difference. First operand 1589 states and 2580 transitions. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:01:08,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:01:08,678 INFO L93 Difference]: Finished difference Result 4610 states and 7544 transitions. [2025-03-03 15:01:08,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 15:01:08,678 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2025-03-03 15:01:08,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:01:08,687 INFO L225 Difference]: With dead ends: 4610 [2025-03-03 15:01:08,687 INFO L226 Difference]: Without dead ends: 3075 [2025-03-03 15:01:08,689 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:01:08,689 INFO L435 NwaCegarLoop]: 201 mSDtfsCounter, 402 mSDsluCounter, 507 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 402 SdHoareTripleChecker+Valid, 708 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:01:08,690 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [402 Valid, 708 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:01:08,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3075 states. [2025-03-03 15:01:08,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3075 to 2320. [2025-03-03 15:01:08,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2320 states, 2319 states have (on average 1.624407072013799) internal successors, (3767), 2319 states have internal predecessors, (3767), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:01:08,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2320 states to 2320 states and 3767 transitions. [2025-03-03 15:01:08,752 INFO L78 Accepts]: Start accepts. Automaton has 2320 states and 3767 transitions. Word has length 64 [2025-03-03 15:01:08,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:01:08,752 INFO L471 AbstractCegarLoop]: Abstraction has 2320 states and 3767 transitions. [2025-03-03 15:01:08,752 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:01:08,752 INFO L276 IsEmpty]: Start isEmpty. Operand 2320 states and 3767 transitions. [2025-03-03 15:01:08,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-03-03 15:01:08,753 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:01:08,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:01:08,753 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 15:01:08,753 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:01:08,754 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:01:08,754 INFO L85 PathProgramCache]: Analyzing trace with hash -10368838, now seen corresponding path program 1 times [2025-03-03 15:01:08,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:01:08,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896039413] [2025-03-03 15:01:08,754 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:01:08,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:01:08,764 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-03 15:01:08,771 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-03 15:01:08,771 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:01:08,771 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:01:08,798 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:01:08,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:01:08,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1896039413] [2025-03-03 15:01:08,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1896039413] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:01:08,798 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:01:08,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:01:08,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [300963908] [2025-03-03 15:01:08,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:01:08,799 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:01:08,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:01:08,799 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:01:08,799 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:01:08,800 INFO L87 Difference]: Start difference. First operand 2320 states and 3767 transitions. Second operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:01:08,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:01:08,826 INFO L93 Difference]: Finished difference Result 5132 states and 8430 transitions. [2025-03-03 15:01:08,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:01:08,827 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2025-03-03 15:01:08,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:01:08,836 INFO L225 Difference]: With dead ends: 5132 [2025-03-03 15:01:08,836 INFO L226 Difference]: Without dead ends: 3500 [2025-03-03 15:01:08,838 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:01:08,839 INFO L435 NwaCegarLoop]: 305 mSDtfsCounter, 122 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 489 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:01:08,839 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 489 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:01:08,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3500 states. [2025-03-03 15:01:08,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3500 to 3498. [2025-03-03 15:01:08,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3498 states, 3497 states have (on average 1.6299685444666858) internal successors, (5700), 3497 states have internal predecessors, (5700), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:01:08,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3498 states to 3498 states and 5700 transitions. [2025-03-03 15:01:08,901 INFO L78 Accepts]: Start accepts. Automaton has 3498 states and 5700 transitions. Word has length 65 [2025-03-03 15:01:08,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:01:08,901 INFO L471 AbstractCegarLoop]: Abstraction has 3498 states and 5700 transitions. [2025-03-03 15:01:08,902 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:01:08,902 INFO L276 IsEmpty]: Start isEmpty. Operand 3498 states and 5700 transitions. [2025-03-03 15:01:08,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-03-03 15:01:08,902 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:01:08,903 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:01:08,903 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 15:01:08,903 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:01:08,903 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:01:08,903 INFO L85 PathProgramCache]: Analyzing trace with hash 1670086369, now seen corresponding path program 1 times [2025-03-03 15:01:08,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:01:08,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [439955385] [2025-03-03 15:01:08,904 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:01:08,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:01:08,912 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-03 15:01:08,919 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-03 15:01:08,919 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:01:08,919 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:01:08,945 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:01:08,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:01:08,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [439955385] [2025-03-03 15:01:08,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [439955385] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:01:08,946 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:01:08,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:01:08,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293880254] [2025-03-03 15:01:08,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:01:08,946 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:01:08,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:01:08,947 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:01:08,947 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:01:08,947 INFO L87 Difference]: Start difference. First operand 3498 states and 5700 transitions. Second operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:01:08,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:01:08,989 INFO L93 Difference]: Finished difference Result 7636 states and 12514 transitions. [2025-03-03 15:01:08,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:01:08,990 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2025-03-03 15:01:08,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:01:09,003 INFO L225 Difference]: With dead ends: 7636 [2025-03-03 15:01:09,004 INFO L226 Difference]: Without dead ends: 5193 [2025-03-03 15:01:09,007 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:01:09,008 INFO L435 NwaCegarLoop]: 294 mSDtfsCounter, 117 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 479 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:01:09,008 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 479 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:01:09,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5193 states. [2025-03-03 15:01:09,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5193 to 5191. [2025-03-03 15:01:09,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5191 states, 5190 states have (on average 1.627552986512524) internal successors, (8447), 5190 states have internal predecessors, (8447), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:01:09,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5191 states to 5191 states and 8447 transitions. [2025-03-03 15:01:09,139 INFO L78 Accepts]: Start accepts. Automaton has 5191 states and 8447 transitions. Word has length 65 [2025-03-03 15:01:09,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:01:09,139 INFO L471 AbstractCegarLoop]: Abstraction has 5191 states and 8447 transitions. [2025-03-03 15:01:09,140 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:01:09,140 INFO L276 IsEmpty]: Start isEmpty. Operand 5191 states and 8447 transitions. [2025-03-03 15:01:09,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-03-03 15:01:09,140 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:01:09,140 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:01:09,141 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 15:01:09,141 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:01:09,141 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:01:09,141 INFO L85 PathProgramCache]: Analyzing trace with hash -598455206, now seen corresponding path program 1 times [2025-03-03 15:01:09,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:01:09,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [761510515] [2025-03-03 15:01:09,141 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:01:09,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:01:09,152 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-03 15:01:09,161 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-03 15:01:09,161 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:01:09,162 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:01:09,204 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:01:09,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:01:09,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [761510515] [2025-03-03 15:01:09,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [761510515] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:01:09,205 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:01:09,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:01:09,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1483423709] [2025-03-03 15:01:09,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:01:09,205 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:01:09,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:01:09,206 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:01:09,206 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:01:09,207 INFO L87 Difference]: Start difference. First operand 5191 states and 8447 transitions. Second operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:01:09,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:01:09,257 INFO L93 Difference]: Finished difference Result 10139 states and 16600 transitions. [2025-03-03 15:01:09,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:01:09,258 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2025-03-03 15:01:09,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:01:09,281 INFO L225 Difference]: With dead ends: 10139 [2025-03-03 15:01:09,281 INFO L226 Difference]: Without dead ends: 7146 [2025-03-03 15:01:09,287 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:01:09,287 INFO L435 NwaCegarLoop]: 276 mSDtfsCounter, 112 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 462 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:01:09,287 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 462 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:01:09,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7146 states. [2025-03-03 15:01:09,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7146 to 7144. [2025-03-03 15:01:09,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7144 states, 7143 states have (on average 1.624807503849923) internal successors, (11606), 7143 states have internal predecessors, (11606), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:01:09,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7144 states to 7144 states and 11606 transitions. [2025-03-03 15:01:09,407 INFO L78 Accepts]: Start accepts. Automaton has 7144 states and 11606 transitions. Word has length 65 [2025-03-03 15:01:09,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:01:09,407 INFO L471 AbstractCegarLoop]: Abstraction has 7144 states and 11606 transitions. [2025-03-03 15:01:09,407 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:01:09,407 INFO L276 IsEmpty]: Start isEmpty. Operand 7144 states and 11606 transitions. [2025-03-03 15:01:09,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-03-03 15:01:09,407 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:01:09,407 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:01:09,407 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 15:01:09,408 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:01:09,408 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:01:09,408 INFO L85 PathProgramCache]: Analyzing trace with hash 207853376, now seen corresponding path program 1 times [2025-03-03 15:01:09,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:01:09,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1522612911] [2025-03-03 15:01:09,408 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:01:09,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:01:09,421 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-03 15:01:09,429 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-03 15:01:09,429 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:01:09,429 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:01:09,505 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:01:09,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:01:09,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1522612911] [2025-03-03 15:01:09,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1522612911] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:01:09,505 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:01:09,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 15:01:09,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1636951930] [2025-03-03 15:01:09,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:01:09,505 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 15:01:09,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:01:09,506 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 15:01:09,506 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 15:01:09,506 INFO L87 Difference]: Start difference. First operand 7144 states and 11606 transitions. Second operand has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:01:09,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:01:09,619 INFO L93 Difference]: Finished difference Result 22325 states and 36431 transitions. [2025-03-03 15:01:09,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 15:01:09,620 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2025-03-03 15:01:09,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:01:09,656 INFO L225 Difference]: With dead ends: 22325 [2025-03-03 15:01:09,656 INFO L226 Difference]: Without dead ends: 15262 [2025-03-03 15:01:09,668 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:01:09,668 INFO L435 NwaCegarLoop]: 201 mSDtfsCounter, 400 mSDsluCounter, 509 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 400 SdHoareTripleChecker+Valid, 710 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:01:09,669 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [400 Valid, 710 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:01:09,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15262 states. [2025-03-03 15:01:09,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15262 to 11160. [2025-03-03 15:01:09,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11160 states, 11159 states have (on average 1.6188726588403979) internal successors, (18065), 11159 states have internal predecessors, (18065), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:01:09,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11160 states to 11160 states and 18065 transitions. [2025-03-03 15:01:09,882 INFO L78 Accepts]: Start accepts. Automaton has 11160 states and 18065 transitions. Word has length 65 [2025-03-03 15:01:09,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:01:09,882 INFO L471 AbstractCegarLoop]: Abstraction has 11160 states and 18065 transitions. [2025-03-03 15:01:09,882 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:01:09,883 INFO L276 IsEmpty]: Start isEmpty. Operand 11160 states and 18065 transitions. [2025-03-03 15:01:09,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-03-03 15:01:09,883 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:01:09,883 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:01:09,883 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 15:01:09,883 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:01:09,884 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:01:09,884 INFO L85 PathProgramCache]: Analyzing trace with hash -2064885630, now seen corresponding path program 1 times [2025-03-03 15:01:09,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:01:09,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2136251997] [2025-03-03 15:01:09,884 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:01:09,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:01:09,894 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-03-03 15:01:09,901 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-03-03 15:01:09,901 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:01:09,902 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:01:10,058 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:01:10,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:01:10,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2136251997] [2025-03-03 15:01:10,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2136251997] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:01:10,058 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:01:10,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 15:01:10,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [465731998] [2025-03-03 15:01:10,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:01:10,059 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:01:10,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:01:10,059 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:01:10,059 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:01:10,059 INFO L87 Difference]: Start difference. First operand 11160 states and 18065 transitions. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:01:10,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:01:10,189 INFO L93 Difference]: Finished difference Result 22241 states and 36020 transitions. [2025-03-03 15:01:10,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 15:01:10,189 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2025-03-03 15:01:10,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:01:10,207 INFO L225 Difference]: With dead ends: 22241 [2025-03-03 15:01:10,208 INFO L226 Difference]: Without dead ends: 11162 [2025-03-03 15:01:10,213 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:01:10,214 INFO L435 NwaCegarLoop]: 210 mSDtfsCounter, 227 mSDsluCounter, 370 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 227 SdHoareTripleChecker+Valid, 580 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:01:10,214 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [227 Valid, 580 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:01:10,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11162 states. [2025-03-03 15:01:10,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11162 to 11160. [2025-03-03 15:01:10,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11160 states, 11159 states have (on average 1.607670938256116) internal successors, (17940), 11159 states have internal predecessors, (17940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:01:10,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11160 states to 11160 states and 17940 transitions. [2025-03-03 15:01:10,386 INFO L78 Accepts]: Start accepts. Automaton has 11160 states and 17940 transitions. Word has length 67 [2025-03-03 15:01:10,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:01:10,386 INFO L471 AbstractCegarLoop]: Abstraction has 11160 states and 17940 transitions. [2025-03-03 15:01:10,386 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:01:10,386 INFO L276 IsEmpty]: Start isEmpty. Operand 11160 states and 17940 transitions. [2025-03-03 15:01:10,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-03-03 15:01:10,387 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:01:10,387 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:01:10,387 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-03 15:01:10,387 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:01:10,388 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:01:10,388 INFO L85 PathProgramCache]: Analyzing trace with hash -1098664329, now seen corresponding path program 1 times [2025-03-03 15:01:10,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:01:10,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1101957384] [2025-03-03 15:01:10,388 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:01:10,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:01:10,400 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-03 15:01:10,411 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-03 15:01:10,411 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:01:10,411 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:01:10,567 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:01:10,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:01:10,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1101957384] [2025-03-03 15:01:10,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1101957384] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:01:10,568 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:01:10,568 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 15:01:10,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344151114] [2025-03-03 15:01:10,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:01:10,569 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:01:10,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:01:10,569 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:01:10,569 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:01:10,569 INFO L87 Difference]: Start difference. First operand 11160 states and 17940 transitions. Second operand has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:01:10,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:01:10,716 INFO L93 Difference]: Finished difference Result 31943 states and 51512 transitions. [2025-03-03 15:01:10,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 15:01:10,716 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 70 [2025-03-03 15:01:10,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:01:10,753 INFO L225 Difference]: With dead ends: 31943 [2025-03-03 15:01:10,754 INFO L226 Difference]: Without dead ends: 20864 [2025-03-03 15:01:10,772 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:01:10,772 INFO L435 NwaCegarLoop]: 202 mSDtfsCounter, 112 mSDsluCounter, 570 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 772 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:01:10,773 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 772 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 15:01:10,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20864 states. [2025-03-03 15:01:11,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20864 to 20862. [2025-03-03 15:01:11,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20862 states, 20861 states have (on average 1.595944585590336) internal successors, (33293), 20861 states have internal predecessors, (33293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:01:11,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20862 states to 20862 states and 33293 transitions. [2025-03-03 15:01:11,064 INFO L78 Accepts]: Start accepts. Automaton has 20862 states and 33293 transitions. Word has length 70 [2025-03-03 15:01:11,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:01:11,064 INFO L471 AbstractCegarLoop]: Abstraction has 20862 states and 33293 transitions. [2025-03-03 15:01:11,064 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:01:11,064 INFO L276 IsEmpty]: Start isEmpty. Operand 20862 states and 33293 transitions. [2025-03-03 15:01:11,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-03-03 15:01:11,064 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:01:11,065 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:01:11,065 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-03 15:01:11,065 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:01:11,065 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:01:11,065 INFO L85 PathProgramCache]: Analyzing trace with hash 302099471, now seen corresponding path program 1 times [2025-03-03 15:01:11,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:01:11,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950412773] [2025-03-03 15:01:11,066 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:01:11,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:01:11,075 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-03 15:01:11,094 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-03 15:01:11,094 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:01:11,094 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:01:11,347 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:01:11,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:01:11,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1950412773] [2025-03-03 15:01:11,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1950412773] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:01:11,348 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:01:11,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 15:01:11,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [937963663] [2025-03-03 15:01:11,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:01:11,349 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:01:11,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:01:11,349 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:01:11,349 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:01:11,349 INFO L87 Difference]: Start difference. First operand 20862 states and 33293 transitions. Second operand has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:01:11,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:01:11,412 INFO L93 Difference]: Finished difference Result 21588 states and 34380 transitions. [2025-03-03 15:01:11,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 15:01:11,412 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 71 [2025-03-03 15:01:11,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:01:11,443 INFO L225 Difference]: With dead ends: 21588 [2025-03-03 15:01:11,443 INFO L226 Difference]: Without dead ends: 21586 [2025-03-03 15:01:11,451 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:01:11,451 INFO L435 NwaCegarLoop]: 209 mSDtfsCounter, 0 mSDsluCounter, 611 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 820 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:01:11,452 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 820 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:01:11,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21586 states. [2025-03-03 15:01:11,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21586 to 21586. [2025-03-03 15:01:11,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21586 states, 21585 states have (on average 1.5755385684503127) internal successors, (34008), 21585 states have internal predecessors, (34008), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:01:11,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21586 states to 21586 states and 34008 transitions. [2025-03-03 15:01:11,681 INFO L78 Accepts]: Start accepts. Automaton has 21586 states and 34008 transitions. Word has length 71 [2025-03-03 15:01:11,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:01:11,681 INFO L471 AbstractCegarLoop]: Abstraction has 21586 states and 34008 transitions. [2025-03-03 15:01:11,681 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:01:11,682 INFO L276 IsEmpty]: Start isEmpty. Operand 21586 states and 34008 transitions. [2025-03-03 15:01:11,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-03-03 15:01:11,683 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:01:11,683 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:01:11,683 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-03 15:01:11,683 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:01:11,684 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:01:11,684 INFO L85 PathProgramCache]: Analyzing trace with hash 996536466, now seen corresponding path program 1 times [2025-03-03 15:01:11,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:01:11,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [852296505] [2025-03-03 15:01:11,684 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:01:11,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:01:11,694 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-03-03 15:01:11,704 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-03-03 15:01:11,704 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:01:11,704 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:01:11,790 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-03 15:01:11,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:01:11,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [852296505] [2025-03-03 15:01:11,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [852296505] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:01:11,790 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:01:11,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 15:01:11,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1266640015] [2025-03-03 15:01:11,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:01:11,791 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:01:11,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:01:11,791 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:01:11,791 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:01:11,791 INFO L87 Difference]: Start difference. First operand 21586 states and 34008 transitions. Second operand has 5 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:01:12,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:01:12,025 INFO L93 Difference]: Finished difference Result 52832 states and 83652 transitions. [2025-03-03 15:01:12,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 15:01:12,026 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 0 states have call successors, (0), 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 93 [2025-03-03 15:01:12,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:01:12,102 INFO L225 Difference]: With dead ends: 52832 [2025-03-03 15:01:12,102 INFO L226 Difference]: Without dead ends: 42410 [2025-03-03 15:01:12,121 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:01:12,122 INFO L435 NwaCegarLoop]: 337 mSDtfsCounter, 505 mSDsluCounter, 699 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 505 SdHoareTripleChecker+Valid, 1036 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:01:12,122 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [505 Valid, 1036 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 15:01:12,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42410 states. [2025-03-03 15:01:12,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42410 to 33142. [2025-03-03 15:01:12,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33142 states, 33141 states have (on average 1.57424338432757) internal successors, (52172), 33141 states have internal predecessors, (52172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:01:12,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33142 states to 33142 states and 52172 transitions. [2025-03-03 15:01:12,663 INFO L78 Accepts]: Start accepts. Automaton has 33142 states and 52172 transitions. Word has length 93 [2025-03-03 15:01:12,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:01:12,663 INFO L471 AbstractCegarLoop]: Abstraction has 33142 states and 52172 transitions. [2025-03-03 15:01:12,663 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:01:12,663 INFO L276 IsEmpty]: Start isEmpty. Operand 33142 states and 52172 transitions. [2025-03-03 15:01:12,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-03-03 15:01:12,666 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:01:12,666 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:01:12,666 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-03 15:01:12,666 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:01:12,667 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:01:12,667 INFO L85 PathProgramCache]: Analyzing trace with hash -1617975623, now seen corresponding path program 1 times [2025-03-03 15:01:12,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:01:12,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1581189594] [2025-03-03 15:01:12,667 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:01:12,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:01:12,684 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-03-03 15:01:12,694 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-03-03 15:01:12,694 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:01:12,695 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:01:12,798 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-03 15:01:12,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:01:12,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1581189594] [2025-03-03 15:01:12,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1581189594] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:01:12,798 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:01:12,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 15:01:12,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629987869] [2025-03-03 15:01:12,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:01:12,799 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:01:12,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:01:12,799 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:01:12,800 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:01:12,800 INFO L87 Difference]: Start difference. First operand 33142 states and 52172 transitions. Second operand has 5 states, 5 states have (on average 17.6) internal successors, (88), 5 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:01:13,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:01:13,032 INFO L93 Difference]: Finished difference Result 59242 states and 93832 transitions. [2025-03-03 15:01:13,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 15:01:13,033 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.6) internal successors, (88), 5 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 93 [2025-03-03 15:01:13,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:01:13,109 INFO L225 Difference]: With dead ends: 59242 [2025-03-03 15:01:13,109 INFO L226 Difference]: Without dead ends: 49050 [2025-03-03 15:01:13,133 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:01:13,134 INFO L435 NwaCegarLoop]: 341 mSDtfsCounter, 511 mSDsluCounter, 599 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 511 SdHoareTripleChecker+Valid, 940 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:01:13,137 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [511 Valid, 940 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 15:01:13,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49050 states. [2025-03-03 15:01:13,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49050 to 44900. [2025-03-03 15:01:13,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44900 states, 44899 states have (on average 1.5767834472928128) internal successors, (70796), 44899 states have internal predecessors, (70796), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:01:13,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44900 states to 44900 states and 70796 transitions. [2025-03-03 15:01:13,877 INFO L78 Accepts]: Start accepts. Automaton has 44900 states and 70796 transitions. Word has length 93 [2025-03-03 15:01:13,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:01:13,877 INFO L471 AbstractCegarLoop]: Abstraction has 44900 states and 70796 transitions. [2025-03-03 15:01:13,877 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.6) internal successors, (88), 5 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:01:13,878 INFO L276 IsEmpty]: Start isEmpty. Operand 44900 states and 70796 transitions. [2025-03-03 15:01:13,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-03-03 15:01:13,879 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:01:13,879 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:01:13,880 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-03 15:01:13,880 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:01:13,880 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:01:13,880 INFO L85 PathProgramCache]: Analyzing trace with hash 408450098, now seen corresponding path program 1 times [2025-03-03 15:01:13,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:01:13,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [819324694] [2025-03-03 15:01:13,880 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:01:13,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:01:13,895 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-03-03 15:01:13,904 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-03-03 15:01:13,905 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:01:13,905 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:01:13,985 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-03-03 15:01:13,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:01:13,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [819324694] [2025-03-03 15:01:13,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [819324694] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:01:13,986 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:01:13,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 15:01:13,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1919889225] [2025-03-03 15:01:13,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:01:13,987 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:01:13,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:01:13,987 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:01:13,987 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:01:13,987 INFO L87 Difference]: Start difference. First operand 44900 states and 70796 transitions. Second operand has 5 states, 5 states have (on average 16.6) internal successors, (83), 5 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:01:14,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:01:14,182 INFO L93 Difference]: Finished difference Result 63294 states and 100268 transitions. [2025-03-03 15:01:14,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 15:01:14,182 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.6) internal successors, (83), 5 states have internal predecessors, (83), 0 states have call successors, (0), 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 93 [2025-03-03 15:01:14,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:01:14,257 INFO L225 Difference]: With dead ends: 63294 [2025-03-03 15:01:14,258 INFO L226 Difference]: Without dead ends: 53102 [2025-03-03 15:01:14,281 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:01:14,282 INFO L435 NwaCegarLoop]: 345 mSDtfsCounter, 518 mSDsluCounter, 624 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 518 SdHoareTripleChecker+Valid, 969 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:01:14,282 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [518 Valid, 969 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:01:14,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53102 states. [2025-03-03 15:01:14,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53102 to 51448. [2025-03-03 15:01:14,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51448 states, 51447 states have (on average 1.5791008222053764) internal successors, (81240), 51447 states have internal predecessors, (81240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:01:15,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51448 states to 51448 states and 81240 transitions. [2025-03-03 15:01:15,115 INFO L78 Accepts]: Start accepts. Automaton has 51448 states and 81240 transitions. Word has length 93 [2025-03-03 15:01:15,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:01:15,115 INFO L471 AbstractCegarLoop]: Abstraction has 51448 states and 81240 transitions. [2025-03-03 15:01:15,115 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.6) internal successors, (83), 5 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:01:15,115 INFO L276 IsEmpty]: Start isEmpty. Operand 51448 states and 81240 transitions. [2025-03-03 15:01:15,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-03-03 15:01:15,117 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:01:15,117 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:01:15,117 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-03 15:01:15,117 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:01:15,118 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:01:15,119 INFO L85 PathProgramCache]: Analyzing trace with hash 829738197, now seen corresponding path program 1 times [2025-03-03 15:01:15,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:01:15,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1478038465] [2025-03-03 15:01:15,122 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:01:15,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:01:15,148 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-03 15:01:15,176 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-03 15:01:15,180 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:01:15,181 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:01:15,292 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-03 15:01:15,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:01:15,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1478038465] [2025-03-03 15:01:15,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1478038465] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:01:15,293 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:01:15,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 15:01:15,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2098388013] [2025-03-03 15:01:15,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:01:15,294 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 15:01:15,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:01:15,294 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 15:01:15,294 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 15:01:15,294 INFO L87 Difference]: Start difference. First operand 51448 states and 81240 transitions. Second operand has 4 states, 4 states have (on average 23.5) internal successors, (94), 4 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:01:15,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:01:15,549 INFO L93 Difference]: Finished difference Result 83821 states and 133089 transitions. [2025-03-03 15:01:15,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 15:01:15,550 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.5) internal successors, (94), 4 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 94 [2025-03-03 15:01:15,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:01:15,649 INFO L225 Difference]: With dead ends: 83821 [2025-03-03 15:01:15,649 INFO L226 Difference]: Without dead ends: 66759 [2025-03-03 15:01:15,681 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 15:01:15,682 INFO L435 NwaCegarLoop]: 331 mSDtfsCounter, 236 mSDsluCounter, 328 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 236 SdHoareTripleChecker+Valid, 659 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:01:15,682 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [236 Valid, 659 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:01:15,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66759 states. [2025-03-03 15:01:16,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66759 to 65107. [2025-03-03 15:01:16,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65107 states, 65106 states have (on average 1.5796086382207477) internal successors, (102842), 65106 states have internal predecessors, (102842), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:01:16,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65107 states to 65107 states and 102842 transitions. [2025-03-03 15:01:16,600 INFO L78 Accepts]: Start accepts. Automaton has 65107 states and 102842 transitions. Word has length 94 [2025-03-03 15:01:16,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:01:16,600 INFO L471 AbstractCegarLoop]: Abstraction has 65107 states and 102842 transitions. [2025-03-03 15:01:16,600 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.5) internal successors, (94), 4 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:01:16,600 INFO L276 IsEmpty]: Start isEmpty. Operand 65107 states and 102842 transitions. [2025-03-03 15:01:16,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-03-03 15:01:16,601 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:01:16,601 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:01:16,602 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-03 15:01:16,602 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:01:16,602 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:01:16,602 INFO L85 PathProgramCache]: Analyzing trace with hash -1164406509, now seen corresponding path program 1 times [2025-03-03 15:01:16,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:01:16,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [132385266] [2025-03-03 15:01:16,602 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:01:16,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:01:16,612 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-03 15:01:16,619 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-03 15:01:16,619 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:01:16,619 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:01:16,649 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-03 15:01:16,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:01:16,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [132385266] [2025-03-03 15:01:16,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [132385266] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:01:16,649 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:01:16,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:01:16,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1929317908] [2025-03-03 15:01:16,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:01:16,649 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:01:16,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:01:16,650 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:01:16,650 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:01:16,650 INFO L87 Difference]: Start difference. First operand 65107 states and 102842 transitions. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:01:16,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:01:16,937 INFO L93 Difference]: Finished difference Result 140452 states and 222734 transitions. [2025-03-03 15:01:16,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:01:16,938 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 94 [2025-03-03 15:01:16,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:01:17,286 INFO L225 Difference]: With dead ends: 140452 [2025-03-03 15:01:17,286 INFO L226 Difference]: Without dead ends: 109892 [2025-03-03 15:01:17,317 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:01:17,318 INFO L435 NwaCegarLoop]: 207 mSDtfsCounter, 103 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 389 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:01:17,318 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 389 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:01:17,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109892 states. [2025-03-03 15:01:18,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109892 to 109614. [2025-03-03 15:01:18,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109614 states, 109613 states have (on average 1.5802961327579759) internal successors, (173221), 109613 states have internal predecessors, (173221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:01:18,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109614 states to 109614 states and 173221 transitions. [2025-03-03 15:01:18,592 INFO L78 Accepts]: Start accepts. Automaton has 109614 states and 173221 transitions. Word has length 94 [2025-03-03 15:01:18,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:01:18,592 INFO L471 AbstractCegarLoop]: Abstraction has 109614 states and 173221 transitions. [2025-03-03 15:01:18,592 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:01:18,592 INFO L276 IsEmpty]: Start isEmpty. Operand 109614 states and 173221 transitions. [2025-03-03 15:01:18,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-03-03 15:01:18,594 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:01:18,594 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:01:18,594 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-03 15:01:18,594 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:01:18,595 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:01:18,595 INFO L85 PathProgramCache]: Analyzing trace with hash 797651953, now seen corresponding path program 1 times [2025-03-03 15:01:18,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:01:18,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1745020442] [2025-03-03 15:01:18,595 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:01:18,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:01:18,606 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-03 15:01:18,614 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-03 15:01:18,614 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:01:18,614 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:01:18,648 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:01:18,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:01:18,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1745020442] [2025-03-03 15:01:18,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1745020442] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:01:18,649 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:01:18,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:01:18,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [484194734] [2025-03-03 15:01:18,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:01:18,649 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:01:18,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:01:18,650 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:01:18,650 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:01:18,650 INFO L87 Difference]: Start difference. First operand 109614 states and 173221 transitions. Second operand has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:01:19,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:01:19,837 INFO L93 Difference]: Finished difference Result 322892 states and 510250 transitions. [2025-03-03 15:01:19,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:01:19,838 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 95 [2025-03-03 15:01:19,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:01:20,119 INFO L225 Difference]: With dead ends: 322892 [2025-03-03 15:01:20,119 INFO L226 Difference]: Without dead ends: 213359 [2025-03-03 15:01:20,165 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:01:20,165 INFO L435 NwaCegarLoop]: 301 mSDtfsCounter, 160 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 505 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:01:20,165 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 505 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:01:20,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213359 states. [2025-03-03 15:01:22,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213359 to 213357. [2025-03-03 15:01:22,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213357 states, 213356 states have (on average 1.5698222688839312) internal successors, (334931), 213356 states have internal predecessors, (334931), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:01:23,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213357 states to 213357 states and 334931 transitions. [2025-03-03 15:01:23,325 INFO L78 Accepts]: Start accepts. Automaton has 213357 states and 334931 transitions. Word has length 95 [2025-03-03 15:01:23,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:01:23,326 INFO L471 AbstractCegarLoop]: Abstraction has 213357 states and 334931 transitions. [2025-03-03 15:01:23,326 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:01:23,326 INFO L276 IsEmpty]: Start isEmpty. Operand 213357 states and 334931 transitions. [2025-03-03 15:01:23,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-03-03 15:01:23,331 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:01:23,332 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:01:23,332 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-03 15:01:23,332 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:01:23,333 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:01:23,333 INFO L85 PathProgramCache]: Analyzing trace with hash -831271151, now seen corresponding path program 1 times [2025-03-03 15:01:23,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:01:23,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [298483803] [2025-03-03 15:01:23,333 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:01:23,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:01:23,347 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-03 15:01:23,358 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-03 15:01:23,358 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:01:23,358 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:01:23,388 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:01:23,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:01:23,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [298483803] [2025-03-03 15:01:23,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [298483803] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:01:23,389 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:01:23,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:01:23,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [178643081] [2025-03-03 15:01:23,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:01:23,389 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:01:23,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:01:23,390 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:01:23,390 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:01:23,390 INFO L87 Difference]: Start difference. First operand 213357 states and 334931 transitions. Second operand has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:01:25,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:01:25,247 INFO L93 Difference]: Finished difference Result 628195 states and 986003 transitions. [2025-03-03 15:01:25,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:01:25,248 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 95 [2025-03-03 15:01:25,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:01:26,075 INFO L225 Difference]: With dead ends: 628195 [2025-03-03 15:01:26,075 INFO L226 Difference]: Without dead ends: 414965 [2025-03-03 15:01:26,574 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:01:26,575 INFO L435 NwaCegarLoop]: 269 mSDtfsCounter, 142 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 473 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:01:26,575 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 473 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:01:26,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 414965 states. [2025-03-03 15:01:30,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 414965 to 414963. [2025-03-03 15:01:30,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 414963 states, 414962 states have (on average 1.5587475479682478) internal successors, (646821), 414962 states have internal predecessors, (646821), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:01:32,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 414963 states to 414963 states and 646821 transitions. [2025-03-03 15:01:32,455 INFO L78 Accepts]: Start accepts. Automaton has 414963 states and 646821 transitions. Word has length 95 [2025-03-03 15:01:32,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:01:32,455 INFO L471 AbstractCegarLoop]: Abstraction has 414963 states and 646821 transitions. [2025-03-03 15:01:32,455 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:01:32,455 INFO L276 IsEmpty]: Start isEmpty. Operand 414963 states and 646821 transitions. [2025-03-03 15:01:32,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-03-03 15:01:32,459 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:01:32,459 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:01:32,459 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-03 15:01:32,459 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:01:32,460 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:01:32,460 INFO L85 PathProgramCache]: Analyzing trace with hash -36379588, now seen corresponding path program 1 times [2025-03-03 15:01:32,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:01:32,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [195571689] [2025-03-03 15:01:32,460 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:01:32,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:01:32,488 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-03 15:01:32,506 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-03 15:01:32,507 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:01:32,507 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:01:32,579 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-03 15:01:32,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:01:32,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [195571689] [2025-03-03 15:01:32,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [195571689] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:01:32,579 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:01:32,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 15:01:32,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449196612] [2025-03-03 15:01:32,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:01:32,580 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 15:01:32,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:01:32,580 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 15:01:32,581 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 15:01:32,581 INFO L87 Difference]: Start difference. First operand 414963 states and 646821 transitions. Second operand has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:01:34,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:01:34,752 INFO L93 Difference]: Finished difference Result 635245 states and 994428 transitions. [2025-03-03 15:01:34,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 15:01:34,753 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 95 [2025-03-03 15:01:34,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:01:36,323 INFO L225 Difference]: With dead ends: 635245 [2025-03-03 15:01:36,323 INFO L226 Difference]: Without dead ends: 515203 [2025-03-03 15:01:36,426 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 15:01:36,428 INFO L435 NwaCegarLoop]: 330 mSDtfsCounter, 240 mSDsluCounter, 328 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 240 SdHoareTripleChecker+Valid, 658 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:01:36,429 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [240 Valid, 658 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:01:36,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 515203 states. [2025-03-03 15:01:41,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 515203 to 490175. [2025-03-03 15:01:41,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 490175 states, 490174 states have (on average 1.5577835625716583) internal successors, (763585), 490174 states have internal predecessors, (763585), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:01:43,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 490175 states to 490175 states and 763585 transitions. [2025-03-03 15:01:43,475 INFO L78 Accepts]: Start accepts. Automaton has 490175 states and 763585 transitions. Word has length 95 [2025-03-03 15:01:43,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:01:43,476 INFO L471 AbstractCegarLoop]: Abstraction has 490175 states and 763585 transitions. [2025-03-03 15:01:43,476 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:01:43,476 INFO L276 IsEmpty]: Start isEmpty. Operand 490175 states and 763585 transitions. [2025-03-03 15:01:43,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-03-03 15:01:43,479 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:01:43,480 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:01:43,480 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-03 15:01:43,480 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:01:43,480 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:01:43,480 INFO L85 PathProgramCache]: Analyzing trace with hash -1047496838, now seen corresponding path program 1 times [2025-03-03 15:01:43,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:01:43,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246447247] [2025-03-03 15:01:43,480 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:01:43,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:01:43,493 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-03 15:01:43,501 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-03 15:01:43,502 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:01:43,502 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:01:43,543 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-03 15:01:43,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:01:43,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1246447247] [2025-03-03 15:01:43,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1246447247] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:01:43,548 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:01:43,548 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:01:43,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1269204188] [2025-03-03 15:01:43,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:01:43,548 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:01:43,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:01:43,548 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:01:43,548 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:01:43,549 INFO L87 Difference]: Start difference. First operand 490175 states and 763585 transitions. Second operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:01:47,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:01:47,265 INFO L93 Difference]: Finished difference Result 1037511 states and 1620881 transitions. [2025-03-03 15:01:47,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:01:47,266 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 95 [2025-03-03 15:01:47,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:01:49,008 INFO L225 Difference]: With dead ends: 1037511 [2025-03-03 15:01:49,008 INFO L226 Difference]: Without dead ends: 805693 [2025-03-03 15:01:49,282 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:01:49,284 INFO L435 NwaCegarLoop]: 202 mSDtfsCounter, 103 mSDsluCounter, 183 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 385 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:01:49,284 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 385 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:01:49,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 805693 states.