./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.4.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed 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_opt-floodmax.4.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 37e549e4fa4b7b530556a3e37b4e2d4806fbb92dab5da0115a6c327b48fa0370 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 06:31:48,840 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 06:31:48,885 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 06:31:48,889 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 06:31:48,889 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 06:31:48,911 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 06:31:48,911 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 06:31:48,911 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 06:31:48,912 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 06:31:48,912 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 06:31:48,912 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 06:31:48,912 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 06:31:48,912 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 06:31:48,914 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 06:31:48,915 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 06:31:48,915 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 06:31:48,915 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 06:31:48,915 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 06:31:48,915 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 06:31:48,915 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 06:31:48,915 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 06:31:48,915 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 06:31:48,915 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 06:31:48,915 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 06:31:48,915 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 06:31:48,915 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 06:31:48,915 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 06:31:48,915 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 06:31:48,916 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 06:31:48,916 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 06:31:48,916 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 06:31:48,916 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 06:31:48,916 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 06:31:48,916 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 06:31:48,916 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 06:31:48,916 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 06:31:48,916 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 06:31:48,916 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 06:31:48,916 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 06:31:48,916 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 06:31:48,916 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 06:31:48,916 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 06:31:48,916 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 06:31:48,916 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 -> 37e549e4fa4b7b530556a3e37b4e2d4806fbb92dab5da0115a6c327b48fa0370 [2025-03-08 06:31:49,140 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 06:31:49,150 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 06:31:49,152 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 06:31:49,154 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 06:31:49,154 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 06:31:49,156 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.4.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2025-03-08 06:31:50,369 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/06ee13357/13190a60a6144e8ea96a28f1450ab0a3/FLAGa6e0be4b6 [2025-03-08 06:31:50,730 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 06:31:50,734 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.4.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2025-03-08 06:31:50,752 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/06ee13357/13190a60a6144e8ea96a28f1450ab0a3/FLAGa6e0be4b6 [2025-03-08 06:31:50,972 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/06ee13357/13190a60a6144e8ea96a28f1450ab0a3 [2025-03-08 06:31:50,973 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 06:31:50,974 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 06:31:50,975 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 06:31:50,975 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 06:31:50,978 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 06:31:50,979 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 06:31:50" (1/1) ... [2025-03-08 06:31:50,979 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@79600425 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:31:50, skipping insertion in model container [2025-03-08 06:31:50,979 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 06:31:50" (1/1) ... [2025-03-08 06:31:51,021 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 06:31:51,262 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_opt-floodmax.4.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c[13490,13503] [2025-03-08 06:31:51,328 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 06:31:51,345 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 06:31:51,396 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_opt-floodmax.4.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c[13490,13503] [2025-03-08 06:31:51,419 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 06:31:51,433 INFO L204 MainTranslator]: Completed translation [2025-03-08 06:31:51,434 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:31:51 WrapperNode [2025-03-08 06:31:51,434 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 06:31:51,438 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 06:31:51,438 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 06:31:51,438 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 06:31:51,444 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:31:51" (1/1) ... [2025-03-08 06:31:51,458 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:31:51" (1/1) ... [2025-03-08 06:31:51,498 INFO L138 Inliner]: procedures = 24, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 1415 [2025-03-08 06:31:51,498 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 06:31:51,499 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 06:31:51,499 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 06:31:51,499 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 06:31:51,506 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:31:51" (1/1) ... [2025-03-08 06:31:51,507 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:31:51" (1/1) ... [2025-03-08 06:31:51,512 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:31:51" (1/1) ... [2025-03-08 06:31:51,541 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-08 06:31:51,542 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:31:51" (1/1) ... [2025-03-08 06:31:51,542 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:31:51" (1/1) ... [2025-03-08 06:31:51,555 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:31:51" (1/1) ... [2025-03-08 06:31:51,558 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:31:51" (1/1) ... [2025-03-08 06:31:51,560 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:31:51" (1/1) ... [2025-03-08 06:31:51,562 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:31:51" (1/1) ... [2025-03-08 06:31:51,566 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 06:31:51,567 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 06:31:51,567 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 06:31:51,567 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 06:31:51,568 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:31:51" (1/1) ... [2025-03-08 06:31:51,571 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 06:31:51,583 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 06:31:51,602 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-08 06:31:51,605 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-08 06:31:51,624 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 06:31:51,624 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 06:31:51,624 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 06:31:51,624 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 06:31:51,733 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 06:31:51,734 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 06:31:52,748 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L597: havoc main_~node4__newmax~0#1; [2025-03-08 06:31:52,749 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L702: havoc main_~__tmp_1~0#1, main_~assert__arg~0#1;havoc main_~check__tmp~0#1; [2025-03-08 06:31:52,749 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L505: havoc main_~node2__newmax~0#1; [2025-03-08 06:31:52,749 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1376: havoc main_~node1____CPAchecker_TMP_2~0#1;havoc main_~node1____CPAchecker_TMP_1~0#1;havoc main_~node1____CPAchecker_TMP_0~0#1; [2025-03-08 06:31:52,749 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1211: havoc main_~node2____CPAchecker_TMP_2~0#1;havoc main_~node2____CPAchecker_TMP_1~0#1;havoc main_~node2____CPAchecker_TMP_0~0#1; [2025-03-08 06:31:52,749 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1046: havoc main_~node3____CPAchecker_TMP_2~0#1;havoc main_~node3____CPAchecker_TMP_1~0#1;havoc main_~node3____CPAchecker_TMP_0~0#1; [2025-03-08 06:31:52,749 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L881: havoc main_~node4____CPAchecker_TMP_2~0#1;havoc main_~node4____CPAchecker_TMP_1~0#1;havoc main_~node4____CPAchecker_TMP_0~0#1; [2025-03-08 06:31:52,749 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L551: havoc main_~node3__newmax~0#1; [2025-03-08 06:31:52,749 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L459: havoc main_~node1__newmax~0#1;havoc main_~init__r121~0#1, main_~init__r131~0#1, main_~init__r141~0#1, main_~init__r211~0#1, main_~init__r231~0#1, main_~init__r241~0#1, main_~init__r311~0#1, main_~init__r321~0#1, main_~init__r341~0#1, main_~init__r411~0#1, main_~init__r421~0#1, main_~init__r431~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__r142~0#1, main_~init__tmp___1~0#1, main_~init__r212~0#1, main_~init__tmp___2~0#1, main_~init__r232~0#1, main_~init__tmp___3~0#1, main_~init__r242~0#1, main_~init__tmp___4~0#1, main_~init__r312~0#1, main_~init__tmp___5~0#1, main_~init__r322~0#1, main_~init__tmp___6~0#1, main_~init__r342~0#1, main_~init__tmp___7~0#1, main_~init__r412~0#1, main_~init__tmp___8~0#1, main_~init__r422~0#1, main_~init__tmp___9~0#1, main_~init__r432~0#1, main_~init__tmp___10~0#1, main_~init__r123~0#1, main_~init__tmp___11~0#1, main_~init__r133~0#1, main_~init__tmp___12~0#1, main_~init__r143~0#1, main_~init__tmp___13~0#1, main_~init__r213~0#1, main_~init__tmp___14~0#1, main_~init__r233~0#1, main_~init__tmp___15~0#1, main_~init__r243~0#1, main_~init__tmp___16~0#1, main_~init__r313~0#1, main_~init__tmp___17~0#1, main_~init__r323~0#1, main_~init__tmp___18~0#1, main_~init__r343~0#1, main_~init__tmp___19~0#1, main_~init__r413~0#1, main_~init__tmp___20~0#1, main_~init__r423~0#1, main_~init__tmp___21~0#1, main_~init__r433~0#1, main_~init__tmp___22~0#1, main_~init__tmp___23~0#1; [2025-03-08 06:31:52,858 INFO L? ?]: Removed 111 outVars from TransFormulas that were not future-live. [2025-03-08 06:31:52,858 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 06:31:52,870 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 06:31:52,870 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 06:31:52,871 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 06:31:52 BoogieIcfgContainer [2025-03-08 06:31:52,871 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 06:31:52,872 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 06:31:52,872 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 06:31:52,879 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 06:31:52,879 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 06:31:50" (1/3) ... [2025-03-08 06:31:52,880 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9af7cd2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 06:31:52, skipping insertion in model container [2025-03-08 06:31:52,880 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:31:51" (2/3) ... [2025-03-08 06:31:52,880 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9af7cd2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 06:31:52, skipping insertion in model container [2025-03-08 06:31:52,880 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 06:31:52" (3/3) ... [2025-03-08 06:31:52,881 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_opt-floodmax.4.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2025-03-08 06:31:52,893 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 06:31:52,896 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_opt-floodmax.4.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c that has 1 procedures, 338 locations, 1 initial locations, 0 loop locations, and 1 error locations. [2025-03-08 06:31:52,949 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 06:31:52,959 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;@f0bf954, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 06:31:52,960 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 06:31:52,964 INFO L276 IsEmpty]: Start isEmpty. Operand has 338 states, 336 states have (on average 1.7797619047619047) internal successors, (598), 337 states have internal predecessors, (598), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:31:52,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-03-08 06:31:52,978 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:31:52,979 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 06:31:52,980 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:31:52,983 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:31:52,984 INFO L85 PathProgramCache]: Analyzing trace with hash -1003903146, now seen corresponding path program 1 times [2025-03-08 06:31:52,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:31:52,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655201030] [2025-03-08 06:31:52,992 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:31:52,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:31:53,083 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-03-08 06:31:53,243 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-03-08 06:31:53,244 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:31:53,245 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:31:53,581 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-08 06:31:53,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:31:53,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [655201030] [2025-03-08 06:31:53,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [655201030] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:31:53,584 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:31:53,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 06:31:53,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1301850951] [2025-03-08 06:31:53,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:31:53,588 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 06:31:53,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:31:53,605 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 06:31:53,606 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:31:53,609 INFO L87 Difference]: Start difference. First operand has 338 states, 336 states have (on average 1.7797619047619047) internal successors, (598), 337 states have internal predecessors, (598), 0 states have call successors, (0), 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 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:31:53,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:31:53,709 INFO L93 Difference]: Finished difference Result 640 states and 1100 transitions. [2025-03-08 06:31:53,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 06:31:53,711 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 106 [2025-03-08 06:31:53,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:31:53,732 INFO L225 Difference]: With dead ends: 640 [2025-03-08 06:31:53,732 INFO L226 Difference]: Without dead ends: 477 [2025-03-08 06:31:53,735 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-08 06:31:53,736 INFO L435 NwaCegarLoop]: 592 mSDtfsCounter, 254 mSDsluCounter, 530 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 254 SdHoareTripleChecker+Valid, 1122 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-08 06:31:53,738 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [254 Valid, 1122 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 06:31:53,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 477 states. [2025-03-08 06:31:53,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 477 to 474. [2025-03-08 06:31:53,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 474 states, 473 states have (on average 1.668076109936575) internal successors, (789), 473 states have internal predecessors, (789), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:31:53,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 474 states to 474 states and 789 transitions. [2025-03-08 06:31:53,788 INFO L78 Accepts]: Start accepts. Automaton has 474 states and 789 transitions. Word has length 106 [2025-03-08 06:31:53,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:31:53,789 INFO L471 AbstractCegarLoop]: Abstraction has 474 states and 789 transitions. [2025-03-08 06:31:53,789 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:31:53,789 INFO L276 IsEmpty]: Start isEmpty. Operand 474 states and 789 transitions. [2025-03-08 06:31:53,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-03-08 06:31:53,794 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:31:53,794 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 06:31:53,794 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 06:31:53,795 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:31:53,795 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:31:53,795 INFO L85 PathProgramCache]: Analyzing trace with hash -1018413683, now seen corresponding path program 1 times [2025-03-08 06:31:53,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:31:53,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1797867753] [2025-03-08 06:31:53,795 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:31:53,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:31:53,824 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-08 06:31:53,862 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-08 06:31:53,862 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:31:53,862 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:31:54,027 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-08 06:31:54,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:31:54,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1797867753] [2025-03-08 06:31:54,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1797867753] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:31:54,027 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:31:54,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 06:31:54,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [213127328] [2025-03-08 06:31:54,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:31:54,028 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 06:31:54,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:31:54,029 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 06:31:54,029 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:31:54,029 INFO L87 Difference]: Start difference. First operand 474 states and 789 transitions. Second operand has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:31:54,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:31:54,076 INFO L93 Difference]: Finished difference Result 1040 states and 1729 transitions. [2025-03-08 06:31:54,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 06:31:54,077 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 0 states have call successors, (0), 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 109 [2025-03-08 06:31:54,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:31:54,082 INFO L225 Difference]: With dead ends: 1040 [2025-03-08 06:31:54,082 INFO L226 Difference]: Without dead ends: 747 [2025-03-08 06:31:54,083 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-08 06:31:54,084 INFO L435 NwaCegarLoop]: 557 mSDtfsCounter, 229 mSDsluCounter, 527 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 229 SdHoareTripleChecker+Valid, 1084 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-08 06:31:54,084 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [229 Valid, 1084 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:31:54,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 747 states. [2025-03-08 06:31:54,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 747 to 743. [2025-03-08 06:31:54,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 743 states, 742 states have (on average 1.6630727762803235) internal successors, (1234), 742 states have internal predecessors, (1234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:31:54,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 743 states to 743 states and 1234 transitions. [2025-03-08 06:31:54,117 INFO L78 Accepts]: Start accepts. Automaton has 743 states and 1234 transitions. Word has length 109 [2025-03-08 06:31:54,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:31:54,117 INFO L471 AbstractCegarLoop]: Abstraction has 743 states and 1234 transitions. [2025-03-08 06:31:54,117 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:31:54,117 INFO L276 IsEmpty]: Start isEmpty. Operand 743 states and 1234 transitions. [2025-03-08 06:31:54,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-03-08 06:31:54,118 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:31:54,118 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 06:31:54,119 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 06:31:54,119 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:31:54,119 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:31:54,119 INFO L85 PathProgramCache]: Analyzing trace with hash 1523520107, now seen corresponding path program 1 times [2025-03-08 06:31:54,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:31:54,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312817634] [2025-03-08 06:31:54,119 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:31:54,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:31:54,148 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-08 06:31:54,180 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-08 06:31:54,181 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:31:54,181 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:31:54,325 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-08 06:31:54,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:31:54,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1312817634] [2025-03-08 06:31:54,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1312817634] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:31:54,326 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:31:54,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 06:31:54,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707945108] [2025-03-08 06:31:54,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:31:54,326 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 06:31:54,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:31:54,329 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 06:31:54,329 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:31:54,329 INFO L87 Difference]: Start difference. First operand 743 states and 1234 transitions. Second operand has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:31:54,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:31:54,382 INFO L93 Difference]: Finished difference Result 1827 states and 3028 transitions. [2025-03-08 06:31:54,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 06:31:54,383 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 0 states have call successors, (0), 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 112 [2025-03-08 06:31:54,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:31:54,391 INFO L225 Difference]: With dead ends: 1827 [2025-03-08 06:31:54,391 INFO L226 Difference]: Without dead ends: 1265 [2025-03-08 06:31:54,393 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-08 06:31:54,396 INFO L435 NwaCegarLoop]: 557 mSDtfsCounter, 222 mSDsluCounter, 528 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 222 SdHoareTripleChecker+Valid, 1085 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-08 06:31:54,397 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [222 Valid, 1085 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:31:54,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1265 states. [2025-03-08 06:31:54,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1265 to 1259. [2025-03-08 06:31:54,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1259 states, 1258 states have (on average 1.6550079491255962) internal successors, (2082), 1258 states have internal predecessors, (2082), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:31:54,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1259 states to 1259 states and 2082 transitions. [2025-03-08 06:31:54,439 INFO L78 Accepts]: Start accepts. Automaton has 1259 states and 2082 transitions. Word has length 112 [2025-03-08 06:31:54,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:31:54,441 INFO L471 AbstractCegarLoop]: Abstraction has 1259 states and 2082 transitions. [2025-03-08 06:31:54,441 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:31:54,441 INFO L276 IsEmpty]: Start isEmpty. Operand 1259 states and 2082 transitions. [2025-03-08 06:31:54,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-03-08 06:31:54,443 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:31:54,443 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 06:31:54,443 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 06:31:54,444 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:31:54,444 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:31:54,444 INFO L85 PathProgramCache]: Analyzing trace with hash 128341442, now seen corresponding path program 1 times [2025-03-08 06:31:54,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:31:54,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385326661] [2025-03-08 06:31:54,445 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:31:54,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:31:54,477 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-08 06:31:54,512 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-08 06:31:54,512 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:31:54,512 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:31:54,665 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-08 06:31:54,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:31:54,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [385326661] [2025-03-08 06:31:54,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [385326661] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:31:54,666 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:31:54,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 06:31:54,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330652261] [2025-03-08 06:31:54,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:31:54,668 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 06:31:54,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:31:54,669 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 06:31:54,669 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:31:54,669 INFO L87 Difference]: Start difference. First operand 1259 states and 2082 transitions. Second operand has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:31:54,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:31:54,728 INFO L93 Difference]: Finished difference Result 3335 states and 5500 transitions. [2025-03-08 06:31:54,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 06:31:54,729 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 0 states have call successors, (0), 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 115 [2025-03-08 06:31:54,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:31:54,740 INFO L225 Difference]: With dead ends: 3335 [2025-03-08 06:31:54,741 INFO L226 Difference]: Without dead ends: 2257 [2025-03-08 06:31:54,743 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-08 06:31:54,746 INFO L435 NwaCegarLoop]: 557 mSDtfsCounter, 215 mSDsluCounter, 529 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 215 SdHoareTripleChecker+Valid, 1086 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-08 06:31:54,748 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [215 Valid, 1086 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:31:54,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2257 states. [2025-03-08 06:31:54,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2257 to 2247. [2025-03-08 06:31:54,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2247 states, 2246 states have (on average 1.6447016918967052) internal successors, (3694), 2246 states have internal predecessors, (3694), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:31:54,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2247 states to 2247 states and 3694 transitions. [2025-03-08 06:31:54,805 INFO L78 Accepts]: Start accepts. Automaton has 2247 states and 3694 transitions. Word has length 115 [2025-03-08 06:31:54,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:31:54,806 INFO L471 AbstractCegarLoop]: Abstraction has 2247 states and 3694 transitions. [2025-03-08 06:31:54,807 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:31:54,807 INFO L276 IsEmpty]: Start isEmpty. Operand 2247 states and 3694 transitions. [2025-03-08 06:31:54,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-03-08 06:31:54,809 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:31:54,810 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 06:31:54,810 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 06:31:54,810 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:31:54,810 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:31:54,810 INFO L85 PathProgramCache]: Analyzing trace with hash -130011520, now seen corresponding path program 1 times [2025-03-08 06:31:54,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:31:54,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486519655] [2025-03-08 06:31:54,811 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:31:54,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:31:54,841 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-03-08 06:31:54,863 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-03-08 06:31:54,863 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:31:54,863 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:31:55,052 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-08 06:31:55,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:31:55,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [486519655] [2025-03-08 06:31:55,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [486519655] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:31:55,053 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:31:55,053 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 06:31:55,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [996425637] [2025-03-08 06:31:55,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:31:55,053 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 06:31:55,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:31:55,054 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 06:31:55,054 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:31:55,054 INFO L87 Difference]: Start difference. First operand 2247 states and 3694 transitions. Second operand has 6 states, 6 states have (on average 19.666666666666668) internal successors, (118), 6 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:31:55,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:31:55,412 INFO L93 Difference]: Finished difference Result 11827 states and 19558 transitions. [2025-03-08 06:31:55,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 06:31:55,412 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 19.666666666666668) internal successors, (118), 6 states have internal predecessors, (118), 0 states have call successors, (0), 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 118 [2025-03-08 06:31:55,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:31:55,457 INFO L225 Difference]: With dead ends: 11827 [2025-03-08 06:31:55,457 INFO L226 Difference]: Without dead ends: 9761 [2025-03-08 06:31:55,466 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-03-08 06:31:55,467 INFO L435 NwaCegarLoop]: 566 mSDtfsCounter, 2227 mSDsluCounter, 4816 mSDsCounter, 0 mSdLazyCounter, 211 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2227 SdHoareTripleChecker+Valid, 5382 SdHoareTripleChecker+Invalid, 218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 06:31:55,468 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2227 Valid, 5382 Invalid, 218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 211 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 06:31:55,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9761 states. [2025-03-08 06:31:55,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9761 to 4177. [2025-03-08 06:31:55,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4177 states, 4176 states have (on average 1.6429597701149425) internal successors, (6861), 4176 states have internal predecessors, (6861), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:31:55,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4177 states to 4177 states and 6861 transitions. [2025-03-08 06:31:55,638 INFO L78 Accepts]: Start accepts. Automaton has 4177 states and 6861 transitions. Word has length 118 [2025-03-08 06:31:55,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:31:55,638 INFO L471 AbstractCegarLoop]: Abstraction has 4177 states and 6861 transitions. [2025-03-08 06:31:55,639 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.666666666666668) internal successors, (118), 6 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:31:55,639 INFO L276 IsEmpty]: Start isEmpty. Operand 4177 states and 6861 transitions. [2025-03-08 06:31:55,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-03-08 06:31:55,641 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:31:55,642 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 06:31:55,642 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 06:31:55,642 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:31:55,642 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:31:55,643 INFO L85 PathProgramCache]: Analyzing trace with hash 266578376, now seen corresponding path program 1 times [2025-03-08 06:31:55,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:31:55,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [62150991] [2025-03-08 06:31:55,643 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:31:55,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:31:55,663 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-03-08 06:31:55,679 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-03-08 06:31:55,679 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:31:55,679 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:31:55,789 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-08 06:31:55,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:31:55,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [62150991] [2025-03-08 06:31:55,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [62150991] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:31:55,789 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:31:55,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 06:31:55,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1432611565] [2025-03-08 06:31:55,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:31:55,790 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 06:31:55,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:31:55,791 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 06:31:55,791 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 06:31:55,791 INFO L87 Difference]: Start difference. First operand 4177 states and 6861 transitions. Second operand has 4 states, 4 states have (on average 29.75) internal successors, (119), 4 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:31:55,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:31:55,900 INFO L93 Difference]: Finished difference Result 12275 states and 20249 transitions. [2025-03-08 06:31:55,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 06:31:55,900 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 29.75) internal successors, (119), 4 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 119 [2025-03-08 06:31:55,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:31:55,934 INFO L225 Difference]: With dead ends: 12275 [2025-03-08 06:31:55,934 INFO L226 Difference]: Without dead ends: 8279 [2025-03-08 06:31:55,942 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-08 06:31:55,943 INFO L435 NwaCegarLoop]: 561 mSDtfsCounter, 752 mSDsluCounter, 1307 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 752 SdHoareTripleChecker+Valid, 1868 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.1s IncrementalHoareTripleChecker+Time [2025-03-08 06:31:55,943 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [752 Valid, 1868 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 06:31:55,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8279 states. [2025-03-08 06:31:56,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8279 to 6211. [2025-03-08 06:31:56,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6211 states, 6210 states have (on average 1.644766505636071) internal successors, (10214), 6210 states have internal predecessors, (10214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:31:56,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6211 states to 6211 states and 10214 transitions. [2025-03-08 06:31:56,081 INFO L78 Accepts]: Start accepts. Automaton has 6211 states and 10214 transitions. Word has length 119 [2025-03-08 06:31:56,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:31:56,081 INFO L471 AbstractCegarLoop]: Abstraction has 6211 states and 10214 transitions. [2025-03-08 06:31:56,082 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 29.75) internal successors, (119), 4 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:31:56,082 INFO L276 IsEmpty]: Start isEmpty. Operand 6211 states and 10214 transitions. [2025-03-08 06:31:56,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2025-03-08 06:31:56,084 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:31:56,085 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 06:31:56,085 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 06:31:56,085 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:31:56,085 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:31:56,086 INFO L85 PathProgramCache]: Analyzing trace with hash -324126109, now seen corresponding path program 1 times [2025-03-08 06:31:56,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:31:56,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464679541] [2025-03-08 06:31:56,086 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:31:56,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:31:56,103 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-03-08 06:31:56,121 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-03-08 06:31:56,122 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:31:56,122 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:31:56,200 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-08 06:31:56,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:31:56,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464679541] [2025-03-08 06:31:56,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1464679541] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:31:56,201 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:31:56,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 06:31:56,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [49330161] [2025-03-08 06:31:56,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:31:56,201 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 06:31:56,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:31:56,202 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 06:31:56,202 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 06:31:56,202 INFO L87 Difference]: Start difference. First operand 6211 states and 10214 transitions. Second operand has 4 states, 4 states have (on average 30.0) internal successors, (120), 4 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:31:56,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:31:56,350 INFO L93 Difference]: Finished difference Result 18273 states and 30109 transitions. [2025-03-08 06:31:56,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 06:31:56,351 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 30.0) internal successors, (120), 4 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 120 [2025-03-08 06:31:56,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:31:56,381 INFO L225 Difference]: With dead ends: 18273 [2025-03-08 06:31:56,381 INFO L226 Difference]: Without dead ends: 12243 [2025-03-08 06:31:56,391 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-08 06:31:56,393 INFO L435 NwaCegarLoop]: 549 mSDtfsCounter, 752 mSDsluCounter, 1309 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 752 SdHoareTripleChecker+Valid, 1858 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.1s IncrementalHoareTripleChecker+Time [2025-03-08 06:31:56,393 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [752 Valid, 1858 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 06:31:56,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12243 states. [2025-03-08 06:31:56,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12243 to 9203. [2025-03-08 06:31:56,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9203 states, 9202 states have (on average 1.6426863725277114) internal successors, (15116), 9202 states have internal predecessors, (15116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:31:56,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9203 states to 9203 states and 15116 transitions. [2025-03-08 06:31:56,645 INFO L78 Accepts]: Start accepts. Automaton has 9203 states and 15116 transitions. Word has length 120 [2025-03-08 06:31:56,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:31:56,646 INFO L471 AbstractCegarLoop]: Abstraction has 9203 states and 15116 transitions. [2025-03-08 06:31:56,646 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 30.0) internal successors, (120), 4 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:31:56,646 INFO L276 IsEmpty]: Start isEmpty. Operand 9203 states and 15116 transitions. [2025-03-08 06:31:56,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-03-08 06:31:56,650 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:31:56,650 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 06:31:56,650 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 06:31:56,650 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:31:56,651 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:31:56,651 INFO L85 PathProgramCache]: Analyzing trace with hash -1456185333, now seen corresponding path program 1 times [2025-03-08 06:31:56,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:31:56,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159703573] [2025-03-08 06:31:56,651 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:31:56,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:31:56,669 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-08 06:31:56,689 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-08 06:31:56,689 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:31:56,689 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:31:56,783 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-08 06:31:56,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:31:56,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [159703573] [2025-03-08 06:31:56,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [159703573] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:31:56,783 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:31:56,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 06:31:56,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663529197] [2025-03-08 06:31:56,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:31:56,784 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 06:31:56,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:31:56,785 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 06:31:56,785 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 06:31:56,785 INFO L87 Difference]: Start difference. First operand 9203 states and 15116 transitions. Second operand has 4 states, 4 states have (on average 30.25) internal successors, (121), 4 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:31:57,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:31:57,025 INFO L93 Difference]: Finished difference Result 27097 states and 44597 transitions. [2025-03-08 06:31:57,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 06:31:57,026 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 30.25) internal successors, (121), 4 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 121 [2025-03-08 06:31:57,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:31:57,063 INFO L225 Difference]: With dead ends: 27097 [2025-03-08 06:31:57,063 INFO L226 Difference]: Without dead ends: 18075 [2025-03-08 06:31:57,073 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-08 06:31:57,074 INFO L435 NwaCegarLoop]: 548 mSDtfsCounter, 750 mSDsluCounter, 1240 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 750 SdHoareTripleChecker+Valid, 1788 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 06:31:57,074 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [750 Valid, 1788 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 06:31:57,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18075 states. [2025-03-08 06:31:57,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18075 to 13605. [2025-03-08 06:31:57,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13605 states, 13604 states have (on average 1.6406939135548368) internal successors, (22320), 13604 states have internal predecessors, (22320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:31:57,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13605 states to 13605 states and 22320 transitions. [2025-03-08 06:31:57,397 INFO L78 Accepts]: Start accepts. Automaton has 13605 states and 22320 transitions. Word has length 121 [2025-03-08 06:31:57,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:31:57,398 INFO L471 AbstractCegarLoop]: Abstraction has 13605 states and 22320 transitions. [2025-03-08 06:31:57,398 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 30.25) internal successors, (121), 4 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:31:57,398 INFO L276 IsEmpty]: Start isEmpty. Operand 13605 states and 22320 transitions. [2025-03-08 06:31:57,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-03-08 06:31:57,403 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:31:57,403 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 06:31:57,403 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 06:31:57,403 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:31:57,404 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:31:57,404 INFO L85 PathProgramCache]: Analyzing trace with hash 1830053537, now seen corresponding path program 1 times [2025-03-08 06:31:57,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:31:57,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1889137630] [2025-03-08 06:31:57,404 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:31:57,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:31:57,421 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-08 06:31:57,436 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-08 06:31:57,436 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:31:57,436 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:31:57,487 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-08 06:31:57,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:31:57,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1889137630] [2025-03-08 06:31:57,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1889137630] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:31:57,487 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:31:57,488 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 06:31:57,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003947149] [2025-03-08 06:31:57,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:31:57,488 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 06:31:57,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:31:57,489 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 06:31:57,489 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:31:57,489 INFO L87 Difference]: Start difference. First operand 13605 states and 22320 transitions. Second operand has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 3 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:31:57,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:31:57,574 INFO L93 Difference]: Finished difference Result 30316 states and 49926 transitions. [2025-03-08 06:31:57,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 06:31:57,574 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 3 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 122 [2025-03-08 06:31:57,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:31:57,613 INFO L225 Difference]: With dead ends: 30316 [2025-03-08 06:31:57,614 INFO L226 Difference]: Without dead ends: 20889 [2025-03-08 06:31:57,632 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-08 06:31:57,633 INFO L435 NwaCegarLoop]: 752 mSDtfsCounter, 235 mSDsluCounter, 513 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 235 SdHoareTripleChecker+Valid, 1265 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-08 06:31:57,633 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [235 Valid, 1265 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:31:57,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20889 states. [2025-03-08 06:31:57,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20889 to 20887. [2025-03-08 06:31:57,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20887 states, 20886 states have (on average 1.6398544479555683) internal successors, (34250), 20886 states have internal predecessors, (34250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:31:57,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20887 states to 20887 states and 34250 transitions. [2025-03-08 06:31:57,962 INFO L78 Accepts]: Start accepts. Automaton has 20887 states and 34250 transitions. Word has length 122 [2025-03-08 06:31:57,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:31:57,962 INFO L471 AbstractCegarLoop]: Abstraction has 20887 states and 34250 transitions. [2025-03-08 06:31:57,962 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 3 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:31:57,963 INFO L276 IsEmpty]: Start isEmpty. Operand 20887 states and 34250 transitions. [2025-03-08 06:31:57,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-03-08 06:31:57,964 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:31:57,964 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 06:31:57,965 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 06:31:57,965 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:31:57,966 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:31:57,969 INFO L85 PathProgramCache]: Analyzing trace with hash -398846017, now seen corresponding path program 1 times [2025-03-08 06:31:57,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:31:57,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834771916] [2025-03-08 06:31:57,969 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:31:57,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:31:57,986 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-08 06:31:58,001 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-08 06:31:58,001 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:31:58,001 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:31:58,053 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-08 06:31:58,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:31:58,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [834771916] [2025-03-08 06:31:58,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [834771916] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:31:58,054 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:31:58,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 06:31:58,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77822941] [2025-03-08 06:31:58,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:31:58,054 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 06:31:58,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:31:58,055 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 06:31:58,055 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:31:58,055 INFO L87 Difference]: Start difference. First operand 20887 states and 34250 transitions. Second operand has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 3 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:31:58,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:31:58,239 INFO L93 Difference]: Finished difference Result 46152 states and 75750 transitions. [2025-03-08 06:31:58,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 06:31:58,239 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 3 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 122 [2025-03-08 06:31:58,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:31:58,296 INFO L225 Difference]: With dead ends: 46152 [2025-03-08 06:31:58,296 INFO L226 Difference]: Without dead ends: 31733 [2025-03-08 06:31:58,310 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-08 06:31:58,311 INFO L435 NwaCegarLoop]: 726 mSDtfsCounter, 228 mSDsluCounter, 514 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 228 SdHoareTripleChecker+Valid, 1240 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-08 06:31:58,311 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [228 Valid, 1240 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:31:58,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31733 states. [2025-03-08 06:31:58,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31733 to 31731. [2025-03-08 06:31:58,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31731 states, 31730 states have (on average 1.634951150330917) internal successors, (51877), 31730 states have internal predecessors, (51877), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:31:58,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31731 states to 31731 states and 51877 transitions. [2025-03-08 06:31:58,773 INFO L78 Accepts]: Start accepts. Automaton has 31731 states and 51877 transitions. Word has length 122 [2025-03-08 06:31:58,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:31:58,773 INFO L471 AbstractCegarLoop]: Abstraction has 31731 states and 51877 transitions. [2025-03-08 06:31:58,774 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 3 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:31:58,774 INFO L276 IsEmpty]: Start isEmpty. Operand 31731 states and 51877 transitions. [2025-03-08 06:31:58,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-03-08 06:31:58,775 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:31:58,776 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 06:31:58,776 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 06:31:58,776 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:31:58,777 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:31:58,777 INFO L85 PathProgramCache]: Analyzing trace with hash 150022655, now seen corresponding path program 1 times [2025-03-08 06:31:58,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:31:58,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1475912789] [2025-03-08 06:31:58,777 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:31:58,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:31:58,795 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-08 06:31:58,814 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-08 06:31:58,815 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:31:58,815 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:31:58,872 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-08 06:31:58,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:31:58,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1475912789] [2025-03-08 06:31:58,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1475912789] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:31:58,872 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:31:58,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 06:31:58,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [391139411] [2025-03-08 06:31:58,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:31:58,873 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 06:31:58,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:31:58,873 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 06:31:58,873 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:31:58,874 INFO L87 Difference]: Start difference. First operand 31731 states and 51877 transitions. Second operand has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 3 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:31:59,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:31:59,127 INFO L93 Difference]: Finished difference Result 62043 states and 101564 transitions. [2025-03-08 06:31:59,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 06:31:59,128 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 3 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 122 [2025-03-08 06:31:59,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:31:59,211 INFO L225 Difference]: With dead ends: 62043 [2025-03-08 06:31:59,212 INFO L226 Difference]: Without dead ends: 44517 [2025-03-08 06:31:59,228 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-08 06:31:59,229 INFO L435 NwaCegarLoop]: 638 mSDtfsCounter, 214 mSDsluCounter, 516 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 1154 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-08 06:31:59,229 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [214 Valid, 1154 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:31:59,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44517 states. [2025-03-08 06:31:59,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44517 to 44515. [2025-03-08 06:31:59,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44515 states, 44514 states have (on average 1.6301388327267825) internal successors, (72564), 44514 states have internal predecessors, (72564), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:31:59,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44515 states to 44515 states and 72564 transitions. [2025-03-08 06:31:59,857 INFO L78 Accepts]: Start accepts. Automaton has 44515 states and 72564 transitions. Word has length 122 [2025-03-08 06:31:59,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:31:59,857 INFO L471 AbstractCegarLoop]: Abstraction has 44515 states and 72564 transitions. [2025-03-08 06:31:59,857 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 3 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:31:59,857 INFO L276 IsEmpty]: Start isEmpty. Operand 44515 states and 72564 transitions. [2025-03-08 06:31:59,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-03-08 06:31:59,858 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:31:59,858 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 06:31:59,858 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 06:31:59,859 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:31:59,859 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:31:59,859 INFO L85 PathProgramCache]: Analyzing trace with hash 2104595014, now seen corresponding path program 1 times [2025-03-08 06:31:59,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:31:59,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2056854176] [2025-03-08 06:31:59,859 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:31:59,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:31:59,875 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-08 06:31:59,889 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-08 06:31:59,890 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:31:59,890 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:31:59,973 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-08 06:31:59,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:31:59,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2056854176] [2025-03-08 06:31:59,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2056854176] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:31:59,973 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:31:59,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 06:31:59,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [517394846] [2025-03-08 06:31:59,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:31:59,974 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 06:31:59,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:31:59,974 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 06:31:59,974 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 06:31:59,974 INFO L87 Difference]: Start difference. First operand 44515 states and 72564 transitions. Second operand has 4 states, 4 states have (on average 30.5) internal successors, (122), 4 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:32:00,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:32:00,497 INFO L93 Difference]: Finished difference Result 142141 states and 232060 transitions. [2025-03-08 06:32:00,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 06:32:00,498 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 30.5) internal successors, (122), 4 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 122 [2025-03-08 06:32:00,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:32:00,776 INFO L225 Difference]: With dead ends: 142141 [2025-03-08 06:32:00,776 INFO L226 Difference]: Without dead ends: 97895 [2025-03-08 06:32:00,824 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-08 06:32:00,825 INFO L435 NwaCegarLoop]: 549 mSDtfsCounter, 748 mSDsluCounter, 1313 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 748 SdHoareTripleChecker+Valid, 1862 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.1s IncrementalHoareTripleChecker+Time [2025-03-08 06:32:00,830 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [748 Valid, 1862 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 06:32:00,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97895 states. [2025-03-08 06:32:01,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97895 to 71071. [2025-03-08 06:32:01,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71071 states, 71070 states have (on average 1.6263683692134516) internal successors, (115586), 71070 states have internal predecessors, (115586), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:32:01,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71071 states to 71071 states and 115586 transitions. [2025-03-08 06:32:01,850 INFO L78 Accepts]: Start accepts. Automaton has 71071 states and 115586 transitions. Word has length 122 [2025-03-08 06:32:01,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:32:01,851 INFO L471 AbstractCegarLoop]: Abstraction has 71071 states and 115586 transitions. [2025-03-08 06:32:01,851 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 30.5) internal successors, (122), 4 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:32:01,851 INFO L276 IsEmpty]: Start isEmpty. Operand 71071 states and 115586 transitions. [2025-03-08 06:32:01,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-03-08 06:32:01,852 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:32:01,852 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 06:32:01,853 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 06:32:01,853 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:32:01,853 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:32:01,853 INFO L85 PathProgramCache]: Analyzing trace with hash 770722913, now seen corresponding path program 1 times [2025-03-08 06:32:01,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:32:01,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [870444228] [2025-03-08 06:32:01,853 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:32:01,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:32:01,878 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-08 06:32:01,895 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-08 06:32:01,895 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:32:01,895 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:32:01,956 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-08 06:32:01,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:32:01,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [870444228] [2025-03-08 06:32:01,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [870444228] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:32:01,957 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:32:01,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 06:32:01,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1981816446] [2025-03-08 06:32:01,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:32:01,958 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 06:32:01,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:32:01,958 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 06:32:01,958 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:32:01,959 INFO L87 Difference]: Start difference. First operand 71071 states and 115586 transitions. Second operand has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 3 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:32:02,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:32:02,605 INFO L93 Difference]: Finished difference Result 155592 states and 253230 transitions. [2025-03-08 06:32:02,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 06:32:02,606 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 3 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 122 [2025-03-08 06:32:02,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:32:02,788 INFO L225 Difference]: With dead ends: 155592 [2025-03-08 06:32:02,788 INFO L226 Difference]: Without dead ends: 105855 [2025-03-08 06:32:02,842 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-08 06:32:02,843 INFO L435 NwaCegarLoop]: 692 mSDtfsCounter, 221 mSDsluCounter, 515 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 221 SdHoareTripleChecker+Valid, 1207 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.1s IncrementalHoareTripleChecker+Time [2025-03-08 06:32:02,844 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [221 Valid, 1207 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 06:32:02,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105855 states. [2025-03-08 06:32:03,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105855 to 105853. [2025-03-08 06:32:04,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105853 states, 105852 states have (on average 1.6188357329101009) internal successors, (171357), 105852 states have internal predecessors, (171357), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:32:04,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105853 states to 105853 states and 171357 transitions. [2025-03-08 06:32:04,435 INFO L78 Accepts]: Start accepts. Automaton has 105853 states and 171357 transitions. Word has length 122 [2025-03-08 06:32:04,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:32:04,435 INFO L471 AbstractCegarLoop]: Abstraction has 105853 states and 171357 transitions. [2025-03-08 06:32:04,436 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 3 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:32:04,436 INFO L276 IsEmpty]: Start isEmpty. Operand 105853 states and 171357 transitions. [2025-03-08 06:32:04,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-03-08 06:32:04,437 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:32:04,437 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 06:32:04,437 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-08 06:32:04,437 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:32:04,437 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:32:04,437 INFO L85 PathProgramCache]: Analyzing trace with hash -362304888, now seen corresponding path program 1 times [2025-03-08 06:32:04,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:32:04,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634156919] [2025-03-08 06:32:04,438 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:32:04,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:32:04,458 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-03-08 06:32:04,473 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-03-08 06:32:04,473 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:32:04,474 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:32:04,762 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-08 06:32:04,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:32:04,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [634156919] [2025-03-08 06:32:04,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [634156919] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:32:04,763 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:32:04,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 06:32:04,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157801363] [2025-03-08 06:32:04,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:32:04,763 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 06:32:04,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:32:04,764 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 06:32:04,764 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:32:04,764 INFO L87 Difference]: Start difference. First operand 105853 states and 171357 transitions. Second operand has 6 states, 6 states have (on average 20.666666666666668) internal successors, (124), 6 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:32:05,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:32:05,602 INFO L93 Difference]: Finished difference Result 211459 states and 342310 transitions. [2025-03-08 06:32:05,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 06:32:05,603 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 20.666666666666668) internal successors, (124), 6 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 124 [2025-03-08 06:32:05,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:32:05,791 INFO L225 Difference]: With dead ends: 211459 [2025-03-08 06:32:05,791 INFO L226 Difference]: Without dead ends: 105855 [2025-03-08 06:32:05,879 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2025-03-08 06:32:05,879 INFO L435 NwaCegarLoop]: 557 mSDtfsCounter, 437 mSDsluCounter, 1569 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 437 SdHoareTripleChecker+Valid, 2126 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 06:32:05,880 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [437 Valid, 2126 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 06:32:05,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105855 states. [2025-03-08 06:32:06,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105855 to 105853. [2025-03-08 06:32:06,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105853 states, 105852 states have (on average 1.6129312625174772) internal successors, (170732), 105852 states have internal predecessors, (170732), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:32:07,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105853 states to 105853 states and 170732 transitions. [2025-03-08 06:32:07,430 INFO L78 Accepts]: Start accepts. Automaton has 105853 states and 170732 transitions. Word has length 124 [2025-03-08 06:32:07,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:32:07,430 INFO L471 AbstractCegarLoop]: Abstraction has 105853 states and 170732 transitions. [2025-03-08 06:32:07,430 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.666666666666668) internal successors, (124), 6 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:32:07,430 INFO L276 IsEmpty]: Start isEmpty. Operand 105853 states and 170732 transitions. [2025-03-08 06:32:07,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-03-08 06:32:07,431 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:32:07,431 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 06:32:07,431 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-08 06:32:07,432 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:32:07,432 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:32:07,432 INFO L85 PathProgramCache]: Analyzing trace with hash 1215426101, now seen corresponding path program 1 times [2025-03-08 06:32:07,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:32:07,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2075438115] [2025-03-08 06:32:07,432 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:32:07,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:32:07,452 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-03-08 06:32:07,474 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-03-08 06:32:07,475 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:32:07,475 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:32:07,806 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-08 06:32:07,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:32:07,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2075438115] [2025-03-08 06:32:07,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2075438115] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:32:07,807 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:32:07,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 06:32:07,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575316916] [2025-03-08 06:32:07,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:32:07,807 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 06:32:07,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:32:07,808 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 06:32:07,808 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:32:07,808 INFO L87 Difference]: Start difference. First operand 105853 states and 170732 transitions. Second operand has 6 states, 6 states have (on average 21.166666666666668) internal successors, (127), 6 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:32:09,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:32:09,154 INFO L93 Difference]: Finished difference Result 309457 states and 499570 transitions. [2025-03-08 06:32:09,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 06:32:09,154 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 21.166666666666668) internal successors, (127), 6 states have internal predecessors, (127), 0 states have call successors, (0), 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 127 [2025-03-08 06:32:09,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:32:09,502 INFO L225 Difference]: With dead ends: 309457 [2025-03-08 06:32:09,503 INFO L226 Difference]: Without dead ends: 203853 [2025-03-08 06:32:09,583 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2025-03-08 06:32:09,584 INFO L435 NwaCegarLoop]: 548 mSDtfsCounter, 433 mSDsluCounter, 1587 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 433 SdHoareTripleChecker+Valid, 2135 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 06:32:09,584 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [433 Valid, 2135 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 06:32:09,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203853 states. [2025-03-08 06:32:11,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203853 to 203851. [2025-03-08 06:32:11,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203851 states, 203850 states have (on average 1.605224429727741) internal successors, (327225), 203850 states have internal predecessors, (327225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:32:12,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203851 states to 203851 states and 327225 transitions. [2025-03-08 06:32:12,326 INFO L78 Accepts]: Start accepts. Automaton has 203851 states and 327225 transitions. Word has length 127 [2025-03-08 06:32:12,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:32:12,326 INFO L471 AbstractCegarLoop]: Abstraction has 203851 states and 327225 transitions. [2025-03-08 06:32:12,326 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 21.166666666666668) internal successors, (127), 6 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:32:12,326 INFO L276 IsEmpty]: Start isEmpty. Operand 203851 states and 327225 transitions. [2025-03-08 06:32:12,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2025-03-08 06:32:12,327 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:32:12,327 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 06:32:12,327 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-08 06:32:12,328 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:32:12,328 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:32:12,328 INFO L85 PathProgramCache]: Analyzing trace with hash -975541227, now seen corresponding path program 1 times [2025-03-08 06:32:12,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:32:12,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442792449] [2025-03-08 06:32:12,328 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:32:12,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:32:12,348 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-03-08 06:32:12,421 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-03-08 06:32:12,421 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:32:12,421 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:32:13,308 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-08 06:32:13,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:32:13,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1442792449] [2025-03-08 06:32:13,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1442792449] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:32:13,309 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:32:13,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 06:32:13,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102749292] [2025-03-08 06:32:13,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:32:13,311 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 06:32:13,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:32:13,311 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 06:32:13,312 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:32:13,312 INFO L87 Difference]: Start difference. First operand 203851 states and 327225 transitions. Second operand has 5 states, 5 states have (on average 25.6) internal successors, (128), 5 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:32:13,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:32:13,869 INFO L93 Difference]: Finished difference Result 207725 states and 333034 transitions. [2025-03-08 06:32:13,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 06:32:13,870 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 25.6) internal successors, (128), 5 states have internal predecessors, (128), 0 states have call successors, (0), 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 128 [2025-03-08 06:32:13,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:32:14,578 INFO L225 Difference]: With dead ends: 207725 [2025-03-08 06:32:14,578 INFO L226 Difference]: Without dead ends: 207723 [2025-03-08 06:32:14,650 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-08 06:32:14,651 INFO L435 NwaCegarLoop]: 557 mSDtfsCounter, 0 mSDsluCounter, 1654 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2211 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 06:32:14,651 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2211 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:32:14,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207723 states. [2025-03-08 06:32:16,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207723 to 207723. [2025-03-08 06:32:16,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207723 states, 207722 states have (on average 1.5938128845283601) internal successors, (331070), 207722 states have internal predecessors, (331070), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:32:17,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207723 states to 207723 states and 331070 transitions. [2025-03-08 06:32:17,464 INFO L78 Accepts]: Start accepts. Automaton has 207723 states and 331070 transitions. Word has length 128 [2025-03-08 06:32:17,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:32:17,464 INFO L471 AbstractCegarLoop]: Abstraction has 207723 states and 331070 transitions. [2025-03-08 06:32:17,464 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 25.6) internal successors, (128), 5 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:32:17,464 INFO L276 IsEmpty]: Start isEmpty. Operand 207723 states and 331070 transitions. [2025-03-08 06:32:17,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2025-03-08 06:32:17,468 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:32:17,469 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 06:32:17,469 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-08 06:32:17,469 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:32:17,469 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:32:17,469 INFO L85 PathProgramCache]: Analyzing trace with hash -1242668988, now seen corresponding path program 1 times [2025-03-08 06:32:17,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:32:17,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046730683] [2025-03-08 06:32:17,470 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:32:17,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:32:17,490 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-03-08 06:32:17,508 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-03-08 06:32:17,508 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:32:17,508 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:32:18,090 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-08 06:32:18,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:32:18,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2046730683] [2025-03-08 06:32:18,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2046730683] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:32:18,090 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:32:18,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 06:32:18,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195809348] [2025-03-08 06:32:18,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:32:18,091 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 06:32:18,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:32:18,091 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 06:32:18,093 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:32:18,093 INFO L87 Difference]: Start difference. First operand 207723 states and 331070 transitions. Second operand has 6 states, 6 states have (on average 27.166666666666668) internal successors, (163), 6 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:32:19,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:32:19,999 INFO L93 Difference]: Finished difference Result 566795 states and 905931 transitions. [2025-03-08 06:32:19,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 06:32:19,999 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 27.166666666666668) internal successors, (163), 6 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 164 [2025-03-08 06:32:20,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:32:20,880 INFO L225 Difference]: With dead ends: 566795 [2025-03-08 06:32:20,880 INFO L226 Difference]: Without dead ends: 474393 [2025-03-08 06:32:21,019 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:32:21,020 INFO L435 NwaCegarLoop]: 804 mSDtfsCounter, 1678 mSDsluCounter, 2653 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1678 SdHoareTripleChecker+Valid, 3457 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 06:32:21,020 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1678 Valid, 3457 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 06:32:21,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 474393 states. [2025-03-08 06:32:25,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 474393 to 333989. [2025-03-08 06:32:25,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 333989 states, 333988 states have (on average 1.5922488233110172) internal successors, (531792), 333988 states have internal predecessors, (531792), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:32:26,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333989 states to 333989 states and 531792 transitions. [2025-03-08 06:32:26,925 INFO L78 Accepts]: Start accepts. Automaton has 333989 states and 531792 transitions. Word has length 164 [2025-03-08 06:32:26,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:32:26,926 INFO L471 AbstractCegarLoop]: Abstraction has 333989 states and 531792 transitions. [2025-03-08 06:32:26,926 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 27.166666666666668) internal successors, (163), 6 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:32:26,926 INFO L276 IsEmpty]: Start isEmpty. Operand 333989 states and 531792 transitions. [2025-03-08 06:32:26,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2025-03-08 06:32:26,929 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:32:26,929 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 06:32:26,929 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-08 06:32:26,929 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:32:26,930 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:32:26,930 INFO L85 PathProgramCache]: Analyzing trace with hash 823398754, now seen corresponding path program 1 times [2025-03-08 06:32:26,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:32:26,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [957860565] [2025-03-08 06:32:26,930 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:32:26,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:32:26,953 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-03-08 06:32:26,978 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-03-08 06:32:26,978 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:32:26,978 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:32:27,176 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-08 06:32:27,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:32:27,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [957860565] [2025-03-08 06:32:27,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [957860565] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:32:27,176 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:32:27,176 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 06:32:27,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1720922051] [2025-03-08 06:32:27,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:32:27,177 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 06:32:27,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:32:27,177 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 06:32:27,177 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:32:27,177 INFO L87 Difference]: Start difference. First operand 333989 states and 531792 transitions. Second operand has 6 states, 6 states have (on average 26.0) internal successors, (156), 6 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:32:29,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:32:29,763 INFO L93 Difference]: Finished difference Result 637741 states and 1019447 transitions. [2025-03-08 06:32:29,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 06:32:29,764 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 26.0) internal successors, (156), 6 states have internal predecessors, (156), 0 states have call successors, (0), 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 164 [2025-03-08 06:32:29,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:32:30,811 INFO L225 Difference]: With dead ends: 637741 [2025-03-08 06:32:30,811 INFO L226 Difference]: Without dead ends: 546489 [2025-03-08 06:32:31,077 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:32:31,078 INFO L435 NwaCegarLoop]: 808 mSDtfsCounter, 1680 mSDsluCounter, 2559 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1680 SdHoareTripleChecker+Valid, 3367 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 06:32:31,078 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1680 Valid, 3367 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 06:32:32,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 546489 states.