./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.4.1.ufo.BOUNDED-8.pals.c.v+cfa-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.4.1.ufo.BOUNDED-8.pals.c.v+cfa-reducer.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 0e4a14a6af4061d17c8fde5475e0f3a38fede87663f764ff2ccff752f7727295 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 16:48:34,551 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 16:48:34,619 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 16:48:34,623 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 16:48:34,624 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 16:48:34,646 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 16:48:34,647 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 16:48:34,647 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 16:48:34,647 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 16:48:34,647 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 16:48:34,647 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 16:48:34,647 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 16:48:34,647 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 16:48:34,647 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 16:48:34,647 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 16:48:34,649 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 16:48:34,649 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 16:48:34,649 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 16:48:34,649 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 16:48:34,649 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 16:48:34,649 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 16:48:34,650 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 16:48:34,650 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 16:48:34,650 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 16:48:34,650 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 16:48:34,650 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 16:48:34,650 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 16:48:34,650 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 16:48:34,650 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 16:48:34,650 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 16:48:34,651 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 16:48:34,651 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 16:48:34,651 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 16:48:34,651 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 16:48:34,651 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 16:48:34,651 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 16:48:34,651 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 16:48:34,651 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 16:48:34,652 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 16:48:34,652 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 16:48:34,652 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 16:48:34,652 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 16:48:34,652 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 16:48:34,652 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-jdk21/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 -> 0e4a14a6af4061d17c8fde5475e0f3a38fede87663f764ff2ccff752f7727295 [2025-02-05 16:48:34,912 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 16:48:34,921 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 16:48:34,923 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 16:48:34,923 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 16:48:34,924 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 16:48:34,925 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.4.1.ufo.BOUNDED-8.pals.c.v+cfa-reducer.c [2025-02-05 16:48:36,101 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b2531f7ee/cf7f65d702854ae389e4e87f0a9f7582/FLAGa82466d10 [2025-02-05 16:48:36,501 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 16:48:36,501 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.4.1.ufo.BOUNDED-8.pals.c.v+cfa-reducer.c [2025-02-05 16:48:36,515 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b2531f7ee/cf7f65d702854ae389e4e87f0a9f7582/FLAGa82466d10 [2025-02-05 16:48:36,530 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b2531f7ee/cf7f65d702854ae389e4e87f0a9f7582 [2025-02-05 16:48:36,532 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 16:48:36,533 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 16:48:36,534 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 16:48:36,534 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 16:48:36,541 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 16:48:36,542 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 04:48:36" (1/1) ... [2025-02-05 16:48:36,543 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7c7fecab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:48:36, skipping insertion in model container [2025-02-05 16:48:36,543 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 04:48:36" (1/1) ... [2025-02-05 16:48:36,583 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 16:48:36,854 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.4.1.ufo.BOUNDED-8.pals.c.v+cfa-reducer.c[13338,13351] [2025-02-05 16:48:36,897 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 16:48:36,910 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 16:48:36,955 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.4.1.ufo.BOUNDED-8.pals.c.v+cfa-reducer.c[13338,13351] [2025-02-05 16:48:36,991 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 16:48:37,006 INFO L204 MainTranslator]: Completed translation [2025-02-05 16:48:37,007 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:48:37 WrapperNode [2025-02-05 16:48:37,008 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 16:48:37,009 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 16:48:37,009 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 16:48:37,009 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 16:48:37,014 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:48:37" (1/1) ... [2025-02-05 16:48:37,026 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:48:37" (1/1) ... [2025-02-05 16:48:37,066 INFO L138 Inliner]: procedures = 23, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 1411 [2025-02-05 16:48:37,067 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 16:48:37,067 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 16:48:37,067 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 16:48:37,067 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 16:48:37,077 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:48:37" (1/1) ... [2025-02-05 16:48:37,078 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:48:37" (1/1) ... [2025-02-05 16:48:37,082 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:48:37" (1/1) ... [2025-02-05 16:48:37,112 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-02-05 16:48:37,112 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:48:37" (1/1) ... [2025-02-05 16:48:37,112 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:48:37" (1/1) ... [2025-02-05 16:48:37,135 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:48:37" (1/1) ... [2025-02-05 16:48:37,141 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:48:37" (1/1) ... [2025-02-05 16:48:37,145 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:48:37" (1/1) ... [2025-02-05 16:48:37,154 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:48:37" (1/1) ... [2025-02-05 16:48:37,160 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 16:48:37,161 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 16:48:37,161 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 16:48:37,161 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 16:48:37,162 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:48:37" (1/1) ... [2025-02-05 16:48:37,167 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 16:48:37,177 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 16:48:37,191 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-05 16:48:37,197 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-05 16:48:37,214 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 16:48:37,214 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 16:48:37,214 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 16:48:37,214 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 16:48:37,361 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 16:48:37,362 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 16:48:38,280 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L864: havoc main_~node4____CPAchecker_TMP_2~0#1;havoc main_~node4____CPAchecker_TMP_1~0#1;havoc main_~node4____CPAchecker_TMP_0~0#1; [2025-02-05 16:48:38,280 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L699: havoc main_~main____CPAchecker_TMP_0~0#1;havoc main_~__tmp_1~0#1, main_~assert__arg~0#1;havoc main_~check__tmp~0#1; [2025-02-05 16:48:38,280 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L503: havoc main_~node2__newmax~0#1; [2025-02-05 16:48:38,280 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L545: havoc main_~node3__newmax~0#1; [2025-02-05 16:48:38,280 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1344: havoc main_~node1____CPAchecker_TMP_2~0#1;havoc main_~node1____CPAchecker_TMP_1~0#1;havoc main_~node1____CPAchecker_TMP_0~0#1; [2025-02-05 16:48:38,280 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L587: havoc main_~node4__newmax~0#1; [2025-02-05 16:48:38,280 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1184: havoc main_~node2____CPAchecker_TMP_2~0#1;havoc main_~node2____CPAchecker_TMP_1~0#1;havoc main_~node2____CPAchecker_TMP_0~0#1; [2025-02-05 16:48:38,280 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L461: havoc main_~node1__newmax~0#1;havoc main_~init__r121~0#1, main_~init__r131~0#1, main_~init__r141~0#1, main_~init__r211~0#1, main_~init__r231~0#1, main_~init__r241~0#1, main_~init__r311~0#1, main_~init__r321~0#1, main_~init__r341~0#1, main_~init__r411~0#1, main_~init__r421~0#1, main_~init__r431~0#1, main_~init__r122~0#1, main_~init__tmp~0#1, main_~init__r132~0#1, main_~init__tmp___0~0#1, main_~init__r142~0#1, main_~init__tmp___1~0#1, main_~init__r212~0#1, main_~init__tmp___2~0#1, main_~init__r232~0#1, main_~init__tmp___3~0#1, main_~init__r242~0#1, main_~init__tmp___4~0#1, main_~init__r312~0#1, main_~init__tmp___5~0#1, main_~init__r322~0#1, main_~init__tmp___6~0#1, main_~init__r342~0#1, main_~init__tmp___7~0#1, main_~init__r412~0#1, main_~init__tmp___8~0#1, main_~init__r422~0#1, main_~init__tmp___9~0#1, main_~init__r432~0#1, main_~init__tmp___10~0#1, main_~init__r123~0#1, main_~init__tmp___11~0#1, main_~init__r133~0#1, main_~init__tmp___12~0#1, main_~init__r143~0#1, main_~init__tmp___13~0#1, main_~init__r213~0#1, main_~init__tmp___14~0#1, main_~init__r233~0#1, main_~init__tmp___15~0#1, main_~init__r243~0#1, main_~init__tmp___16~0#1, main_~init__r313~0#1, main_~init__tmp___17~0#1, main_~init__r323~0#1, main_~init__tmp___18~0#1, main_~init__r343~0#1, main_~init__tmp___19~0#1, main_~init__r413~0#1, main_~init__tmp___20~0#1, main_~init__r423~0#1, main_~init__tmp___21~0#1, main_~init__r433~0#1, main_~init__tmp___22~0#1, main_~init__tmp___23~0#1; [2025-02-05 16:48:38,280 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1024: havoc main_~node3____CPAchecker_TMP_2~0#1;havoc main_~node3____CPAchecker_TMP_1~0#1;havoc main_~node3____CPAchecker_TMP_0~0#1; [2025-02-05 16:48:38,392 INFO L? ?]: Removed 112 outVars from TransFormulas that were not future-live. [2025-02-05 16:48:38,393 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 16:48:38,409 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 16:48:38,409 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 16:48:38,410 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 04:48:38 BoogieIcfgContainer [2025-02-05 16:48:38,410 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 16:48:38,412 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 16:48:38,412 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 16:48:38,415 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 16:48:38,415 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 04:48:36" (1/3) ... [2025-02-05 16:48:38,415 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7421c585 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 04:48:38, skipping insertion in model container [2025-02-05 16:48:38,415 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:48:37" (2/3) ... [2025-02-05 16:48:38,416 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7421c585 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 04:48:38, skipping insertion in model container [2025-02-05 16:48:38,416 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 04:48:38" (3/3) ... [2025-02-05 16:48:38,416 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_opt-floodmax.4.1.ufo.BOUNDED-8.pals.c.v+cfa-reducer.c [2025-02-05 16:48:38,430 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 16:48:38,433 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_opt-floodmax.4.1.ufo.BOUNDED-8.pals.c.v+cfa-reducer.c that has 1 procedures, 330 locations, 1 initial locations, 0 loop locations, and 1 error locations. [2025-02-05 16:48:38,480 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 16:48:38,488 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;@61984d3c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 16:48:38,489 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 16:48:38,492 INFO L276 IsEmpty]: Start isEmpty. Operand has 330 states, 328 states have (on average 1.7896341463414633) internal successors, (587), 329 states have internal predecessors, (587), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:48:38,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-02-05 16:48:38,502 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:48:38,502 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:48:38,503 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:48:38,506 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:48:38,506 INFO L85 PathProgramCache]: Analyzing trace with hash 856694754, now seen corresponding path program 1 times [2025-02-05 16:48:38,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:48:38,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841470741] [2025-02-05 16:48:38,511 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:48:38,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:48:38,599 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-02-05 16:48:38,746 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-02-05 16:48:38,746 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:48:38,746 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:48:39,054 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:48:39,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:48:39,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [841470741] [2025-02-05 16:48:39,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [841470741] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:48:39,054 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:48:39,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:48:39,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1654822526] [2025-02-05 16:48:39,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:48:39,060 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:48:39,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:48:39,072 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:48:39,072 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:48:39,076 INFO L87 Difference]: Start difference. First operand has 330 states, 328 states have (on average 1.7896341463414633) internal successors, (587), 329 states have internal predecessors, (587), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:48:39,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:48:39,194 INFO L93 Difference]: Finished difference Result 616 states and 1067 transitions. [2025-02-05 16:48:39,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:48:39,195 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 106 [2025-02-05 16:48:39,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:48:39,206 INFO L225 Difference]: With dead ends: 616 [2025-02-05 16:48:39,206 INFO L226 Difference]: Without dead ends: 461 [2025-02-05 16:48:39,210 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-02-05 16:48:39,212 INFO L435 NwaCegarLoop]: 587 mSDtfsCounter, 244 mSDsluCounter, 521 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 244 SdHoareTripleChecker+Valid, 1108 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:48:39,213 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [244 Valid, 1108 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:48:39,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 461 states. [2025-02-05 16:48:39,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 461 to 459. [2025-02-05 16:48:39,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 459 states, 458 states have (on average 1.6746724890829694) internal successors, (767), 458 states have internal predecessors, (767), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:48:39,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 459 states to 459 states and 767 transitions. [2025-02-05 16:48:39,278 INFO L78 Accepts]: Start accepts. Automaton has 459 states and 767 transitions. Word has length 106 [2025-02-05 16:48:39,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:48:39,278 INFO L471 AbstractCegarLoop]: Abstraction has 459 states and 767 transitions. [2025-02-05 16:48:39,278 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:48:39,278 INFO L276 IsEmpty]: Start isEmpty. Operand 459 states and 767 transitions. [2025-02-05 16:48:39,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-02-05 16:48:39,283 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:48:39,283 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:48:39,283 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 16:48:39,283 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:48:39,284 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:48:39,285 INFO L85 PathProgramCache]: Analyzing trace with hash 1184143246, now seen corresponding path program 1 times [2025-02-05 16:48:39,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:48:39,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1602428531] [2025-02-05 16:48:39,285 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:48:39,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:48:39,310 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-02-05 16:48:39,339 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-02-05 16:48:39,339 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:48:39,339 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:48:39,504 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:48:39,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:48:39,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1602428531] [2025-02-05 16:48:39,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1602428531] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:48:39,506 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:48:39,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:48:39,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604347019] [2025-02-05 16:48:39,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:48:39,507 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:48:39,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:48:39,508 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:48:39,508 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:48:39,508 INFO L87 Difference]: Start difference. First operand 459 states and 767 transitions. Second operand has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:48:39,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:48:39,582 INFO L93 Difference]: Finished difference Result 995 states and 1663 transitions. [2025-02-05 16:48:39,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:48:39,582 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 109 [2025-02-05 16:48:39,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:48:39,585 INFO L225 Difference]: With dead ends: 995 [2025-02-05 16:48:39,589 INFO L226 Difference]: Without dead ends: 717 [2025-02-05 16:48:39,590 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-02-05 16:48:39,591 INFO L435 NwaCegarLoop]: 546 mSDtfsCounter, 218 mSDsluCounter, 517 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 218 SdHoareTripleChecker+Valid, 1063 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:48:39,591 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [218 Valid, 1063 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:48:39,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 717 states. [2025-02-05 16:48:39,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 717 to 715. [2025-02-05 16:48:39,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 715 states, 714 states have (on average 1.6722689075630253) internal successors, (1194), 714 states have internal predecessors, (1194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:48:39,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 715 states to 715 states and 1194 transitions. [2025-02-05 16:48:39,615 INFO L78 Accepts]: Start accepts. Automaton has 715 states and 1194 transitions. Word has length 109 [2025-02-05 16:48:39,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:48:39,615 INFO L471 AbstractCegarLoop]: Abstraction has 715 states and 1194 transitions. [2025-02-05 16:48:39,615 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:48:39,615 INFO L276 IsEmpty]: Start isEmpty. Operand 715 states and 1194 transitions. [2025-02-05 16:48:39,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-02-05 16:48:39,617 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:48:39,617 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:48:39,617 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 16:48:39,617 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:48:39,618 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:48:39,618 INFO L85 PathProgramCache]: Analyzing trace with hash 754648979, now seen corresponding path program 1 times [2025-02-05 16:48:39,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:48:39,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [395865090] [2025-02-05 16:48:39,618 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:48:39,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:48:39,638 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-02-05 16:48:39,685 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-02-05 16:48:39,689 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:48:39,689 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:48:39,802 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:48:39,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:48:39,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [395865090] [2025-02-05 16:48:39,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [395865090] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:48:39,804 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:48:39,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:48:39,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083802910] [2025-02-05 16:48:39,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:48:39,804 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:48:39,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:48:39,806 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:48:39,806 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:48:39,806 INFO L87 Difference]: Start difference. First operand 715 states and 1194 transitions. Second operand has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:48:39,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:48:39,860 INFO L93 Difference]: Finished difference Result 1743 states and 2908 transitions. [2025-02-05 16:48:39,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:48:39,861 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 112 [2025-02-05 16:48:39,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:48:39,865 INFO L225 Difference]: With dead ends: 1743 [2025-02-05 16:48:39,865 INFO L226 Difference]: Without dead ends: 1209 [2025-02-05 16:48:39,866 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:48:39,866 INFO L435 NwaCegarLoop]: 546 mSDtfsCounter, 211 mSDsluCounter, 518 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 211 SdHoareTripleChecker+Valid, 1064 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:48:39,866 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [211 Valid, 1064 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:48:39,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1209 states. [2025-02-05 16:48:39,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1209 to 1207. [2025-02-05 16:48:39,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1207 states, 1206 states have (on average 1.6666666666666667) internal successors, (2010), 1206 states have internal predecessors, (2010), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:48:39,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1207 states to 1207 states and 2010 transitions. [2025-02-05 16:48:39,891 INFO L78 Accepts]: Start accepts. Automaton has 1207 states and 2010 transitions. Word has length 112 [2025-02-05 16:48:39,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:48:39,891 INFO L471 AbstractCegarLoop]: Abstraction has 1207 states and 2010 transitions. [2025-02-05 16:48:39,892 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:48:39,892 INFO L276 IsEmpty]: Start isEmpty. Operand 1207 states and 2010 transitions. [2025-02-05 16:48:39,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-02-05 16:48:39,893 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:48:39,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] [2025-02-05 16:48:39,893 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 16:48:39,894 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:48:39,895 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:48:39,895 INFO L85 PathProgramCache]: Analyzing trace with hash 1921660191, now seen corresponding path program 1 times [2025-02-05 16:48:39,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:48:39,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [191809146] [2025-02-05 16:48:39,895 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:48:39,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:48:39,919 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-02-05 16:48:39,943 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-02-05 16:48:39,943 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:48:39,943 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:48:40,052 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:48:40,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:48:40,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [191809146] [2025-02-05 16:48:40,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [191809146] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:48:40,052 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:48:40,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:48:40,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2088506140] [2025-02-05 16:48:40,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:48:40,053 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:48:40,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:48:40,053 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:48:40,053 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:48:40,053 INFO L87 Difference]: Start difference. First operand 1207 states and 2010 transitions. Second operand has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:48:40,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:48:40,092 INFO L93 Difference]: Finished difference Result 3179 states and 5284 transitions. [2025-02-05 16:48:40,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:48:40,093 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 115 [2025-02-05 16:48:40,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:48:40,099 INFO L225 Difference]: With dead ends: 3179 [2025-02-05 16:48:40,100 INFO L226 Difference]: Without dead ends: 2153 [2025-02-05 16:48:40,101 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-02-05 16:48:40,102 INFO L435 NwaCegarLoop]: 546 mSDtfsCounter, 204 mSDsluCounter, 519 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 204 SdHoareTripleChecker+Valid, 1065 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:48:40,102 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [204 Valid, 1065 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:48:40,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2153 states. [2025-02-05 16:48:40,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2153 to 2151. [2025-02-05 16:48:40,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2151 states, 2150 states have (on average 1.6586046511627908) internal successors, (3566), 2150 states have internal predecessors, (3566), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:48:40,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2151 states to 2151 states and 3566 transitions. [2025-02-05 16:48:40,153 INFO L78 Accepts]: Start accepts. Automaton has 2151 states and 3566 transitions. Word has length 115 [2025-02-05 16:48:40,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:48:40,153 INFO L471 AbstractCegarLoop]: Abstraction has 2151 states and 3566 transitions. [2025-02-05 16:48:40,153 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:48:40,154 INFO L276 IsEmpty]: Start isEmpty. Operand 2151 states and 3566 transitions. [2025-02-05 16:48:40,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-02-05 16:48:40,156 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:48:40,156 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:48:40,156 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 16:48:40,157 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:48:40,157 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:48:40,157 INFO L85 PathProgramCache]: Analyzing trace with hash 143811652, now seen corresponding path program 1 times [2025-02-05 16:48:40,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:48:40,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716305674] [2025-02-05 16:48:40,157 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:48:40,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:48:40,179 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-02-05 16:48:40,206 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-02-05 16:48:40,206 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:48:40,206 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:48:40,369 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:48:40,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:48:40,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1716305674] [2025-02-05 16:48:40,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1716305674] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:48:40,369 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:48:40,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 16:48:40,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [897287398] [2025-02-05 16:48:40,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:48:40,370 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 16:48:40,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:48:40,371 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 16:48:40,371 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 16:48:40,371 INFO L87 Difference]: Start difference. First operand 2151 states and 3566 transitions. Second operand has 6 states, 6 states have (on average 19.666666666666668) internal successors, (118), 6 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:48:40,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:48:40,663 INFO L93 Difference]: Finished difference Result 11271 states and 18798 transitions. [2025-02-05 16:48:40,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 16:48:40,664 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 19.666666666666668) internal successors, (118), 6 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 118 [2025-02-05 16:48:40,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:48:40,694 INFO L225 Difference]: With dead ends: 11271 [2025-02-05 16:48:40,694 INFO L226 Difference]: Without dead ends: 9301 [2025-02-05 16:48:40,701 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-02-05 16:48:40,702 INFO L435 NwaCegarLoop]: 545 mSDtfsCounter, 1930 mSDsluCounter, 4822 mSDsCounter, 0 mSdLazyCounter, 226 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1930 SdHoareTripleChecker+Valid, 5367 SdHoareTripleChecker+Invalid, 233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 226 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 16:48:40,702 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1930 Valid, 5367 Invalid, 233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 226 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 16:48:40,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9301 states. [2025-02-05 16:48:40,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9301 to 3989. [2025-02-05 16:48:40,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3989 states, 3988 states have (on average 1.657221664994985) internal successors, (6609), 3988 states have internal predecessors, (6609), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:48:40,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3989 states to 3989 states and 6609 transitions. [2025-02-05 16:48:40,865 INFO L78 Accepts]: Start accepts. Automaton has 3989 states and 6609 transitions. Word has length 118 [2025-02-05 16:48:40,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:48:40,866 INFO L471 AbstractCegarLoop]: Abstraction has 3989 states and 6609 transitions. [2025-02-05 16:48:40,866 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.666666666666668) internal successors, (118), 6 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:48:40,866 INFO L276 IsEmpty]: Start isEmpty. Operand 3989 states and 6609 transitions. [2025-02-05 16:48:40,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-02-05 16:48:40,870 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:48:40,870 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:48:40,871 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 16:48:40,871 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:48:40,871 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:48:40,871 INFO L85 PathProgramCache]: Analyzing trace with hash 165162178, now seen corresponding path program 1 times [2025-02-05 16:48:40,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:48:40,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884899441] [2025-02-05 16:48:40,871 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:48:40,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:48:40,897 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-02-05 16:48:40,918 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-02-05 16:48:40,918 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:48:40,918 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:48:41,025 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:48:41,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:48:41,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [884899441] [2025-02-05 16:48:41,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [884899441] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:48:41,026 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:48:41,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 16:48:41,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256058272] [2025-02-05 16:48:41,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:48:41,027 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 16:48:41,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:48:41,027 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 16:48:41,027 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 16:48:41,027 INFO L87 Difference]: Start difference. First operand 3989 states and 6609 transitions. Second operand has 4 states, 4 states have (on average 29.75) internal successors, (119), 4 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:48:41,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:48:41,133 INFO L93 Difference]: Finished difference Result 11701 states and 19469 transitions. [2025-02-05 16:48:41,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 16:48:41,134 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 29.75) internal successors, (119), 4 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 119 [2025-02-05 16:48:41,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:48:41,161 INFO L225 Difference]: With dead ends: 11701 [2025-02-05 16:48:41,161 INFO L226 Difference]: Without dead ends: 7893 [2025-02-05 16:48:41,169 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:48:41,170 INFO L435 NwaCegarLoop]: 547 mSDtfsCounter, 717 mSDsluCounter, 1096 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 717 SdHoareTripleChecker+Valid, 1643 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:48:41,170 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [717 Valid, 1643 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:48:41,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7893 states. [2025-02-05 16:48:41,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7893 to 5924. [2025-02-05 16:48:41,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5924 states, 5923 states have (on average 1.6586189431031573) internal successors, (9824), 5923 states have internal predecessors, (9824), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:48:41,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5924 states to 5924 states and 9824 transitions. [2025-02-05 16:48:41,308 INFO L78 Accepts]: Start accepts. Automaton has 5924 states and 9824 transitions. Word has length 119 [2025-02-05 16:48:41,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:48:41,308 INFO L471 AbstractCegarLoop]: Abstraction has 5924 states and 9824 transitions. [2025-02-05 16:48:41,308 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 29.75) internal successors, (119), 4 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:48:41,309 INFO L276 IsEmpty]: Start isEmpty. Operand 5924 states and 9824 transitions. [2025-02-05 16:48:41,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2025-02-05 16:48:41,312 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:48:41,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] [2025-02-05 16:48:41,313 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 16:48:41,313 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:48:41,314 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:48:41,314 INFO L85 PathProgramCache]: Analyzing trace with hash -1915680007, now seen corresponding path program 1 times [2025-02-05 16:48:41,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:48:41,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [621493167] [2025-02-05 16:48:41,314 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:48:41,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:48:41,332 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-02-05 16:48:41,362 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-02-05 16:48:41,362 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:48:41,362 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:48:41,460 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:48:41,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:48:41,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [621493167] [2025-02-05 16:48:41,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [621493167] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:48:41,461 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:48:41,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:48:41,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492825329] [2025-02-05 16:48:41,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:48:41,461 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:48:41,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:48:41,461 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:48:41,462 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:48:41,462 INFO L87 Difference]: Start difference. First operand 5924 states and 9824 transitions. Second operand has 3 states, 3 states have (on average 40.0) internal successors, (120), 3 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:48:41,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:48:41,528 INFO L93 Difference]: Finished difference Result 13013 states and 21666 transitions. [2025-02-05 16:48:41,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:48:41,529 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.0) internal successors, (120), 3 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 120 [2025-02-05 16:48:41,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:48:41,555 INFO L225 Difference]: With dead ends: 13013 [2025-02-05 16:48:41,555 INFO L226 Difference]: Without dead ends: 9012 [2025-02-05 16:48:41,564 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-02-05 16:48:41,564 INFO L435 NwaCegarLoop]: 731 mSDtfsCounter, 226 mSDsluCounter, 501 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 226 SdHoareTripleChecker+Valid, 1232 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:48:41,564 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [226 Valid, 1232 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:48:41,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9012 states. [2025-02-05 16:48:41,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9012 to 9010. [2025-02-05 16:48:41,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9010 states, 9009 states have (on average 1.6581196581196582) internal successors, (14938), 9009 states have internal predecessors, (14938), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:48:41,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9010 states to 9010 states and 14938 transitions. [2025-02-05 16:48:41,720 INFO L78 Accepts]: Start accepts. Automaton has 9010 states and 14938 transitions. Word has length 120 [2025-02-05 16:48:41,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:48:41,720 INFO L471 AbstractCegarLoop]: Abstraction has 9010 states and 14938 transitions. [2025-02-05 16:48:41,720 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.0) internal successors, (120), 3 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:48:41,720 INFO L276 IsEmpty]: Start isEmpty. Operand 9010 states and 14938 transitions. [2025-02-05 16:48:41,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2025-02-05 16:48:41,722 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:48:41,722 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:48:41,722 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 16:48:41,722 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:48:41,722 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:48:41,722 INFO L85 PathProgramCache]: Analyzing trace with hash 1275200527, now seen corresponding path program 1 times [2025-02-05 16:48:41,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:48:41,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401275995] [2025-02-05 16:48:41,722 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:48:41,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:48:41,758 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-02-05 16:48:41,777 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-02-05 16:48:41,778 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:48:41,778 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:48:41,847 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:48:41,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:48:41,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [401275995] [2025-02-05 16:48:41,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [401275995] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:48:41,847 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:48:41,847 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:48:41,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363583212] [2025-02-05 16:48:41,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:48:41,848 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:48:41,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:48:41,848 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:48:41,848 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:48:41,849 INFO L87 Difference]: Start difference. First operand 9010 states and 14938 transitions. Second operand has 3 states, 3 states have (on average 40.0) internal successors, (120), 3 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:48:41,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:48:41,913 INFO L93 Difference]: Finished difference Result 17356 states and 28807 transitions. [2025-02-05 16:48:41,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:48:41,914 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.0) internal successors, (120), 3 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 120 [2025-02-05 16:48:41,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:48:41,939 INFO L225 Difference]: With dead ends: 17356 [2025-02-05 16:48:41,940 INFO L226 Difference]: Without dead ends: 12594 [2025-02-05 16:48:41,951 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-02-05 16:48:41,952 INFO L435 NwaCegarLoop]: 706 mSDtfsCounter, 219 mSDsluCounter, 502 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 219 SdHoareTripleChecker+Valid, 1208 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:48:41,952 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [219 Valid, 1208 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:48:41,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12594 states. [2025-02-05 16:48:42,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12594 to 12592. [2025-02-05 16:48:42,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12592 states, 12591 states have (on average 1.6541974426177428) internal successors, (20828), 12591 states have internal predecessors, (20828), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:48:42,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12592 states to 12592 states and 20828 transitions. [2025-02-05 16:48:42,149 INFO L78 Accepts]: Start accepts. Automaton has 12592 states and 20828 transitions. Word has length 120 [2025-02-05 16:48:42,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:48:42,149 INFO L471 AbstractCegarLoop]: Abstraction has 12592 states and 20828 transitions. [2025-02-05 16:48:42,150 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.0) internal successors, (120), 3 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:48:42,150 INFO L276 IsEmpty]: Start isEmpty. Operand 12592 states and 20828 transitions. [2025-02-05 16:48:42,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2025-02-05 16:48:42,151 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:48:42,151 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:48:42,151 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 16:48:42,151 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:48:42,152 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:48:42,152 INFO L85 PathProgramCache]: Analyzing trace with hash 799111097, now seen corresponding path program 1 times [2025-02-05 16:48:42,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:48:42,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662540785] [2025-02-05 16:48:42,152 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:48:42,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:48:42,208 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-02-05 16:48:42,228 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-02-05 16:48:42,228 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:48:42,228 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:48:42,289 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:48:42,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:48:42,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1662540785] [2025-02-05 16:48:42,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1662540785] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:48:42,289 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:48:42,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:48:42,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1957343210] [2025-02-05 16:48:42,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:48:42,289 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:48:42,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:48:42,290 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:48:42,290 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:48:42,290 INFO L87 Difference]: Start difference. First operand 12592 states and 20828 transitions. Second operand has 3 states, 3 states have (on average 40.0) internal successors, (120), 3 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:48:42,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:48:42,386 INFO L93 Difference]: Finished difference Result 24098 states and 39913 transitions. [2025-02-05 16:48:42,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:48:42,387 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.0) internal successors, (120), 3 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 120 [2025-02-05 16:48:42,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:48:42,419 INFO L225 Difference]: With dead ends: 24098 [2025-02-05 16:48:42,419 INFO L226 Difference]: Without dead ends: 17456 [2025-02-05 16:48:42,433 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-02-05 16:48:42,433 INFO L435 NwaCegarLoop]: 672 mSDtfsCounter, 212 mSDsluCounter, 503 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 212 SdHoareTripleChecker+Valid, 1175 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:48:42,434 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [212 Valid, 1175 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:48:42,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17456 states. [2025-02-05 16:48:42,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17456 to 17454. [2025-02-05 16:48:42,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17454 states, 17453 states have (on average 1.6499169197272676) internal successors, (28796), 17453 states have internal predecessors, (28796), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:48:42,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17454 states to 17454 states and 28796 transitions. [2025-02-05 16:48:42,719 INFO L78 Accepts]: Start accepts. Automaton has 17454 states and 28796 transitions. Word has length 120 [2025-02-05 16:48:42,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:48:42,720 INFO L471 AbstractCegarLoop]: Abstraction has 17454 states and 28796 transitions. [2025-02-05 16:48:42,720 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.0) internal successors, (120), 3 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:48:42,720 INFO L276 IsEmpty]: Start isEmpty. Operand 17454 states and 28796 transitions. [2025-02-05 16:48:42,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2025-02-05 16:48:42,721 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:48:42,721 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:48:42,721 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 16:48:42,722 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:48:42,726 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:48:42,726 INFO L85 PathProgramCache]: Analyzing trace with hash -1262588081, now seen corresponding path program 1 times [2025-02-05 16:48:42,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:48:42,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940108853] [2025-02-05 16:48:42,726 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:48:42,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:48:42,752 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-02-05 16:48:42,772 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-02-05 16:48:42,772 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:48:42,772 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:48:42,829 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:48:42,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:48:42,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1940108853] [2025-02-05 16:48:42,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1940108853] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:48:42,829 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:48:42,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:48:42,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1731378270] [2025-02-05 16:48:42,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:48:42,830 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:48:42,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:48:42,830 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:48:42,830 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:48:42,830 INFO L87 Difference]: Start difference. First operand 17454 states and 28796 transitions. Second operand has 3 states, 3 states have (on average 40.0) internal successors, (120), 3 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:48:42,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:48:42,920 INFO L93 Difference]: Finished difference Result 33200 states and 54855 transitions. [2025-02-05 16:48:42,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:48:42,921 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.0) internal successors, (120), 3 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 120 [2025-02-05 16:48:42,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:48:42,968 INFO L225 Difference]: With dead ends: 33200 [2025-02-05 16:48:42,968 INFO L226 Difference]: Without dead ends: 23988 [2025-02-05 16:48:43,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-02-05 16:48:43,048 INFO L435 NwaCegarLoop]: 638 mSDtfsCounter, 205 mSDsluCounter, 504 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 1142 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:48:43,049 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [205 Valid, 1142 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:48:43,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23988 states. [2025-02-05 16:48:43,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23988 to 23986. [2025-02-05 16:48:43,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23986 states, 23985 states have (on average 1.6450281425891182) internal successors, (39456), 23985 states have internal predecessors, (39456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:48:43,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23986 states to 23986 states and 39456 transitions. [2025-02-05 16:48:43,370 INFO L78 Accepts]: Start accepts. Automaton has 23986 states and 39456 transitions. Word has length 120 [2025-02-05 16:48:43,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:48:43,370 INFO L471 AbstractCegarLoop]: Abstraction has 23986 states and 39456 transitions. [2025-02-05 16:48:43,371 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.0) internal successors, (120), 3 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:48:43,371 INFO L276 IsEmpty]: Start isEmpty. Operand 23986 states and 39456 transitions. [2025-02-05 16:48:43,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2025-02-05 16:48:43,372 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:48:43,372 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:48:43,372 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-05 16:48:43,372 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:48:43,373 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:48:43,373 INFO L85 PathProgramCache]: Analyzing trace with hash 826939111, now seen corresponding path program 1 times [2025-02-05 16:48:43,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:48:43,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1973777887] [2025-02-05 16:48:43,373 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:48:43,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:48:43,393 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-02-05 16:48:43,411 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-02-05 16:48:43,412 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:48:43,412 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:48:43,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-02-05 16:48:43,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:48:43,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1973777887] [2025-02-05 16:48:43,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1973777887] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:48:43,527 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:48:43,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 16:48:43,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [348597822] [2025-02-05 16:48:43,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:48:43,528 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 16:48:43,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:48:43,528 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 16:48:43,528 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 16:48:43,529 INFO L87 Difference]: Start difference. First operand 23986 states and 39456 transitions. Second operand has 4 states, 4 states have (on average 30.0) internal successors, (120), 4 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:48:43,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:48:43,837 INFO L93 Difference]: Finished difference Result 78047 states and 128545 transitions. [2025-02-05 16:48:43,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 16:48:43,838 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 30.0) internal successors, (120), 4 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 120 [2025-02-05 16:48:43,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:48:43,965 INFO L225 Difference]: With dead ends: 78047 [2025-02-05 16:48:43,965 INFO L226 Difference]: Without dead ends: 54310 [2025-02-05 16:48:44,011 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:48:44,012 INFO L435 NwaCegarLoop]: 537 mSDtfsCounter, 716 mSDsluCounter, 1273 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 716 SdHoareTripleChecker+Valid, 1810 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:48:44,012 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [716 Valid, 1810 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:48:44,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54310 states. [2025-02-05 16:48:44,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54310 to 39059. [2025-02-05 16:48:44,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39059 states, 39058 states have (on average 1.6395872804547085) internal successors, (64039), 39058 states have internal predecessors, (64039), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:48:44,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39059 states to 39059 states and 64039 transitions. [2025-02-05 16:48:44,758 INFO L78 Accepts]: Start accepts. Automaton has 39059 states and 64039 transitions. Word has length 120 [2025-02-05 16:48:44,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:48:44,759 INFO L471 AbstractCegarLoop]: Abstraction has 39059 states and 64039 transitions. [2025-02-05 16:48:44,759 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 30.0) internal successors, (120), 4 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:48:44,759 INFO L276 IsEmpty]: Start isEmpty. Operand 39059 states and 64039 transitions. [2025-02-05 16:48:44,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-02-05 16:48:44,760 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:48:44,760 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:48:44,760 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-05 16:48:44,760 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:48:44,760 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:48:44,760 INFO L85 PathProgramCache]: Analyzing trace with hash -132901819, now seen corresponding path program 1 times [2025-02-05 16:48:44,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:48:44,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097552925] [2025-02-05 16:48:44,760 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:48:44,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:48:44,777 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-02-05 16:48:44,793 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-02-05 16:48:44,793 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:48:44,793 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:48:44,873 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:48:44,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:48:44,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1097552925] [2025-02-05 16:48:44,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1097552925] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:48:44,874 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:48:44,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 16:48:44,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128271555] [2025-02-05 16:48:44,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:48:44,874 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 16:48:44,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:48:44,874 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 16:48:44,875 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 16:48:44,875 INFO L87 Difference]: Start difference. First operand 39059 states and 64039 transitions. Second operand has 4 states, 4 states have (on average 30.25) internal successors, (121), 4 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:48:45,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:48:45,314 INFO L93 Difference]: Finished difference Result 126525 states and 207699 transitions. [2025-02-05 16:48:45,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 16:48:45,315 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 30.25) internal successors, (121), 4 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 121 [2025-02-05 16:48:45,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:48:45,526 INFO L225 Difference]: With dead ends: 126525 [2025-02-05 16:48:45,527 INFO L226 Difference]: Without dead ends: 87715 [2025-02-05 16:48:45,580 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:48:45,582 INFO L435 NwaCegarLoop]: 537 mSDtfsCounter, 714 mSDsluCounter, 1275 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 714 SdHoareTripleChecker+Valid, 1812 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:48:45,582 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [714 Valid, 1812 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:48:45,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87715 states. [2025-02-05 16:48:46,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87715 to 63244. [2025-02-05 16:48:46,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63244 states, 63243 states have (on average 1.6341097038407413) internal successors, (103346), 63243 states have internal predecessors, (103346), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:48:46,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63244 states to 63244 states and 103346 transitions. [2025-02-05 16:48:46,853 INFO L78 Accepts]: Start accepts. Automaton has 63244 states and 103346 transitions. Word has length 121 [2025-02-05 16:48:46,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:48:46,853 INFO L471 AbstractCegarLoop]: Abstraction has 63244 states and 103346 transitions. [2025-02-05 16:48:46,853 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 30.25) internal successors, (121), 4 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:48:46,854 INFO L276 IsEmpty]: Start isEmpty. Operand 63244 states and 103346 transitions. [2025-02-05 16:48:46,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-02-05 16:48:46,854 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:48:46,854 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:48:46,854 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-05 16:48:46,855 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:48:46,855 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:48:46,856 INFO L85 PathProgramCache]: Analyzing trace with hash 176711050, now seen corresponding path program 1 times [2025-02-05 16:48:46,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:48:46,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1722653643] [2025-02-05 16:48:46,856 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:48:46,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:48:46,872 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-02-05 16:48:46,890 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-02-05 16:48:46,890 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:48:46,890 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:48:47,148 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:48:47,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:48:47,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1722653643] [2025-02-05 16:48:47,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1722653643] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:48:47,149 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:48:47,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 16:48:47,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094402033] [2025-02-05 16:48:47,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:48:47,149 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 16:48:47,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:48:47,149 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 16:48:47,150 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 16:48:47,150 INFO L87 Difference]: Start difference. First operand 63244 states and 103346 transitions. Second operand has 4 states, 4 states have (on average 30.5) internal successors, (122), 4 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:48:47,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:48:47,861 INFO L93 Difference]: Finished difference Result 202555 states and 331405 transitions. [2025-02-05 16:48:47,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 16:48:47,861 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 30.5) internal successors, (122), 4 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 122 [2025-02-05 16:48:47,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:48:48,103 INFO L225 Difference]: With dead ends: 202555 [2025-02-05 16:48:48,104 INFO L226 Difference]: Without dead ends: 139560 [2025-02-05 16:48:48,141 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:48:48,142 INFO L435 NwaCegarLoop]: 537 mSDtfsCounter, 712 mSDsluCounter, 1277 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 712 SdHoareTripleChecker+Valid, 1814 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:48:48,142 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [712 Valid, 1814 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:48:48,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139560 states. [2025-02-05 16:48:49,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139560 to 101177. [2025-02-05 16:48:49,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101177 states, 101176 states have (on average 1.6287360638886692) internal successors, (164789), 101176 states have internal predecessors, (164789), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:48:49,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101177 states to 101177 states and 164789 transitions. [2025-02-05 16:48:49,909 INFO L78 Accepts]: Start accepts. Automaton has 101177 states and 164789 transitions. Word has length 122 [2025-02-05 16:48:49,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:48:49,909 INFO L471 AbstractCegarLoop]: Abstraction has 101177 states and 164789 transitions. [2025-02-05 16:48:49,909 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 30.5) internal successors, (122), 4 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:48:49,909 INFO L276 IsEmpty]: Start isEmpty. Operand 101177 states and 164789 transitions. [2025-02-05 16:48:49,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-02-05 16:48:49,910 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:48:49,910 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:48:49,910 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-05 16:48:49,910 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:48:49,910 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:48:49,910 INFO L85 PathProgramCache]: Analyzing trace with hash -1927887732, now seen corresponding path program 1 times [2025-02-05 16:48:49,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:48:49,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627198449] [2025-02-05 16:48:49,911 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:48:49,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:48:49,927 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-02-05 16:48:49,940 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-02-05 16:48:49,940 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:48:49,940 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:48:50,344 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:48:50,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:48:50,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627198449] [2025-02-05 16:48:50,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [627198449] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:48:50,345 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:48:50,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 16:48:50,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342169823] [2025-02-05 16:48:50,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:48:50,346 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 16:48:50,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:48:50,346 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 16:48:50,346 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-02-05 16:48:50,346 INFO L87 Difference]: Start difference. First operand 101177 states and 164789 transitions. Second operand has 6 states, 6 states have (on average 20.666666666666668) internal successors, (124), 6 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:48:51,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:48:51,193 INFO L93 Difference]: Finished difference Result 202107 states and 329174 transitions. [2025-02-05 16:48:51,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 16:48:51,193 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 20.666666666666668) internal successors, (124), 6 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 124 [2025-02-05 16:48:51,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:48:51,358 INFO L225 Difference]: With dead ends: 202107 [2025-02-05 16:48:51,358 INFO L226 Difference]: Without dead ends: 101179 [2025-02-05 16:48:51,391 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2025-02-05 16:48:51,392 INFO L435 NwaCegarLoop]: 541 mSDtfsCounter, 618 mSDsluCounter, 1533 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 618 SdHoareTripleChecker+Valid, 2074 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:48:51,393 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [618 Valid, 2074 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:48:51,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101179 states. [2025-02-05 16:48:52,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101179 to 101177. [2025-02-05 16:48:52,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101177 states, 101176 states have (on average 1.6225587095753933) internal successors, (164164), 101176 states have internal predecessors, (164164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:48:52,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101177 states to 101177 states and 164164 transitions. [2025-02-05 16:48:52,598 INFO L78 Accepts]: Start accepts. Automaton has 101177 states and 164164 transitions. Word has length 124 [2025-02-05 16:48:52,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:48:52,599 INFO L471 AbstractCegarLoop]: Abstraction has 101177 states and 164164 transitions. [2025-02-05 16:48:52,599 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.666666666666668) internal successors, (124), 6 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:48:52,599 INFO L276 IsEmpty]: Start isEmpty. Operand 101177 states and 164164 transitions. [2025-02-05 16:48:52,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-02-05 16:48:52,599 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:48:52,600 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:48:52,600 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-05 16:48:52,600 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:48:52,600 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:48:52,600 INFO L85 PathProgramCache]: Analyzing trace with hash -13150673, now seen corresponding path program 1 times [2025-02-05 16:48:52,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:48:52,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687189613] [2025-02-05 16:48:52,601 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:48:52,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:48:52,616 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-02-05 16:48:52,637 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-02-05 16:48:52,637 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:48:52,637 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:48:52,877 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:48:52,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:48:52,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687189613] [2025-02-05 16:48:52,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1687189613] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:48:52,878 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:48:52,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 16:48:52,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665758410] [2025-02-05 16:48:52,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:48:52,879 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 16:48:52,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:48:52,879 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 16:48:52,879 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-02-05 16:48:52,880 INFO L87 Difference]: Start difference. First operand 101177 states and 164164 transitions. Second operand has 6 states, 6 states have (on average 21.166666666666668) internal successors, (127), 6 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:48:54,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:48:54,137 INFO L93 Difference]: Finished difference Result 295753 states and 480298 transitions. [2025-02-05 16:48:54,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 16:48:54,137 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 21.166666666666668) internal successors, (127), 6 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 127 [2025-02-05 16:48:54,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:48:54,473 INFO L225 Difference]: With dead ends: 295753 [2025-02-05 16:48:54,473 INFO L226 Difference]: Without dead ends: 194825 [2025-02-05 16:48:54,545 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2025-02-05 16:48:54,546 INFO L435 NwaCegarLoop]: 536 mSDtfsCounter, 206 mSDsluCounter, 2068 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 206 SdHoareTripleChecker+Valid, 2604 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 16:48:54,546 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [206 Valid, 2604 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 16:48:54,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194825 states. [2025-02-05 16:48:56,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194825 to 194823. [2025-02-05 16:48:56,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194823 states, 194822 states have (on average 1.6144018642658426) internal successors, (314521), 194822 states have internal predecessors, (314521), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:48:57,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194823 states to 194823 states and 314521 transitions. [2025-02-05 16:48:57,133 INFO L78 Accepts]: Start accepts. Automaton has 194823 states and 314521 transitions. Word has length 127 [2025-02-05 16:48:57,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:48:57,133 INFO L471 AbstractCegarLoop]: Abstraction has 194823 states and 314521 transitions. [2025-02-05 16:48:57,133 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 21.166666666666668) internal successors, (127), 6 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:48:57,133 INFO L276 IsEmpty]: Start isEmpty. Operand 194823 states and 314521 transitions. [2025-02-05 16:48:57,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2025-02-05 16:48:57,134 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:48:57,134 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:48:57,134 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-05 16:48:57,134 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:48:57,134 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:48:57,134 INFO L85 PathProgramCache]: Analyzing trace with hash -406715495, now seen corresponding path program 1 times [2025-02-05 16:48:57,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:48:57,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1098664363] [2025-02-05 16:48:57,134 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:48:57,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:48:57,153 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-02-05 16:48:57,221 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-02-05 16:48:57,221 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:48:57,221 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:48:57,851 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:48:57,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:48:57,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1098664363] [2025-02-05 16:48:57,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1098664363] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:48:57,851 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:48:57,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 16:48:57,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1062422381] [2025-02-05 16:48:57,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:48:57,851 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 16:48:57,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:48:57,852 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 16:48:57,852 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:48:57,852 INFO L87 Difference]: Start difference. First operand 194823 states and 314521 transitions. Second operand has 5 states, 5 states have (on average 25.6) internal successors, (128), 5 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:48:58,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:48:58,509 INFO L93 Difference]: Finished difference Result 198697 states and 320330 transitions. [2025-02-05 16:48:58,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 16:48:58,509 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 25.6) internal successors, (128), 5 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 128 [2025-02-05 16:48:58,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:48:59,106 INFO L225 Difference]: With dead ends: 198697 [2025-02-05 16:48:59,106 INFO L226 Difference]: Without dead ends: 198695 [2025-02-05 16:48:59,139 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:48:59,139 INFO L435 NwaCegarLoop]: 545 mSDtfsCounter, 0 mSDsluCounter, 1617 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2162 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:48:59,139 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2162 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:48:59,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198695 states. [2025-02-05 16:49:00,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198695 to 198695. [2025-02-05 16:49:00,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198695 states, 198694 states have (on average 1.6022929731144373) internal successors, (318366), 198694 states have internal predecessors, (318366), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:49:01,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198695 states to 198695 states and 318366 transitions. [2025-02-05 16:49:01,331 INFO L78 Accepts]: Start accepts. Automaton has 198695 states and 318366 transitions. Word has length 128 [2025-02-05 16:49:01,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:49:01,332 INFO L471 AbstractCegarLoop]: Abstraction has 198695 states and 318366 transitions. [2025-02-05 16:49:01,332 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 25.6) internal successors, (128), 5 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:49:01,332 INFO L276 IsEmpty]: Start isEmpty. Operand 198695 states and 318366 transitions. [2025-02-05 16:49:01,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2025-02-05 16:49:01,337 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:49:01,338 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:49:01,338 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-05 16:49:01,338 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:49:01,339 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:49:01,339 INFO L85 PathProgramCache]: Analyzing trace with hash -1548232042, now seen corresponding path program 1 times [2025-02-05 16:49:01,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:49:01,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667005690] [2025-02-05 16:49:01,339 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:49:01,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:49:01,354 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-02-05 16:49:01,368 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-02-05 16:49:01,368 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:49:01,368 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:49:01,878 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-05 16:49:01,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:49:01,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [667005690] [2025-02-05 16:49:01,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [667005690] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:49:01,879 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:49:01,879 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 16:49:01,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2659270] [2025-02-05 16:49:01,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:49:01,879 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 16:49:01,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:49:01,880 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 16:49:01,880 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-05 16:49:01,880 INFO L87 Difference]: Start difference. First operand 198695 states and 318366 transitions. Second operand has 6 states, 6 states have (on average 26.833333333333332) internal successors, (161), 6 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-02-05 16:49:04,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:49:04,159 INFO L93 Difference]: Finished difference Result 542119 states and 870863 transitions. [2025-02-05 16:49:04,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 16:49:04,160 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 26.833333333333332) internal successors, (161), 6 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 162 [2025-02-05 16:49:04,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:49:04,955 INFO L225 Difference]: With dead ends: 542119 [2025-02-05 16:49:04,956 INFO L226 Difference]: Without dead ends: 453717 [2025-02-05 16:49:05,056 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-02-05 16:49:05,057 INFO L435 NwaCegarLoop]: 785 mSDtfsCounter, 1430 mSDsluCounter, 2734 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1430 SdHoareTripleChecker+Valid, 3519 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:49:05,057 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1430 Valid, 3519 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:49:05,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 453717 states. [2025-02-05 16:49:09,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 453717 to 319473. [2025-02-05 16:49:09,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 319473 states, 319472 states have (on average 1.6004219462112486) internal successors, (511290), 319472 states have internal predecessors, (511290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:49:10,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319473 states to 319473 states and 511290 transitions. [2025-02-05 16:49:10,711 INFO L78 Accepts]: Start accepts. Automaton has 319473 states and 511290 transitions. Word has length 162 [2025-02-05 16:49:10,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:49:10,711 INFO L471 AbstractCegarLoop]: Abstraction has 319473 states and 511290 transitions. [2025-02-05 16:49:10,711 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.833333333333332) internal successors, (161), 6 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-02-05 16:49:10,711 INFO L276 IsEmpty]: Start isEmpty. Operand 319473 states and 511290 transitions. [2025-02-05 16:49:10,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2025-02-05 16:49:10,726 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:49:10,726 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:49:10,726 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-05 16:49:10,726 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:49:10,727 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:49:10,730 INFO L85 PathProgramCache]: Analyzing trace with hash 1642648492, now seen corresponding path program 1 times [2025-02-05 16:49:10,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:49:10,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1582317763] [2025-02-05 16:49:10,731 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:49:10,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:49:10,763 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-02-05 16:49:10,780 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-02-05 16:49:10,780 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:49:10,780 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:49:10,926 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-02-05 16:49:10,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:49:10,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1582317763] [2025-02-05 16:49:10,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1582317763] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:49:10,928 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:49:10,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 16:49:10,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [709536261] [2025-02-05 16:49:10,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:49:10,929 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 16:49:10,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:49:10,929 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 16:49:10,929 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-05 16:49:10,930 INFO L87 Difference]: Start difference. First operand 319473 states and 511290 transitions. Second operand has 6 states, 6 states have (on average 25.666666666666668) internal successors, (154), 6 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:49:13,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:49:13,079 INFO L93 Difference]: Finished difference Result 609929 states and 979867 transitions. [2025-02-05 16:49:13,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 16:49:13,079 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 25.666666666666668) internal successors, (154), 6 states have internal predecessors, (154), 0 states have call successors, (0), 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 162 [2025-02-05 16:49:13,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:49:14,182 INFO L225 Difference]: With dead ends: 609929 [2025-02-05 16:49:14,182 INFO L226 Difference]: Without dead ends: 522677 [2025-02-05 16:49:14,872 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-02-05 16:49:14,872 INFO L435 NwaCegarLoop]: 779 mSDtfsCounter, 1439 mSDsluCounter, 2646 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1439 SdHoareTripleChecker+Valid, 3425 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:49:14,872 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1439 Valid, 3425 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:49:15,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 522677 states.