./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.4.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.4.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0df39af5bb0da8e3087f1622629197ff07999529140b31d9eb8577cc8820a051 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 15:08:37,015 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 15:08:37,070 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 15:08:37,074 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 15:08:37,074 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 15:08:37,088 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 15:08:37,089 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 15:08:37,089 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 15:08:37,089 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 15:08:37,089 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 15:08:37,089 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 15:08:37,089 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 15:08:37,090 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 15:08:37,090 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 15:08:37,090 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 15:08:37,090 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 15:08:37,090 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 15:08:37,090 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 15:08:37,090 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 15:08:37,090 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 15:08:37,090 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 15:08:37,090 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 15:08:37,090 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 15:08:37,091 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 15:08:37,091 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 15:08:37,091 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 15:08:37,091 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 15:08:37,091 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 15:08:37,091 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 15:08:37,091 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 15:08:37,091 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 15:08:37,091 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 15:08:37,091 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 15:08:37,091 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 15:08:37,091 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 15:08:37,092 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 15:08:37,092 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 15:08:37,092 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 15:08:37,092 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 15:08:37,092 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 15:08:37,092 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 15:08:37,092 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 15:08:37,092 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 15:08:37,092 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 0df39af5bb0da8e3087f1622629197ff07999529140b31d9eb8577cc8820a051 [2025-03-03 15:08:37,334 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 15:08:37,340 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 15:08:37,342 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 15:08:37,343 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 15:08:37,343 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 15:08:37,344 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.4.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2025-03-03 15:08:38,508 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/834bfc0ff/d6c436d0601945bdaa8489413d0dc6c9/FLAGc13388ff1 [2025-03-03 15:08:38,782 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 15:08:38,787 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.4.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2025-03-03 15:08:38,803 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/834bfc0ff/d6c436d0601945bdaa8489413d0dc6c9/FLAGc13388ff1 [2025-03-03 15:08:38,819 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/834bfc0ff/d6c436d0601945bdaa8489413d0dc6c9 [2025-03-03 15:08:38,821 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 15:08:38,822 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 15:08:38,824 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 15:08:38,825 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 15:08:38,828 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 15:08:38,830 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 03:08:38" (1/1) ... [2025-03-03 15:08:38,831 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@51e043c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:08:38, skipping insertion in model container [2025-03-03 15:08:38,832 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 03:08:38" (1/1) ... [2025-03-03 15:08:38,863 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 15:08:39,004 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.4.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c[7105,7118] [2025-03-03 15:08:39,047 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 15:08:39,060 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 15:08:39,105 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.4.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c[7105,7118] [2025-03-03 15:08:39,132 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 15:08:39,150 INFO L204 MainTranslator]: Completed translation [2025-03-03 15:08:39,151 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:08:39 WrapperNode [2025-03-03 15:08:39,151 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 15:08:39,153 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 15:08:39,153 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 15:08:39,153 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 15:08:39,158 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:08:39" (1/1) ... [2025-03-03 15:08:39,167 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:08:39" (1/1) ... [2025-03-03 15:08:39,193 INFO L138 Inliner]: procedures = 24, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 721 [2025-03-03 15:08:39,194 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 15:08:39,195 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 15:08:39,195 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 15:08:39,196 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 15:08:39,201 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:08:39" (1/1) ... [2025-03-03 15:08:39,202 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:08:39" (1/1) ... [2025-03-03 15:08:39,204 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:08:39" (1/1) ... [2025-03-03 15:08:39,221 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-03 15:08:39,222 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:08:39" (1/1) ... [2025-03-03 15:08:39,222 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:08:39" (1/1) ... [2025-03-03 15:08:39,228 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:08:39" (1/1) ... [2025-03-03 15:08:39,230 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:08:39" (1/1) ... [2025-03-03 15:08:39,234 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:08:39" (1/1) ... [2025-03-03 15:08:39,236 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:08:39" (1/1) ... [2025-03-03 15:08:39,238 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 15:08:39,239 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 15:08:39,239 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 15:08:39,239 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 15:08:39,244 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:08:39" (1/1) ... [2025-03-03 15:08:39,248 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 15:08:39,260 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 15:08:39,272 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 15:08:39,278 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 15:08:39,290 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 15:08:39,290 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 15:08:39,290 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 15:08:39,290 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 15:08:39,379 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 15:08:39,380 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 15:08:39,865 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1111: havoc main_~node1____CPAchecker_TMP_1~1#1; [2025-03-03 15:08:39,865 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L979: havoc main_~node4____CPAchecker_TMP_1~1#1; [2025-03-03 15:08:39,865 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L203: havoc main_~node3__m3~0#1;havoc main_~node2____CPAchecker_TMP_0~0#1; [2025-03-03 15:08:39,865 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L600: havoc main_~node3____CPAchecker_TMP_1~0#1; [2025-03-03 15:08:39,865 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L749: havoc main_~node1____CPAchecker_TMP_0~1#1; [2025-03-03 15:08:39,865 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L403: havoc main_~node2__m2~2#1; [2025-03-03 15:08:39,866 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L486: havoc main_~node4____CPAchecker_TMP_0~1#1; [2025-03-03 15:08:39,866 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L421: havoc main_~node3__m3~2#1; [2025-03-03 15:08:39,866 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L686: havoc main_~node2____CPAchecker_TMP_1~0#1; [2025-03-03 15:08:39,866 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L224: havoc main_~node4__m4~0#1;havoc main_~node3____CPAchecker_TMP_0~0#1; [2025-03-03 15:08:39,866 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L439: havoc main_~node4__m4~2#1; [2025-03-03 15:08:39,866 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1067: havoc main_~node2____CPAchecker_TMP_1~1#1; [2025-03-03 15:08:39,866 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L572: havoc main_~node3____CPAchecker_TMP_0~1#1; [2025-03-03 15:08:39,866 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L161: havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2025-03-03 15:08:39,867 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L658: havoc main_~node2____CPAchecker_TMP_0~1#1; [2025-03-03 15:08:39,867 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1023: havoc main_~node3____CPAchecker_TMP_1~1#1; [2025-03-03 15:08:39,867 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L380: havoc main_~node1__m1~2#1;havoc main_~__tmp_2~0#1, main_~assert__arg~1#1;havoc main_~check__tmp~1#1;havoc main_~node4__m4~1#1;havoc main_~node3__m3~1#1;havoc main_~node2__m2~1#1;havoc main_~node1__m1~1#1;havoc main_~__tmp_1~0#1, main_~assert__arg~0#1;havoc main_~check__tmp~0#1;havoc main_~node4____CPAchecker_TMP_0~0#1; [2025-03-03 15:08:39,867 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L182: havoc main_~node2__m2~0#1;havoc main_~node1____CPAchecker_TMP_0~0#1; [2025-03-03 15:08:39,867 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L777: havoc main_~node1____CPAchecker_TMP_1~0#1; [2025-03-03 15:08:39,867 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L514: havoc main_~node4____CPAchecker_TMP_1~0#1; [2025-03-03 15:08:39,901 INFO L? ?]: Removed 84 outVars from TransFormulas that were not future-live. [2025-03-03 15:08:39,902 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 15:08:39,915 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 15:08:39,916 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 15:08:39,917 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 03:08:39 BoogieIcfgContainer [2025-03-03 15:08:39,917 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 15:08:39,918 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 15:08:39,919 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 15:08:39,922 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 15:08:39,922 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 03:08:38" (1/3) ... [2025-03-03 15:08:39,923 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@371c178e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 03:08:39, skipping insertion in model container [2025-03-03 15:08:39,923 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:08:39" (2/3) ... [2025-03-03 15:08:39,923 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@371c178e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 03:08:39, skipping insertion in model container [2025-03-03 15:08:39,923 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 03:08:39" (3/3) ... [2025-03-03 15:08:39,924 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.4.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2025-03-03 15:08:39,938 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 15:08:39,940 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_lcr-var-start-time.4.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c that has 1 procedures, 179 locations, 1 initial locations, 0 loop locations, and 1 error locations. [2025-03-03 15:08:39,988 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 15:08:39,997 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;@517c13fe, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 15:08:39,997 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 15:08:40,002 INFO L276 IsEmpty]: Start isEmpty. Operand has 179 states, 177 states have (on average 1.7175141242937852) internal successors, (304), 178 states have internal predecessors, (304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:40,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-03-03 15:08:40,008 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:08:40,008 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:08:40,009 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:08:40,013 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:08:40,014 INFO L85 PathProgramCache]: Analyzing trace with hash 1118971602, now seen corresponding path program 1 times [2025-03-03 15:08:40,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:08:40,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987969699] [2025-03-03 15:08:40,022 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:08:40,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:08:40,124 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-03 15:08:40,203 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-03 15:08:40,203 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:08:40,203 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:08:40,548 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:08:40,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:08:40,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987969699] [2025-03-03 15:08:40,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1987969699] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:08:40,550 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:08:40,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 15:08:40,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135959577] [2025-03-03 15:08:40,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:08:40,555 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 15:08:40,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:08:40,570 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 15:08:40,571 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:08:40,574 INFO L87 Difference]: Start difference. First operand has 179 states, 177 states have (on average 1.7175141242937852) internal successors, (304), 178 states have internal predecessors, (304), 0 states have call successors, (0), 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 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:40,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:08:40,782 INFO L93 Difference]: Finished difference Result 639 states and 1034 transitions. [2025-03-03 15:08:40,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 15:08:40,784 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2025-03-03 15:08:40,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:08:40,795 INFO L225 Difference]: With dead ends: 639 [2025-03-03 15:08:40,795 INFO L226 Difference]: Without dead ends: 540 [2025-03-03 15:08:40,799 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:08:40,801 INFO L435 NwaCegarLoop]: 307 mSDtfsCounter, 1458 mSDsluCounter, 1520 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1458 SdHoareTripleChecker+Valid, 1827 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:08:40,801 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1458 Valid, 1827 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 15:08:40,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 540 states. [2025-03-03 15:08:40,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 540 to 274. [2025-03-03 15:08:40,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 274 states, 273 states have (on average 1.5128205128205128) internal successors, (413), 273 states have internal predecessors, (413), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:40,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 413 transitions. [2025-03-03 15:08:40,843 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 413 transitions. Word has length 64 [2025-03-03 15:08:40,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:08:40,843 INFO L471 AbstractCegarLoop]: Abstraction has 274 states and 413 transitions. [2025-03-03 15:08:40,843 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:40,843 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 413 transitions. [2025-03-03 15:08:40,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-03-03 15:08:40,844 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:08:40,844 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:08:40,845 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 15:08:40,845 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:08:40,845 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:08:40,845 INFO L85 PathProgramCache]: Analyzing trace with hash 329342078, now seen corresponding path program 1 times [2025-03-03 15:08:40,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:08:40,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [321458490] [2025-03-03 15:08:40,846 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:08:40,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:08:40,865 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-03 15:08:40,900 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-03 15:08:40,900 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:08:40,900 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:08:41,109 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:08:41,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:08:41,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [321458490] [2025-03-03 15:08:41,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [321458490] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:08:41,109 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:08:41,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 15:08:41,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004314474] [2025-03-03 15:08:41,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:08:41,110 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 15:08:41,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:08:41,111 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 15:08:41,111 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:08:41,111 INFO L87 Difference]: Start difference. First operand 274 states and 413 transitions. Second operand has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:41,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:08:41,243 INFO L93 Difference]: Finished difference Result 1012 states and 1565 transitions. [2025-03-03 15:08:41,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 15:08:41,243 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2025-03-03 15:08:41,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:08:41,246 INFO L225 Difference]: With dead ends: 1012 [2025-03-03 15:08:41,246 INFO L226 Difference]: Without dead ends: 800 [2025-03-03 15:08:41,247 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:08:41,248 INFO L435 NwaCegarLoop]: 243 mSDtfsCounter, 1343 mSDsluCounter, 504 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1343 SdHoareTripleChecker+Valid, 747 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:08:41,248 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1343 Valid, 747 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 15:08:41,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 800 states. [2025-03-03 15:08:41,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 800 to 794. [2025-03-03 15:08:41,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 794 states, 793 states have (on average 1.5359394703656999) internal successors, (1218), 793 states have internal predecessors, (1218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:41,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 794 states to 794 states and 1218 transitions. [2025-03-03 15:08:41,280 INFO L78 Accepts]: Start accepts. Automaton has 794 states and 1218 transitions. Word has length 65 [2025-03-03 15:08:41,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:08:41,280 INFO L471 AbstractCegarLoop]: Abstraction has 794 states and 1218 transitions. [2025-03-03 15:08:41,281 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:41,281 INFO L276 IsEmpty]: Start isEmpty. Operand 794 states and 1218 transitions. [2025-03-03 15:08:41,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-03-03 15:08:41,283 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:08:41,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] [2025-03-03 15:08:41,284 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 15:08:41,284 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:08:41,284 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:08:41,284 INFO L85 PathProgramCache]: Analyzing trace with hash 1214440177, now seen corresponding path program 1 times [2025-03-03 15:08:41,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:08:41,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [288809607] [2025-03-03 15:08:41,285 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:08:41,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:08:41,302 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-03 15:08:41,320 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-03 15:08:41,320 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:08:41,320 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:08:41,459 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:08:41,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:08:41,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [288809607] [2025-03-03 15:08:41,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [288809607] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:08:41,460 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:08:41,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 15:08:41,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [676820889] [2025-03-03 15:08:41,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:08:41,460 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:08:41,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:08:41,460 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:08:41,460 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:08:41,461 INFO L87 Difference]: Start difference. First operand 794 states and 1218 transitions. Second operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 4 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:41,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:08:41,659 INFO L93 Difference]: Finished difference Result 2016 states and 3140 transitions. [2025-03-03 15:08:41,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 15:08:41,660 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 4 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2025-03-03 15:08:41,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:08:41,665 INFO L225 Difference]: With dead ends: 2016 [2025-03-03 15:08:41,666 INFO L226 Difference]: Without dead ends: 1322 [2025-03-03 15:08:41,667 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-03 15:08:41,668 INFO L435 NwaCegarLoop]: 148 mSDtfsCounter, 933 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 933 SdHoareTripleChecker+Valid, 252 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 15:08:41,668 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [933 Valid, 252 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 15:08:41,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1322 states. [2025-03-03 15:08:41,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1322 to 1320. [2025-03-03 15:08:41,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1320 states, 1319 states have (on average 1.5466262319939348) internal successors, (2040), 1319 states have internal predecessors, (2040), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:41,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1320 states to 1320 states and 2040 transitions. [2025-03-03 15:08:41,704 INFO L78 Accepts]: Start accepts. Automaton has 1320 states and 2040 transitions. Word has length 66 [2025-03-03 15:08:41,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:08:41,705 INFO L471 AbstractCegarLoop]: Abstraction has 1320 states and 2040 transitions. [2025-03-03 15:08:41,705 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 4 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:41,705 INFO L276 IsEmpty]: Start isEmpty. Operand 1320 states and 2040 transitions. [2025-03-03 15:08:41,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-03-03 15:08:41,708 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:08:41,708 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] [2025-03-03 15:08:41,708 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 15:08:41,708 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:08:41,708 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:08:41,708 INFO L85 PathProgramCache]: Analyzing trace with hash 186148253, now seen corresponding path program 1 times [2025-03-03 15:08:41,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:08:41,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295752827] [2025-03-03 15:08:41,711 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:08:41,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:08:41,729 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-03 15:08:41,750 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-03 15:08:41,750 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:08:41,750 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:08: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-03-03 15:08:41,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:08:41,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [295752827] [2025-03-03 15:08:41,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [295752827] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:08:41,847 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:08:41,847 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 15:08:41,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781980108] [2025-03-03 15:08:41,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:08:41,848 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:08:41,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:08:41,848 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:08:41,848 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:08:41,848 INFO L87 Difference]: Start difference. First operand 1320 states and 2040 transitions. Second operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 4 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:42,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:08:42,048 INFO L93 Difference]: Finished difference Result 3647 states and 5687 transitions. [2025-03-03 15:08:42,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 15:08:42,049 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 4 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2025-03-03 15:08:42,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:08:42,057 INFO L225 Difference]: With dead ends: 3647 [2025-03-03 15:08:42,057 INFO L226 Difference]: Without dead ends: 2400 [2025-03-03 15:08:42,059 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-03 15:08:42,059 INFO L435 NwaCegarLoop]: 148 mSDtfsCounter, 959 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 959 SdHoareTripleChecker+Valid, 250 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 15:08:42,060 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [959 Valid, 250 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 15:08:42,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2400 states. [2025-03-03 15:08:42,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2400 to 2398. [2025-03-03 15:08:42,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2398 states, 2397 states have (on average 1.5502711722987068) internal successors, (3716), 2397 states have internal predecessors, (3716), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:42,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2398 states to 2398 states and 3716 transitions. [2025-03-03 15:08:42,121 INFO L78 Accepts]: Start accepts. Automaton has 2398 states and 3716 transitions. Word has length 66 [2025-03-03 15:08:42,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:08:42,123 INFO L471 AbstractCegarLoop]: Abstraction has 2398 states and 3716 transitions. [2025-03-03 15:08:42,123 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 4 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:42,123 INFO L276 IsEmpty]: Start isEmpty. Operand 2398 states and 3716 transitions. [2025-03-03 15:08:42,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-03-03 15:08:42,124 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:08:42,124 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] [2025-03-03 15:08:42,124 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 15:08:42,124 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:08:42,125 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:08:42,125 INFO L85 PathProgramCache]: Analyzing trace with hash -1665879479, now seen corresponding path program 1 times [2025-03-03 15:08:42,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:08:42,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2055453523] [2025-03-03 15:08:42,125 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:08:42,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:08:42,140 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-03 15:08:42,156 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-03 15:08:42,156 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:08:42,156 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:08:42,260 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:08:42,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:08:42,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2055453523] [2025-03-03 15:08:42,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2055453523] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:08:42,261 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:08:42,261 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 15:08:42,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579826283] [2025-03-03 15:08:42,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:08:42,261 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:08:42,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:08:42,261 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:08:42,261 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:08:42,262 INFO L87 Difference]: Start difference. First operand 2398 states and 3716 transitions. Second operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 4 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:42,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:08:42,474 INFO L93 Difference]: Finished difference Result 6924 states and 10788 transitions. [2025-03-03 15:08:42,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 15:08:42,475 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 4 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2025-03-03 15:08:42,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:08:42,490 INFO L225 Difference]: With dead ends: 6924 [2025-03-03 15:08:42,491 INFO L226 Difference]: Without dead ends: 4576 [2025-03-03 15:08:42,496 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-03 15:08:42,497 INFO L435 NwaCegarLoop]: 148 mSDtfsCounter, 985 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 985 SdHoareTripleChecker+Valid, 248 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 15:08:42,497 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [985 Valid, 248 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 15:08:42,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4576 states. [2025-03-03 15:08:42,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4576 to 4574. [2025-03-03 15:08:42,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4574 states, 4573 states have (on average 1.5484364749617319) internal successors, (7081), 4573 states have internal predecessors, (7081), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:42,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4574 states to 4574 states and 7081 transitions. [2025-03-03 15:08:42,611 INFO L78 Accepts]: Start accepts. Automaton has 4574 states and 7081 transitions. Word has length 66 [2025-03-03 15:08:42,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:08:42,612 INFO L471 AbstractCegarLoop]: Abstraction has 4574 states and 7081 transitions. [2025-03-03 15:08:42,612 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 4 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:42,612 INFO L276 IsEmpty]: Start isEmpty. Operand 4574 states and 7081 transitions. [2025-03-03 15:08:42,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-03-03 15:08:42,613 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:08:42,613 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] [2025-03-03 15:08:42,613 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 15:08:42,613 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:08:42,614 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:08:42,614 INFO L85 PathProgramCache]: Analyzing trace with hash 952289525, now seen corresponding path program 1 times [2025-03-03 15:08:42,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:08:42,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975769171] [2025-03-03 15:08:42,614 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:08:42,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:08:42,626 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-03 15:08:42,640 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-03 15:08:42,643 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:08:42,643 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:08:42,744 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:08:42,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:08:42,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1975769171] [2025-03-03 15:08:42,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1975769171] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:08:42,745 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:08:42,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 15:08:42,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [418241767] [2025-03-03 15:08:42,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:08:42,746 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:08:42,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:08:42,746 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:08:42,746 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:08:42,747 INFO L87 Difference]: Start difference. First operand 4574 states and 7081 transitions. Second operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 4 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:43,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:08:43,015 INFO L93 Difference]: Finished difference Result 12540 states and 19466 transitions. [2025-03-03 15:08:43,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 15:08:43,016 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 4 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2025-03-03 15:08:43,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:08:43,045 INFO L225 Difference]: With dead ends: 12540 [2025-03-03 15:08:43,045 INFO L226 Difference]: Without dead ends: 8000 [2025-03-03 15:08:43,054 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-03 15:08:43,055 INFO L435 NwaCegarLoop]: 148 mSDtfsCounter, 1011 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1011 SdHoareTripleChecker+Valid, 246 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 15:08:43,055 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1011 Valid, 246 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 15:08:43,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8000 states. [2025-03-03 15:08:43,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8000 to 7998. [2025-03-03 15:08:43,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7998 states, 7997 states have (on average 1.5390771539327248) internal successors, (12308), 7997 states have internal predecessors, (12308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:43,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7998 states to 7998 states and 12308 transitions. [2025-03-03 15:08:43,215 INFO L78 Accepts]: Start accepts. Automaton has 7998 states and 12308 transitions. Word has length 66 [2025-03-03 15:08:43,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:08:43,215 INFO L471 AbstractCegarLoop]: Abstraction has 7998 states and 12308 transitions. [2025-03-03 15:08:43,215 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 4 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:43,215 INFO L276 IsEmpty]: Start isEmpty. Operand 7998 states and 12308 transitions. [2025-03-03 15:08:43,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-03-03 15:08:43,217 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:08:43,217 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:08:43,217 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 15:08:43,217 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:08:43,218 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:08:43,218 INFO L85 PathProgramCache]: Analyzing trace with hash 146376352, now seen corresponding path program 1 times [2025-03-03 15:08:43,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:08:43,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1184704526] [2025-03-03 15:08:43,218 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:08:43,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:08:43,230 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-03-03 15:08:43,241 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-03-03 15:08:43,242 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:08:43,242 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:08:43,431 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:08:43,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:08:43,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1184704526] [2025-03-03 15:08:43,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1184704526] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:08:43,432 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:08:43,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 15:08:43,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729113759] [2025-03-03 15:08:43,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:08:43,433 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:08:43,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:08:43,433 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:08:43,433 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:08:43,433 INFO L87 Difference]: Start difference. First operand 7998 states and 12308 transitions. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:43,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:08:43,482 INFO L93 Difference]: Finished difference Result 8224 states and 12645 transitions. [2025-03-03 15:08:43,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 15:08:43,484 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2025-03-03 15:08:43,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:08:43,518 INFO L225 Difference]: With dead ends: 8224 [2025-03-03 15:08:43,519 INFO L226 Difference]: Without dead ends: 8222 [2025-03-03 15:08:43,523 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:08:43,524 INFO L435 NwaCegarLoop]: 245 mSDtfsCounter, 0 mSDsluCounter, 725 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 970 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:08:43,524 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 970 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:08:43,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8222 states. [2025-03-03 15:08:43,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8222 to 8222. [2025-03-03 15:08:43,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8222 states, 8221 states have (on average 1.5243887604914244) internal successors, (12532), 8221 states have internal predecessors, (12532), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:43,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8222 states to 8222 states and 12532 transitions. [2025-03-03 15:08:43,670 INFO L78 Accepts]: Start accepts. Automaton has 8222 states and 12532 transitions. Word has length 67 [2025-03-03 15:08:43,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:08:43,670 INFO L471 AbstractCegarLoop]: Abstraction has 8222 states and 12532 transitions. [2025-03-03 15:08:43,671 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:43,671 INFO L276 IsEmpty]: Start isEmpty. Operand 8222 states and 12532 transitions. [2025-03-03 15:08:43,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-03-03 15:08:43,673 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:08:43,673 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] [2025-03-03 15:08:43,673 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 15:08:43,673 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:08:43,673 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:08:43,673 INFO L85 PathProgramCache]: Analyzing trace with hash 247473648, now seen corresponding path program 1 times [2025-03-03 15:08:43,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:08:43,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1634050648] [2025-03-03 15:08:43,674 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:08:43,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:08:43,685 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-03 15:08:43,704 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-03 15:08:43,705 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:08:43,705 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:08:43,951 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:08:43,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:08:43,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1634050648] [2025-03-03 15:08:43,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1634050648] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:08:43,951 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:08:43,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-03 15:08:43,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132094483] [2025-03-03 15:08:43,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:08:43,952 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-03 15:08:43,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:08:43,952 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-03 15:08:43,952 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-03-03 15:08:43,953 INFO L87 Difference]: Start difference. First operand 8222 states and 12532 transitions. Second operand has 10 states, 10 states have (on average 6.8) internal successors, (68), 9 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:44,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:08:44,471 INFO L93 Difference]: Finished difference Result 10931 states and 16524 transitions. [2025-03-03 15:08:44,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 15:08:44,472 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.8) internal successors, (68), 9 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2025-03-03 15:08:44,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:08:44,487 INFO L225 Difference]: With dead ends: 10931 [2025-03-03 15:08:44,487 INFO L226 Difference]: Without dead ends: 9639 [2025-03-03 15:08:44,490 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=104, Invalid=276, Unknown=0, NotChecked=0, Total=380 [2025-03-03 15:08:44,491 INFO L435 NwaCegarLoop]: 141 mSDtfsCounter, 1372 mSDsluCounter, 614 mSDsCounter, 0 mSdLazyCounter, 611 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1372 SdHoareTripleChecker+Valid, 755 SdHoareTripleChecker+Invalid, 622 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 611 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 15:08:44,491 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1372 Valid, 755 Invalid, 622 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 611 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 15:08:44,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9639 states. [2025-03-03 15:08:44,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9639 to 8222. [2025-03-03 15:08:44,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8222 states, 8221 states have (on average 1.5242671207882252) internal successors, (12531), 8221 states have internal predecessors, (12531), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:44,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8222 states to 8222 states and 12531 transitions. [2025-03-03 15:08:44,596 INFO L78 Accepts]: Start accepts. Automaton has 8222 states and 12531 transitions. Word has length 68 [2025-03-03 15:08:44,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:08:44,596 INFO L471 AbstractCegarLoop]: Abstraction has 8222 states and 12531 transitions. [2025-03-03 15:08:44,597 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.8) internal successors, (68), 9 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:44,597 INFO L276 IsEmpty]: Start isEmpty. Operand 8222 states and 12531 transitions. [2025-03-03 15:08:44,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-03-03 15:08:44,599 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:08:44,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] [2025-03-03 15:08:44,600 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 15:08:44,601 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:08:44,601 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:08:44,601 INFO L85 PathProgramCache]: Analyzing trace with hash 2107380080, now seen corresponding path program 1 times [2025-03-03 15:08:44,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:08:44,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1154421969] [2025-03-03 15:08:44,601 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:08:44,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:08:44,613 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-03 15:08:44,637 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-03 15:08:44,640 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:08:44,641 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:08:44,897 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:08:44,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:08:44,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1154421969] [2025-03-03 15:08:44,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1154421969] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:08:44,897 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:08:44,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-03 15:08:44,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515976072] [2025-03-03 15:08:44,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:08:44,898 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-03 15:08:44,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:08:44,899 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-03 15:08:44,899 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-03-03 15:08:44,899 INFO L87 Difference]: Start difference. First operand 8222 states and 12531 transitions. Second operand has 10 states, 10 states have (on average 6.8) internal successors, (68), 9 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:45,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:08:45,482 INFO L93 Difference]: Finished difference Result 14703 states and 22225 transitions. [2025-03-03 15:08:45,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-03 15:08:45,483 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.8) internal successors, (68), 9 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2025-03-03 15:08:45,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:08:45,503 INFO L225 Difference]: With dead ends: 14703 [2025-03-03 15:08:45,504 INFO L226 Difference]: Without dead ends: 11126 [2025-03-03 15:08:45,512 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=122, Invalid=340, Unknown=0, NotChecked=0, Total=462 [2025-03-03 15:08:45,513 INFO L435 NwaCegarLoop]: 153 mSDtfsCounter, 1545 mSDsluCounter, 643 mSDsCounter, 0 mSdLazyCounter, 648 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1545 SdHoareTripleChecker+Valid, 796 SdHoareTripleChecker+Invalid, 660 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 648 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 15:08:45,513 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1545 Valid, 796 Invalid, 660 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 648 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 15:08:45,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11126 states. [2025-03-03 15:08:45,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11126 to 8390. [2025-03-03 15:08:45,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8390 states, 8389 states have (on average 1.5212778638693527) internal successors, (12762), 8389 states have internal predecessors, (12762), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:45,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8390 states to 8390 states and 12762 transitions. [2025-03-03 15:08:45,678 INFO L78 Accepts]: Start accepts. Automaton has 8390 states and 12762 transitions. Word has length 68 [2025-03-03 15:08:45,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:08:45,678 INFO L471 AbstractCegarLoop]: Abstraction has 8390 states and 12762 transitions. [2025-03-03 15:08:45,678 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.8) internal successors, (68), 9 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:45,678 INFO L276 IsEmpty]: Start isEmpty. Operand 8390 states and 12762 transitions. [2025-03-03 15:08:45,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-03-03 15:08:45,680 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:08:45,680 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] [2025-03-03 15:08:45,680 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 15:08:45,680 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:08:45,680 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:08:45,681 INFO L85 PathProgramCache]: Analyzing trace with hash -40485648, now seen corresponding path program 1 times [2025-03-03 15:08:45,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:08:45,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974575150] [2025-03-03 15:08:45,681 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:08:45,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:08:45,689 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-03 15:08:45,704 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-03 15:08:45,705 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:08:45,705 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:08:45,901 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:08:45,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:08:45,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [974575150] [2025-03-03 15:08:45,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [974575150] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:08:45,902 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:08:45,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-03 15:08:45,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1340007476] [2025-03-03 15:08:45,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:08:45,902 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-03 15:08:45,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:08:45,902 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-03 15:08:45,903 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-03-03 15:08:45,903 INFO L87 Difference]: Start difference. First operand 8390 states and 12762 transitions. Second operand has 10 states, 10 states have (on average 6.8) internal successors, (68), 9 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:46,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:08:46,518 INFO L93 Difference]: Finished difference Result 18375 states and 27743 transitions. [2025-03-03 15:08:46,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-03 15:08:46,518 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.8) internal successors, (68), 9 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2025-03-03 15:08:46,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:08:46,541 INFO L225 Difference]: With dead ends: 18375 [2025-03-03 15:08:46,541 INFO L226 Difference]: Without dead ends: 12535 [2025-03-03 15:08:46,550 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=122, Invalid=340, Unknown=0, NotChecked=0, Total=462 [2025-03-03 15:08:46,551 INFO L435 NwaCegarLoop]: 166 mSDtfsCounter, 1459 mSDsluCounter, 680 mSDsCounter, 0 mSdLazyCounter, 733 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1459 SdHoareTripleChecker+Valid, 846 SdHoareTripleChecker+Invalid, 745 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 733 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 15:08:46,551 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1459 Valid, 846 Invalid, 745 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 733 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 15:08:46,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12535 states. [2025-03-03 15:08:46,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12535 to 8578. [2025-03-03 15:08:46,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8578 states, 8577 states have (on average 1.516147837239128) internal successors, (13004), 8577 states have internal predecessors, (13004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:46,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8578 states to 8578 states and 13004 transitions. [2025-03-03 15:08:46,674 INFO L78 Accepts]: Start accepts. Automaton has 8578 states and 13004 transitions. Word has length 68 [2025-03-03 15:08:46,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:08:46,674 INFO L471 AbstractCegarLoop]: Abstraction has 8578 states and 13004 transitions. [2025-03-03 15:08:46,674 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.8) internal successors, (68), 9 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:46,675 INFO L276 IsEmpty]: Start isEmpty. Operand 8578 states and 13004 transitions. [2025-03-03 15:08:46,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-03-03 15:08:46,677 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:08:46,677 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] [2025-03-03 15:08:46,677 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 15:08:46,677 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:08:46,678 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:08:46,678 INFO L85 PathProgramCache]: Analyzing trace with hash 1435412592, now seen corresponding path program 1 times [2025-03-03 15:08:46,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:08:46,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2139915801] [2025-03-03 15:08:46,678 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:08:46,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:08:46,688 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-03 15:08:46,710 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-03 15:08:46,713 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:08:46,713 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:08:46,941 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:08:46,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:08:46,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2139915801] [2025-03-03 15:08:46,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2139915801] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:08:46,942 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:08:46,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-03 15:08:46,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1036245127] [2025-03-03 15:08:46,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:08:46,942 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-03 15:08:46,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:08:46,942 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-03 15:08:46,942 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-03-03 15:08:46,943 INFO L87 Difference]: Start difference. First operand 8578 states and 13004 transitions. Second operand has 10 states, 10 states have (on average 6.8) internal successors, (68), 9 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:47,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:08:47,636 INFO L93 Difference]: Finished difference Result 21670 states and 32663 transitions. [2025-03-03 15:08:47,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-03 15:08:47,637 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.8) internal successors, (68), 9 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2025-03-03 15:08:47,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:08:47,660 INFO L225 Difference]: With dead ends: 21670 [2025-03-03 15:08:47,660 INFO L226 Difference]: Without dead ends: 13755 [2025-03-03 15:08:47,671 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=103, Invalid=317, Unknown=0, NotChecked=0, Total=420 [2025-03-03 15:08:47,671 INFO L435 NwaCegarLoop]: 234 mSDtfsCounter, 1072 mSDsluCounter, 1126 mSDsCounter, 0 mSdLazyCounter, 1114 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1072 SdHoareTripleChecker+Valid, 1360 SdHoareTripleChecker+Invalid, 1123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 1114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 15:08:47,672 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1072 Valid, 1360 Invalid, 1123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 1114 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 15:08:47,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13755 states. [2025-03-03 15:08:47,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13755 to 8728. [2025-03-03 15:08:47,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8728 states, 8727 states have (on average 1.5092242465910393) internal successors, (13171), 8727 states have internal predecessors, (13171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:47,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8728 states to 8728 states and 13171 transitions. [2025-03-03 15:08:47,795 INFO L78 Accepts]: Start accepts. Automaton has 8728 states and 13171 transitions. Word has length 68 [2025-03-03 15:08:47,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:08:47,795 INFO L471 AbstractCegarLoop]: Abstraction has 8728 states and 13171 transitions. [2025-03-03 15:08:47,796 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.8) internal successors, (68), 9 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:47,796 INFO L276 IsEmpty]: Start isEmpty. Operand 8728 states and 13171 transitions. [2025-03-03 15:08:47,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-03-03 15:08:47,798 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:08:47,798 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] [2025-03-03 15:08:47,798 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-03 15:08:47,798 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:08:47,799 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:08:47,799 INFO L85 PathProgramCache]: Analyzing trace with hash 1592237472, now seen corresponding path program 1 times [2025-03-03 15:08:47,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:08:47,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500135736] [2025-03-03 15:08:47,799 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:08:47,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:08:47,811 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-03 15:08:47,837 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-03 15:08:47,837 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:08:47,837 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:08:47,910 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:08:47,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:08:47,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [500135736] [2025-03-03 15:08:47,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [500135736] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:08:47,911 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:08:47,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 15:08:47,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [829680029] [2025-03-03 15:08:47,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:08:47,912 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 15:08:47,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:08:47,912 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 15:08:47,912 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 15:08:47,912 INFO L87 Difference]: Start difference. First operand 8728 states and 13171 transitions. Second operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:47,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:08:47,972 INFO L93 Difference]: Finished difference Result 22788 states and 34565 transitions. [2025-03-03 15:08:47,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 15:08:47,973 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2025-03-03 15:08:47,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:08:47,999 INFO L225 Difference]: With dead ends: 22788 [2025-03-03 15:08:47,999 INFO L226 Difference]: Without dead ends: 15138 [2025-03-03 15:08:48,012 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:08:48,013 INFO L435 NwaCegarLoop]: 243 mSDtfsCounter, 170 mSDsluCounter, 362 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 605 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:08:48,013 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [170 Valid, 605 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:08:48,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15138 states. [2025-03-03 15:08:48,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15138 to 15032. [2025-03-03 15:08:48,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15032 states, 15031 states have (on average 1.4989687978178432) internal successors, (22531), 15031 states have internal predecessors, (22531), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:48,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15032 states to 15032 states and 22531 transitions. [2025-03-03 15:08:48,204 INFO L78 Accepts]: Start accepts. Automaton has 15032 states and 22531 transitions. Word has length 69 [2025-03-03 15:08:48,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:08:48,204 INFO L471 AbstractCegarLoop]: Abstraction has 15032 states and 22531 transitions. [2025-03-03 15:08:48,204 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:48,204 INFO L276 IsEmpty]: Start isEmpty. Operand 15032 states and 22531 transitions. [2025-03-03 15:08:48,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-03-03 15:08:48,206 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:08:48,206 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] [2025-03-03 15:08:48,206 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-03 15:08:48,206 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:08:48,207 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:08:48,207 INFO L85 PathProgramCache]: Analyzing trace with hash 800567042, now seen corresponding path program 1 times [2025-03-03 15:08:48,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:08:48,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1822568173] [2025-03-03 15:08:48,207 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:08:48,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:08:48,216 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-03 15:08:48,221 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-03 15:08:48,221 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:08:48,221 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:08:48,245 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:08:48,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:08:48,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1822568173] [2025-03-03 15:08:48,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1822568173] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:08:48,245 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:08:48,245 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:08:48,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [952596769] [2025-03-03 15:08:48,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:08:48,246 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:08:48,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:08:48,246 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:08:48,246 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:08:48,246 INFO L87 Difference]: Start difference. First operand 15032 states and 22531 transitions. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:48,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:08:48,313 INFO L93 Difference]: Finished difference Result 32638 states and 49093 transitions. [2025-03-03 15:08:48,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:08:48,314 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2025-03-03 15:08:48,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:08:48,349 INFO L225 Difference]: With dead ends: 32638 [2025-03-03 15:08:48,349 INFO L226 Difference]: Without dead ends: 20054 [2025-03-03 15:08:48,363 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:08:48,364 INFO L435 NwaCegarLoop]: 244 mSDtfsCounter, 176 mSDsluCounter, 222 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 466 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:08:48,365 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [176 Valid, 466 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:08:48,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20054 states. [2025-03-03 15:08:48,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20054 to 20004. [2025-03-03 15:08:48,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20004 states, 20003 states have (on average 1.4869769534569814) internal successors, (29744), 20003 states have internal predecessors, (29744), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:48,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20004 states to 20004 states and 29744 transitions. [2025-03-03 15:08:48,630 INFO L78 Accepts]: Start accepts. Automaton has 20004 states and 29744 transitions. Word has length 69 [2025-03-03 15:08:48,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:08:48,630 INFO L471 AbstractCegarLoop]: Abstraction has 20004 states and 29744 transitions. [2025-03-03 15:08:48,630 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:48,630 INFO L276 IsEmpty]: Start isEmpty. Operand 20004 states and 29744 transitions. [2025-03-03 15:08:48,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-03-03 15:08:48,633 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:08:48,633 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] [2025-03-03 15:08:48,633 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-03 15:08:48,633 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:08:48,634 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:08:48,634 INFO L85 PathProgramCache]: Analyzing trace with hash -1759014655, now seen corresponding path program 1 times [2025-03-03 15:08:48,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:08:48,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1663707] [2025-03-03 15:08:48,634 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:08:48,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:08:48,645 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-03 15:08:48,651 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-03 15:08:48,652 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:08:48,652 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:08:48,683 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:08:48,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:08:48,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1663707] [2025-03-03 15:08:48,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1663707] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:08:48,683 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:08:48,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:08:48,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675331436] [2025-03-03 15:08:48,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:08:48,684 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:08:48,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:08:48,684 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:08:48,684 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:08:48,685 INFO L87 Difference]: Start difference. First operand 20004 states and 29744 transitions. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:48,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:08:48,760 INFO L93 Difference]: Finished difference Result 29047 states and 43114 transitions. [2025-03-03 15:08:48,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:08:48,761 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2025-03-03 15:08:48,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:08:48,798 INFO L225 Difference]: With dead ends: 29047 [2025-03-03 15:08:48,798 INFO L226 Difference]: Without dead ends: 22329 [2025-03-03 15:08:48,810 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:08:48,811 INFO L435 NwaCegarLoop]: 335 mSDtfsCounter, 144 mSDsluCounter, 221 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 556 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:08:48,812 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 556 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:08:48,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22329 states. [2025-03-03 15:08:48,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22329 to 19443. [2025-03-03 15:08:49,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19443 states, 19442 states have (on average 1.4613722868017693) internal successors, (28412), 19442 states have internal predecessors, (28412), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:49,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19443 states to 19443 states and 28412 transitions. [2025-03-03 15:08:49,036 INFO L78 Accepts]: Start accepts. Automaton has 19443 states and 28412 transitions. Word has length 69 [2025-03-03 15:08:49,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:08:49,036 INFO L471 AbstractCegarLoop]: Abstraction has 19443 states and 28412 transitions. [2025-03-03 15:08:49,036 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:49,036 INFO L276 IsEmpty]: Start isEmpty. Operand 19443 states and 28412 transitions. [2025-03-03 15:08:49,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-03-03 15:08:49,038 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:08:49,039 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] [2025-03-03 15:08:49,039 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-03 15:08:49,039 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:08:49,039 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:08:49,039 INFO L85 PathProgramCache]: Analyzing trace with hash 706108514, now seen corresponding path program 1 times [2025-03-03 15:08:49,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:08:49,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344377508] [2025-03-03 15:08:49,039 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:08:49,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:08:49,049 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-03 15:08:49,052 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-03 15:08:49,053 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:08:49,053 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:08:49,074 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:08:49,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:08:49,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1344377508] [2025-03-03 15:08:49,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1344377508] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:08:49,075 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:08:49,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:08:49,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1398221992] [2025-03-03 15:08:49,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:08:49,075 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:08:49,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:08:49,076 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:08:49,076 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:08:49,076 INFO L87 Difference]: Start difference. First operand 19443 states and 28412 transitions. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:49,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:08:49,199 INFO L93 Difference]: Finished difference Result 34467 states and 50436 transitions. [2025-03-03 15:08:49,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:08:49,200 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2025-03-03 15:08:49,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:08:49,230 INFO L225 Difference]: With dead ends: 34467 [2025-03-03 15:08:49,230 INFO L226 Difference]: Without dead ends: 22527 [2025-03-03 15:08:49,239 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:08:49,239 INFO L435 NwaCegarLoop]: 278 mSDtfsCounter, 154 mSDsluCounter, 220 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 498 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:08:49,239 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 498 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:08:49,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22527 states. [2025-03-03 15:08:49,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22527 to 22225. [2025-03-03 15:08:49,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22225 states, 22224 states have (on average 1.4353401727861772) internal successors, (31899), 22224 states have internal predecessors, (31899), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:49,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22225 states to 22225 states and 31899 transitions. [2025-03-03 15:08:49,455 INFO L78 Accepts]: Start accepts. Automaton has 22225 states and 31899 transitions. Word has length 69 [2025-03-03 15:08:49,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:08:49,455 INFO L471 AbstractCegarLoop]: Abstraction has 22225 states and 31899 transitions. [2025-03-03 15:08:49,455 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:49,455 INFO L276 IsEmpty]: Start isEmpty. Operand 22225 states and 31899 transitions. [2025-03-03 15:08:49,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-03-03 15:08:49,457 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:08:49,457 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:08:49,458 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-03 15:08:49,458 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:08:49,458 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:08:49,458 INFO L85 PathProgramCache]: Analyzing trace with hash 871916129, now seen corresponding path program 1 times [2025-03-03 15:08:49,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:08:49,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460842401] [2025-03-03 15:08:49,458 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:08:49,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:08:49,468 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-03 15:08:49,473 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-03 15:08:49,473 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:08:49,473 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:08:49,494 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:08:49,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:08:49,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1460842401] [2025-03-03 15:08:49,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1460842401] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:08:49,496 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:08:49,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:08:49,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [168096552] [2025-03-03 15:08:49,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:08:49,496 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:08:49,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:08:49,496 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:08:49,496 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:08:49,496 INFO L87 Difference]: Start difference. First operand 22225 states and 31899 transitions. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:49,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:08:49,592 INFO L93 Difference]: Finished difference Result 44870 states and 64241 transitions. [2025-03-03 15:08:49,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:08:49,592 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2025-03-03 15:08:49,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:08:49,630 INFO L225 Difference]: With dead ends: 44870 [2025-03-03 15:08:49,630 INFO L226 Difference]: Without dead ends: 25148 [2025-03-03 15:08:49,647 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:08:49,648 INFO L435 NwaCegarLoop]: 244 mSDtfsCounter, 164 mSDsluCounter, 219 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 463 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:08:49,648 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [164 Valid, 463 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:08:49,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25148 states. [2025-03-03 15:08:49,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25148 to 24902. [2025-03-03 15:08:49,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24902 states, 24901 states have (on average 1.398417734227541) internal successors, (34822), 24901 states have internal predecessors, (34822), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:49,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24902 states to 24902 states and 34822 transitions. [2025-03-03 15:08:49,982 INFO L78 Accepts]: Start accepts. Automaton has 24902 states and 34822 transitions. Word has length 69 [2025-03-03 15:08:49,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:08:49,982 INFO L471 AbstractCegarLoop]: Abstraction has 24902 states and 34822 transitions. [2025-03-03 15:08:49,982 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:49,982 INFO L276 IsEmpty]: Start isEmpty. Operand 24902 states and 34822 transitions. [2025-03-03 15:08:49,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-03-03 15:08:49,984 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:08:49,984 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:08:49,985 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-03 15:08:49,985 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:08:49,986 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:08:49,986 INFO L85 PathProgramCache]: Analyzing trace with hash -548566319, now seen corresponding path program 1 times [2025-03-03 15:08:49,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:08:49,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1205529785] [2025-03-03 15:08:49,986 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:08:49,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:08:49,996 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-03 15:08:50,001 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-03 15:08:50,001 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:08:50,001 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:08:50,066 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:08:50,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:08:50,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1205529785] [2025-03-03 15:08:50,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1205529785] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:08:50,067 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:08:50,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 15:08:50,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046678933] [2025-03-03 15:08:50,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:08:50,068 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 15:08:50,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:08:50,068 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 15:08:50,068 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:08:50,068 INFO L87 Difference]: Start difference. First operand 24902 states and 34822 transitions. Second operand has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:50,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:08:50,203 INFO L93 Difference]: Finished difference Result 46031 states and 64885 transitions. [2025-03-03 15:08:50,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 15:08:50,204 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 70 [2025-03-03 15:08:50,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:08:50,260 INFO L225 Difference]: With dead ends: 46031 [2025-03-03 15:08:50,260 INFO L226 Difference]: Without dead ends: 43041 [2025-03-03 15:08:50,280 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:08:50,281 INFO L435 NwaCegarLoop]: 353 mSDtfsCounter, 1111 mSDsluCounter, 773 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1111 SdHoareTripleChecker+Valid, 1126 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:08:50,281 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1111 Valid, 1126 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:08:50,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43041 states. [2025-03-03 15:08:50,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43041 to 27845. [2025-03-03 15:08:50,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27845 states, 27844 states have (on average 1.398972848728631) internal successors, (38953), 27844 states have internal predecessors, (38953), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:50,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27845 states to 27845 states and 38953 transitions. [2025-03-03 15:08:50,839 INFO L78 Accepts]: Start accepts. Automaton has 27845 states and 38953 transitions. Word has length 70 [2025-03-03 15:08:50,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:08:50,839 INFO L471 AbstractCegarLoop]: Abstraction has 27845 states and 38953 transitions. [2025-03-03 15:08:50,839 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:50,840 INFO L276 IsEmpty]: Start isEmpty. Operand 27845 states and 38953 transitions. [2025-03-03 15:08:50,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-03-03 15:08:50,842 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:08:50,842 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:08:50,842 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-03 15:08:50,842 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:08:50,842 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:08:50,842 INFO L85 PathProgramCache]: Analyzing trace with hash -271879983, now seen corresponding path program 1 times [2025-03-03 15:08:50,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:08:50,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1024589066] [2025-03-03 15:08:50,843 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:08:50,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:08:50,856 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-03 15:08:50,862 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-03 15:08:50,862 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:08:50,862 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:08:50,938 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:08:50,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:08:50,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1024589066] [2025-03-03 15:08:50,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1024589066] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:08:50,938 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:08:50,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 15:08:50,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [934551663] [2025-03-03 15:08:50,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:08:50,939 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 15:08:50,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:08:50,939 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 15:08:50,939 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:08:50,939 INFO L87 Difference]: Start difference. First operand 27845 states and 38953 transitions. Second operand has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:51,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:08:51,149 INFO L93 Difference]: Finished difference Result 52522 states and 74052 transitions. [2025-03-03 15:08:51,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 15:08:51,149 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 70 [2025-03-03 15:08:51,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:08:51,207 INFO L225 Difference]: With dead ends: 52522 [2025-03-03 15:08:51,207 INFO L226 Difference]: Without dead ends: 45908 [2025-03-03 15:08:51,225 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:08:51,226 INFO L435 NwaCegarLoop]: 374 mSDtfsCounter, 1035 mSDsluCounter, 816 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1035 SdHoareTripleChecker+Valid, 1190 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:08:51,226 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1035 Valid, 1190 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:08:51,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45908 states. [2025-03-03 15:08:51,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45908 to 34374. [2025-03-03 15:08:51,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34374 states, 34373 states have (on average 1.3991214034271084) internal successors, (48092), 34373 states have internal predecessors, (48092), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:51,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34374 states to 34374 states and 48092 transitions. [2025-03-03 15:08:51,793 INFO L78 Accepts]: Start accepts. Automaton has 34374 states and 48092 transitions. Word has length 70 [2025-03-03 15:08:51,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:08:51,793 INFO L471 AbstractCegarLoop]: Abstraction has 34374 states and 48092 transitions. [2025-03-03 15:08:51,793 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:51,793 INFO L276 IsEmpty]: Start isEmpty. Operand 34374 states and 48092 transitions. [2025-03-03 15:08:51,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-03-03 15:08:51,796 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:08:51,796 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:08:51,796 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-03 15:08:51,796 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:08:51,796 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:08:51,796 INFO L85 PathProgramCache]: Analyzing trace with hash 1385153455, now seen corresponding path program 1 times [2025-03-03 15:08:51,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:08:51,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1042770338] [2025-03-03 15:08:51,796 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:08:51,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:08:51,807 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-03 15:08:51,813 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-03 15:08:51,813 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:08:51,813 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:08:51,885 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:08:51,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:08:51,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1042770338] [2025-03-03 15:08:51,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1042770338] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:08:51,885 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:08:51,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 15:08:51,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971854964] [2025-03-03 15:08:51,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:08:51,885 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 15:08:51,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:08:51,886 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 15:08:51,886 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:08:51,886 INFO L87 Difference]: Start difference. First operand 34374 states and 48092 transitions. Second operand has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:52,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:08:52,176 INFO L93 Difference]: Finished difference Result 62447 states and 88025 transitions. [2025-03-03 15:08:52,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 15:08:52,176 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 70 [2025-03-03 15:08:52,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:08:52,243 INFO L225 Difference]: With dead ends: 62447 [2025-03-03 15:08:52,244 INFO L226 Difference]: Without dead ends: 52353 [2025-03-03 15:08:52,342 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:08:52,343 INFO L435 NwaCegarLoop]: 388 mSDtfsCounter, 1080 mSDsluCounter, 891 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1080 SdHoareTripleChecker+Valid, 1279 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:08:52,343 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1080 Valid, 1279 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 15:08:52,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52353 states. [2025-03-03 15:08:52,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52353 to 41438. [2025-03-03 15:08:52,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41438 states, 41437 states have (on average 1.401187344643676) internal successors, (58061), 41437 states have internal predecessors, (58061), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:52,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41438 states to 41438 states and 58061 transitions. [2025-03-03 15:08:52,752 INFO L78 Accepts]: Start accepts. Automaton has 41438 states and 58061 transitions. Word has length 70 [2025-03-03 15:08:52,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:08:52,753 INFO L471 AbstractCegarLoop]: Abstraction has 41438 states and 58061 transitions. [2025-03-03 15:08:52,753 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:52,753 INFO L276 IsEmpty]: Start isEmpty. Operand 41438 states and 58061 transitions. [2025-03-03 15:08:52,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-03-03 15:08:52,754 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:08:52,755 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:08:52,755 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-03 15:08:52,755 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:08:52,755 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:08:52,755 INFO L85 PathProgramCache]: Analyzing trace with hash -2089966831, now seen corresponding path program 1 times [2025-03-03 15:08:52,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:08:52,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859204203] [2025-03-03 15:08:52,755 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:08:52,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:08:52,764 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-03 15:08:52,768 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-03 15:08:52,768 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:08:52,768 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:08:52,935 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:08:52,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:08:52,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [859204203] [2025-03-03 15:08:52,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [859204203] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:08:52,935 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:08:52,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 15:08:52,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2099091825] [2025-03-03 15:08:52,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:08:52,936 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 15:08:52,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:08:52,936 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 15:08:52,936 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:08:52,936 INFO L87 Difference]: Start difference. First operand 41438 states and 58061 transitions. Second operand has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:53,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:08:53,263 INFO L93 Difference]: Finished difference Result 71179 states and 100265 transitions. [2025-03-03 15:08:53,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 15:08:53,263 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 70 [2025-03-03 15:08:53,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:08:53,341 INFO L225 Difference]: With dead ends: 71179 [2025-03-03 15:08:53,342 INFO L226 Difference]: Without dead ends: 60738 [2025-03-03 15:08:53,358 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:08:53,359 INFO L435 NwaCegarLoop]: 394 mSDtfsCounter, 1089 mSDsluCounter, 748 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1089 SdHoareTripleChecker+Valid, 1142 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:08:53,360 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1089 Valid, 1142 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:08:53,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60738 states. [2025-03-03 15:08:53,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60738 to 45936. [2025-03-03 15:08:54,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45936 states, 45935 states have (on average 1.4016327419179275) internal successors, (64384), 45935 states have internal predecessors, (64384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:54,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45936 states to 45936 states and 64384 transitions. [2025-03-03 15:08:54,075 INFO L78 Accepts]: Start accepts. Automaton has 45936 states and 64384 transitions. Word has length 70 [2025-03-03 15:08:54,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:08:54,075 INFO L471 AbstractCegarLoop]: Abstraction has 45936 states and 64384 transitions. [2025-03-03 15:08:54,075 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:54,075 INFO L276 IsEmpty]: Start isEmpty. Operand 45936 states and 64384 transitions. [2025-03-03 15:08:54,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-03-03 15:08:54,079 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:08:54,079 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] [2025-03-03 15:08:54,079 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-03 15:08:54,079 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:08:54,079 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:08:54,079 INFO L85 PathProgramCache]: Analyzing trace with hash 646420641, now seen corresponding path program 1 times [2025-03-03 15:08:54,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:08:54,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2022168575] [2025-03-03 15:08:54,079 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:08:54,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:08:54,091 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-03-03 15:08:54,103 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-03-03 15:08:54,103 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:08:54,103 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:08:54,181 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:08:54,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:08:54,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2022168575] [2025-03-03 15:08:54,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2022168575] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:08:54,182 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:08:54,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 15:08:54,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393671549] [2025-03-03 15:08:54,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:08:54,183 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 15:08:54,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:08:54,183 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 15:08:54,183 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-03 15:08:54,183 INFO L87 Difference]: Start difference. First operand 45936 states and 64384 transitions. Second operand has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 6 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:54,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:08:54,987 INFO L93 Difference]: Finished difference Result 135931 states and 189048 transitions. [2025-03-03 15:08:54,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 15:08:54,988 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 6 states have internal predecessors, (75), 0 states have call successors, (0), 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 75 [2025-03-03 15:08:54,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:08:55,127 INFO L225 Difference]: With dead ends: 135931 [2025-03-03 15:08:55,128 INFO L226 Difference]: Without dead ends: 118901 [2025-03-03 15:08:55,159 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2025-03-03 15:08:55,160 INFO L435 NwaCegarLoop]: 144 mSDtfsCounter, 1608 mSDsluCounter, 313 mSDsCounter, 0 mSdLazyCounter, 321 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1608 SdHoareTripleChecker+Valid, 457 SdHoareTripleChecker+Invalid, 338 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 321 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 15:08:55,160 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1608 Valid, 457 Invalid, 338 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 321 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 15:08:55,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118901 states. [2025-03-03 15:08:55,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118901 to 46098. [2025-03-03 15:08:56,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46098 states, 46097 states have (on average 1.4008937674902922) internal successors, (64577), 46097 states have internal predecessors, (64577), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:56,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46098 states to 46098 states and 64577 transitions. [2025-03-03 15:08:56,104 INFO L78 Accepts]: Start accepts. Automaton has 46098 states and 64577 transitions. Word has length 75 [2025-03-03 15:08:56,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:08:56,105 INFO L471 AbstractCegarLoop]: Abstraction has 46098 states and 64577 transitions. [2025-03-03 15:08:56,105 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 6 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:56,105 INFO L276 IsEmpty]: Start isEmpty. Operand 46098 states and 64577 transitions. [2025-03-03 15:08:56,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-03-03 15:08:56,108 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:08:56,109 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] [2025-03-03 15:08:56,109 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-03 15:08:56,109 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:08:56,109 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:08:56,109 INFO L85 PathProgramCache]: Analyzing trace with hash 1669357284, now seen corresponding path program 1 times [2025-03-03 15:08:56,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:08:56,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477691827] [2025-03-03 15:08:56,109 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:08:56,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:08:56,120 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-03-03 15:08:56,129 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-03-03 15:08:56,129 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:08:56,129 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:08:56,200 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:08:56,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:08:56,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [477691827] [2025-03-03 15:08:56,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [477691827] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:08:56,201 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:08:56,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 15:08:56,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745518670] [2025-03-03 15:08:56,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:08:56,201 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 15:08:56,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:08:56,202 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 15:08:56,202 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-03 15:08:56,202 INFO L87 Difference]: Start difference. First operand 46098 states and 64577 transitions. Second operand has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 6 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:56,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:08:56,889 INFO L93 Difference]: Finished difference Result 143943 states and 201252 transitions. [2025-03-03 15:08:56,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 15:08:56,892 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 6 states have internal predecessors, (75), 0 states have call successors, (0), 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 75 [2025-03-03 15:08:56,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:08:57,054 INFO L225 Difference]: With dead ends: 143943 [2025-03-03 15:08:57,054 INFO L226 Difference]: Without dead ends: 121485 [2025-03-03 15:08:57,102 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2025-03-03 15:08:57,103 INFO L435 NwaCegarLoop]: 143 mSDtfsCounter, 1766 mSDsluCounter, 327 mSDsCounter, 0 mSdLazyCounter, 332 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1766 SdHoareTripleChecker+Valid, 470 SdHoareTripleChecker+Invalid, 349 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 332 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 15:08:57,103 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1766 Valid, 470 Invalid, 349 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 332 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 15:08:57,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121485 states. [2025-03-03 15:08:58,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121485 to 46202. [2025-03-03 15:08:58,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46202 states, 46201 states have (on average 1.400445877794853) internal successors, (64702), 46201 states have internal predecessors, (64702), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:58,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46202 states to 46202 states and 64702 transitions. [2025-03-03 15:08:58,250 INFO L78 Accepts]: Start accepts. Automaton has 46202 states and 64702 transitions. Word has length 75 [2025-03-03 15:08:58,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:08:58,250 INFO L471 AbstractCegarLoop]: Abstraction has 46202 states and 64702 transitions. [2025-03-03 15:08:58,250 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 6 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:58,250 INFO L276 IsEmpty]: Start isEmpty. Operand 46202 states and 64702 transitions. [2025-03-03 15:08:58,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-03-03 15:08:58,253 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:08:58,253 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] [2025-03-03 15:08:58,253 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-03 15:08:58,254 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:08:58,254 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:08:58,254 INFO L85 PathProgramCache]: Analyzing trace with hash 1099371106, now seen corresponding path program 1 times [2025-03-03 15:08:58,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:08:58,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315220093] [2025-03-03 15:08:58,254 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:08:58,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:08:58,265 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-03-03 15:08:58,272 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-03-03 15:08:58,272 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:08:58,272 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:08:58,331 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:08:58,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:08:58,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1315220093] [2025-03-03 15:08:58,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1315220093] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:08:58,332 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:08:58,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 15:08:58,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1284716987] [2025-03-03 15:08:58,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:08:58,332 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 15:08:58,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:08:58,333 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 15:08:58,333 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-03 15:08:58,333 INFO L87 Difference]: Start difference. First operand 46202 states and 64702 transitions. Second operand has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 6 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:58,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:08:58,826 INFO L93 Difference]: Finished difference Result 108667 states and 150683 transitions. [2025-03-03 15:08:58,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 15:08:58,827 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 6 states have internal predecessors, (75), 0 states have call successors, (0), 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 75 [2025-03-03 15:08:58,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:08:58,950 INFO L225 Difference]: With dead ends: 108667 [2025-03-03 15:08:58,950 INFO L226 Difference]: Without dead ends: 99869 [2025-03-03 15:08:58,983 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2025-03-03 15:08:58,984 INFO L435 NwaCegarLoop]: 147 mSDtfsCounter, 1394 mSDsluCounter, 302 mSDsCounter, 0 mSdLazyCounter, 339 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1394 SdHoareTripleChecker+Valid, 449 SdHoareTripleChecker+Invalid, 355 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 339 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 15:08:58,984 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1394 Valid, 449 Invalid, 355 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 339 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 15:08:59,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99869 states. [2025-03-03 15:08:59,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99869 to 46451. [2025-03-03 15:08:59,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46451 states, 46450 states have (on average 1.3991819160387513) internal successors, (64992), 46450 states have internal predecessors, (64992), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:59,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46451 states to 46451 states and 64992 transitions. [2025-03-03 15:08:59,903 INFO L78 Accepts]: Start accepts. Automaton has 46451 states and 64992 transitions. Word has length 75 [2025-03-03 15:08:59,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:08:59,903 INFO L471 AbstractCegarLoop]: Abstraction has 46451 states and 64992 transitions. [2025-03-03 15:08:59,903 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 6 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:59,903 INFO L276 IsEmpty]: Start isEmpty. Operand 46451 states and 64992 transitions. [2025-03-03 15:08:59,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-03-03 15:08:59,907 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:08:59,907 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:08:59,908 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-03 15:08:59,908 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:08:59,908 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:08:59,908 INFO L85 PathProgramCache]: Analyzing trace with hash 152121571, now seen corresponding path program 1 times [2025-03-03 15:08:59,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:08:59,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1139396356] [2025-03-03 15:08:59,908 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:08:59,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:08:59,920 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-03-03 15:08:59,927 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-03-03 15:08:59,927 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:08:59,927 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:08:59,999 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:09:00,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:09:00,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1139396356] [2025-03-03 15:09:00,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1139396356] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:09:00,000 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:09:00,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 15:09:00,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [827367879] [2025-03-03 15:09:00,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:09:00,001 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 15:09:00,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:09:00,001 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 15:09:00,001 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-03 15:09:00,001 INFO L87 Difference]: Start difference. First operand 46451 states and 64992 transitions. Second operand has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 6 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:09:00,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:09:00,573 INFO L93 Difference]: Finished difference Result 114627 states and 159607 transitions. [2025-03-03 15:09:00,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 15:09:00,574 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 6 states have internal predecessors, (75), 0 states have call successors, (0), 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 75 [2025-03-03 15:09:00,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:09:00,672 INFO L225 Difference]: With dead ends: 114627 [2025-03-03 15:09:00,672 INFO L226 Difference]: Without dead ends: 87399 [2025-03-03 15:09:00,711 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2025-03-03 15:09:00,712 INFO L435 NwaCegarLoop]: 147 mSDtfsCounter, 1229 mSDsluCounter, 256 mSDsCounter, 0 mSdLazyCounter, 279 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1229 SdHoareTripleChecker+Valid, 403 SdHoareTripleChecker+Invalid, 292 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 279 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 15:09:00,712 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1229 Valid, 403 Invalid, 292 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 279 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 15:09:00,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87399 states. [2025-03-03 15:09:01,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87399 to 46501. [2025-03-03 15:09:01,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46501 states, 46500 states have (on average 1.3989677419354838) internal successors, (65052), 46500 states have internal predecessors, (65052), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:09:01,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46501 states to 46501 states and 65052 transitions. [2025-03-03 15:09:01,662 INFO L78 Accepts]: Start accepts. Automaton has 46501 states and 65052 transitions. Word has length 75 [2025-03-03 15:09:01,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:09:01,662 INFO L471 AbstractCegarLoop]: Abstraction has 46501 states and 65052 transitions. [2025-03-03 15:09:01,662 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 6 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:09:01,662 INFO L276 IsEmpty]: Start isEmpty. Operand 46501 states and 65052 transitions. [2025-03-03 15:09:01,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-03-03 15:09:01,667 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:09:01,667 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] [2025-03-03 15:09:01,667 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-03 15:09:01,667 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:09:01,668 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:09:01,668 INFO L85 PathProgramCache]: Analyzing trace with hash -463025853, now seen corresponding path program 1 times [2025-03-03 15:09:01,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:09:01,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381894733] [2025-03-03 15:09:01,668 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:09:01,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:09:01,678 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-03 15:09:01,695 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-03 15:09:01,695 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:09:01,695 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:09:02,286 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:09:02,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:09:02,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [381894733] [2025-03-03 15:09:02,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [381894733] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:09:02,287 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:09:02,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-03 15:09:02,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [771537041] [2025-03-03 15:09:02,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:09:02,287 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-03 15:09:02,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:09:02,288 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-03 15:09:02,288 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2025-03-03 15:09:02,288 INFO L87 Difference]: Start difference. First operand 46501 states and 65052 transitions. Second operand has 13 states, 13 states have (on average 5.923076923076923) internal successors, (77), 13 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:09:03,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:09:03,085 INFO L93 Difference]: Finished difference Result 85372 states and 119461 transitions. [2025-03-03 15:09:03,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-03 15:09:03,086 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.923076923076923) internal successors, (77), 13 states have internal predecessors, (77), 0 states have call successors, (0), 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 77 [2025-03-03 15:09:03,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:09:03,184 INFO L225 Difference]: With dead ends: 85372 [2025-03-03 15:09:03,184 INFO L226 Difference]: Without dead ends: 79430 [2025-03-03 15:09:03,214 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=142, Invalid=458, Unknown=0, NotChecked=0, Total=600 [2025-03-03 15:09:03,214 INFO L435 NwaCegarLoop]: 239 mSDtfsCounter, 1347 mSDsluCounter, 1718 mSDsCounter, 0 mSdLazyCounter, 433 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1347 SdHoareTripleChecker+Valid, 1957 SdHoareTripleChecker+Invalid, 438 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 433 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 15:09:03,215 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1347 Valid, 1957 Invalid, 438 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 433 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 15:09:03,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79430 states. [2025-03-03 15:09:04,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79430 to 46514. [2025-03-03 15:09:04,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46514 states, 46513 states have (on average 1.3987057381807237) internal successors, (65058), 46513 states have internal predecessors, (65058), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:09:04,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46514 states to 46514 states and 65058 transitions. [2025-03-03 15:09:04,101 INFO L78 Accepts]: Start accepts. Automaton has 46514 states and 65058 transitions. Word has length 77 [2025-03-03 15:09:04,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:09:04,101 INFO L471 AbstractCegarLoop]: Abstraction has 46514 states and 65058 transitions. [2025-03-03 15:09:04,101 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.923076923076923) internal successors, (77), 13 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:09:04,101 INFO L276 IsEmpty]: Start isEmpty. Operand 46514 states and 65058 transitions. [2025-03-03 15:09:04,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-03-03 15:09:04,105 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:09:04,105 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] [2025-03-03 15:09:04,105 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-03 15:09:04,105 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:09:04,105 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:09:04,106 INFO L85 PathProgramCache]: Analyzing trace with hash 1194915973, now seen corresponding path program 1 times [2025-03-03 15:09:04,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:09:04,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380356481] [2025-03-03 15:09:04,106 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:09:04,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:09:04,113 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-03 15:09:04,127 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-03 15:09:04,127 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:09:04,127 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:09:04,450 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:09:04,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:09:04,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1380356481] [2025-03-03 15:09:04,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1380356481] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:09:04,451 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:09:04,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-03 15:09:04,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824842877] [2025-03-03 15:09:04,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:09:04,451 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-03 15:09:04,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:09:04,452 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-03 15:09:04,452 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-03-03 15:09:04,452 INFO L87 Difference]: Start difference. First operand 46514 states and 65058 transitions. Second operand has 11 states, 11 states have (on average 7.0) internal successors, (77), 11 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:09:04,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:09:04,988 INFO L93 Difference]: Finished difference Result 94529 states and 132656 transitions. [2025-03-03 15:09:04,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-03 15:09:04,989 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 7.0) internal successors, (77), 11 states have internal predecessors, (77), 0 states have call successors, (0), 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 77 [2025-03-03 15:09:04,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:09:05,092 INFO L225 Difference]: With dead ends: 94529 [2025-03-03 15:09:05,093 INFO L226 Difference]: Without dead ends: 74900 [2025-03-03 15:09:05,122 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=81, Invalid=225, Unknown=0, NotChecked=0, Total=306 [2025-03-03 15:09:05,123 INFO L435 NwaCegarLoop]: 327 mSDtfsCounter, 908 mSDsluCounter, 1510 mSDsCounter, 0 mSdLazyCounter, 348 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 908 SdHoareTripleChecker+Valid, 1837 SdHoareTripleChecker+Invalid, 351 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 348 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 15:09:05,123 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [908 Valid, 1837 Invalid, 351 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 348 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 15:09:05,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74900 states. [2025-03-03 15:09:05,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74900 to 46417. [2025-03-03 15:09:05,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46417 states, 46416 states have (on average 1.3990434332988624) internal successors, (64938), 46416 states have internal predecessors, (64938), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:09:05,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46417 states to 46417 states and 64938 transitions. [2025-03-03 15:09:05,996 INFO L78 Accepts]: Start accepts. Automaton has 46417 states and 64938 transitions. Word has length 77 [2025-03-03 15:09:05,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:09:05,996 INFO L471 AbstractCegarLoop]: Abstraction has 46417 states and 64938 transitions. [2025-03-03 15:09:05,996 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.0) internal successors, (77), 11 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:09:05,996 INFO L276 IsEmpty]: Start isEmpty. Operand 46417 states and 64938 transitions. [2025-03-03 15:09:06,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-03-03 15:09:06,000 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:09:06,000 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] [2025-03-03 15:09:06,000 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-03 15:09:06,000 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:09:06,001 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:09:06,001 INFO L85 PathProgramCache]: Analyzing trace with hash -164434357, now seen corresponding path program 1 times [2025-03-03 15:09:06,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:09:06,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114745013] [2025-03-03 15:09:06,001 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:09:06,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:09:06,010 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-03 15:09:06,014 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-03 15:09:06,014 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:09:06,014 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:09:06,036 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:09:06,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:09:06,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1114745013] [2025-03-03 15:09:06,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1114745013] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:09:06,037 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:09:06,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:09:06,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1373261254] [2025-03-03 15:09:06,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:09:06,038 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:09:06,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:09:06,038 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:09:06,038 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:09:06,038 INFO L87 Difference]: Start difference. First operand 46417 states and 64938 transitions. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:09:06,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:09:06,277 INFO L93 Difference]: Finished difference Result 101603 states and 142436 transitions. [2025-03-03 15:09:06,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:09:06,278 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 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 78 [2025-03-03 15:09:06,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:09:06,359 INFO L225 Difference]: With dead ends: 101603 [2025-03-03 15:09:06,360 INFO L226 Difference]: Without dead ends: 73511 [2025-03-03 15:09:06,395 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:09:06,395 INFO L435 NwaCegarLoop]: 248 mSDtfsCounter, 198 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 198 SdHoareTripleChecker+Valid, 394 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:09:06,395 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [198 Valid, 394 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:09:06,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73511 states. [2025-03-03 15:09:07,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73511 to 73365. [2025-03-03 15:09:07,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73365 states, 73364 states have (on average 1.4010822746851317) internal successors, (102789), 73364 states have internal predecessors, (102789), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:09:07,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73365 states to 73365 states and 102789 transitions. [2025-03-03 15:09:07,554 INFO L78 Accepts]: Start accepts. Automaton has 73365 states and 102789 transitions. Word has length 78 [2025-03-03 15:09:07,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:09:07,554 INFO L471 AbstractCegarLoop]: Abstraction has 73365 states and 102789 transitions. [2025-03-03 15:09:07,554 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:09:07,554 INFO L276 IsEmpty]: Start isEmpty. Operand 73365 states and 102789 transitions. [2025-03-03 15:09:07,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-03-03 15:09:07,559 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:09:07,559 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] [2025-03-03 15:09:07,560 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-03 15:09:07,560 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:09:07,560 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:09:07,560 INFO L85 PathProgramCache]: Analyzing trace with hash 1552857261, now seen corresponding path program 1 times [2025-03-03 15:09:07,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:09:07,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872218187] [2025-03-03 15:09:07,560 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:09:07,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:09:07,574 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-03 15:09:07,579 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-03 15:09:07,579 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:09:07,579 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:09:07,603 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:09:07,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:09:07,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1872218187] [2025-03-03 15:09:07,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1872218187] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:09:07,604 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:09:07,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:09:07,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715209308] [2025-03-03 15:09:07,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:09:07,604 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:09:07,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:09:07,605 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:09:07,605 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:09:07,605 INFO L87 Difference]: Start difference. First operand 73365 states and 102789 transitions. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:09:08,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:09:08,239 INFO L93 Difference]: Finished difference Result 156418 states and 219206 transitions. [2025-03-03 15:09:08,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:09:08,240 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 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 78 [2025-03-03 15:09:08,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:09:08,369 INFO L225 Difference]: With dead ends: 156418 [2025-03-03 15:09:08,369 INFO L226 Difference]: Without dead ends: 107402 [2025-03-03 15:09:08,403 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:09:08,404 INFO L435 NwaCegarLoop]: 228 mSDtfsCounter, 184 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 362 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:09:08,404 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [184 Valid, 362 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:09:08,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107402 states. [2025-03-03 15:09:09,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107402 to 107020. [2025-03-03 15:09:09,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107020 states, 107019 states have (on average 1.403890897877947) internal successors, (150243), 107019 states have internal predecessors, (150243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:09:09,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107020 states to 107020 states and 150243 transitions. [2025-03-03 15:09:09,879 INFO L78 Accepts]: Start accepts. Automaton has 107020 states and 150243 transitions. Word has length 78 [2025-03-03 15:09:09,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:09:09,879 INFO L471 AbstractCegarLoop]: Abstraction has 107020 states and 150243 transitions. [2025-03-03 15:09:09,879 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:09:09,879 INFO L276 IsEmpty]: Start isEmpty. Operand 107020 states and 150243 transitions. [2025-03-03 15:09:09,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-03-03 15:09:09,885 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:09:09,885 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] [2025-03-03 15:09:09,885 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-03 15:09:09,885 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:09:09,887 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:09:09,887 INFO L85 PathProgramCache]: Analyzing trace with hash 224140727, now seen corresponding path program 1 times [2025-03-03 15:09:09,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:09:09,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411305261] [2025-03-03 15:09:09,887 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:09:09,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:09:09,896 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-03-03 15:09:09,904 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-03-03 15:09:09,904 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:09:09,904 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:09:09,927 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:09:09,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:09:09,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [411305261] [2025-03-03 15:09:09,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [411305261] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:09:09,927 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:09:09,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:09:09,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425746092] [2025-03-03 15:09:09,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:09:09,929 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:09:09,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:09:09,930 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:09:09,930 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:09:09,930 INFO L87 Difference]: Start difference. First operand 107020 states and 150243 transitions. Second operand has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:09:10,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:09:10,358 INFO L93 Difference]: Finished difference Result 209523 states and 294590 transitions. [2025-03-03 15:09:10,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:09:10,359 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 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 81 [2025-03-03 15:09:10,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:09:10,523 INFO L225 Difference]: With dead ends: 209523 [2025-03-03 15:09:10,523 INFO L226 Difference]: Without dead ends: 142941 [2025-03-03 15:09:10,601 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:09:10,601 INFO L435 NwaCegarLoop]: 231 mSDtfsCounter, 171 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 360 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:09:10,601 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 360 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:09:10,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142941 states. [2025-03-03 15:09:12,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142941 to 91634. [2025-03-03 15:09:12,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91634 states, 91633 states have (on average 1.4082044678227277) internal successors, (129038), 91633 states have internal predecessors, (129038), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:09:12,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91634 states to 91634 states and 129038 transitions. [2025-03-03 15:09:12,397 INFO L78 Accepts]: Start accepts. Automaton has 91634 states and 129038 transitions. Word has length 81 [2025-03-03 15:09:12,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:09:12,397 INFO L471 AbstractCegarLoop]: Abstraction has 91634 states and 129038 transitions. [2025-03-03 15:09:12,397 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:09:12,397 INFO L276 IsEmpty]: Start isEmpty. Operand 91634 states and 129038 transitions. [2025-03-03 15:09:12,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-03-03 15:09:12,403 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:09:12,403 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:09:12,403 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-03-03 15:09:12,403 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:09:12,403 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:09:12,403 INFO L85 PathProgramCache]: Analyzing trace with hash 310655262, now seen corresponding path program 1 times [2025-03-03 15:09:12,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:09:12,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [383759994] [2025-03-03 15:09:12,403 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:09:12,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:09:12,412 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-03-03 15:09:12,416 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-03-03 15:09:12,416 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:09:12,416 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:09:12,438 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:09:12,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:09:12,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [383759994] [2025-03-03 15:09:12,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [383759994] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:09:12,438 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:09:12,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:09:12,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [235300965] [2025-03-03 15:09:12,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:09:12,439 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:09:12,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:09:12,439 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:09:12,439 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:09:12,439 INFO L87 Difference]: Start difference. First operand 91634 states and 129038 transitions. Second operand has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:09:12,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:09:12,724 INFO L93 Difference]: Finished difference Result 134823 states and 189389 transitions. [2025-03-03 15:09:12,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:09:12,727 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 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 81 [2025-03-03 15:09:12,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:09:12,830 INFO L225 Difference]: With dead ends: 134823 [2025-03-03 15:09:12,831 INFO L226 Difference]: Without dead ends: 80987 [2025-03-03 15:09:12,877 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:09:12,878 INFO L435 NwaCegarLoop]: 374 mSDtfsCounter, 147 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 578 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:09:12,878 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 578 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:09:12,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80987 states. [2025-03-03 15:09:13,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80987 to 80985. [2025-03-03 15:09:13,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80985 states, 80984 states have (on average 1.3926454608317693) internal successors, (112782), 80984 states have internal predecessors, (112782), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:09:14,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80985 states to 80985 states and 112782 transitions. [2025-03-03 15:09:14,285 INFO L78 Accepts]: Start accepts. Automaton has 80985 states and 112782 transitions. Word has length 81 [2025-03-03 15:09:14,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:09:14,285 INFO L471 AbstractCegarLoop]: Abstraction has 80985 states and 112782 transitions. [2025-03-03 15:09:14,285 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:09:14,285 INFO L276 IsEmpty]: Start isEmpty. Operand 80985 states and 112782 transitions. [2025-03-03 15:09:14,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-03-03 15:09:14,290 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:09:14,290 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] [2025-03-03 15:09:14,290 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-03-03 15:09:14,290 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:09:14,291 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:09:14,291 INFO L85 PathProgramCache]: Analyzing trace with hash -1935995021, now seen corresponding path program 1 times [2025-03-03 15:09:14,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:09:14,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2085352022] [2025-03-03 15:09:14,291 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:09:14,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:09:14,302 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-03-03 15:09:14,305 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-03-03 15:09:14,306 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:09:14,306 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:09:14,326 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:09:14,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:09:14,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2085352022] [2025-03-03 15:09:14,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2085352022] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:09:14,327 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:09:14,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:09:14,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1080753537] [2025-03-03 15:09:14,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:09:14,327 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:09:14,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:09:14,327 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:09:14,327 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:09:14,328 INFO L87 Difference]: Start difference. First operand 80985 states and 112782 transitions. Second operand has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:09:14,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:09:14,655 INFO L93 Difference]: Finished difference Result 159900 states and 222917 transitions. [2025-03-03 15:09:14,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:09:14,655 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 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 82 [2025-03-03 15:09:14,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:09:14,770 INFO L225 Difference]: With dead ends: 159900 [2025-03-03 15:09:14,770 INFO L226 Difference]: Without dead ends: 112055 [2025-03-03 15:09:14,818 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:09:14,819 INFO L435 NwaCegarLoop]: 224 mSDtfsCounter, 180 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 180 SdHoareTripleChecker+Valid, 364 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:09:14,819 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [180 Valid, 364 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:09:14,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112055 states. [2025-03-03 15:09:16,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112055 to 78919. [2025-03-03 15:09:16,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78919 states, 78918 states have (on average 1.390861400440964) internal successors, (109764), 78918 states have internal predecessors, (109764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:09:16,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78919 states to 78919 states and 109764 transitions. [2025-03-03 15:09:16,257 INFO L78 Accepts]: Start accepts. Automaton has 78919 states and 109764 transitions. Word has length 82 [2025-03-03 15:09:16,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:09:16,257 INFO L471 AbstractCegarLoop]: Abstraction has 78919 states and 109764 transitions. [2025-03-03 15:09:16,257 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:09:16,257 INFO L276 IsEmpty]: Start isEmpty. Operand 78919 states and 109764 transitions. [2025-03-03 15:09:16,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-03-03 15:09:16,262 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:09:16,263 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] [2025-03-03 15:09:16,263 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-03-03 15:09:16,263 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:09:16,263 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:09:16,263 INFO L85 PathProgramCache]: Analyzing trace with hash -327572470, now seen corresponding path program 1 times [2025-03-03 15:09:16,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:09:16,263 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171611523] [2025-03-03 15:09:16,263 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:09:16,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:09:16,273 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-03-03 15:09:16,289 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-03-03 15:09:16,289 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:09:16,289 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:09:16,867 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:09:16,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:09:16,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1171611523] [2025-03-03 15:09:16,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1171611523] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:09:16,867 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:09:16,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-03 15:09:16,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1633393187] [2025-03-03 15:09:16,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:09:16,868 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-03 15:09:16,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:09:16,868 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-03 15:09:16,868 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2025-03-03 15:09:16,868 INFO L87 Difference]: Start difference. First operand 78919 states and 109764 transitions. Second operand has 13 states, 13 states have (on average 6.3076923076923075) internal successors, (82), 13 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:09:17,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:09:17,722 INFO L93 Difference]: Finished difference Result 143430 states and 198908 transitions. [2025-03-03 15:09:17,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-03 15:09:17,722 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 6.3076923076923075) internal successors, (82), 13 states have internal predecessors, (82), 0 states have call successors, (0), 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 82 [2025-03-03 15:09:17,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:09:17,905 INFO L225 Difference]: With dead ends: 143430 [2025-03-03 15:09:17,905 INFO L226 Difference]: Without dead ends: 132227 [2025-03-03 15:09:17,956 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=166, Invalid=434, Unknown=0, NotChecked=0, Total=600 [2025-03-03 15:09:17,956 INFO L435 NwaCegarLoop]: 244 mSDtfsCounter, 1843 mSDsluCounter, 1707 mSDsCounter, 0 mSdLazyCounter, 427 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1843 SdHoareTripleChecker+Valid, 1951 SdHoareTripleChecker+Invalid, 434 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 427 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 15:09:17,956 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1843 Valid, 1951 Invalid, 434 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 427 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 15:09:18,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132227 states. [2025-03-03 15:09:19,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132227 to 77822. [2025-03-03 15:09:19,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77822 states, 77821 states have (on average 1.3915138587270788) internal successors, (108289), 77821 states have internal predecessors, (108289), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:09:19,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77822 states to 77822 states and 108289 transitions. [2025-03-03 15:09:19,485 INFO L78 Accepts]: Start accepts. Automaton has 77822 states and 108289 transitions. Word has length 82 [2025-03-03 15:09:19,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:09:19,485 INFO L471 AbstractCegarLoop]: Abstraction has 77822 states and 108289 transitions. [2025-03-03 15:09:19,485 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.3076923076923075) internal successors, (82), 13 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:09:19,485 INFO L276 IsEmpty]: Start isEmpty. Operand 77822 states and 108289 transitions. [2025-03-03 15:09:19,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-03-03 15:09:19,495 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:09:19,495 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-03 15:09:19,495 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-03-03 15:09:19,495 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:09:19,496 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:09:19,496 INFO L85 PathProgramCache]: Analyzing trace with hash -822194964, now seen corresponding path program 1 times [2025-03-03 15:09:19,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:09:19,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [641781091] [2025-03-03 15:09:19,496 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:09:19,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:09:19,505 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-03-03 15:09:19,511 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-03-03 15:09:19,511 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:09:19,511 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:09:19,548 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:09:19,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:09:19,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [641781091] [2025-03-03 15:09:19,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [641781091] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:09:19,548 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:09:19,548 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:09:19,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336714424] [2025-03-03 15:09:19,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:09:19,548 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:09:19,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:09:19,549 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:09:19,549 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:09:19,549 INFO L87 Difference]: Start difference. First operand 77822 states and 108289 transitions. Second operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:09:19,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:09:19,904 INFO L93 Difference]: Finished difference Result 177131 states and 247655 transitions. [2025-03-03 15:09:19,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:09:19,904 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 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 91 [2025-03-03 15:09:19,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:09:20,070 INFO L225 Difference]: With dead ends: 177131 [2025-03-03 15:09:20,070 INFO L226 Difference]: Without dead ends: 125064 [2025-03-03 15:09:20,133 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:09:20,134 INFO L435 NwaCegarLoop]: 311 mSDtfsCounter, 125 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 497 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:09:20,134 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 497 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:09:20,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125064 states.