./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.3.3.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.3.3.ufo.BOUNDED-6.pals.c.v+nlh-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 2731fe4ad24c50878b77c0b5ed6ffe935fe9322bfb607f5cec3a6209916d8bc3 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 19:20:02,330 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 19:20:02,392 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 19:20:02,397 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 19:20:02,399 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 19:20:02,421 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 19:20:02,423 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 19:20:02,423 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 19:20:02,424 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 19:20:02,424 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 19:20:02,424 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 19:20:02,424 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 19:20:02,425 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 19:20:02,425 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 19:20:02,425 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 19:20:02,425 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 19:20:02,425 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 19:20:02,426 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 19:20:02,426 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 19:20:02,426 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 19:20:02,426 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 19:20:02,426 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 19:20:02,426 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 19:20:02,426 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 19:20:02,426 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 19:20:02,426 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 19:20:02,426 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 19:20:02,426 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 19:20:02,426 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 19:20:02,427 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 19:20:02,427 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 19:20:02,427 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 19:20:02,427 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 19:20:02,427 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 19:20:02,427 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 19:20:02,428 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 19:20:02,428 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 19:20:02,428 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 19:20:02,428 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 19:20:02,428 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 19:20:02,428 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 19:20:02,428 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 19:20:02,428 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 19:20:02,428 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 -> 2731fe4ad24c50878b77c0b5ed6ffe935fe9322bfb607f5cec3a6209916d8bc3 [2025-03-16 19:20:02,655 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 19:20:02,661 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 19:20:02,663 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 19:20:02,664 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 19:20:02,664 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 19:20:02,666 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.3.3.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c [2025-03-16 19:20:03,857 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1c71afd3c/3c36c915e2d74802b98bdda3c221f79d/FLAG57b3ba324 [2025-03-16 19:20:04,166 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 19:20:04,167 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.3.3.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c [2025-03-16 19:20:04,182 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1c71afd3c/3c36c915e2d74802b98bdda3c221f79d/FLAG57b3ba324 [2025-03-16 19:20:04,199 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1c71afd3c/3c36c915e2d74802b98bdda3c221f79d [2025-03-16 19:20:04,201 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 19:20:04,203 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 19:20:04,205 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 19:20:04,206 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 19:20:04,209 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 19:20:04,209 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 07:20:04" (1/1) ... [2025-03-16 19:20:04,210 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4a712eda and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:20:04, skipping insertion in model container [2025-03-16 19:20:04,211 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 07:20:04" (1/1) ... [2025-03-16 19:20:04,250 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 19:20:04,435 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.3.3.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c[14521,14534] [2025-03-16 19:20:04,485 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 19:20:04,496 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 19:20:04,560 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.3.3.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c[14521,14534] [2025-03-16 19:20:04,582 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 19:20:04,593 INFO L204 MainTranslator]: Completed translation [2025-03-16 19:20:04,594 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:20:04 WrapperNode [2025-03-16 19:20:04,594 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 19:20:04,595 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 19:20:04,595 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 19:20:04,595 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 19:20:04,599 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:20:04" (1/1) ... [2025-03-16 19:20:04,610 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:20:04" (1/1) ... [2025-03-16 19:20:04,658 INFO L138 Inliner]: procedures = 22, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 1250 [2025-03-16 19:20:04,658 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 19:20:04,659 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 19:20:04,659 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 19:20:04,659 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 19:20:04,667 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:20:04" (1/1) ... [2025-03-16 19:20:04,667 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:20:04" (1/1) ... [2025-03-16 19:20:04,675 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:20:04" (1/1) ... [2025-03-16 19:20:04,699 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-16 19:20:04,702 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:20:04" (1/1) ... [2025-03-16 19:20:04,703 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:20:04" (1/1) ... [2025-03-16 19:20:04,719 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:20:04" (1/1) ... [2025-03-16 19:20:04,720 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:20:04" (1/1) ... [2025-03-16 19:20:04,728 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:20:04" (1/1) ... [2025-03-16 19:20:04,729 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:20:04" (1/1) ... [2025-03-16 19:20:04,732 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 19:20:04,733 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 19:20:04,733 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 19:20:04,733 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 19:20:04,734 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:20:04" (1/1) ... [2025-03-16 19:20:04,743 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 19:20:04,752 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 19:20:04,764 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-16 19:20:04,769 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-16 19:20:04,785 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 19:20:04,785 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 19:20:04,785 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 19:20:04,785 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 19:20:04,892 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 19:20:04,894 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 19:20:05,705 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1101: havoc main_~node3____CPAchecker_TMP_1~2#1;havoc main_~node3____CPAchecker_TMP_0~2#1; [2025-03-16 19:20:05,706 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1202: havoc main_~node2____CPAchecker_TMP_1~2#1;havoc main_~node2____CPAchecker_TMP_0~2#1; [2025-03-16 19:20:05,706 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L840: havoc main_~main____CPAchecker_TMP_0~3#1;havoc main_~__tmp_4~0#1, main_~assert__arg~3#1;havoc main_~check__tmp~3#1;havoc main_~main____CPAchecker_TMP_0~2#1;havoc main_~__tmp_3~0#1, main_~assert__arg~2#1;havoc main_~check__tmp~2#1;havoc main_~node3____CPAchecker_TMP_1~1#1;havoc main_~node3____CPAchecker_TMP_0~1#1;havoc main_~node2____CPAchecker_TMP_1~1#1;havoc main_~node2____CPAchecker_TMP_0~1#1;havoc main_~node1____CPAchecker_TMP_1~1#1;havoc main_~node1____CPAchecker_TMP_0~1#1;havoc main_~main____CPAchecker_TMP_0~1#1;havoc main_~__tmp_2~0#1, main_~assert__arg~1#1;havoc main_~check__tmp~1#1;havoc main_~main____CPAchecker_TMP_0~0#1;havoc main_~__tmp_1~0#1, main_~assert__arg~0#1;havoc main_~check__tmp~0#1;havoc main_~node3____CPAchecker_TMP_1~0#1;havoc main_~node3____CPAchecker_TMP_0~0#1;havoc main_~node2____CPAchecker_TMP_1~0#1;havoc main_~node2____CPAchecker_TMP_0~0#1;havoc main_~node1____CPAchecker_TMP_1~0#1;havoc main_~node1____CPAchecker_TMP_0~0#1;havoc main_~init__r121~0#1, main_~init__r131~0#1, main_~init__r211~0#1, main_~init__r231~0#1, main_~init__r311~0#1, main_~init__r321~0#1, main_~init__r122~0#1, main_~init__tmp~0#1, main_~init__r132~0#1, main_~init__tmp___0~0#1, main_~init__r212~0#1, main_~init__tmp___1~0#1, main_~init__r232~0#1, main_~init__tmp___2~0#1, main_~init__r312~0#1, main_~init__tmp___3~0#1, main_~init__r322~0#1, main_~init__tmp___4~0#1, main_~init__tmp___5~0#1; [2025-03-16 19:20:05,706 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1303: havoc main_~node1____CPAchecker_TMP_1~2#1;havoc main_~node1____CPAchecker_TMP_0~2#1; [2025-03-16 19:20:05,706 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L941: havoc main_~check__tmp~4#1; [2025-03-16 19:20:05,748 INFO L? ?]: Removed 84 outVars from TransFormulas that were not future-live. [2025-03-16 19:20:05,748 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 19:20:05,760 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 19:20:05,763 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 19:20:05,763 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 07:20:05 BoogieIcfgContainer [2025-03-16 19:20:05,763 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 19:20:05,765 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 19:20:05,765 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 19:20:05,769 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 19:20:05,769 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 07:20:04" (1/3) ... [2025-03-16 19:20:05,769 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b1c4e9b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 07:20:05, skipping insertion in model container [2025-03-16 19:20:05,770 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:20:04" (2/3) ... [2025-03-16 19:20:05,770 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b1c4e9b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 07:20:05, skipping insertion in model container [2025-03-16 19:20:05,771 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 07:20:05" (3/3) ... [2025-03-16 19:20:05,771 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_floodmax.3.3.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c [2025-03-16 19:20:05,783 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 19:20:05,786 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_floodmax.3.3.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c that has 1 procedures, 304 locations, 1 initial locations, 0 loop locations, and 1 error locations. [2025-03-16 19:20:05,832 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 19:20:05,841 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;@3d2fabf4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 19:20:05,842 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 19:20:05,846 INFO L276 IsEmpty]: Start isEmpty. Operand has 304 states, 302 states have (on average 1.7880794701986755) internal successors, (540), 303 states have internal predecessors, (540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:20:05,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-03-16 19:20:05,856 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:20:05,856 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:20:05,858 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:20:05,862 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:20:05,863 INFO L85 PathProgramCache]: Analyzing trace with hash -466447747, now seen corresponding path program 1 times [2025-03-16 19:20:05,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:20:05,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1751327619] [2025-03-16 19:20:05,870 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:20:05,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:20:05,949 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-03-16 19:20:06,156 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-03-16 19:20:06,157 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:20:06,157 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:20:06,733 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-16 19:20:06,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:20:06,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1751327619] [2025-03-16 19:20:06,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1751327619] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:20:06,734 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:20:06,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:20:06,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1218989252] [2025-03-16 19:20:06,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:20:06,740 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 19:20:06,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:20:06,758 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 19:20:06,759 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 19:20:06,762 INFO L87 Difference]: Start difference. First operand has 304 states, 302 states have (on average 1.7880794701986755) internal successors, (540), 303 states have internal predecessors, (540), 0 states have call successors, (0), 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 4 states, 4 states have (on average 35.75) internal successors, (143), 3 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:20:06,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:20:06,891 INFO L93 Difference]: Finished difference Result 1147 states and 2046 transitions. [2025-03-16 19:20:06,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 19:20:06,893 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 35.75) internal successors, (143), 3 states have internal predecessors, (143), 0 states have call successors, (0), 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 143 [2025-03-16 19:20:06,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:20:06,907 INFO L225 Difference]: With dead ends: 1147 [2025-03-16 19:20:06,907 INFO L226 Difference]: Without dead ends: 860 [2025-03-16 19:20:06,913 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 19:20:06,916 INFO L435 NwaCegarLoop]: 919 mSDtfsCounter, 978 mSDsluCounter, 980 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 978 SdHoareTripleChecker+Valid, 1899 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:20:06,917 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [978 Valid, 1899 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:20:06,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 860 states. [2025-03-16 19:20:06,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 860 to 580. [2025-03-16 19:20:06,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 580 states, 579 states have (on average 1.455958549222798) internal successors, (843), 579 states have internal predecessors, (843), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:20:06,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 580 states to 580 states and 843 transitions. [2025-03-16 19:20:06,976 INFO L78 Accepts]: Start accepts. Automaton has 580 states and 843 transitions. Word has length 143 [2025-03-16 19:20:06,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:20:06,977 INFO L471 AbstractCegarLoop]: Abstraction has 580 states and 843 transitions. [2025-03-16 19:20:06,977 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 35.75) internal successors, (143), 3 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:20:06,977 INFO L276 IsEmpty]: Start isEmpty. Operand 580 states and 843 transitions. [2025-03-16 19:20:06,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-03-16 19:20:06,986 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:20:06,986 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:20:06,986 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 19:20:06,986 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:20:06,987 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:20:06,987 INFO L85 PathProgramCache]: Analyzing trace with hash 2061153844, now seen corresponding path program 1 times [2025-03-16 19:20:06,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:20:06,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626727530] [2025-03-16 19:20:06,987 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:20:06,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:20:07,010 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-03-16 19:20:07,019 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-03-16 19:20:07,019 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:20:07,020 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:20:07,107 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-16 19:20:07,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:20:07,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [626727530] [2025-03-16 19:20:07,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [626727530] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:20:07,107 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:20:07,107 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:20:07,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602717948] [2025-03-16 19:20:07,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:20:07,110 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:20:07,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:20:07,111 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:20:07,111 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:20:07,111 INFO L87 Difference]: Start difference. First operand 580 states and 843 transitions. Second operand has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:20:07,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:20:07,134 INFO L93 Difference]: Finished difference Result 1135 states and 1643 transitions. [2025-03-16 19:20:07,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:20:07,135 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 0 states have call successors, (0), 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 144 [2025-03-16 19:20:07,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:20:07,137 INFO L225 Difference]: With dead ends: 1135 [2025-03-16 19:20:07,138 INFO L226 Difference]: Without dead ends: 582 [2025-03-16 19:20:07,139 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-16 19:20:07,141 INFO L435 NwaCegarLoop]: 443 mSDtfsCounter, 0 mSDsluCounter, 437 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 880 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:20:07,141 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 880 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:20:07,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 582 states. [2025-03-16 19:20:07,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 582 to 582. [2025-03-16 19:20:07,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 582 states, 581 states have (on average 1.4543889845094664) internal successors, (845), 581 states have internal predecessors, (845), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:20:07,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 582 states to 582 states and 845 transitions. [2025-03-16 19:20:07,171 INFO L78 Accepts]: Start accepts. Automaton has 582 states and 845 transitions. Word has length 144 [2025-03-16 19:20:07,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:20:07,171 INFO L471 AbstractCegarLoop]: Abstraction has 582 states and 845 transitions. [2025-03-16 19:20:07,171 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:20:07,171 INFO L276 IsEmpty]: Start isEmpty. Operand 582 states and 845 transitions. [2025-03-16 19:20:07,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-03-16 19:20:07,172 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:20:07,172 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:20:07,172 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 19:20:07,174 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:20:07,174 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:20:07,175 INFO L85 PathProgramCache]: Analyzing trace with hash 547826458, now seen corresponding path program 1 times [2025-03-16 19:20:07,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:20:07,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517958965] [2025-03-16 19:20:07,175 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:20:07,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:20:07,197 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-03-16 19:20:07,209 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-03-16 19:20:07,210 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:20:07,210 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:20:07,292 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-16 19:20:07,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:20:07,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1517958965] [2025-03-16 19:20:07,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1517958965] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:20:07,293 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:20:07,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:20:07,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [21994951] [2025-03-16 19:20:07,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:20:07,294 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:20:07,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:20:07,294 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:20:07,295 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:20:07,295 INFO L87 Difference]: Start difference. First operand 582 states and 845 transitions. Second operand has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 3 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:20:07,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:20:07,339 INFO L93 Difference]: Finished difference Result 1530 states and 2232 transitions. [2025-03-16 19:20:07,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:20:07,341 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 3 states have internal predecessors, (145), 0 states have call successors, (0), 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 145 [2025-03-16 19:20:07,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:20:07,346 INFO L225 Difference]: With dead ends: 1530 [2025-03-16 19:20:07,346 INFO L226 Difference]: Without dead ends: 1125 [2025-03-16 19:20:07,347 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-16 19:20:07,348 INFO L435 NwaCegarLoop]: 800 mSDtfsCounter, 371 mSDsluCounter, 403 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 371 SdHoareTripleChecker+Valid, 1203 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:20:07,348 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [371 Valid, 1203 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:20:07,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1125 states. [2025-03-16 19:20:07,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1125 to 1123. [2025-03-16 19:20:07,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1123 states, 1122 states have (on average 1.4393939393939394) internal successors, (1615), 1122 states have internal predecessors, (1615), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:20:07,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1123 states to 1123 states and 1615 transitions. [2025-03-16 19:20:07,377 INFO L78 Accepts]: Start accepts. Automaton has 1123 states and 1615 transitions. Word has length 145 [2025-03-16 19:20:07,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:20:07,378 INFO L471 AbstractCegarLoop]: Abstraction has 1123 states and 1615 transitions. [2025-03-16 19:20:07,378 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 3 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:20:07,378 INFO L276 IsEmpty]: Start isEmpty. Operand 1123 states and 1615 transitions. [2025-03-16 19:20:07,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-03-16 19:20:07,380 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:20:07,380 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:20:07,380 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 19:20:07,380 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:20:07,381 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:20:07,381 INFO L85 PathProgramCache]: Analyzing trace with hash 7396952, now seen corresponding path program 1 times [2025-03-16 19:20:07,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:20:07,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1397996038] [2025-03-16 19:20:07,381 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:20:07,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:20:07,404 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-03-16 19:20:07,476 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-03-16 19:20:07,476 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:20:07,476 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:20:07,752 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-16 19:20:07,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:20:07,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1397996038] [2025-03-16 19:20:07,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1397996038] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:20:07,752 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:20:07,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 19:20:07,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [654370608] [2025-03-16 19:20:07,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:20:07,753 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 19:20:07,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:20:07,754 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 19:20:07,754 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:20:07,754 INFO L87 Difference]: Start difference. First operand 1123 states and 1615 transitions. Second operand has 5 states, 5 states have (on average 29.0) internal successors, (145), 4 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:20:07,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:20:07,830 INFO L93 Difference]: Finished difference Result 3113 states and 4476 transitions. [2025-03-16 19:20:07,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 19:20:07,831 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 29.0) internal successors, (145), 4 states have internal predecessors, (145), 0 states have call successors, (0), 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 145 [2025-03-16 19:20:07,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:20:07,838 INFO L225 Difference]: With dead ends: 3113 [2025-03-16 19:20:07,838 INFO L226 Difference]: Without dead ends: 2003 [2025-03-16 19:20:07,841 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:20:07,842 INFO L435 NwaCegarLoop]: 761 mSDtfsCounter, 381 mSDsluCounter, 1139 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 381 SdHoareTripleChecker+Valid, 1900 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:20:07,842 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [381 Valid, 1900 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:20:07,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2003 states. [2025-03-16 19:20:07,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2003 to 2001. [2025-03-16 19:20:07,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2001 states, 2000 states have (on average 1.4255) internal successors, (2851), 2000 states have internal predecessors, (2851), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:20:07,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2001 states to 2001 states and 2851 transitions. [2025-03-16 19:20:07,893 INFO L78 Accepts]: Start accepts. Automaton has 2001 states and 2851 transitions. Word has length 145 [2025-03-16 19:20:07,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:20:07,894 INFO L471 AbstractCegarLoop]: Abstraction has 2001 states and 2851 transitions. [2025-03-16 19:20:07,894 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.0) internal successors, (145), 4 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:20:07,895 INFO L276 IsEmpty]: Start isEmpty. Operand 2001 states and 2851 transitions. [2025-03-16 19:20:07,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-03-16 19:20:07,898 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:20:07,899 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:20:07,899 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 19:20:07,899 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:20:07,899 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:20:07,899 INFO L85 PathProgramCache]: Analyzing trace with hash -1839952459, now seen corresponding path program 1 times [2025-03-16 19:20:07,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:20:07,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909341239] [2025-03-16 19:20:07,900 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:20:07,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:20:07,923 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-03-16 19:20:07,952 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-03-16 19:20:07,952 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:20:07,952 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:20:08,270 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-16 19:20:08,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:20:08,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1909341239] [2025-03-16 19:20:08,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1909341239] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:20:08,271 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:20:08,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 19:20:08,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066822784] [2025-03-16 19:20:08,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:20:08,271 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 19:20:08,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:20:08,271 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 19:20:08,271 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 19:20:08,272 INFO L87 Difference]: Start difference. First operand 2001 states and 2851 transitions. Second operand has 4 states, 4 states have (on average 36.25) internal successors, (145), 4 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:20:08,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:20:08,305 INFO L93 Difference]: Finished difference Result 3144 states and 4488 transitions. [2025-03-16 19:20:08,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 19:20:08,307 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 36.25) internal successors, (145), 4 states have internal predecessors, (145), 0 states have call successors, (0), 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 145 [2025-03-16 19:20:08,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:20:08,311 INFO L225 Difference]: With dead ends: 3144 [2025-03-16 19:20:08,311 INFO L226 Difference]: Without dead ends: 1300 [2025-03-16 19:20:08,314 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 19:20:08,316 INFO L435 NwaCegarLoop]: 486 mSDtfsCounter, 24 mSDsluCounter, 919 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 1405 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:20:08,316 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 1405 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:20:08,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1300 states. [2025-03-16 19:20:08,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1300 to 1300. [2025-03-16 19:20:08,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1300 states, 1299 states have (on average 1.4149345650500385) internal successors, (1838), 1299 states have internal predecessors, (1838), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:20:08,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1300 states to 1300 states and 1838 transitions. [2025-03-16 19:20:08,340 INFO L78 Accepts]: Start accepts. Automaton has 1300 states and 1838 transitions. Word has length 145 [2025-03-16 19:20:08,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:20:08,341 INFO L471 AbstractCegarLoop]: Abstraction has 1300 states and 1838 transitions. [2025-03-16 19:20:08,341 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 36.25) internal successors, (145), 4 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:20:08,341 INFO L276 IsEmpty]: Start isEmpty. Operand 1300 states and 1838 transitions. [2025-03-16 19:20:08,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-03-16 19:20:08,343 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:20:08,343 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, 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-16 19:20:08,343 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-16 19:20:08,343 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:20:08,344 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:20:08,344 INFO L85 PathProgramCache]: Analyzing trace with hash -506978832, now seen corresponding path program 1 times [2025-03-16 19:20:08,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:20:08,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171406813] [2025-03-16 19:20:08,346 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:20:08,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:20:08,363 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-03-16 19:20:08,367 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-03-16 19:20:08,368 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:20:08,368 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:20:08,413 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-16 19:20:08,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:20:08,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [171406813] [2025-03-16 19:20:08,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [171406813] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:20:08,415 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:20:08,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:20:08,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079005137] [2025-03-16 19:20:08,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:20:08,416 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:20:08,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:20:08,416 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:20:08,417 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:20:08,418 INFO L87 Difference]: Start difference. First operand 1300 states and 1838 transitions. Second operand has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:20:08,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:20:08,441 INFO L93 Difference]: Finished difference Result 2723 states and 3863 transitions. [2025-03-16 19:20:08,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:20:08,442 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 0 states have call successors, (0), 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 152 [2025-03-16 19:20:08,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:20:08,447 INFO L225 Difference]: With dead ends: 2723 [2025-03-16 19:20:08,447 INFO L226 Difference]: Without dead ends: 1781 [2025-03-16 19:20:08,448 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-16 19:20:08,448 INFO L435 NwaCegarLoop]: 787 mSDtfsCounter, 415 mSDsluCounter, 434 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 415 SdHoareTripleChecker+Valid, 1221 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:20:08,449 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [415 Valid, 1221 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:20:08,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1781 states. [2025-03-16 19:20:08,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1781 to 1300. [2025-03-16 19:20:08,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1300 states, 1299 states have (on average 1.4141647421093149) internal successors, (1837), 1299 states have internal predecessors, (1837), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:20:08,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1300 states to 1300 states and 1837 transitions. [2025-03-16 19:20:08,474 INFO L78 Accepts]: Start accepts. Automaton has 1300 states and 1837 transitions. Word has length 152 [2025-03-16 19:20:08,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:20:08,474 INFO L471 AbstractCegarLoop]: Abstraction has 1300 states and 1837 transitions. [2025-03-16 19:20:08,475 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:20:08,475 INFO L276 IsEmpty]: Start isEmpty. Operand 1300 states and 1837 transitions. [2025-03-16 19:20:08,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-03-16 19:20:08,476 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:20:08,476 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, 1, 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-16 19:20:08,477 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-16 19:20:08,477 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:20:08,477 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:20:08,477 INFO L85 PathProgramCache]: Analyzing trace with hash -1321584962, now seen corresponding path program 1 times [2025-03-16 19:20:08,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:20:08,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189419453] [2025-03-16 19:20:08,477 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:20:08,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:20:08,492 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-03-16 19:20:08,500 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-03-16 19:20:08,500 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:20:08,500 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:20:08,559 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-16 19:20:08,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:20:08,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [189419453] [2025-03-16 19:20:08,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [189419453] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:20:08,560 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:20:08,560 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:20:08,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582273663] [2025-03-16 19:20:08,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:20:08,560 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:20:08,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:20:08,561 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:20:08,561 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:20:08,561 INFO L87 Difference]: Start difference. First operand 1300 states and 1837 transitions. Second operand has 3 states, 3 states have (on average 51.0) internal successors, (153), 3 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:20:08,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:20:08,603 INFO L93 Difference]: Finished difference Result 3376 states and 4820 transitions. [2025-03-16 19:20:08,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:20:08,604 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.0) internal successors, (153), 3 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 153 [2025-03-16 19:20:08,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:20:08,611 INFO L225 Difference]: With dead ends: 3376 [2025-03-16 19:20:08,611 INFO L226 Difference]: Without dead ends: 2397 [2025-03-16 19:20:08,612 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-16 19:20:08,613 INFO L435 NwaCegarLoop]: 827 mSDtfsCounter, 365 mSDsluCounter, 400 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 365 SdHoareTripleChecker+Valid, 1227 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:20:08,613 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [365 Valid, 1227 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:20:08,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2397 states. [2025-03-16 19:20:08,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2397 to 2395. [2025-03-16 19:20:08,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2395 states, 2394 states have (on average 1.406015037593985) internal successors, (3366), 2394 states have internal predecessors, (3366), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:20:08,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2395 states to 2395 states and 3366 transitions. [2025-03-16 19:20:08,656 INFO L78 Accepts]: Start accepts. Automaton has 2395 states and 3366 transitions. Word has length 153 [2025-03-16 19:20:08,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:20:08,657 INFO L471 AbstractCegarLoop]: Abstraction has 2395 states and 3366 transitions. [2025-03-16 19:20:08,657 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.0) internal successors, (153), 3 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:20:08,657 INFO L276 IsEmpty]: Start isEmpty. Operand 2395 states and 3366 transitions. [2025-03-16 19:20:08,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-03-16 19:20:08,659 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:20:08,660 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, 1, 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-16 19:20:08,660 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-16 19:20:08,660 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:20:08,660 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:20:08,660 INFO L85 PathProgramCache]: Analyzing trace with hash -1586232452, now seen corresponding path program 1 times [2025-03-16 19:20:08,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:20:08,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429605061] [2025-03-16 19:20:08,661 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:20:08,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:20:08,675 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-03-16 19:20:08,710 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-03-16 19:20:08,711 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:20:08,711 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:20:09,019 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-16 19:20:09,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:20:09,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429605061] [2025-03-16 19:20:09,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1429605061] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:20:09,020 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:20:09,020 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 19:20:09,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1874999483] [2025-03-16 19:20:09,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:20:09,020 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 19:20:09,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:20:09,021 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 19:20:09,021 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 19:20:09,021 INFO L87 Difference]: Start difference. First operand 2395 states and 3366 transitions. Second operand has 4 states, 4 states have (on average 38.25) internal successors, (153), 4 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:20:09,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:20:09,053 INFO L93 Difference]: Finished difference Result 3668 states and 5175 transitions. [2025-03-16 19:20:09,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 19:20:09,053 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 38.25) internal successors, (153), 4 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 153 [2025-03-16 19:20:09,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:20:09,060 INFO L225 Difference]: With dead ends: 3668 [2025-03-16 19:20:09,060 INFO L226 Difference]: Without dead ends: 1960 [2025-03-16 19:20:09,062 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 19:20:09,062 INFO L435 NwaCegarLoop]: 476 mSDtfsCounter, 19 mSDsluCounter, 907 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 1383 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:20:09,062 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 1383 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:20:09,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1960 states. [2025-03-16 19:20:09,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1960 to 1960. [2025-03-16 19:20:09,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1960 states, 1959 states have (on average 1.400714650331802) internal successors, (2744), 1959 states have internal predecessors, (2744), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:20:09,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1960 states to 1960 states and 2744 transitions. [2025-03-16 19:20:09,099 INFO L78 Accepts]: Start accepts. Automaton has 1960 states and 2744 transitions. Word has length 153 [2025-03-16 19:20:09,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:20:09,101 INFO L471 AbstractCegarLoop]: Abstraction has 1960 states and 2744 transitions. [2025-03-16 19:20:09,101 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 38.25) internal successors, (153), 4 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:20:09,101 INFO L276 IsEmpty]: Start isEmpty. Operand 1960 states and 2744 transitions. [2025-03-16 19:20:09,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2025-03-16 19:20:09,104 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:20:09,104 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, 1, 1, 1, 1, 1, 1, 1, 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-16 19:20:09,104 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-16 19:20:09,104 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:20:09,104 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:20:09,105 INFO L85 PathProgramCache]: Analyzing trace with hash 403397155, now seen corresponding path program 1 times [2025-03-16 19:20:09,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:20:09,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471069437] [2025-03-16 19:20:09,105 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:20:09,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:20:09,121 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 159 statements into 1 equivalence classes. [2025-03-16 19:20:09,144 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 159 of 159 statements. [2025-03-16 19:20:09,144 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:20:09,144 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:20:09,483 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-16 19:20:09,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:20:09,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1471069437] [2025-03-16 19:20:09,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1471069437] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:20:09,484 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:20:09,484 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-16 19:20:09,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353411040] [2025-03-16 19:20:09,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:20:09,484 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 19:20:09,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:20:09,485 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 19:20:09,485 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-16 19:20:09,485 INFO L87 Difference]: Start difference. First operand 1960 states and 2744 transitions. Second operand has 8 states, 8 states have (on average 19.875) internal successors, (159), 8 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:20:09,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:20:09,595 INFO L93 Difference]: Finished difference Result 3959 states and 5765 transitions. [2025-03-16 19:20:09,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 19:20:09,596 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 19.875) internal successors, (159), 8 states have internal predecessors, (159), 0 states have call successors, (0), 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 159 [2025-03-16 19:20:09,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:20:09,605 INFO L225 Difference]: With dead ends: 3959 [2025-03-16 19:20:09,605 INFO L226 Difference]: Without dead ends: 3287 [2025-03-16 19:20:09,606 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2025-03-16 19:20:09,607 INFO L435 NwaCegarLoop]: 509 mSDtfsCounter, 720 mSDsluCounter, 659 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 720 SdHoareTripleChecker+Valid, 1168 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:20:09,607 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [720 Valid, 1168 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:20:09,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3287 states. [2025-03-16 19:20:09,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3287 to 3285. [2025-03-16 19:20:09,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3285 states, 3284 states have (on average 1.4199147381242387) internal successors, (4663), 3284 states have internal predecessors, (4663), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:20:09,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3285 states to 3285 states and 4663 transitions. [2025-03-16 19:20:09,681 INFO L78 Accepts]: Start accepts. Automaton has 3285 states and 4663 transitions. Word has length 159 [2025-03-16 19:20:09,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:20:09,682 INFO L471 AbstractCegarLoop]: Abstraction has 3285 states and 4663 transitions. [2025-03-16 19:20:09,682 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 19.875) internal successors, (159), 8 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:20:09,682 INFO L276 IsEmpty]: Start isEmpty. Operand 3285 states and 4663 transitions. [2025-03-16 19:20:09,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2025-03-16 19:20:09,686 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:20:09,686 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, 1, 1, 1, 1, 1, 1, 1, 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-16 19:20:09,686 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-16 19:20:09,686 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:20:09,688 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:20:09,689 INFO L85 PathProgramCache]: Analyzing trace with hash -2116562779, now seen corresponding path program 1 times [2025-03-16 19:20:09,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:20:09,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [813795857] [2025-03-16 19:20:09,689 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:20:09,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:20:09,707 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 159 statements into 1 equivalence classes. [2025-03-16 19:20:09,721 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 159 of 159 statements. [2025-03-16 19:20:09,722 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:20:09,722 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:20:09,854 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-16 19:20:09,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:20:09,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [813795857] [2025-03-16 19:20:09,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [813795857] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:20:09,855 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:20:09,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 19:20:09,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320280948] [2025-03-16 19:20:09,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:20:09,855 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 19:20:09,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:20:09,856 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 19:20:09,856 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:20:09,856 INFO L87 Difference]: Start difference. First operand 3285 states and 4663 transitions. Second operand has 5 states, 5 states have (on average 31.8) internal successors, (159), 5 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:20:10,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:20:10,008 INFO L93 Difference]: Finished difference Result 6797 states and 10241 transitions. [2025-03-16 19:20:10,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 19:20:10,009 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 31.8) internal successors, (159), 5 states have internal predecessors, (159), 0 states have call successors, (0), 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 159 [2025-03-16 19:20:10,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:20:10,027 INFO L225 Difference]: With dead ends: 6797 [2025-03-16 19:20:10,028 INFO L226 Difference]: Without dead ends: 6221 [2025-03-16 19:20:10,032 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-16 19:20:10,032 INFO L435 NwaCegarLoop]: 653 mSDtfsCounter, 821 mSDsluCounter, 960 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 821 SdHoareTripleChecker+Valid, 1613 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:20:10,033 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [821 Valid, 1613 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:20:10,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6221 states. [2025-03-16 19:20:10,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6221 to 4979. [2025-03-16 19:20:10,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4979 states, 4978 states have (on average 1.4626355966251507) internal successors, (7281), 4978 states have internal predecessors, (7281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:20:10,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4979 states to 4979 states and 7281 transitions. [2025-03-16 19:20:10,185 INFO L78 Accepts]: Start accepts. Automaton has 4979 states and 7281 transitions. Word has length 159 [2025-03-16 19:20:10,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:20:10,187 INFO L471 AbstractCegarLoop]: Abstraction has 4979 states and 7281 transitions. [2025-03-16 19:20:10,187 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.8) internal successors, (159), 5 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:20:10,187 INFO L276 IsEmpty]: Start isEmpty. Operand 4979 states and 7281 transitions. [2025-03-16 19:20:10,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2025-03-16 19:20:10,192 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:20:10,192 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, 1, 1, 1, 1, 1, 1, 1, 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-16 19:20:10,192 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-16 19:20:10,192 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:20:10,193 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:20:10,193 INFO L85 PathProgramCache]: Analyzing trace with hash 10370145, now seen corresponding path program 1 times [2025-03-16 19:20:10,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:20:10,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113851896] [2025-03-16 19:20:10,193 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:20:10,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:20:10,208 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 159 statements into 1 equivalence classes. [2025-03-16 19:20:10,250 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 159 of 159 statements. [2025-03-16 19:20:10,250 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:20:10,250 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:20:10,455 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-16 19:20:10,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:20:10,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [113851896] [2025-03-16 19:20:10,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [113851896] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:20:10,456 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:20:10,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:20:10,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [992338099] [2025-03-16 19:20:10,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:20:10,457 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 19:20:10,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:20:10,457 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 19:20:10,457 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 19:20:10,457 INFO L87 Difference]: Start difference. First operand 4979 states and 7281 transitions. Second operand has 4 states, 4 states have (on average 39.75) internal successors, (159), 3 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:20:10,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:20:10,584 INFO L93 Difference]: Finished difference Result 19179 states and 27989 transitions. [2025-03-16 19:20:10,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 19:20:10,585 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 39.75) internal successors, (159), 3 states have internal predecessors, (159), 0 states have call successors, (0), 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 159 [2025-03-16 19:20:10,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:20:10,620 INFO L225 Difference]: With dead ends: 19179 [2025-03-16 19:20:10,621 INFO L226 Difference]: Without dead ends: 14250 [2025-03-16 19:20:10,629 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 19:20:10,630 INFO L435 NwaCegarLoop]: 735 mSDtfsCounter, 811 mSDsluCounter, 769 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 811 SdHoareTripleChecker+Valid, 1504 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:20:10,630 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [811 Valid, 1504 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:20:10,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14250 states. [2025-03-16 19:20:10,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14250 to 9617. [2025-03-16 19:20:10,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9617 states, 9616 states have (on average 1.4484193011647255) internal successors, (13928), 9616 states have internal predecessors, (13928), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:20:10,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9617 states to 9617 states and 13928 transitions. [2025-03-16 19:20:10,898 INFO L78 Accepts]: Start accepts. Automaton has 9617 states and 13928 transitions. Word has length 159 [2025-03-16 19:20:10,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:20:10,898 INFO L471 AbstractCegarLoop]: Abstraction has 9617 states and 13928 transitions. [2025-03-16 19:20:10,898 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 39.75) internal successors, (159), 3 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:20:10,899 INFO L276 IsEmpty]: Start isEmpty. Operand 9617 states and 13928 transitions. [2025-03-16 19:20:10,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-03-16 19:20:10,906 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:20:10,907 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, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 19:20:10,907 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-16 19:20:10,907 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:20:10,907 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:20:10,907 INFO L85 PathProgramCache]: Analyzing trace with hash -1566904120, now seen corresponding path program 1 times [2025-03-16 19:20:10,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:20:10,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505433211] [2025-03-16 19:20:10,908 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:20:10,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:20:10,922 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-03-16 19:20:10,926 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-03-16 19:20:10,927 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:20:10,927 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:20:10,963 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-16 19:20:10,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:20:10,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1505433211] [2025-03-16 19:20:10,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1505433211] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:20:10,964 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:20:10,964 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:20:10,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [158575374] [2025-03-16 19:20:10,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:20:10,964 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:20:10,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:20:10,965 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:20:10,965 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:20:10,966 INFO L87 Difference]: Start difference. First operand 9617 states and 13928 transitions. Second operand has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 3 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:20:11,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:20:11,026 INFO L93 Difference]: Finished difference Result 19139 states and 27728 transitions. [2025-03-16 19:20:11,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:20:11,026 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 3 states have internal predecessors, (160), 0 states have call successors, (0), 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 160 [2025-03-16 19:20:11,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:20:11,043 INFO L225 Difference]: With dead ends: 19139 [2025-03-16 19:20:11,043 INFO L226 Difference]: Without dead ends: 9623 [2025-03-16 19:20:11,054 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:20:11,055 INFO L435 NwaCegarLoop]: 439 mSDtfsCounter, 0 mSDsluCounter, 433 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 872 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:20:11,055 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 872 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:20:11,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9623 states. [2025-03-16 19:20:11,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9623 to 9623. [2025-03-16 19:20:11,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9623 states, 9622 states have (on average 1.4481396799002286) internal successors, (13934), 9622 states have internal predecessors, (13934), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:20:11,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9623 states to 9623 states and 13934 transitions. [2025-03-16 19:20:11,247 INFO L78 Accepts]: Start accepts. Automaton has 9623 states and 13934 transitions. Word has length 160 [2025-03-16 19:20:11,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:20:11,247 INFO L471 AbstractCegarLoop]: Abstraction has 9623 states and 13934 transitions. [2025-03-16 19:20:11,247 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 3 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:20:11,247 INFO L276 IsEmpty]: Start isEmpty. Operand 9623 states and 13934 transitions. [2025-03-16 19:20:11,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2025-03-16 19:20:11,255 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:20:11,255 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 19:20:11,255 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-16 19:20:11,255 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:20:11,256 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:20:11,256 INFO L85 PathProgramCache]: Analyzing trace with hash -499742311, now seen corresponding path program 1 times [2025-03-16 19:20:11,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:20:11,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886960250] [2025-03-16 19:20:11,256 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:20:11,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:20:11,271 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-03-16 19:20:11,300 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-03-16 19:20:11,300 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:20:11,300 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:20:11,551 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-16 19:20:11,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:20:11,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [886960250] [2025-03-16 19:20:11,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [886960250] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:20:11,551 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:20:11,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 19:20:11,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637692480] [2025-03-16 19:20:11,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:20:11,552 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 19:20:11,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:20:11,552 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 19:20:11,553 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 19:20:11,553 INFO L87 Difference]: Start difference. First operand 9623 states and 13934 transitions. Second operand has 4 states, 4 states have (on average 40.25) internal successors, (161), 4 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:20:11,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:20:11,615 INFO L93 Difference]: Finished difference Result 19209 states and 27814 transitions. [2025-03-16 19:20:11,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 19:20:11,616 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 40.25) internal successors, (161), 4 states have internal predecessors, (161), 0 states have call successors, (0), 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 161 [2025-03-16 19:20:11,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:20:11,632 INFO L225 Difference]: With dead ends: 19209 [2025-03-16 19:20:11,632 INFO L226 Difference]: Without dead ends: 9617 [2025-03-16 19:20:11,643 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 19:20:11,645 INFO L435 NwaCegarLoop]: 469 mSDtfsCounter, 14 mSDsluCounter, 898 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 1367 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:20:11,645 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 1367 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:20:11,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9617 states. [2025-03-16 19:20:11,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9617 to 9617. [2025-03-16 19:20:11,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9617 states, 9616 states have (on average 1.4477953410981697) internal successors, (13922), 9616 states have internal predecessors, (13922), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:20:11,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9617 states to 9617 states and 13922 transitions. [2025-03-16 19:20:11,807 INFO L78 Accepts]: Start accepts. Automaton has 9617 states and 13922 transitions. Word has length 161 [2025-03-16 19:20:11,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:20:11,807 INFO L471 AbstractCegarLoop]: Abstraction has 9617 states and 13922 transitions. [2025-03-16 19:20:11,808 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 40.25) internal successors, (161), 4 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:20:11,808 INFO L276 IsEmpty]: Start isEmpty. Operand 9617 states and 13922 transitions. [2025-03-16 19:20:11,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2025-03-16 19:20:11,816 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:20:11,816 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 19:20:11,816 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-16 19:20:11,816 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:20:11,817 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:20:11,817 INFO L85 PathProgramCache]: Analyzing trace with hash -97044610, now seen corresponding path program 1 times [2025-03-16 19:20:11,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:20:11,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590576821] [2025-03-16 19:20:11,817 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:20:11,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:20:11,830 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-03-16 19:20:11,838 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-03-16 19:20:11,839 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:20:11,839 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:20:11,888 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-16 19:20:11,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:20:11,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1590576821] [2025-03-16 19:20:11,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1590576821] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:20:11,888 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:20:11,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:20:11,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269070704] [2025-03-16 19:20:11,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:20:11,889 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:20:11,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:20:11,890 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:20:11,890 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:20:11,890 INFO L87 Difference]: Start difference. First operand 9617 states and 13922 transitions. Second operand has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 3 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:20:12,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:20:12,021 INFO L93 Difference]: Finished difference Result 23227 states and 33679 transitions. [2025-03-16 19:20:12,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:20:12,021 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 3 states have internal predecessors, (161), 0 states have call successors, (0), 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 161 [2025-03-16 19:20:12,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:20:12,042 INFO L225 Difference]: With dead ends: 23227 [2025-03-16 19:20:12,043 INFO L226 Difference]: Without dead ends: 14289 [2025-03-16 19:20:12,048 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-16 19:20:12,050 INFO L435 NwaCegarLoop]: 782 mSDtfsCounter, 357 mSDsluCounter, 391 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 357 SdHoareTripleChecker+Valid, 1173 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:20:12,050 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [357 Valid, 1173 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:20:12,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14289 states. [2025-03-16 19:20:12,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14289 to 14287. [2025-03-16 19:20:12,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14287 states, 14286 states have (on average 1.4263614727705445) internal successors, (20377), 14286 states have internal predecessors, (20377), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:20:12,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14287 states to 14287 states and 20377 transitions. [2025-03-16 19:20:12,299 INFO L78 Accepts]: Start accepts. Automaton has 14287 states and 20377 transitions. Word has length 161 [2025-03-16 19:20:12,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:20:12,299 INFO L471 AbstractCegarLoop]: Abstraction has 14287 states and 20377 transitions. [2025-03-16 19:20:12,300 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 3 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:20:12,300 INFO L276 IsEmpty]: Start isEmpty. Operand 14287 states and 20377 transitions. [2025-03-16 19:20:12,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-03-16 19:20:12,312 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:20:12,312 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 19:20:12,312 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-16 19:20:12,312 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:20:12,313 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:20:12,313 INFO L85 PathProgramCache]: Analyzing trace with hash 794214116, now seen corresponding path program 1 times [2025-03-16 19:20:12,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:20:12,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075416767] [2025-03-16 19:20:12,313 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:20:12,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:20:12,332 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-03-16 19:20:12,344 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-03-16 19:20:12,344 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:20:12,344 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:20:12,389 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-16 19:20:12,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:20:12,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1075416767] [2025-03-16 19:20:12,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1075416767] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:20:12,390 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:20:12,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:20:12,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079442277] [2025-03-16 19:20:12,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:20:12,391 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:20:12,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:20:12,391 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:20:12,391 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:20:12,391 INFO L87 Difference]: Start difference. First operand 14287 states and 20377 transitions. Second operand has 3 states, 3 states have (on average 55.666666666666664) internal successors, (167), 3 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:20:12,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:20:12,666 INFO L93 Difference]: Finished difference Result 36726 states and 52768 transitions. [2025-03-16 19:20:12,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:20:12,666 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.666666666666664) internal successors, (167), 3 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 167 [2025-03-16 19:20:12,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:20:12,713 INFO L225 Difference]: With dead ends: 36726 [2025-03-16 19:20:12,713 INFO L226 Difference]: Without dead ends: 25975 [2025-03-16 19:20:12,730 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-16 19:20:12,731 INFO L435 NwaCegarLoop]: 421 mSDtfsCounter, 268 mSDsluCounter, 322 mSDsCounter, 0 mSdLazyCounter, 193 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 268 SdHoareTripleChecker+Valid, 743 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 19:20:12,731 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [268 Valid, 743 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 193 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 19:20:12,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25975 states. [2025-03-16 19:20:13,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25975 to 25973. [2025-03-16 19:20:13,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25973 states, 25972 states have (on average 1.420029262282458) internal successors, (36881), 25972 states have internal predecessors, (36881), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:20:13,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25973 states to 25973 states and 36881 transitions. [2025-03-16 19:20:13,195 INFO L78 Accepts]: Start accepts. Automaton has 25973 states and 36881 transitions. Word has length 167 [2025-03-16 19:20:13,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:20:13,196 INFO L471 AbstractCegarLoop]: Abstraction has 25973 states and 36881 transitions. [2025-03-16 19:20:13,196 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.666666666666664) internal successors, (167), 3 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:20:13,196 INFO L276 IsEmpty]: Start isEmpty. Operand 25973 states and 36881 transitions. [2025-03-16 19:20:13,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-03-16 19:20:13,219 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:20:13,220 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 19:20:13,220 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-16 19:20:13,221 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:20:13,221 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:20:13,221 INFO L85 PathProgramCache]: Analyzing trace with hash 177721475, now seen corresponding path program 1 times [2025-03-16 19:20:13,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:20:13,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [589182515] [2025-03-16 19:20:13,221 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:20:13,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:20:13,241 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-03-16 19:20:13,276 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-03-16 19:20:13,276 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:20:13,276 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:20:13,632 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-16 19:20:13,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:20:13,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [589182515] [2025-03-16 19:20:13,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [589182515] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:20:13,633 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:20:13,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-16 19:20:13,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082154345] [2025-03-16 19:20:13,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:20:13,634 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 19:20:13,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:20:13,634 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 19:20:13,634 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-16 19:20:13,634 INFO L87 Difference]: Start difference. First operand 25973 states and 36881 transitions. Second operand has 8 states, 8 states have (on average 20.875) internal successors, (167), 8 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:20:13,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:20:13,841 INFO L93 Difference]: Finished difference Result 60607 states and 88523 transitions. [2025-03-16 19:20:13,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 19:20:13,841 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 20.875) internal successors, (167), 8 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 167 [2025-03-16 19:20:13,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:20:13,918 INFO L225 Difference]: With dead ends: 60607 [2025-03-16 19:20:13,919 INFO L226 Difference]: Without dead ends: 44798 [2025-03-16 19:20:13,945 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2025-03-16 19:20:13,947 INFO L435 NwaCegarLoop]: 483 mSDtfsCounter, 1733 mSDsluCounter, 589 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1733 SdHoareTripleChecker+Valid, 1072 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:20:13,947 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1733 Valid, 1072 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:20:13,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44798 states. [2025-03-16 19:20:14,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44798 to 44706. [2025-03-16 19:20:14,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44706 states, 44705 states have (on average 1.4292137344816016) internal successors, (63893), 44705 states have internal predecessors, (63893), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:20:14,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44706 states to 44706 states and 63893 transitions. [2025-03-16 19:20:14,565 INFO L78 Accepts]: Start accepts. Automaton has 44706 states and 63893 transitions. Word has length 167 [2025-03-16 19:20:14,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:20:14,565 INFO L471 AbstractCegarLoop]: Abstraction has 44706 states and 63893 transitions. [2025-03-16 19:20:14,565 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 20.875) internal successors, (167), 8 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:20:14,566 INFO L276 IsEmpty]: Start isEmpty. Operand 44706 states and 63893 transitions. [2025-03-16 19:20:14,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-03-16 19:20:14,591 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:20:14,592 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 19:20:14,592 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-16 19:20:14,592 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:20:14,593 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:20:14,593 INFO L85 PathProgramCache]: Analyzing trace with hash -1526509623, now seen corresponding path program 1 times [2025-03-16 19:20:14,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:20:14,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089376457] [2025-03-16 19:20:14,593 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:20:14,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:20:14,611 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-03-16 19:20:14,660 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-03-16 19:20:14,661 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:20:14,661 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:20:14,824 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-16 19:20:14,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:20:14,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1089376457] [2025-03-16 19:20:14,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1089376457] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:20:14,825 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:20:14,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:20:14,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [34464390] [2025-03-16 19:20:14,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:20:14,825 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 19:20:14,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:20:14,826 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 19:20:14,826 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 19:20:14,826 INFO L87 Difference]: Start difference. First operand 44706 states and 63893 transitions. Second operand has 4 states, 4 states have (on average 41.75) internal successors, (167), 3 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:20:15,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:20:15,141 INFO L93 Difference]: Finished difference Result 86321 states and 123338 transitions. [2025-03-16 19:20:15,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 19:20:15,142 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 41.75) internal successors, (167), 3 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 167 [2025-03-16 19:20:15,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:20:15,215 INFO L225 Difference]: With dead ends: 86321 [2025-03-16 19:20:15,215 INFO L226 Difference]: Without dead ends: 41949 [2025-03-16 19:20:15,245 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-16 19:20:15,246 INFO L435 NwaCegarLoop]: 714 mSDtfsCounter, 371 mSDsluCounter, 1070 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 371 SdHoareTripleChecker+Valid, 1784 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:20:15,246 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [371 Valid, 1784 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:20:15,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41949 states. [2025-03-16 19:20:15,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41949 to 41906. [2025-03-16 19:20:15,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41906 states, 41905 states have (on average 1.4266078033647536) internal successors, (59782), 41905 states have internal predecessors, (59782), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:20:15,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41906 states to 41906 states and 59782 transitions. [2025-03-16 19:20:15,937 INFO L78 Accepts]: Start accepts. Automaton has 41906 states and 59782 transitions. Word has length 167 [2025-03-16 19:20:15,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:20:15,938 INFO L471 AbstractCegarLoop]: Abstraction has 41906 states and 59782 transitions. [2025-03-16 19:20:15,938 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 41.75) internal successors, (167), 3 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:20:15,938 INFO L276 IsEmpty]: Start isEmpty. Operand 41906 states and 59782 transitions. [2025-03-16 19:20:15,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2025-03-16 19:20:15,958 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:20:15,959 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 19:20:15,959 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-16 19:20:15,959 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:20:15,959 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:20:15,959 INFO L85 PathProgramCache]: Analyzing trace with hash -1403218552, now seen corresponding path program 1 times [2025-03-16 19:20:15,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:20:15,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1298529157] [2025-03-16 19:20:15,960 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:20:15,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:20:15,981 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-03-16 19:20:15,986 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-03-16 19:20:15,987 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:20:15,987 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:20:16,031 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-16 19:20:16,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:20:16,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1298529157] [2025-03-16 19:20:16,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1298529157] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:20:16,032 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:20:16,032 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:20:16,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214205874] [2025-03-16 19:20:16,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:20:16,032 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:20:16,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:20:16,033 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:20:16,033 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:20:16,033 INFO L87 Difference]: Start difference. First operand 41906 states and 59782 transitions. Second operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:20:16,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:20:16,250 INFO L93 Difference]: Finished difference Result 81860 states and 116718 transitions. [2025-03-16 19:20:16,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:20:16,251 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 168 [2025-03-16 19:20:16,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:20:16,382 INFO L225 Difference]: With dead ends: 81860 [2025-03-16 19:20:16,382 INFO L226 Difference]: Without dead ends: 58039 [2025-03-16 19:20:16,416 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-16 19:20:16,417 INFO L435 NwaCegarLoop]: 509 mSDtfsCounter, 402 mSDsluCounter, 429 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 402 SdHoareTripleChecker+Valid, 938 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:20:16,417 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [402 Valid, 938 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:20:16,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58039 states. [2025-03-16 19:20:17,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58039 to 41906. [2025-03-16 19:20:17,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41906 states, 41905 states have (on average 1.4265600763632025) internal successors, (59780), 41905 states have internal predecessors, (59780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:20:17,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41906 states to 41906 states and 59780 transitions. [2025-03-16 19:20:17,343 INFO L78 Accepts]: Start accepts. Automaton has 41906 states and 59780 transitions. Word has length 168 [2025-03-16 19:20:17,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:20:17,343 INFO L471 AbstractCegarLoop]: Abstraction has 41906 states and 59780 transitions. [2025-03-16 19:20:17,343 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:20:17,343 INFO L276 IsEmpty]: Start isEmpty. Operand 41906 states and 59780 transitions. [2025-03-16 19:20:17,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2025-03-16 19:20:17,359 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:20:17,360 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 19:20:17,360 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-16 19:20:17,360 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:20:17,360 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:20:17,360 INFO L85 PathProgramCache]: Analyzing trace with hash -1223409852, now seen corresponding path program 1 times [2025-03-16 19:20:17,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:20:17,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18967753] [2025-03-16 19:20:17,361 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:20:17,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:20:17,378 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 169 statements into 1 equivalence classes. [2025-03-16 19:20:17,577 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 169 of 169 statements. [2025-03-16 19:20:17,577 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:20:17,577 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:20:18,043 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-16 19:20:18,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:20:18,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [18967753] [2025-03-16 19:20:18,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [18967753] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:20:18,044 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:20:18,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-16 19:20:18,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [236245500] [2025-03-16 19:20:18,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:20:18,044 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-16 19:20:18,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:20:18,045 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-16 19:20:18,045 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2025-03-16 19:20:18,045 INFO L87 Difference]: Start difference. First operand 41906 states and 59780 transitions. Second operand has 14 states, 14 states have (on average 12.071428571428571) internal successors, (169), 13 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:20:19,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:20:19,161 INFO L93 Difference]: Finished difference Result 110051 states and 158143 transitions. [2025-03-16 19:20:19,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-16 19:20:19,161 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 12.071428571428571) internal successors, (169), 13 states have internal predecessors, (169), 0 states have call successors, (0), 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 169 [2025-03-16 19:20:19,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:20:19,305 INFO L225 Difference]: With dead ends: 110051 [2025-03-16 19:20:19,306 INFO L226 Difference]: Without dead ends: 103981 [2025-03-16 19:20:19,332 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=183, Invalid=629, Unknown=0, NotChecked=0, Total=812 [2025-03-16 19:20:19,333 INFO L435 NwaCegarLoop]: 578 mSDtfsCounter, 3273 mSDsluCounter, 4890 mSDsCounter, 0 mSdLazyCounter, 1156 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3273 SdHoareTripleChecker+Valid, 5468 SdHoareTripleChecker+Invalid, 1189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 1156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 19:20:19,333 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3273 Valid, 5468 Invalid, 1189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 1156 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 19:20:19,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103981 states. [2025-03-16 19:20:20,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103981 to 46546. [2025-03-16 19:20:20,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46546 states, 46545 states have (on average 1.4014394671822967) internal successors, (65230), 46545 states have internal predecessors, (65230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:20:20,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46546 states to 46546 states and 65230 transitions. [2025-03-16 19:20:20,431 INFO L78 Accepts]: Start accepts. Automaton has 46546 states and 65230 transitions. Word has length 169 [2025-03-16 19:20:20,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:20:20,431 INFO L471 AbstractCegarLoop]: Abstraction has 46546 states and 65230 transitions. [2025-03-16 19:20:20,431 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 12.071428571428571) internal successors, (169), 13 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:20:20,431 INFO L276 IsEmpty]: Start isEmpty. Operand 46546 states and 65230 transitions. [2025-03-16 19:20:20,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2025-03-16 19:20:20,456 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:20:20,457 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 19:20:20,457 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-16 19:20:20,457 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:20:20,457 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:20:20,457 INFO L85 PathProgramCache]: Analyzing trace with hash 1503724862, now seen corresponding path program 1 times [2025-03-16 19:20:20,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:20:20,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347696310] [2025-03-16 19:20:20,458 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:20:20,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:20:20,476 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 169 statements into 1 equivalence classes. [2025-03-16 19:20:20,494 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 169 of 169 statements. [2025-03-16 19:20:20,494 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:20:20,494 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:20:20,565 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-16 19:20:20,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:20:20,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1347696310] [2025-03-16 19:20:20,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1347696310] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:20:20,566 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:20:20,566 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:20:20,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687792292] [2025-03-16 19:20:20,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:20:20,566 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:20:20,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:20:20,567 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:20:20,567 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:20:20,567 INFO L87 Difference]: Start difference. First operand 46546 states and 65230 transitions. Second operand has 3 states, 3 states have (on average 56.333333333333336) internal successors, (169), 3 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:20:20,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:20:20,868 INFO L93 Difference]: Finished difference Result 101324 states and 147092 transitions. [2025-03-16 19:20:20,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:20:20,868 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 56.333333333333336) internal successors, (169), 3 states have internal predecessors, (169), 0 states have call successors, (0), 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 169 [2025-03-16 19:20:20,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:20:20,975 INFO L225 Difference]: With dead ends: 101324 [2025-03-16 19:20:20,976 INFO L226 Difference]: Without dead ends: 75390 [2025-03-16 19:20:21,017 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-16 19:20:21,020 INFO L435 NwaCegarLoop]: 548 mSDtfsCounter, 250 mSDsluCounter, 307 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 250 SdHoareTripleChecker+Valid, 855 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:20:21,020 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [250 Valid, 855 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:20:21,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75390 states. [2025-03-16 19:20:22,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75390 to 75388. [2025-03-16 19:20:22,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75388 states, 75387 states have (on average 1.412312467666839) internal successors, (106470), 75387 states have internal predecessors, (106470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:20:22,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75388 states to 75388 states and 106470 transitions. [2025-03-16 19:20:22,281 INFO L78 Accepts]: Start accepts. Automaton has 75388 states and 106470 transitions. Word has length 169 [2025-03-16 19:20:22,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:20:22,281 INFO L471 AbstractCegarLoop]: Abstraction has 75388 states and 106470 transitions. [2025-03-16 19:20:22,281 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 56.333333333333336) internal successors, (169), 3 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:20:22,281 INFO L276 IsEmpty]: Start isEmpty. Operand 75388 states and 106470 transitions. [2025-03-16 19:20:22,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2025-03-16 19:20:22,307 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:20:22,308 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 19:20:22,308 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-16 19:20:22,308 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:20:22,308 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:20:22,308 INFO L85 PathProgramCache]: Analyzing trace with hash -1202894532, now seen corresponding path program 1 times [2025-03-16 19:20:22,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:20:22,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [237647693] [2025-03-16 19:20:22,309 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:20:22,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:20:22,322 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 169 statements into 1 equivalence classes. [2025-03-16 19:20:22,332 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 169 of 169 statements. [2025-03-16 19:20:22,332 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:20:22,332 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:20:22,411 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-16 19:20:22,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:20:22,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [237647693] [2025-03-16 19:20:22,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [237647693] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:20:22,411 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:20:22,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 19:20:22,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146065659] [2025-03-16 19:20:22,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:20:22,413 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 19:20:22,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:20:22,413 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 19:20:22,413 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:20:22,413 INFO L87 Difference]: Start difference. First operand 75388 states and 106470 transitions. Second operand has 5 states, 5 states have (on average 33.8) internal successors, (169), 5 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:20:23,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:20:23,425 INFO L93 Difference]: Finished difference Result 193798 states and 291780 transitions. [2025-03-16 19:20:23,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-16 19:20:23,425 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 33.8) internal successors, (169), 5 states have internal predecessors, (169), 0 states have call successors, (0), 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 169 [2025-03-16 19:20:23,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:20:23,668 INFO L225 Difference]: With dead ends: 193798 [2025-03-16 19:20:23,668 INFO L226 Difference]: Without dead ends: 154190 [2025-03-16 19:20:23,711 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-03-16 19:20:23,712 INFO L435 NwaCegarLoop]: 829 mSDtfsCounter, 1110 mSDsluCounter, 1349 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1110 SdHoareTripleChecker+Valid, 2178 SdHoareTripleChecker+Invalid, 217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 19:20:23,712 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1110 Valid, 2178 Invalid, 217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 19:20:23,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154190 states. [2025-03-16 19:20:25,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154190 to 102988. [2025-03-16 19:20:25,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102988 states, 102987 states have (on average 1.4446095138221329) internal successors, (148776), 102987 states have internal predecessors, (148776), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:20:25,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102988 states to 102988 states and 148776 transitions. [2025-03-16 19:20:25,631 INFO L78 Accepts]: Start accepts. Automaton has 102988 states and 148776 transitions. Word has length 169 [2025-03-16 19:20:25,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:20:25,631 INFO L471 AbstractCegarLoop]: Abstraction has 102988 states and 148776 transitions. [2025-03-16 19:20:25,631 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 33.8) internal successors, (169), 5 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:20:25,632 INFO L276 IsEmpty]: Start isEmpty. Operand 102988 states and 148776 transitions. [2025-03-16 19:20:25,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2025-03-16 19:20:25,907 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:20:25,907 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 19:20:25,908 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-16 19:20:25,908 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:20:25,908 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:20:25,908 INFO L85 PathProgramCache]: Analyzing trace with hash -1357423358, now seen corresponding path program 1 times [2025-03-16 19:20:25,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:20:25,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [334666382] [2025-03-16 19:20:25,908 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:20:25,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:20:25,923 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 169 statements into 1 equivalence classes. [2025-03-16 19:20:25,933 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 169 of 169 statements. [2025-03-16 19:20:25,934 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:20:25,934 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:20:25,980 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-16 19:20:25,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:20:25,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [334666382] [2025-03-16 19:20:25,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [334666382] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:20:25,980 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:20:25,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:20:25,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [323513488] [2025-03-16 19:20:25,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:20:25,981 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:20:25,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:20:25,982 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:20:25,982 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:20:25,982 INFO L87 Difference]: Start difference. First operand 102988 states and 148776 transitions. Second operand has 3 states, 3 states have (on average 56.333333333333336) internal successors, (169), 3 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:20:26,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:20:26,304 INFO L93 Difference]: Finished difference Result 129996 states and 189966 transitions. [2025-03-16 19:20:26,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:20:26,305 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 56.333333333333336) internal successors, (169), 3 states have internal predecessors, (169), 0 states have call successors, (0), 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 169 [2025-03-16 19:20:26,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:20:26,695 INFO L225 Difference]: With dead ends: 129996 [2025-03-16 19:20:26,695 INFO L226 Difference]: Without dead ends: 102990 [2025-03-16 19:20:26,725 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-16 19:20:26,727 INFO L435 NwaCegarLoop]: 430 mSDtfsCounter, 258 mSDsluCounter, 316 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 258 SdHoareTripleChecker+Valid, 746 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:20:26,728 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [258 Valid, 746 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:20:26,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102990 states. [2025-03-16 19:20:28,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102990 to 102988. [2025-03-16 19:20:28,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102988 states, 102987 states have (on average 1.4380844184217425) internal successors, (148104), 102987 states have internal predecessors, (148104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:20:28,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102988 states to 102988 states and 148104 transitions. [2025-03-16 19:20:28,319 INFO L78 Accepts]: Start accepts. Automaton has 102988 states and 148104 transitions. Word has length 169 [2025-03-16 19:20:28,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:20:28,319 INFO L471 AbstractCegarLoop]: Abstraction has 102988 states and 148104 transitions. [2025-03-16 19:20:28,319 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 56.333333333333336) internal successors, (169), 3 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:20:28,319 INFO L276 IsEmpty]: Start isEmpty. Operand 102988 states and 148104 transitions. [2025-03-16 19:20:28,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2025-03-16 19:20:28,344 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:20:28,345 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 19:20:28,345 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-16 19:20:28,345 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:20:28,345 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:20:28,345 INFO L85 PathProgramCache]: Analyzing trace with hash -657443778, now seen corresponding path program 1 times [2025-03-16 19:20:28,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:20:28,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2038766727] [2025-03-16 19:20:28,346 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:20:28,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:20:28,356 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 169 statements into 1 equivalence classes. [2025-03-16 19:20:28,389 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 169 of 169 statements. [2025-03-16 19:20:28,389 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:20:28,389 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:20:28,527 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-16 19:20:28,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:20:28,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2038766727] [2025-03-16 19:20:28,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2038766727] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:20:28,529 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:20:28,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:20:28,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357744723] [2025-03-16 19:20:28,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:20:28,529 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 19:20:28,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:20:28,530 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 19:20:28,530 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 19:20:28,530 INFO L87 Difference]: Start difference. First operand 102988 states and 148104 transitions. Second operand has 4 states, 4 states have (on average 42.25) internal successors, (169), 3 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:20:29,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:20:29,677 INFO L93 Difference]: Finished difference Result 309134 states and 444527 transitions. [2025-03-16 19:20:29,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 19:20:29,678 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 42.25) internal successors, (169), 3 states have internal predecessors, (169), 0 states have call successors, (0), 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 169 [2025-03-16 19:20:29,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:20:29,996 INFO L225 Difference]: With dead ends: 309134 [2025-03-16 19:20:29,996 INFO L226 Difference]: Without dead ends: 206296 [2025-03-16 19:20:30,059 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-16 19:20:30,060 INFO L435 NwaCegarLoop]: 691 mSDtfsCounter, 1193 mSDsluCounter, 1048 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1193 SdHoareTripleChecker+Valid, 1739 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 19:20:30,060 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1193 Valid, 1739 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 19:20:30,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206296 states. [2025-03-16 19:20:32,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206296 to 103119. [2025-03-16 19:20:32,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103119 states, 103118 states have (on average 1.437644252215908) internal successors, (148247), 103118 states have internal predecessors, (148247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:20:32,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103119 states to 103119 states and 148247 transitions. [2025-03-16 19:20:32,404 INFO L78 Accepts]: Start accepts. Automaton has 103119 states and 148247 transitions. Word has length 169 [2025-03-16 19:20:32,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:20:32,404 INFO L471 AbstractCegarLoop]: Abstraction has 103119 states and 148247 transitions. [2025-03-16 19:20:32,404 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 42.25) internal successors, (169), 3 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:20:32,404 INFO L276 IsEmpty]: Start isEmpty. Operand 103119 states and 148247 transitions. [2025-03-16 19:20:32,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2025-03-16 19:20:32,426 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:20:32,426 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 19:20:32,426 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-16 19:20:32,427 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:20:32,427 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:20:32,427 INFO L85 PathProgramCache]: Analyzing trace with hash 896713787, now seen corresponding path program 1 times [2025-03-16 19:20:32,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:20:32,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [692781189] [2025-03-16 19:20:32,427 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:20:32,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:20:32,437 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-03-16 19:20:32,441 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-03-16 19:20:32,441 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:20:32,441 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:20:32,467 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-16 19:20:32,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:20:32,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [692781189] [2025-03-16 19:20:32,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [692781189] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:20:32,468 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:20:32,468 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:20:32,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756657913] [2025-03-16 19:20:32,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:20:32,469 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:20:32,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:20:32,469 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:20:32,469 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:20:32,469 INFO L87 Difference]: Start difference. First operand 103119 states and 148247 transitions. Second operand has 3 states, 3 states have (on average 56.666666666666664) internal successors, (170), 3 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:20:32,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:20:32,792 INFO L93 Difference]: Finished difference Result 182467 states and 262024 transitions. [2025-03-16 19:20:32,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:20:32,793 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 56.666666666666664) internal successors, (170), 3 states have internal predecessors, (170), 0 states have call successors, (0), 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 170 [2025-03-16 19:20:32,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:20:32,920 INFO L225 Difference]: With dead ends: 182467 [2025-03-16 19:20:32,920 INFO L226 Difference]: Without dead ends: 103129 [2025-03-16 19:20:32,996 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-16 19:20:32,997 INFO L435 NwaCegarLoop]: 434 mSDtfsCounter, 0 mSDsluCounter, 428 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 862 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:20:32,997 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 862 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:20:33,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103129 states. [2025-03-16 19:20:34,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103129 to 103129. [2025-03-16 19:20:34,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103129 states, 103128 states have (on average 1.4376018152199208) internal successors, (148257), 103128 states have internal predecessors, (148257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:20:34,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103129 states to 103129 states and 148257 transitions. [2025-03-16 19:20:34,866 INFO L78 Accepts]: Start accepts. Automaton has 103129 states and 148257 transitions. Word has length 170 [2025-03-16 19:20:34,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:20:34,866 INFO L471 AbstractCegarLoop]: Abstraction has 103129 states and 148257 transitions. [2025-03-16 19:20:34,866 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 56.666666666666664) internal successors, (170), 3 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:20:34,867 INFO L276 IsEmpty]: Start isEmpty. Operand 103129 states and 148257 transitions. [2025-03-16 19:20:34,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2025-03-16 19:20:34,893 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:20:34,893 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 19:20:34,893 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-16 19:20:34,893 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:20:34,894 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:20:34,894 INFO L85 PathProgramCache]: Analyzing trace with hash -1122236362, now seen corresponding path program 1 times [2025-03-16 19:20:34,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:20:34,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340237837] [2025-03-16 19:20:34,894 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:20:34,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:20:34,909 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-03-16 19:20:34,937 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-03-16 19:20:34,938 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:20:34,938 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:20:35,360 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-16 19:20:35,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:20:35,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1340237837] [2025-03-16 19:20:35,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1340237837] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:20:35,362 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:20:35,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 19:20:35,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1017902980] [2025-03-16 19:20:35,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:20:35,363 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 19:20:35,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:20:35,364 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 19:20:35,364 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 19:20:35,364 INFO L87 Difference]: Start difference. First operand 103129 states and 148257 transitions. Second operand has 4 states, 4 states have (on average 42.75) internal successors, (171), 4 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:20:35,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:20:35,684 INFO L93 Difference]: Finished difference Result 182985 states and 262604 transitions. [2025-03-16 19:20:35,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 19:20:35,684 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 42.75) internal successors, (171), 4 states have internal predecessors, (171), 0 states have call successors, (0), 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 171 [2025-03-16 19:20:35,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:20:35,825 INFO L225 Difference]: With dead ends: 182985 [2025-03-16 19:20:35,825 INFO L226 Difference]: Without dead ends: 103119 [2025-03-16 19:20:35,891 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 19:20:35,892 INFO L435 NwaCegarLoop]: 451 mSDtfsCounter, 3 mSDsluCounter, 876 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1327 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:20:35,892 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1327 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:20:35,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103119 states. [2025-03-16 19:20:37,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103119 to 103119. [2025-03-16 19:20:37,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103119 states, 103118 states have (on average 1.437595764076107) internal successors, (148242), 103118 states have internal predecessors, (148242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:20:37,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103119 states to 103119 states and 148242 transitions. [2025-03-16 19:20:37,629 INFO L78 Accepts]: Start accepts. Automaton has 103119 states and 148242 transitions. Word has length 171 [2025-03-16 19:20:37,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:20:37,630 INFO L471 AbstractCegarLoop]: Abstraction has 103119 states and 148242 transitions. [2025-03-16 19:20:37,630 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 42.75) internal successors, (171), 4 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:20:37,630 INFO L276 IsEmpty]: Start isEmpty. Operand 103119 states and 148242 transitions. [2025-03-16 19:20:37,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2025-03-16 19:20:37,669 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:20:37,669 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 19:20:37,669 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-16 19:20:37,670 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:20:37,670 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:20:37,670 INFO L85 PathProgramCache]: Analyzing trace with hash 1738095515, now seen corresponding path program 1 times [2025-03-16 19:20:37,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:20:37,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199947426] [2025-03-16 19:20:37,670 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:20:37,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:20:37,685 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-03-16 19:20:37,729 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-03-16 19:20:37,729 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:20:37,729 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:20:37,915 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-16 19:20:37,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:20:37,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [199947426] [2025-03-16 19:20:37,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [199947426] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:20:37,915 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:20:37,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:20:37,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081240829] [2025-03-16 19:20:37,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:20:37,916 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 19:20:37,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:20:37,916 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 19:20:37,917 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 19:20:37,917 INFO L87 Difference]: Start difference. First operand 103119 states and 148242 transitions. Second operand has 4 states, 4 states have (on average 42.75) internal successors, (171), 3 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:20:38,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:20:38,563 INFO L93 Difference]: Finished difference Result 166651 states and 239653 transitions. [2025-03-16 19:20:38,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 19:20:38,563 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 42.75) internal successors, (171), 3 states have internal predecessors, (171), 0 states have call successors, (0), 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 171 [2025-03-16 19:20:38,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:20:38,671 INFO L225 Difference]: With dead ends: 166651 [2025-03-16 19:20:38,671 INFO L226 Difference]: Without dead ends: 89739 [2025-03-16 19:20:38,724 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 19:20:38,725 INFO L435 NwaCegarLoop]: 485 mSDtfsCounter, 721 mSDsluCounter, 376 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 721 SdHoareTripleChecker+Valid, 861 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 19:20:38,725 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [721 Valid, 861 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 19:20:38,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89739 states. [2025-03-16 19:20:39,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89739 to 89402. [2025-03-16 19:20:39,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89402 states, 89401 states have (on average 1.4350734331830741) internal successors, (128297), 89401 states have internal predecessors, (128297), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:20:39,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89402 states to 89402 states and 128297 transitions. [2025-03-16 19:20:39,961 INFO L78 Accepts]: Start accepts. Automaton has 89402 states and 128297 transitions. Word has length 171 [2025-03-16 19:20:39,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:20:39,961 INFO L471 AbstractCegarLoop]: Abstraction has 89402 states and 128297 transitions. [2025-03-16 19:20:39,961 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 42.75) internal successors, (171), 3 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:20:39,961 INFO L276 IsEmpty]: Start isEmpty. Operand 89402 states and 128297 transitions. [2025-03-16 19:20:39,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2025-03-16 19:20:39,986 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:20:39,986 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 19:20:39,986 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-16 19:20:39,986 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:20:39,986 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:20:39,987 INFO L85 PathProgramCache]: Analyzing trace with hash 271729630, now seen corresponding path program 1 times [2025-03-16 19:20:39,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:20:39,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [717826564] [2025-03-16 19:20:39,987 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:20:39,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:20:39,998 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 173 statements into 1 equivalence classes. [2025-03-16 19:20:40,006 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 173 of 173 statements. [2025-03-16 19:20:40,007 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:20:40,007 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:20:40,300 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-16 19:20:40,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:20:40,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [717826564] [2025-03-16 19:20:40,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [717826564] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:20:40,301 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:20:40,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:20:40,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1215349933] [2025-03-16 19:20:40,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:20:40,301 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:20:40,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:20:40,302 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:20:40,302 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:20:40,302 INFO L87 Difference]: Start difference. First operand 89402 states and 128297 transitions. Second operand has 3 states, 3 states have (on average 57.666666666666664) internal successors, (173), 3 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:20:40,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:20:40,883 INFO L93 Difference]: Finished difference Result 247010 states and 357998 transitions. [2025-03-16 19:20:40,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:20:40,884 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 57.666666666666664) internal successors, (173), 3 states have internal predecessors, (173), 0 states have call successors, (0), 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 173 [2025-03-16 19:20:40,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:20:41,117 INFO L225 Difference]: With dead ends: 247010 [2025-03-16 19:20:41,117 INFO L226 Difference]: Without dead ends: 169943 [2025-03-16 19:20:41,209 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-16 19:20:41,209 INFO L435 NwaCegarLoop]: 533 mSDtfsCounter, 238 mSDsluCounter, 318 mSDsCounter, 0 mSdLazyCounter, 188 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 238 SdHoareTripleChecker+Valid, 851 SdHoareTripleChecker+Invalid, 197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:20:41,209 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [238 Valid, 851 Invalid, 197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 188 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:20:41,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169943 states. [2025-03-16 19:20:43,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169943 to 169941. [2025-03-16 19:20:43,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169941 states, 169940 states have (on average 1.4298575967988703) internal successors, (242990), 169940 states have internal predecessors, (242990), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:20:44,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169941 states to 169941 states and 242990 transitions. [2025-03-16 19:20:44,153 INFO L78 Accepts]: Start accepts. Automaton has 169941 states and 242990 transitions. Word has length 173 [2025-03-16 19:20:44,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:20:44,153 INFO L471 AbstractCegarLoop]: Abstraction has 169941 states and 242990 transitions. [2025-03-16 19:20:44,154 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 57.666666666666664) internal successors, (173), 3 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:20:44,154 INFO L276 IsEmpty]: Start isEmpty. Operand 169941 states and 242990 transitions. [2025-03-16 19:20:44,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2025-03-16 19:20:44,195 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:20:44,195 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 19:20:44,196 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-16 19:20:44,196 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:20:44,196 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:20:44,196 INFO L85 PathProgramCache]: Analyzing trace with hash 819449599, now seen corresponding path program 1 times [2025-03-16 19:20:44,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:20:44,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [440043909] [2025-03-16 19:20:44,196 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:20:44,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:20:44,211 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 173 statements into 1 equivalence classes. [2025-03-16 19:20:44,222 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 173 of 173 statements. [2025-03-16 19:20:44,222 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:20:44,222 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:20:44,286 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-16 19:20:44,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:20:44,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [440043909] [2025-03-16 19:20:44,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [440043909] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:20:44,286 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:20:44,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 19:20:44,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [672723539] [2025-03-16 19:20:44,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:20:44,287 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 19:20:44,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:20:44,287 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 19:20:44,287 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:20:44,288 INFO L87 Difference]: Start difference. First operand 169941 states and 242990 transitions. Second operand has 5 states, 5 states have (on average 34.6) internal successors, (173), 4 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:20:44,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:20:44,884 INFO L93 Difference]: Finished difference Result 222373 states and 319259 transitions. [2025-03-16 19:20:44,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 19:20:44,885 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 34.6) internal successors, (173), 4 states have internal predecessors, (173), 0 states have call successors, (0), 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 173 [2025-03-16 19:20:44,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:20:45,002 INFO L225 Difference]: With dead ends: 222373 [2025-03-16 19:20:45,002 INFO L226 Difference]: Without dead ends: 89402 [2025-03-16 19:20:45,088 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-16 19:20:45,088 INFO L435 NwaCegarLoop]: 319 mSDtfsCounter, 1116 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1116 SdHoareTripleChecker+Valid, 403 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:20:45,089 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1116 Valid, 403 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:20:45,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89402 states. [2025-03-16 19:20:46,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89402 to 89402. [2025-03-16 19:20:46,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89402 states, 89401 states have (on average 1.4148723168644646) internal successors, (126491), 89401 states have internal predecessors, (126491), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:20:46,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89402 states to 89402 states and 126491 transitions. [2025-03-16 19:20:46,661 INFO L78 Accepts]: Start accepts. Automaton has 89402 states and 126491 transitions. Word has length 173 [2025-03-16 19:20:46,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:20:46,662 INFO L471 AbstractCegarLoop]: Abstraction has 89402 states and 126491 transitions. [2025-03-16 19:20:46,662 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 34.6) internal successors, (173), 4 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:20:46,662 INFO L276 IsEmpty]: Start isEmpty. Operand 89402 states and 126491 transitions. [2025-03-16 19:20:46,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2025-03-16 19:20:46,693 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:20:46,693 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 19:20:46,693 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-16 19:20:46,693 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:20:46,693 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:20:46,693 INFO L85 PathProgramCache]: Analyzing trace with hash -1176785121, now seen corresponding path program 1 times [2025-03-16 19:20:46,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:20:46,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1318577474] [2025-03-16 19:20:46,694 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:20:46,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:20:46,708 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 173 statements into 1 equivalence classes. [2025-03-16 19:20:46,728 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 173 of 173 statements. [2025-03-16 19:20:46,728 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:20:46,728 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:20:47,021 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-16 19:20:47,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:20:47,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1318577474] [2025-03-16 19:20:47,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1318577474] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:20:47,022 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:20:47,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-16 19:20:47,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069665681] [2025-03-16 19:20:47,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:20:47,023 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-16 19:20:47,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:20:47,024 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-16 19:20:47,024 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2025-03-16 19:20:47,024 INFO L87 Difference]: Start difference. First operand 89402 states and 126491 transitions. Second operand has 10 states, 10 states have (on average 17.3) internal successors, (173), 9 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:20:47,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:20:47,570 INFO L93 Difference]: Finished difference Result 161680 states and 232990 transitions. [2025-03-16 19:20:47,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 19:20:47,571 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 17.3) internal successors, (173), 9 states have internal predecessors, (173), 0 states have call successors, (0), 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 173 [2025-03-16 19:20:47,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:20:47,678 INFO L225 Difference]: With dead ends: 161680 [2025-03-16 19:20:47,678 INFO L226 Difference]: Without dead ends: 78814 [2025-03-16 19:20:47,742 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2025-03-16 19:20:47,742 INFO L435 NwaCegarLoop]: 319 mSDtfsCounter, 2798 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2798 SdHoareTripleChecker+Valid, 497 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:20:47,743 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2798 Valid, 497 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:20:47,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78814 states. [2025-03-16 19:20:48,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78814 to 48678. [2025-03-16 19:20:48,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48678 states, 48677 states have (on average 1.3920948291801056) internal successors, (67763), 48677 states have internal predecessors, (67763), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:20:48,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48678 states to 48678 states and 67763 transitions. [2025-03-16 19:20:48,772 INFO L78 Accepts]: Start accepts. Automaton has 48678 states and 67763 transitions. Word has length 173 [2025-03-16 19:20:48,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:20:48,772 INFO L471 AbstractCegarLoop]: Abstraction has 48678 states and 67763 transitions. [2025-03-16 19:20:48,772 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 17.3) internal successors, (173), 9 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:20:48,772 INFO L276 IsEmpty]: Start isEmpty. Operand 48678 states and 67763 transitions. [2025-03-16 19:20:48,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2025-03-16 19:20:48,785 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:20:48,785 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 19:20:48,785 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-03-16 19:20:48,785 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:20:48,786 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:20:48,786 INFO L85 PathProgramCache]: Analyzing trace with hash -1828895456, now seen corresponding path program 1 times [2025-03-16 19:20:48,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:20:48,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1285309570] [2025-03-16 19:20:48,786 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:20:48,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:20:48,797 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 173 statements into 1 equivalence classes. [2025-03-16 19:20:48,809 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 173 of 173 statements. [2025-03-16 19:20:48,809 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:20:48,809 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat