./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.3.1.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.3.1.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 43a630ae12d5f6fa3f8faf425527884a616bada52a1fbcc4f1f28adcf4c6e228 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 15:05:22,118 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 15:05:22,176 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 15:05:22,179 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 15:05:22,181 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 15:05:22,197 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 15:05:22,199 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 15:05:22,199 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 15:05:22,199 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 15:05:22,199 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 15:05:22,200 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 15:05:22,200 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 15:05:22,200 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 15:05:22,200 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 15:05:22,200 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 15:05:22,201 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 15:05:22,201 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 15:05:22,201 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 15:05:22,201 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 15:05:22,202 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 15:05:22,202 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 15:05:22,202 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 15:05:22,202 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 15:05:22,202 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 15:05:22,202 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 15:05:22,202 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 15:05:22,202 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 15:05:22,202 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 15:05:22,202 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 15:05:22,202 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 15:05:22,202 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 15:05:22,202 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 15:05:22,203 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 15:05:22,203 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 15:05:22,203 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 15:05:22,203 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 15:05:22,203 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 15:05:22,203 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 15:05:22,203 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 15:05:22,203 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 15:05:22,203 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 15:05:22,204 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 15:05:22,204 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 15:05:22,204 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 -> 43a630ae12d5f6fa3f8faf425527884a616bada52a1fbcc4f1f28adcf4c6e228 [2025-03-03 15:05:22,428 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 15:05:22,437 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 15:05:22,439 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 15:05:22,441 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 15:05:22,441 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 15:05:22,442 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.3.1.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2025-03-03 15:05:23,633 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bc1135164/2564d65f61f34bd39cf5ab1ca61b71d7/FLAGf13305dc1 [2025-03-03 15:05:23,849 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 15:05:23,849 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.3.1.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2025-03-03 15:05:23,857 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bc1135164/2564d65f61f34bd39cf5ab1ca61b71d7/FLAGf13305dc1 [2025-03-03 15:05:23,867 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bc1135164/2564d65f61f34bd39cf5ab1ca61b71d7 [2025-03-03 15:05:23,868 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 15:05:23,869 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 15:05:23,870 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 15:05:23,870 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 15:05:23,873 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 15:05:23,873 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 03:05:23" (1/1) ... [2025-03-03 15:05:23,874 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@30c0d2b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:05:23, skipping insertion in model container [2025-03-03 15:05:23,874 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 03:05:23" (1/1) ... [2025-03-03 15:05:23,895 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 15:05:24,030 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.3.1.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c[7165,7178] [2025-03-03 15:05:24,059 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 15:05:24,069 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 15:05:24,111 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.3.1.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c[7165,7178] [2025-03-03 15:05:24,137 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 15:05:24,149 INFO L204 MainTranslator]: Completed translation [2025-03-03 15:05:24,150 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:05:24 WrapperNode [2025-03-03 15:05:24,150 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 15:05:24,151 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 15:05:24,151 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 15:05:24,151 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 15:05:24,156 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:05:24" (1/1) ... [2025-03-03 15:05:24,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:05:24" (1/1) ... [2025-03-03 15:05:24,205 INFO L138 Inliner]: procedures = 23, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 647 [2025-03-03 15:05:24,209 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 15:05:24,209 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 15:05:24,209 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 15:05:24,209 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 15:05:24,219 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:05:24" (1/1) ... [2025-03-03 15:05:24,219 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:05:24" (1/1) ... [2025-03-03 15:05:24,226 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:05:24" (1/1) ... [2025-03-03 15:05:24,237 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:05:24,238 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:05:24" (1/1) ... [2025-03-03 15:05:24,238 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:05:24" (1/1) ... [2025-03-03 15:05:24,244 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:05:24" (1/1) ... [2025-03-03 15:05:24,245 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:05:24" (1/1) ... [2025-03-03 15:05:24,246 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:05:24" (1/1) ... [2025-03-03 15:05:24,247 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:05:24" (1/1) ... [2025-03-03 15:05:24,249 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 15:05:24,253 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 15:05:24,253 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 15:05:24,253 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 15:05:24,254 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:05:24" (1/1) ... [2025-03-03 15:05:24,262 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 15:05:24,272 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 15:05:24,284 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:05:24,289 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:05:24,305 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 15:05:24,305 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 15:05:24,305 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 15:05:24,305 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 15:05:24,391 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 15:05:24,393 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 15:05:24,902 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L482: havoc main_~node1____CPAchecker_TMP_1~0#1; [2025-03-03 15:05:24,902 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L979: havoc main_~node2____CPAchecker_TMP_1~1#1; [2025-03-03 15:05:24,903 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L649: havoc main_~node2____CPAchecker_TMP_0~1#1; [2025-03-03 15:05:24,903 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L154: havoc main_~node2__m2~0#1;havoc main_~node1____CPAchecker_TMP_0~0#1; [2025-03-03 15:05:24,903 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L454: havoc main_~node1____CPAchecker_TMP_0~1#1; [2025-03-03 15:05:24,903 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L306: 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_~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_~node3____CPAchecker_TMP_0~0#1; [2025-03-03 15:05:24,903 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L769: havoc main_~node1____CPAchecker_TMP_1~1#1; [2025-03-03 15:05:24,903 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L175: havoc main_~node3__m3~0#1;havoc main_~node2____CPAchecker_TMP_0~0#1; [2025-03-03 15:05:24,903 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L935: havoc main_~node3____CPAchecker_TMP_1~1#1; [2025-03-03 15:05:24,903 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L591: havoc main_~node3____CPAchecker_TMP_1~0#1; [2025-03-03 15:05:24,903 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L741: havoc main_~node1____CPAchecker_TMP_0~2#1; [2025-03-03 15:05:24,903 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1023: havoc main_~node1____CPAchecker_TMP_1~2#1; [2025-03-03 15:05:24,903 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L396: havoc main_~node1__m1~3#1;havoc main_~__tmp_3~0#1, main_~assert__arg~2#1;havoc main_~check__tmp~2#1; [2025-03-03 15:05:24,903 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L330: havoc main_~node2__m2~2#1; [2025-03-03 15:05:24,903 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L677: havoc main_~node2____CPAchecker_TMP_1~0#1; [2025-03-03 15:05:24,903 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L133: havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2025-03-03 15:05:24,903 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L348: havoc main_~node3__m3~2#1; [2025-03-03 15:05:24,903 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L563: havoc main_~node3____CPAchecker_TMP_0~1#1; [2025-03-03 15:05:24,929 INFO L? ?]: Removed 81 outVars from TransFormulas that were not future-live. [2025-03-03 15:05:24,930 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 15:05:24,940 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 15:05:24,942 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 15:05:24,942 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 03:05:24 BoogieIcfgContainer [2025-03-03 15:05:24,942 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 15:05:24,944 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 15:05:24,944 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 15:05:24,947 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 15:05:24,947 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 03:05:23" (1/3) ... [2025-03-03 15:05:24,948 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70bff78e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 03:05:24, skipping insertion in model container [2025-03-03 15:05:24,948 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:05:24" (2/3) ... [2025-03-03 15:05:24,948 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70bff78e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 03:05:24, skipping insertion in model container [2025-03-03 15:05:24,948 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 03:05:24" (3/3) ... [2025-03-03 15:05:24,949 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.3.1.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2025-03-03 15:05:24,958 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 15:05:24,959 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_lcr-var-start-time.3.1.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c that has 1 procedures, 161 locations, 1 initial locations, 0 loop locations, and 1 error locations. [2025-03-03 15:05:24,998 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 15:05:25,007 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;@3e741505, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 15:05:25,007 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 15:05:25,011 INFO L276 IsEmpty]: Start isEmpty. Operand has 161 states, 159 states have (on average 1.7044025157232705) internal successors, (271), 160 states have internal predecessors, (271), 0 states have call successors, (0), 0 states 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:05:25,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-03-03 15:05:25,017 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:05:25,018 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] [2025-03-03 15:05:25,018 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:05:25,022 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:05:25,022 INFO L85 PathProgramCache]: Analyzing trace with hash 169172669, now seen corresponding path program 1 times [2025-03-03 15:05:25,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:05:25,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710754050] [2025-03-03 15:05:25,028 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:05:25,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:05:25,103 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-03 15:05:25,171 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-03 15:05:25,172 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:05:25,172 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:05:25,423 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:05:25,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:05:25,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1710754050] [2025-03-03 15:05:25,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1710754050] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:05:25,424 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:05:25,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 15:05:25,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584585803] [2025-03-03 15:05:25,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:05:25,427 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:05:25,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:05:25,439 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:05:25,439 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:05:25,441 INFO L87 Difference]: Start difference. First operand has 161 states, 159 states have (on average 1.7044025157232705) internal successors, (271), 160 states have internal predecessors, (271), 0 states have call successors, (0), 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 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 0 states have call successors, (0), 0 states 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:05:25,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:05:25,582 INFO L93 Difference]: Finished difference Result 516 states and 834 transitions. [2025-03-03 15:05:25,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 15:05:25,584 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 0 states have call successors, (0), 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 49 [2025-03-03 15:05:25,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:05:25,591 INFO L225 Difference]: With dead ends: 516 [2025-03-03 15:05:25,591 INFO L226 Difference]: Without dead ends: 437 [2025-03-03 15:05:25,593 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 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:05:25,594 INFO L435 NwaCegarLoop]: 376 mSDtfsCounter, 908 mSDsluCounter, 910 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 908 SdHoareTripleChecker+Valid, 1286 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:05:25,595 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [908 Valid, 1286 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 15:05:25,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 437 states. [2025-03-03 15:05:25,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 437 to 255. [2025-03-03 15:05:25,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 255 states, 254 states have (on average 1.515748031496063) internal successors, (385), 254 states have internal predecessors, (385), 0 states have call successors, (0), 0 states 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:05:25,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 385 transitions. [2025-03-03 15:05:25,640 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 385 transitions. Word has length 49 [2025-03-03 15:05:25,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:05:25,641 INFO L471 AbstractCegarLoop]: Abstraction has 255 states and 385 transitions. [2025-03-03 15:05:25,641 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 0 states have call successors, (0), 0 states 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:05:25,641 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 385 transitions. [2025-03-03 15:05:25,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-03-03 15:05:25,642 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:05:25,642 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:05:25,642 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 15:05:25,642 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:05:25,642 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:05:25,642 INFO L85 PathProgramCache]: Analyzing trace with hash -631698242, now seen corresponding path program 1 times [2025-03-03 15:05:25,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:05:25,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1964945156] [2025-03-03 15:05:25,643 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:05:25,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:05:25,659 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-03 15:05:25,675 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-03 15:05:25,678 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:05:25,679 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:05:25,723 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:05:25,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:05:25,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1964945156] [2025-03-03 15:05:25,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1964945156] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:05:25,725 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:05:25,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:05:25,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111401370] [2025-03-03 15:05:25,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:05:25,726 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:05:25,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:05:25,727 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:05:25,727 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:05:25,727 INFO L87 Difference]: Start difference. First operand 255 states and 385 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states 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:05:25,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:05:25,757 INFO L93 Difference]: Finished difference Result 627 states and 965 transitions. [2025-03-03 15:05:25,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:05:25,758 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 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 52 [2025-03-03 15:05:25,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:05:25,761 INFO L225 Difference]: With dead ends: 627 [2025-03-03 15:05:25,761 INFO L226 Difference]: Without dead ends: 429 [2025-03-03 15:05:25,762 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:05:25,762 INFO L435 NwaCegarLoop]: 227 mSDtfsCounter, 160 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 422 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:05:25,763 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 422 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:05:25,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 429 states. [2025-03-03 15:05:25,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 429 to 427. [2025-03-03 15:05:25,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 427 states, 426 states have (on average 1.5046948356807512) internal successors, (641), 426 states have internal predecessors, (641), 0 states have call successors, (0), 0 states 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:05:25,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 427 states and 641 transitions. [2025-03-03 15:05:25,781 INFO L78 Accepts]: Start accepts. Automaton has 427 states and 641 transitions. Word has length 52 [2025-03-03 15:05:25,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:05:25,781 INFO L471 AbstractCegarLoop]: Abstraction has 427 states and 641 transitions. [2025-03-03 15:05:25,781 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states 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:05:25,781 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 641 transitions. [2025-03-03 15:05:25,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-03-03 15:05:25,782 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:05:25,782 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] [2025-03-03 15:05:25,783 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 15:05:25,783 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:05:25,783 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:05:25,783 INFO L85 PathProgramCache]: Analyzing trace with hash 561756701, now seen corresponding path program 1 times [2025-03-03 15:05:25,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:05:25,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696005343] [2025-03-03 15:05:25,783 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:05:25,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:05:25,797 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-03 15:05:25,810 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-03 15:05:25,812 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:05:25,812 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:05:25,861 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:05:25,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:05:25,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1696005343] [2025-03-03 15:05:25,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1696005343] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:05:25,862 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:05:25,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:05:25,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [839272388] [2025-03-03 15:05:25,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:05:25,862 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:05:25,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:05:25,863 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:05:25,863 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:05:25,863 INFO L87 Difference]: Start difference. First operand 427 states and 641 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states 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:05:25,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:05:25,889 INFO L93 Difference]: Finished difference Result 1077 states and 1638 transitions. [2025-03-03 15:05:25,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:05:25,889 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 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 52 [2025-03-03 15:05:25,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:05:25,892 INFO L225 Difference]: With dead ends: 1077 [2025-03-03 15:05:25,892 INFO L226 Difference]: Without dead ends: 749 [2025-03-03 15:05:25,894 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:05:25,895 INFO L435 NwaCegarLoop]: 229 mSDtfsCounter, 159 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 436 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:05:25,896 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 436 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:05:25,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 749 states. [2025-03-03 15:05:25,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 749 to 747. [2025-03-03 15:05:25,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 747 states, 746 states have (on average 1.4946380697050938) internal successors, (1115), 746 states have internal predecessors, (1115), 0 states have call successors, (0), 0 states 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:05:25,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 747 states to 747 states and 1115 transitions. [2025-03-03 15:05:25,912 INFO L78 Accepts]: Start accepts. Automaton has 747 states and 1115 transitions. Word has length 52 [2025-03-03 15:05:25,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:05:25,913 INFO L471 AbstractCegarLoop]: Abstraction has 747 states and 1115 transitions. [2025-03-03 15:05:25,913 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states 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:05:25,913 INFO L276 IsEmpty]: Start isEmpty. Operand 747 states and 1115 transitions. [2025-03-03 15:05:25,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-03-03 15:05:25,917 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:05:25,917 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] [2025-03-03 15:05:25,917 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 15:05:25,917 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:05:25,917 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:05:25,917 INFO L85 PathProgramCache]: Analyzing trace with hash 1798054174, now seen corresponding path program 1 times [2025-03-03 15:05:25,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:05:25,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1232933685] [2025-03-03 15:05:25,918 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:05:25,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:05:25,931 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-03 15:05:25,939 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-03 15:05:25,940 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:05:25,940 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:05:25,989 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:05:25,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:05:25,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1232933685] [2025-03-03 15:05:25,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1232933685] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:05:25,990 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:05:25,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:05:25,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984135268] [2025-03-03 15:05:25,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:05:25,990 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:05:25,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:05:25,990 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:05:25,991 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:05:25,991 INFO L87 Difference]: Start difference. First operand 747 states and 1115 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states 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:05:26,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:05:26,019 INFO L93 Difference]: Finished difference Result 1857 states and 2792 transitions. [2025-03-03 15:05:26,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:05:26,020 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 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 52 [2025-03-03 15:05:26,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:05:26,024 INFO L225 Difference]: With dead ends: 1857 [2025-03-03 15:05:26,024 INFO L226 Difference]: Without dead ends: 1293 [2025-03-03 15:05:26,025 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:05:26,027 INFO L435 NwaCegarLoop]: 229 mSDtfsCounter, 146 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 436 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:05:26,028 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 436 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:05:26,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1293 states. [2025-03-03 15:05:26,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1293 to 1291. [2025-03-03 15:05:26,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1291 states, 1290 states have (on average 1.4751937984496124) internal successors, (1903), 1290 states have internal predecessors, (1903), 0 states have call successors, (0), 0 states 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:05:26,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1291 states to 1291 states and 1903 transitions. [2025-03-03 15:05:26,056 INFO L78 Accepts]: Start accepts. Automaton has 1291 states and 1903 transitions. Word has length 52 [2025-03-03 15:05:26,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:05:26,056 INFO L471 AbstractCegarLoop]: Abstraction has 1291 states and 1903 transitions. [2025-03-03 15:05:26,057 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states 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:05:26,057 INFO L276 IsEmpty]: Start isEmpty. Operand 1291 states and 1903 transitions. [2025-03-03 15:05:26,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-03-03 15:05:26,060 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:05:26,060 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] [2025-03-03 15:05:26,060 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 15:05:26,060 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:05:26,060 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:05:26,060 INFO L85 PathProgramCache]: Analyzing trace with hash 1950817686, now seen corresponding path program 1 times [2025-03-03 15:05:26,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:05:26,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1509040583] [2025-03-03 15:05:26,060 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:05:26,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:05:26,073 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-03-03 15:05:26,083 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-03-03 15:05:26,084 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:05:26,084 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:05:26,164 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:05:26,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:05:26,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1509040583] [2025-03-03 15:05:26,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1509040583] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:05:26,164 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:05:26,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 15:05:26,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2028522085] [2025-03-03 15:05:26,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:05:26,165 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:05:26,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:05:26,165 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:05:26,165 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:05:26,165 INFO L87 Difference]: Start difference. First operand 1291 states and 1903 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 0 states have call successors, (0), 0 states 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:05:26,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:05:26,250 INFO L93 Difference]: Finished difference Result 2511 states and 3768 transitions. [2025-03-03 15:05:26,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 15:05:26,250 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 0 states have call successors, (0), 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 53 [2025-03-03 15:05:26,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:05:26,258 INFO L225 Difference]: With dead ends: 2511 [2025-03-03 15:05:26,258 INFO L226 Difference]: Without dead ends: 2145 [2025-03-03 15:05:26,259 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-03 15:05:26,260 INFO L435 NwaCegarLoop]: 411 mSDtfsCounter, 639 mSDsluCounter, 553 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 639 SdHoareTripleChecker+Valid, 964 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:05:26,260 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [639 Valid, 964 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:05:26,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2145 states. [2025-03-03 15:05:26,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2145 to 1740. [2025-03-03 15:05:26,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1740 states, 1739 states have (on average 1.4836112708453133) internal successors, (2580), 1739 states have internal predecessors, (2580), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:05:26,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1740 states to 1740 states and 2580 transitions. [2025-03-03 15:05:26,297 INFO L78 Accepts]: Start accepts. Automaton has 1740 states and 2580 transitions. Word has length 53 [2025-03-03 15:05:26,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:05:26,299 INFO L471 AbstractCegarLoop]: Abstraction has 1740 states and 2580 transitions. [2025-03-03 15:05:26,299 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 0 states have call successors, (0), 0 states 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:05:26,299 INFO L276 IsEmpty]: Start isEmpty. Operand 1740 states and 2580 transitions. [2025-03-03 15:05:26,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-03-03 15:05:26,300 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:05:26,300 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] [2025-03-03 15:05:26,300 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 15:05:26,300 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:05:26,301 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:05:26,301 INFO L85 PathProgramCache]: Analyzing trace with hash 1013738654, now seen corresponding path program 1 times [2025-03-03 15:05:26,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:05:26,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [791057247] [2025-03-03 15:05:26,301 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:05:26,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:05:26,313 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-03-03 15:05:26,319 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-03-03 15:05:26,319 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:05:26,319 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:05:26,392 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:05:26,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:05:26,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [791057247] [2025-03-03 15:05:26,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [791057247] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:05:26,393 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:05:26,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 15:05:26,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1921211333] [2025-03-03 15:05:26,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:05:26,393 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:05:26,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:05:26,393 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:05:26,393 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:05:26,393 INFO L87 Difference]: Start difference. First operand 1740 states and 2580 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 0 states have call successors, (0), 0 states 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:05:26,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:05:26,467 INFO L93 Difference]: Finished difference Result 2960 states and 4445 transitions. [2025-03-03 15:05:26,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 15:05:26,468 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 0 states have call successors, (0), 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 53 [2025-03-03 15:05:26,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:05:26,476 INFO L225 Difference]: With dead ends: 2960 [2025-03-03 15:05:26,476 INFO L226 Difference]: Without dead ends: 2594 [2025-03-03 15:05:26,477 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-03 15:05:26,478 INFO L435 NwaCegarLoop]: 392 mSDtfsCounter, 636 mSDsluCounter, 604 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 636 SdHoareTripleChecker+Valid, 996 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:05:26,478 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [636 Valid, 996 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:05:26,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2594 states. [2025-03-03 15:05:26,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2594 to 2075. [2025-03-03 15:05:26,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2075 states, 2074 states have (on average 1.488910318225651) internal successors, (3088), 2074 states have internal predecessors, (3088), 0 states have call successors, (0), 0 states 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:05:26,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2075 states to 2075 states and 3088 transitions. [2025-03-03 15:05:26,519 INFO L78 Accepts]: Start accepts. Automaton has 2075 states and 3088 transitions. Word has length 53 [2025-03-03 15:05:26,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:05:26,520 INFO L471 AbstractCegarLoop]: Abstraction has 2075 states and 3088 transitions. [2025-03-03 15:05:26,520 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 0 states have call successors, (0), 0 states 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:05:26,520 INFO L276 IsEmpty]: Start isEmpty. Operand 2075 states and 3088 transitions. [2025-03-03 15:05:26,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-03-03 15:05:26,522 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:05:26,522 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] [2025-03-03 15:05:26,523 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 15:05:26,523 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:05:26,523 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:05:26,523 INFO L85 PathProgramCache]: Analyzing trace with hash -804633783, now seen corresponding path program 1 times [2025-03-03 15:05:26,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:05:26,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053329417] [2025-03-03 15:05:26,524 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:05:26,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:05:26,533 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-03-03 15:05:26,540 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-03-03 15:05:26,540 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:05:26,540 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:05:26,622 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:05:26,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:05:26,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1053329417] [2025-03-03 15:05:26,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1053329417] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:05:26,623 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:05:26,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 15:05:26,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1642687597] [2025-03-03 15:05:26,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:05:26,623 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:05:26,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:05:26,623 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:05:26,623 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:05:26,623 INFO L87 Difference]: Start difference. First operand 2075 states and 3088 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 0 states have call successors, (0), 0 states 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:05:26,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:05:26,694 INFO L93 Difference]: Finished difference Result 3359 states and 5045 transitions. [2025-03-03 15:05:26,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 15:05:26,694 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 0 states have call successors, (0), 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 53 [2025-03-03 15:05:26,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:05:26,702 INFO L225 Difference]: With dead ends: 3359 [2025-03-03 15:05:26,702 INFO L226 Difference]: Without dead ends: 2993 [2025-03-03 15:05:26,703 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-03 15:05:26,704 INFO L435 NwaCegarLoop]: 439 mSDtfsCounter, 630 mSDsluCounter, 630 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 630 SdHoareTripleChecker+Valid, 1069 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:05:26,704 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [630 Valid, 1069 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:05:26,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2993 states. [2025-03-03 15:05:26,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2993 to 2375. [2025-03-03 15:05:26,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2375 states, 2374 states have (on average 1.4928390901432183) internal successors, (3544), 2374 states have internal predecessors, (3544), 0 states have call successors, (0), 0 states 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:05:26,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2375 states to 2375 states and 3544 transitions. [2025-03-03 15:05:26,748 INFO L78 Accepts]: Start accepts. Automaton has 2375 states and 3544 transitions. Word has length 53 [2025-03-03 15:05:26,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:05:26,748 INFO L471 AbstractCegarLoop]: Abstraction has 2375 states and 3544 transitions. [2025-03-03 15:05:26,748 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 0 states have call successors, (0), 0 states 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:05:26,748 INFO L276 IsEmpty]: Start isEmpty. Operand 2375 states and 3544 transitions. [2025-03-03 15:05:26,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-03-03 15:05:26,749 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:05:26,749 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] [2025-03-03 15:05:26,750 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 15:05:26,750 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:05:26,750 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:05:26,750 INFO L85 PathProgramCache]: Analyzing trace with hash 142479573, now seen corresponding path program 1 times [2025-03-03 15:05:26,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:05:26,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756560064] [2025-03-03 15:05:26,750 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:05:26,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:05:26,761 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-03 15:05:26,775 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-03 15:05:26,776 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:05:26,776 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:05:26,832 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:05:26,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:05:26,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756560064] [2025-03-03 15:05:26,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1756560064] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:05:26,832 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:05:26,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 15:05:26,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653397032] [2025-03-03 15:05:26,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:05:26,832 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:05:26,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:05:26,833 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:05:26,833 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:05:26,833 INFO L87 Difference]: Start difference. First operand 2375 states and 3544 transitions. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 4 states have internal predecessors, (57), 0 states have call successors, (0), 0 states 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:05:27,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:05:27,054 INFO L93 Difference]: Finished difference Result 6743 states and 10099 transitions. [2025-03-03 15:05:27,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 15:05:27,054 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 4 states have internal predecessors, (57), 0 states have call successors, (0), 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 57 [2025-03-03 15:05:27,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:05:27,067 INFO L225 Difference]: With dead ends: 6743 [2025-03-03 15:05:27,067 INFO L226 Difference]: Without dead ends: 4395 [2025-03-03 15:05:27,070 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:05:27,071 INFO L435 NwaCegarLoop]: 129 mSDtfsCounter, 947 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 947 SdHoareTripleChecker+Valid, 220 SdHoareTripleChecker+Invalid, 189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 15:05:27,071 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [947 Valid, 220 Invalid, 189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 175 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 15:05:27,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4395 states. [2025-03-03 15:05:27,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4395 to 4368. [2025-03-03 15:05:27,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4368 states, 4367 states have (on average 1.4868330661781544) internal successors, (6493), 4367 states have internal predecessors, (6493), 0 states have call successors, (0), 0 states 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:05:27,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4368 states to 4368 states and 6493 transitions. [2025-03-03 15:05:27,136 INFO L78 Accepts]: Start accepts. Automaton has 4368 states and 6493 transitions. Word has length 57 [2025-03-03 15:05:27,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:05:27,137 INFO L471 AbstractCegarLoop]: Abstraction has 4368 states and 6493 transitions. [2025-03-03 15:05:27,137 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 4 states have internal predecessors, (57), 0 states have call successors, (0), 0 states 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:05:27,137 INFO L276 IsEmpty]: Start isEmpty. Operand 4368 states and 6493 transitions. [2025-03-03 15:05:27,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-03-03 15:05:27,139 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:05:27,139 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] [2025-03-03 15:05:27,139 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 15:05:27,139 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:05:27,139 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:05:27,139 INFO L85 PathProgramCache]: Analyzing trace with hash -1993367190, now seen corresponding path program 1 times [2025-03-03 15:05:27,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:05:27,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421954840] [2025-03-03 15:05:27,140 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:05:27,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:05:27,149 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-03 15:05:27,157 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-03 15:05:27,158 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:05:27,158 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:05:27,206 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:05:27,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:05:27,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [421954840] [2025-03-03 15:05:27,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [421954840] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:05:27,206 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:05:27,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 15:05:27,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382261395] [2025-03-03 15:05:27,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:05:27,207 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:05:27,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:05:27,207 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:05:27,207 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:05:27,207 INFO L87 Difference]: Start difference. First operand 4368 states and 6493 transitions. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 4 states have internal predecessors, (57), 0 states have call successors, (0), 0 states 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:05:27,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:05:27,405 INFO L93 Difference]: Finished difference Result 10465 states and 15544 transitions. [2025-03-03 15:05:27,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 15:05:27,405 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 4 states have internal predecessors, (57), 0 states have call successors, (0), 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 57 [2025-03-03 15:05:27,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:05:27,420 INFO L225 Difference]: With dead ends: 10465 [2025-03-03 15:05:27,421 INFO L226 Difference]: Without dead ends: 6142 [2025-03-03 15:05:27,424 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:05:27,424 INFO L435 NwaCegarLoop]: 134 mSDtfsCounter, 898 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 898 SdHoareTripleChecker+Valid, 230 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:05:27,424 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [898 Valid, 230 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 15:05:27,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6142 states. [2025-03-03 15:05:27,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6142 to 6108. [2025-03-03 15:05:27,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6108 states, 6107 states have (on average 1.4735549369575895) internal successors, (8999), 6107 states have internal predecessors, (8999), 0 states have call successors, (0), 0 states 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:05:27,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6108 states to 6108 states and 8999 transitions. [2025-03-03 15:05:27,537 INFO L78 Accepts]: Start accepts. Automaton has 6108 states and 8999 transitions. Word has length 57 [2025-03-03 15:05:27,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:05:27,537 INFO L471 AbstractCegarLoop]: Abstraction has 6108 states and 8999 transitions. [2025-03-03 15:05:27,537 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 4 states have internal predecessors, (57), 0 states have call successors, (0), 0 states 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:05:27,537 INFO L276 IsEmpty]: Start isEmpty. Operand 6108 states and 8999 transitions. [2025-03-03 15:05:27,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-03-03 15:05:27,539 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:05:27,539 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:05:27,540 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 15:05:27,540 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:05:27,540 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:05:27,540 INFO L85 PathProgramCache]: Analyzing trace with hash -93202369, now seen corresponding path program 1 times [2025-03-03 15:05:27,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:05:27,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485034468] [2025-03-03 15:05:27,540 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:05:27,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:05:27,549 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-03 15:05:27,559 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-03 15:05:27,560 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:05:27,560 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:05:27,622 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:05:27,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:05:27,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [485034468] [2025-03-03 15:05:27,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [485034468] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:05:27,622 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:05:27,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 15:05:27,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863609171] [2025-03-03 15:05:27,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:05:27,623 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:05:27,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:05:27,623 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:05:27,623 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:05:27,623 INFO L87 Difference]: Start difference. First operand 6108 states and 8999 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:05:27,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:05:27,817 INFO L93 Difference]: Finished difference Result 14561 states and 21424 transitions. [2025-03-03 15:05:27,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 15:05:27,818 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2025-03-03 15:05:27,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:05:27,848 INFO L225 Difference]: With dead ends: 14561 [2025-03-03 15:05:27,850 INFO L226 Difference]: Without dead ends: 8534 [2025-03-03 15:05:27,856 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:05:27,856 INFO L435 NwaCegarLoop]: 134 mSDtfsCounter, 853 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 853 SdHoareTripleChecker+Valid, 232 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:05:27,856 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [853 Valid, 232 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 15:05:27,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8534 states. [2025-03-03 15:05:27,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8534 to 8486. [2025-03-03 15:05:27,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8486 states, 8485 states have (on average 1.4579846788450206) internal successors, (12371), 8485 states have internal predecessors, (12371), 0 states have call successors, (0), 0 states 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:05:27,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8486 states to 8486 states and 12371 transitions. [2025-03-03 15:05:27,982 INFO L78 Accepts]: Start accepts. Automaton has 8486 states and 12371 transitions. Word has length 58 [2025-03-03 15:05:27,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:05:27,982 INFO L471 AbstractCegarLoop]: Abstraction has 8486 states and 12371 transitions. [2025-03-03 15:05:27,982 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:05:27,983 INFO L276 IsEmpty]: Start isEmpty. Operand 8486 states and 12371 transitions. [2025-03-03 15:05:27,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-03-03 15:05:27,985 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:05:27,985 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] [2025-03-03 15:05:27,986 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 15:05:27,986 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:05:27,986 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:05:27,986 INFO L85 PathProgramCache]: Analyzing trace with hash 920563705, now seen corresponding path program 1 times [2025-03-03 15:05:27,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:05:27,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1060913092] [2025-03-03 15:05:27,986 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:05:27,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:05:27,999 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-03-03 15:05:28,008 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-03-03 15:05:28,008 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:05:28,009 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:05:28,125 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:05:28,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:05:28,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1060913092] [2025-03-03 15:05:28,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1060913092] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:05:28,126 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:05:28,126 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 15:05:28,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959627822] [2025-03-03 15:05:28,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:05:28,126 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 15:05:28,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:05:28,127 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 15:05:28,127 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-03 15:05:28,127 INFO L87 Difference]: Start difference. First operand 8486 states and 12371 transitions. Second operand has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 6 states have internal predecessors, (59), 0 states have call successors, (0), 0 states 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:05:28,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:05:28,424 INFO L93 Difference]: Finished difference Result 22447 states and 32418 transitions. [2025-03-03 15:05:28,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 15:05:28,425 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 6 states have internal predecessors, (59), 0 states have call successors, (0), 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 59 [2025-03-03 15:05:28,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:05:28,457 INFO L225 Difference]: With dead ends: 22447 [2025-03-03 15:05:28,457 INFO L226 Difference]: Without dead ends: 18205 [2025-03-03 15:05:28,468 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:05:28,469 INFO L435 NwaCegarLoop]: 130 mSDtfsCounter, 1299 mSDsluCounter, 248 mSDsCounter, 0 mSdLazyCounter, 278 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1299 SdHoareTripleChecker+Valid, 378 SdHoareTripleChecker+Invalid, 297 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 278 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 15:05:28,469 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1299 Valid, 378 Invalid, 297 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 278 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 15:05:28,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18205 states. [2025-03-03 15:05:28,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18205 to 8596. [2025-03-03 15:05:28,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8596 states, 8595 states have (on average 1.455846422338569) internal successors, (12513), 8595 states have internal predecessors, (12513), 0 states have call successors, (0), 0 states 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:05:28,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8596 states to 8596 states and 12513 transitions. [2025-03-03 15:05:28,684 INFO L78 Accepts]: Start accepts. Automaton has 8596 states and 12513 transitions. Word has length 59 [2025-03-03 15:05:28,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:05:28,684 INFO L471 AbstractCegarLoop]: Abstraction has 8596 states and 12513 transitions. [2025-03-03 15:05:28,684 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 6 states have internal predecessors, (59), 0 states have call successors, (0), 0 states 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:05:28,684 INFO L276 IsEmpty]: Start isEmpty. Operand 8596 states and 12513 transitions. [2025-03-03 15:05:28,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-03-03 15:05:28,688 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:05:28,689 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] [2025-03-03 15:05:28,689 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-03 15:05:28,689 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:05:28,689 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:05:28,689 INFO L85 PathProgramCache]: Analyzing trace with hash 1544172664, now seen corresponding path program 1 times [2025-03-03 15:05:28,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:05:28,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2144165410] [2025-03-03 15:05:28,690 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:05:28,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:05:28,699 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-03-03 15:05:28,710 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-03-03 15:05:28,710 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:05:28,710 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:05:28,813 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:05:28,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:05:28,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2144165410] [2025-03-03 15:05:28,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2144165410] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:05:28,814 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:05:28,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 15:05:28,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1719177939] [2025-03-03 15:05:28,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:05:28,814 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 15:05:28,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:05:28,815 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 15:05:28,815 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-03 15:05:28,815 INFO L87 Difference]: Start difference. First operand 8596 states and 12513 transitions. Second operand has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 6 states have internal predecessors, (59), 0 states have call successors, (0), 0 states 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:05:29,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:05:29,100 INFO L93 Difference]: Finished difference Result 19358 states and 27949 transitions. [2025-03-03 15:05:29,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 15:05:29,101 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 6 states have internal predecessors, (59), 0 states have call successors, (0), 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 59 [2025-03-03 15:05:29,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:05:29,126 INFO L225 Difference]: With dead ends: 19358 [2025-03-03 15:05:29,126 INFO L226 Difference]: Without dead ends: 15028 [2025-03-03 15:05:29,135 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:05:29,136 INFO L435 NwaCegarLoop]: 124 mSDtfsCounter, 1118 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 258 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1118 SdHoareTripleChecker+Valid, 330 SdHoareTripleChecker+Invalid, 276 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 258 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 15:05:29,136 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1118 Valid, 330 Invalid, 276 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 258 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 15:05:29,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15028 states. [2025-03-03 15:05:29,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15028 to 8616. [2025-03-03 15:05:29,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8616 states, 8615 states have (on average 1.4552524666279745) internal successors, (12537), 8615 states have internal predecessors, (12537), 0 states have call successors, (0), 0 states 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:05:29,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8616 states to 8616 states and 12537 transitions. [2025-03-03 15:05:29,341 INFO L78 Accepts]: Start accepts. Automaton has 8616 states and 12537 transitions. Word has length 59 [2025-03-03 15:05:29,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:05:29,341 INFO L471 AbstractCegarLoop]: Abstraction has 8616 states and 12537 transitions. [2025-03-03 15:05:29,342 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 6 states have internal predecessors, (59), 0 states have call successors, (0), 0 states 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:05:29,342 INFO L276 IsEmpty]: Start isEmpty. Operand 8616 states and 12537 transitions. [2025-03-03 15:05:29,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-03-03 15:05:29,346 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:05:29,346 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] [2025-03-03 15:05:29,346 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-03 15:05:29,346 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:05:29,347 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:05:29,347 INFO L85 PathProgramCache]: Analyzing trace with hash -382810438, now seen corresponding path program 1 times [2025-03-03 15:05:29,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:05:29,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693319061] [2025-03-03 15:05:29,347 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:05:29,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:05:29,359 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-03-03 15:05:29,371 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-03-03 15:05:29,372 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:05:29,372 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:05:29,472 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:05:29,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:05:29,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [693319061] [2025-03-03 15:05:29,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [693319061] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:05:29,473 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:05:29,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 15:05:29,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803573645] [2025-03-03 15:05:29,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:05:29,473 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 15:05:29,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:05:29,473 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 15:05:29,473 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-03 15:05:29,474 INFO L87 Difference]: Start difference. First operand 8616 states and 12537 transitions. Second operand has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 6 states have internal predecessors, (59), 0 states have call successors, (0), 0 states 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:05:29,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:05:29,749 INFO L93 Difference]: Finished difference Result 24936 states and 35947 transitions. [2025-03-03 15:05:29,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 15:05:29,749 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 6 states have internal predecessors, (59), 0 states have call successors, (0), 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 59 [2025-03-03 15:05:29,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:05:29,779 INFO L225 Difference]: With dead ends: 24936 [2025-03-03 15:05:29,779 INFO L226 Difference]: Without dead ends: 21838 [2025-03-03 15:05:29,788 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:05:29,788 INFO L435 NwaCegarLoop]: 128 mSDtfsCounter, 1456 mSDsluCounter, 261 mSDsCounter, 0 mSdLazyCounter, 296 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1456 SdHoareTripleChecker+Valid, 389 SdHoareTripleChecker+Invalid, 315 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 296 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 15:05:29,788 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1456 Valid, 389 Invalid, 315 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 296 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 15:05:29,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21838 states. [2025-03-03 15:05:29,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21838 to 8672. [2025-03-03 15:05:29,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8672 states, 8671 states have (on average 1.4538115557605813) internal successors, (12606), 8671 states have internal predecessors, (12606), 0 states have call successors, (0), 0 states 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:05:29,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8672 states to 8672 states and 12606 transitions. [2025-03-03 15:05:29,926 INFO L78 Accepts]: Start accepts. Automaton has 8672 states and 12606 transitions. Word has length 59 [2025-03-03 15:05:29,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:05:29,926 INFO L471 AbstractCegarLoop]: Abstraction has 8672 states and 12606 transitions. [2025-03-03 15:05:29,927 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 6 states have internal predecessors, (59), 0 states have call successors, (0), 0 states 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:05:29,927 INFO L276 IsEmpty]: Start isEmpty. Operand 8672 states and 12606 transitions. [2025-03-03 15:05:29,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-03-03 15:05:29,930 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:05:29,930 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] [2025-03-03 15:05:29,930 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-03 15:05:29,930 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:05:29,931 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:05:29,931 INFO L85 PathProgramCache]: Analyzing trace with hash 2046939638, now seen corresponding path program 1 times [2025-03-03 15:05:29,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:05:29,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1829047787] [2025-03-03 15:05:29,931 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:05:29,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:05:29,940 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-03-03 15:05:29,963 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-03-03 15:05:29,963 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:05:29,963 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:05:30,205 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:05:30,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:05:30,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1829047787] [2025-03-03 15:05:30,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1829047787] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:05:30,206 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:05:30,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-03 15:05:30,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1618751516] [2025-03-03 15:05:30,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:05:30,206 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-03 15:05:30,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:05:30,207 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-03 15:05:30,207 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-03-03 15:05:30,207 INFO L87 Difference]: Start difference. First operand 8672 states and 12606 transitions. Second operand has 10 states, 10 states have (on average 6.1) internal successors, (61), 9 states have internal predecessors, (61), 0 states have call successors, (0), 0 states 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:05:30,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:05:30,724 INFO L93 Difference]: Finished difference Result 20881 states and 30397 transitions. [2025-03-03 15:05:30,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-03 15:05:30,724 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.1) internal successors, (61), 9 states have internal predecessors, (61), 0 states have call successors, (0), 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 61 [2025-03-03 15:05:30,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:05:30,745 INFO L225 Difference]: With dead ends: 20881 [2025-03-03 15:05:30,745 INFO L226 Difference]: Without dead ends: 13728 [2025-03-03 15:05:30,754 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:05:30,754 INFO L435 NwaCegarLoop]: 144 mSDtfsCounter, 1034 mSDsluCounter, 778 mSDsCounter, 0 mSdLazyCounter, 775 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1034 SdHoareTripleChecker+Valid, 922 SdHoareTripleChecker+Invalid, 786 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 775 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 15:05:30,754 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1034 Valid, 922 Invalid, 786 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 775 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 15:05:30,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13728 states. [2025-03-03 15:05:30,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13728 to 8512. [2025-03-03 15:05:30,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8512 states, 8511 states have (on average 1.450945834802021) internal successors, (12349), 8511 states have internal predecessors, (12349), 0 states have call successors, (0), 0 states 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:05:30,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8512 states to 8512 states and 12349 transitions. [2025-03-03 15:05:30,897 INFO L78 Accepts]: Start accepts. Automaton has 8512 states and 12349 transitions. Word has length 61 [2025-03-03 15:05:30,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:05:30,897 INFO L471 AbstractCegarLoop]: Abstraction has 8512 states and 12349 transitions. [2025-03-03 15:05:30,897 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.1) internal successors, (61), 9 states have internal predecessors, (61), 0 states have call successors, (0), 0 states 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:05:30,897 INFO L276 IsEmpty]: Start isEmpty. Operand 8512 states and 12349 transitions. [2025-03-03 15:05:30,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-03-03 15:05:30,900 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:05:30,901 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] [2025-03-03 15:05:30,901 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-03 15:05:30,901 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:05:30,901 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:05:30,901 INFO L85 PathProgramCache]: Analyzing trace with hash -1011730185, now seen corresponding path program 1 times [2025-03-03 15:05:30,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:05:30,901 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128003359] [2025-03-03 15:05:30,902 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:05:30,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:05:30,912 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-03-03 15:05:30,923 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-03-03 15:05:30,923 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:05:30,923 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:05:31,117 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:05:31,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:05:31,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [128003359] [2025-03-03 15:05:31,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [128003359] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:05:31,118 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:05:31,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-03 15:05:31,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739593628] [2025-03-03 15:05:31,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:05:31,118 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-03 15:05:31,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:05:31,118 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-03 15:05:31,119 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-03-03 15:05:31,119 INFO L87 Difference]: Start difference. First operand 8512 states and 12349 transitions. Second operand has 10 states, 10 states have (on average 6.1) internal successors, (61), 9 states have internal predecessors, (61), 0 states have call successors, (0), 0 states 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:05:31,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:05:31,579 INFO L93 Difference]: Finished difference Result 19551 states and 28310 transitions. [2025-03-03 15:05:31,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-03 15:05:31,580 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.1) internal successors, (61), 9 states have internal predecessors, (61), 0 states have call successors, (0), 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 61 [2025-03-03 15:05:31,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:05:31,598 INFO L225 Difference]: With dead ends: 19551 [2025-03-03 15:05:31,599 INFO L226 Difference]: Without dead ends: 12269 [2025-03-03 15:05:31,607 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=111, Invalid=309, Unknown=0, NotChecked=0, Total=420 [2025-03-03 15:05:31,608 INFO L435 NwaCegarLoop]: 140 mSDtfsCounter, 1336 mSDsluCounter, 583 mSDsCounter, 0 mSdLazyCounter, 693 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1336 SdHoareTripleChecker+Valid, 723 SdHoareTripleChecker+Invalid, 710 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 693 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 15:05:31,608 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1336 Valid, 723 Invalid, 710 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 693 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 15:05:31,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12269 states. [2025-03-03 15:05:31,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12269 to 8231. [2025-03-03 15:05:31,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8231 states, 8230 states have (on average 1.4487241798298907) internal successors, (11923), 8230 states have internal predecessors, (11923), 0 states have call successors, (0), 0 states 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:05:31,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8231 states to 8231 states and 11923 transitions. [2025-03-03 15:05:31,763 INFO L78 Accepts]: Start accepts. Automaton has 8231 states and 11923 transitions. Word has length 61 [2025-03-03 15:05:31,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:05:31,763 INFO L471 AbstractCegarLoop]: Abstraction has 8231 states and 11923 transitions. [2025-03-03 15:05:31,763 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.1) internal successors, (61), 9 states have internal predecessors, (61), 0 states have call successors, (0), 0 states 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:05:31,764 INFO L276 IsEmpty]: Start isEmpty. Operand 8231 states and 11923 transitions. [2025-03-03 15:05:31,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-03-03 15:05:31,766 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:05:31,767 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] [2025-03-03 15:05:31,767 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-03 15:05:31,767 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:05:31,767 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:05:31,767 INFO L85 PathProgramCache]: Analyzing trace with hash -534799560, now seen corresponding path program 1 times [2025-03-03 15:05:31,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:05:31,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [409267870] [2025-03-03 15:05:31,768 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:05:31,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:05:31,779 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-03-03 15:05:31,805 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-03-03 15:05:31,805 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:05:31,805 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:05:32,051 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:05:32,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:05:32,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [409267870] [2025-03-03 15:05:32,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [409267870] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:05:32,052 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:05:32,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-03 15:05:32,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451689553] [2025-03-03 15:05:32,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:05:32,053 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-03 15:05:32,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:05:32,054 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-03 15:05:32,054 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-03-03 15:05:32,054 INFO L87 Difference]: Start difference. First operand 8231 states and 11923 transitions. Second operand has 10 states, 10 states have (on average 6.1) internal successors, (61), 9 states have internal predecessors, (61), 0 states have call successors, (0), 0 states 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:05:32,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:05:32,511 INFO L93 Difference]: Finished difference Result 20312 states and 29515 transitions. [2025-03-03 15:05:32,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 15:05:32,511 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.1) internal successors, (61), 9 states have internal predecessors, (61), 0 states have call successors, (0), 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 61 [2025-03-03 15:05:32,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:05:32,529 INFO L225 Difference]: With dead ends: 20312 [2025-03-03 15:05:32,529 INFO L226 Difference]: Without dead ends: 13236 [2025-03-03 15:05:32,537 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:05:32,538 INFO L435 NwaCegarLoop]: 138 mSDtfsCounter, 1237 mSDsluCounter, 609 mSDsCounter, 0 mSdLazyCounter, 587 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1237 SdHoareTripleChecker+Valid, 747 SdHoareTripleChecker+Invalid, 598 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 587 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 15:05:32,538 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1237 Valid, 747 Invalid, 598 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 587 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 15:05:32,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13236 states. [2025-03-03 15:05:32,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13236 to 8082. [2025-03-03 15:05:32,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8082 states, 8081 states have (on average 1.4493255785175103) internal successors, (11712), 8081 states have internal predecessors, (11712), 0 states have call successors, (0), 0 states 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:05:32,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8082 states to 8082 states and 11712 transitions. [2025-03-03 15:05:32,695 INFO L78 Accepts]: Start accepts. Automaton has 8082 states and 11712 transitions. Word has length 61 [2025-03-03 15:05:32,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:05:32,696 INFO L471 AbstractCegarLoop]: Abstraction has 8082 states and 11712 transitions. [2025-03-03 15:05:32,696 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.1) internal successors, (61), 9 states have internal predecessors, (61), 0 states have call successors, (0), 0 states 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:05:32,696 INFO L276 IsEmpty]: Start isEmpty. Operand 8082 states and 11712 transitions. [2025-03-03 15:05:32,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-03-03 15:05:32,698 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:05:32,698 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:05:32,699 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-03 15:05:32,699 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:05:32,699 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:05:32,699 INFO L85 PathProgramCache]: Analyzing trace with hash -50148285, now seen corresponding path program 1 times [2025-03-03 15:05:32,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:05:32,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [689135811] [2025-03-03 15:05:32,699 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:05:32,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:05:32,711 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-03 15:05:32,717 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-03 15:05:32,718 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:05:32,718 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:05:32,741 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:05:32,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:05:32,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [689135811] [2025-03-03 15:05:32,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [689135811] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:05:32,741 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:05:32,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:05:32,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775849085] [2025-03-03 15:05:32,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:05:32,742 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:05:32,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:05:32,743 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:05:32,743 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:05:32,743 INFO L87 Difference]: Start difference. First operand 8082 states and 11712 transitions. Second operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:05:32,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:05:32,776 INFO L93 Difference]: Finished difference Result 11129 states and 16085 transitions. [2025-03-03 15:05:32,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:05:32,776 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2025-03-03 15:05:32,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:05:32,786 INFO L225 Difference]: With dead ends: 11129 [2025-03-03 15:05:32,786 INFO L226 Difference]: Without dead ends: 7899 [2025-03-03 15:05:32,790 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:05:32,791 INFO L435 NwaCegarLoop]: 346 mSDtfsCounter, 152 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 528 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:05:32,791 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 528 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:05:32,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7899 states. [2025-03-03 15:05:32,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7899 to 7897. [2025-03-03 15:05:32,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7897 states, 7896 states have (on average 1.4223657548125632) internal successors, (11231), 7896 states have internal predecessors, (11231), 0 states have call successors, (0), 0 states 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:05:32,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7897 states to 7897 states and 11231 transitions. [2025-03-03 15:05:32,870 INFO L78 Accepts]: Start accepts. Automaton has 7897 states and 11231 transitions. Word has length 62 [2025-03-03 15:05:32,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:05:32,870 INFO L471 AbstractCegarLoop]: Abstraction has 7897 states and 11231 transitions. [2025-03-03 15:05:32,870 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:05:32,870 INFO L276 IsEmpty]: Start isEmpty. Operand 7897 states and 11231 transitions. [2025-03-03 15:05:32,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-03-03 15:05:32,873 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:05:32,873 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:05:32,873 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-03 15:05:32,873 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:05:32,873 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:05:32,873 INFO L85 PathProgramCache]: Analyzing trace with hash 1110438627, now seen corresponding path program 1 times [2025-03-03 15:05:32,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:05:32,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283639892] [2025-03-03 15:05:32,874 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:05:32,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:05:32,881 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-03 15:05:32,887 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-03 15:05:32,887 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:05:32,887 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:05:32,913 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:05:32,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:05:32,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [283639892] [2025-03-03 15:05:32,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [283639892] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:05:32,913 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:05:32,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:05:32,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88715373] [2025-03-03 15:05:32,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:05:32,914 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:05:32,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:05:32,914 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:05:32,914 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:05:32,914 INFO L87 Difference]: Start difference. First operand 7897 states and 11231 transitions. Second operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:05:32,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:05:32,945 INFO L93 Difference]: Finished difference Result 11320 states and 16101 transitions. [2025-03-03 15:05:32,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:05:32,945 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2025-03-03 15:05:32,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:05:32,953 INFO L225 Difference]: With dead ends: 11320 [2025-03-03 15:05:32,953 INFO L226 Difference]: Without dead ends: 6998 [2025-03-03 15:05:32,957 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:05:32,958 INFO L435 NwaCegarLoop]: 335 mSDtfsCounter, 150 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 532 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:05:32,958 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 532 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:05:32,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6998 states. [2025-03-03 15:05:33,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6998 to 6996. [2025-03-03 15:05:33,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6996 states, 6995 states have (on average 1.4030021443888492) internal successors, (9814), 6995 states have internal predecessors, (9814), 0 states have call successors, (0), 0 states 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:05:33,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6996 states to 6996 states and 9814 transitions. [2025-03-03 15:05:33,025 INFO L78 Accepts]: Start accepts. Automaton has 6996 states and 9814 transitions. Word has length 62 [2025-03-03 15:05:33,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:05:33,025 INFO L471 AbstractCegarLoop]: Abstraction has 6996 states and 9814 transitions. [2025-03-03 15:05:33,025 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:05:33,025 INFO L276 IsEmpty]: Start isEmpty. Operand 6996 states and 9814 transitions. [2025-03-03 15:05:33,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-03-03 15:05:33,027 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:05:33,027 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:05:33,027 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-03 15:05:33,028 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:05:33,028 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:05:33,029 INFO L85 PathProgramCache]: Analyzing trace with hash -1620668029, now seen corresponding path program 1 times [2025-03-03 15:05:33,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:05:33,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1013150896] [2025-03-03 15:05:33,029 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:05:33,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:05:33,038 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-03 15:05:33,042 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-03 15:05:33,043 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:05:33,043 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:05:33,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:05:33,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:05:33,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1013150896] [2025-03-03 15:05:33,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1013150896] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:05:33,067 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:05:33,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:05:33,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [221798039] [2025-03-03 15:05:33,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:05:33,068 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:05:33,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:05:33,068 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:05:33,068 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:05:33,068 INFO L87 Difference]: Start difference. First operand 6996 states and 9814 transitions. Second operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:05:33,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:05:33,096 INFO L93 Difference]: Finished difference Result 9361 states and 13123 transitions. [2025-03-03 15:05:33,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:05:33,096 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2025-03-03 15:05:33,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:05:33,102 INFO L225 Difference]: With dead ends: 9361 [2025-03-03 15:05:33,102 INFO L226 Difference]: Without dead ends: 5420 [2025-03-03 15:05:33,107 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:05:33,107 INFO L435 NwaCegarLoop]: 322 mSDtfsCounter, 138 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 519 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:05:33,108 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 519 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:05:33,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5420 states. [2025-03-03 15:05:33,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5420 to 5418. [2025-03-03 15:05:33,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5418 states, 5417 states have (on average 1.3782536459294812) internal successors, (7466), 5417 states have internal predecessors, (7466), 0 states have call successors, (0), 0 states 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:05:33,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5418 states to 5418 states and 7466 transitions. [2025-03-03 15:05:33,192 INFO L78 Accepts]: Start accepts. Automaton has 5418 states and 7466 transitions. Word has length 62 [2025-03-03 15:05:33,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:05:33,193 INFO L471 AbstractCegarLoop]: Abstraction has 5418 states and 7466 transitions. [2025-03-03 15:05:33,193 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:05:33,193 INFO L276 IsEmpty]: Start isEmpty. Operand 5418 states and 7466 transitions. [2025-03-03 15:05:33,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-03-03 15:05:33,195 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:05:33,195 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:05:33,196 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-03 15:05:33,196 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:05:33,196 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:05:33,196 INFO L85 PathProgramCache]: Analyzing trace with hash -1221170535, now seen corresponding path program 1 times [2025-03-03 15:05:33,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:05:33,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1979286378] [2025-03-03 15:05:33,196 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:05:33,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:05:33,205 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-03 15:05:33,208 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-03 15:05:33,208 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:05:33,208 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:05:33,226 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:05:33,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:05:33,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1979286378] [2025-03-03 15:05:33,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1979286378] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:05:33,226 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:05:33,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:05:33,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960627022] [2025-03-03 15:05:33,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:05:33,226 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:05:33,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:05:33,226 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:05:33,226 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:05:33,226 INFO L87 Difference]: Start difference. First operand 5418 states and 7466 transitions. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:05:33,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:05:33,271 INFO L93 Difference]: Finished difference Result 10083 states and 13974 transitions. [2025-03-03 15:05:33,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:05:33,271 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2025-03-03 15:05:33,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:05:33,280 INFO L225 Difference]: With dead ends: 10083 [2025-03-03 15:05:33,280 INFO L226 Difference]: Without dead ends: 7367 [2025-03-03 15:05:33,284 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:05:33,288 INFO L435 NwaCegarLoop]: 216 mSDtfsCounter, 181 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 356 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:05:33,288 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [181 Valid, 356 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:05:33,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7367 states. [2025-03-03 15:05:33,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7367 to 5149. [2025-03-03 15:05:33,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5149 states, 5148 states have (on average 1.3782051282051282) internal successors, (7095), 5148 states have internal predecessors, (7095), 0 states have call successors, (0), 0 states 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:05:33,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5149 states to 5149 states and 7095 transitions. [2025-03-03 15:05:33,347 INFO L78 Accepts]: Start accepts. Automaton has 5149 states and 7095 transitions. Word has length 63 [2025-03-03 15:05:33,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:05:33,347 INFO L471 AbstractCegarLoop]: Abstraction has 5149 states and 7095 transitions. [2025-03-03 15:05:33,347 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:05:33,347 INFO L276 IsEmpty]: Start isEmpty. Operand 5149 states and 7095 transitions. [2025-03-03 15:05:33,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-03-03 15:05:33,349 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:05:33,350 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:05:33,350 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-03 15:05:33,350 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:05:33,351 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:05:33,351 INFO L85 PathProgramCache]: Analyzing trace with hash -2072752705, now seen corresponding path program 1 times [2025-03-03 15:05:33,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:05:33,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1620264647] [2025-03-03 15:05:33,351 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:05:33,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:05:33,361 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-03 15:05:33,388 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-03 15:05:33,388 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:05:33,388 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:05:34,310 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:05:34,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:05:34,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1620264647] [2025-03-03 15:05:34,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1620264647] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:05:34,310 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:05:34,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2025-03-03 15:05:34,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297158163] [2025-03-03 15:05:34,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:05:34,311 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-03 15:05:34,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:05:34,311 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-03 15:05:34,312 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=458, Unknown=0, NotChecked=0, Total=506 [2025-03-03 15:05:34,312 INFO L87 Difference]: Start difference. First operand 5149 states and 7095 transitions. Second operand has 23 states, 23 states have (on average 2.739130434782609) internal successors, (63), 23 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:05:36,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:05:36,740 INFO L93 Difference]: Finished difference Result 6248 states and 8606 transitions. [2025-03-03 15:05:36,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-03-03 15:05:36,741 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.739130434782609) internal successors, (63), 23 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2025-03-03 15:05:36,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:05:36,747 INFO L225 Difference]: With dead ends: 6248 [2025-03-03 15:05:36,747 INFO L226 Difference]: Without dead ends: 6133 [2025-03-03 15:05:36,749 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 183 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=369, Invalid=1523, Unknown=0, NotChecked=0, Total=1892 [2025-03-03 15:05:36,751 INFO L435 NwaCegarLoop]: 273 mSDtfsCounter, 1429 mSDsluCounter, 3594 mSDsCounter, 0 mSdLazyCounter, 2687 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1429 SdHoareTripleChecker+Valid, 3867 SdHoareTripleChecker+Invalid, 2701 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 2687 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-03 15:05:36,751 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1429 Valid, 3867 Invalid, 2701 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 2687 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-03 15:05:36,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6133 states. [2025-03-03 15:05:36,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6133 to 5149. [2025-03-03 15:05:36,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5149 states, 5148 states have (on average 1.378010878010878) internal successors, (7094), 5148 states have internal predecessors, (7094), 0 states have call successors, (0), 0 states 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:05:36,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5149 states to 5149 states and 7094 transitions. [2025-03-03 15:05:36,817 INFO L78 Accepts]: Start accepts. Automaton has 5149 states and 7094 transitions. Word has length 63 [2025-03-03 15:05:36,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:05:36,818 INFO L471 AbstractCegarLoop]: Abstraction has 5149 states and 7094 transitions. [2025-03-03 15:05:36,818 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 2.739130434782609) internal successors, (63), 23 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:05:36,818 INFO L276 IsEmpty]: Start isEmpty. Operand 5149 states and 7094 transitions. [2025-03-03 15:05:36,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-03-03 15:05:36,821 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:05:36,821 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:05:36,821 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-03 15:05:36,821 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:05:36,821 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:05:36,822 INFO L85 PathProgramCache]: Analyzing trace with hash 982777312, now seen corresponding path program 1 times [2025-03-03 15:05:36,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:05:36,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [195622559] [2025-03-03 15:05:36,822 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:05:36,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:05:36,831 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-03 15:05:36,854 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-03 15:05:36,854 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:05:36,855 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:05:37,672 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:05:37,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:05:37,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [195622559] [2025-03-03 15:05:37,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [195622559] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:05:37,673 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:05:37,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2025-03-03 15:05:37,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25717691] [2025-03-03 15:05:37,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:05:37,673 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-03 15:05:37,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:05:37,674 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-03 15:05:37,674 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=453, Unknown=0, NotChecked=0, Total=506 [2025-03-03 15:05:37,674 INFO L87 Difference]: Start difference. First operand 5149 states and 7094 transitions. Second operand has 23 states, 23 states have (on average 2.739130434782609) internal successors, (63), 23 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:05:39,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:05:39,539 INFO L93 Difference]: Finished difference Result 7643 states and 10536 transitions. [2025-03-03 15:05:39,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-03-03 15:05:39,543 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.739130434782609) internal successors, (63), 23 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2025-03-03 15:05:39,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:05:39,550 INFO L225 Difference]: With dead ends: 7643 [2025-03-03 15:05:39,551 INFO L226 Difference]: Without dead ends: 7528 [2025-03-03 15:05:39,553 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 203 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=311, Invalid=1411, Unknown=0, NotChecked=0, Total=1722 [2025-03-03 15:05:39,554 INFO L435 NwaCegarLoop]: 284 mSDtfsCounter, 1641 mSDsluCounter, 3509 mSDsCounter, 0 mSdLazyCounter, 2730 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1641 SdHoareTripleChecker+Valid, 3793 SdHoareTripleChecker+Invalid, 2743 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 2730 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:05:39,554 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1641 Valid, 3793 Invalid, 2743 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 2730 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-03 15:05:39,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7528 states. [2025-03-03 15:05:39,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7528 to 5155. [2025-03-03 15:05:39,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5155 states, 5154 states have (on average 1.3777648428405123) internal successors, (7101), 5154 states have internal predecessors, (7101), 0 states have call successors, (0), 0 states 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:05:39,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5155 states to 5155 states and 7101 transitions. [2025-03-03 15:05:39,607 INFO L78 Accepts]: Start accepts. Automaton has 5155 states and 7101 transitions. Word has length 63 [2025-03-03 15:05:39,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:05:39,607 INFO L471 AbstractCegarLoop]: Abstraction has 5155 states and 7101 transitions. [2025-03-03 15:05:39,608 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 2.739130434782609) internal successors, (63), 23 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:05:39,608 INFO L276 IsEmpty]: Start isEmpty. Operand 5155 states and 7101 transitions. [2025-03-03 15:05:39,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-03-03 15:05:39,610 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:05:39,610 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:05:39,610 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-03 15:05:39,610 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:05:39,610 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:05:39,610 INFO L85 PathProgramCache]: Analyzing trace with hash -1210232511, now seen corresponding path program 1 times [2025-03-03 15:05:39,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:05:39,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [29024984] [2025-03-03 15:05:39,611 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:05:39,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:05:39,618 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-03 15:05:39,632 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-03 15:05:39,632 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:05:39,633 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:05:40,323 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:05:40,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:05:40,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [29024984] [2025-03-03 15:05:40,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [29024984] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:05:40,323 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:05:40,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2025-03-03 15:05:40,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [174713813] [2025-03-03 15:05:40,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:05:40,324 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-03 15:05:40,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:05:40,324 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-03 15:05:40,324 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=448, Unknown=0, NotChecked=0, Total=506 [2025-03-03 15:05:40,324 INFO L87 Difference]: Start difference. First operand 5155 states and 7101 transitions. Second operand has 23 states, 23 states have (on average 2.739130434782609) internal successors, (63), 23 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:05:42,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:05:42,095 INFO L93 Difference]: Finished difference Result 7644 states and 10528 transitions. [2025-03-03 15:05:42,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-03-03 15:05:42,095 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.739130434782609) internal successors, (63), 23 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2025-03-03 15:05:42,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:05:42,102 INFO L225 Difference]: With dead ends: 7644 [2025-03-03 15:05:42,102 INFO L226 Difference]: Without dead ends: 7529 [2025-03-03 15:05:42,103 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 292 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=325, Invalid=1567, Unknown=0, NotChecked=0, Total=1892 [2025-03-03 15:05:42,104 INFO L435 NwaCegarLoop]: 251 mSDtfsCounter, 1898 mSDsluCounter, 3308 mSDsCounter, 0 mSdLazyCounter, 2751 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1898 SdHoareTripleChecker+Valid, 3559 SdHoareTripleChecker+Invalid, 2765 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 2751 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:05:42,104 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1898 Valid, 3559 Invalid, 2765 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 2751 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-03 15:05:42,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7529 states. [2025-03-03 15:05:42,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7529 to 5155. [2025-03-03 15:05:42,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5155 states, 5154 states have (on average 1.377570818781529) internal successors, (7100), 5154 states have internal predecessors, (7100), 0 states have call successors, (0), 0 states 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:05:42,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5155 states to 5155 states and 7100 transitions. [2025-03-03 15:05:42,154 INFO L78 Accepts]: Start accepts. Automaton has 5155 states and 7100 transitions. Word has length 63 [2025-03-03 15:05:42,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:05:42,154 INFO L471 AbstractCegarLoop]: Abstraction has 5155 states and 7100 transitions. [2025-03-03 15:05:42,155 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 2.739130434782609) internal successors, (63), 23 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:05:42,155 INFO L276 IsEmpty]: Start isEmpty. Operand 5155 states and 7100 transitions. [2025-03-03 15:05:42,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-03-03 15:05:42,156 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:05:42,156 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:05:42,157 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-03 15:05:42,157 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:05:42,157 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:05:42,157 INFO L85 PathProgramCache]: Analyzing trace with hash -1408683063, now seen corresponding path program 1 times [2025-03-03 15:05:42,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:05:42,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895408178] [2025-03-03 15:05:42,157 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:05:42,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:05:42,164 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-03 15:05:42,168 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-03 15:05:42,168 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:05:42,169 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:05:42,193 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:05:42,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:05:42,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1895408178] [2025-03-03 15:05:42,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1895408178] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:05:42,194 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:05:42,194 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:05:42,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1044875645] [2025-03-03 15:05:42,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:05:42,195 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:05:42,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:05:42,195 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:05:42,196 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:05:42,196 INFO L87 Difference]: Start difference. First operand 5155 states and 7100 transitions. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:05:42,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:05:42,234 INFO L93 Difference]: Finished difference Result 9640 states and 13347 transitions. [2025-03-03 15:05:42,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:05:42,234 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2025-03-03 15:05:42,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:05:42,240 INFO L225 Difference]: With dead ends: 9640 [2025-03-03 15:05:42,241 INFO L226 Difference]: Without dead ends: 6955 [2025-03-03 15:05:42,245 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:05:42,245 INFO L435 NwaCegarLoop]: 211 mSDtfsCounter, 171 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 344 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:05:42,246 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 344 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:05:42,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6955 states. [2025-03-03 15:05:42,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6955 to 4934. [2025-03-03 15:05:42,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4934 states, 4933 states have (on average 1.3768497871477803) internal successors, (6792), 4933 states have internal predecessors, (6792), 0 states have call successors, (0), 0 states 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:05:42,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4934 states to 4934 states and 6792 transitions. [2025-03-03 15:05:42,296 INFO L78 Accepts]: Start accepts. Automaton has 4934 states and 6792 transitions. Word has length 63 [2025-03-03 15:05:42,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:05:42,296 INFO L471 AbstractCegarLoop]: Abstraction has 4934 states and 6792 transitions. [2025-03-03 15:05:42,296 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:05:42,296 INFO L276 IsEmpty]: Start isEmpty. Operand 4934 states and 6792 transitions. [2025-03-03 15:05:42,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-03-03 15:05:42,297 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:05:42,298 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:05:42,298 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-03 15:05:42,298 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:05:42,298 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:05:42,298 INFO L85 PathProgramCache]: Analyzing trace with hash 2016626025, now seen corresponding path program 1 times [2025-03-03 15:05:42,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:05:42,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1742917318] [2025-03-03 15:05:42,298 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:05:42,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:05:42,307 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-03 15:05:42,310 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-03 15:05:42,311 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:05:42,311 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:05:42,327 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:05:42,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:05:42,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1742917318] [2025-03-03 15:05:42,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1742917318] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:05:42,327 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:05:42,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:05:42,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [837860389] [2025-03-03 15:05:42,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:05:42,328 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:05:42,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:05:42,328 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:05:42,328 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:05:42,329 INFO L87 Difference]: Start difference. First operand 4934 states and 6792 transitions. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:05:42,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:05:42,379 INFO L93 Difference]: Finished difference Result 7477 states and 10307 transitions. [2025-03-03 15:05:42,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:05:42,379 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2025-03-03 15:05:42,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:05:42,384 INFO L225 Difference]: With dead ends: 7477 [2025-03-03 15:05:42,384 INFO L226 Difference]: Without dead ends: 5683 [2025-03-03 15:05:42,386 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:05:42,386 INFO L435 NwaCegarLoop]: 195 mSDtfsCounter, 165 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 327 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:05:42,387 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 327 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:05:42,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5683 states. [2025-03-03 15:05:42,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5683 to 4717. [2025-03-03 15:05:42,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4717 states, 4716 states have (on average 1.3770144189991518) internal successors, (6494), 4716 states have internal predecessors, (6494), 0 states have call successors, (0), 0 states 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:05:42,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4717 states to 4717 states and 6494 transitions. [2025-03-03 15:05:42,429 INFO L78 Accepts]: Start accepts. Automaton has 4717 states and 6494 transitions. Word has length 63 [2025-03-03 15:05:42,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:05:42,429 INFO L471 AbstractCegarLoop]: Abstraction has 4717 states and 6494 transitions. [2025-03-03 15:05:42,429 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:05:42,429 INFO L276 IsEmpty]: Start isEmpty. Operand 4717 states and 6494 transitions. [2025-03-03 15:05:42,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-03-03 15:05:42,431 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:05:42,431 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:05:42,431 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-03 15:05:42,431 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:05:42,431 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:05:42,431 INFO L85 PathProgramCache]: Analyzing trace with hash 462055555, now seen corresponding path program 1 times [2025-03-03 15:05:42,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:05:42,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1664277321] [2025-03-03 15:05:42,431 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:05:42,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:05:42,438 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-03 15:05:42,452 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-03 15:05:42,452 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:05:42,452 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:05:42,937 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:05:42,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:05:42,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1664277321] [2025-03-03 15:05:42,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1664277321] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:05:42,938 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:05:42,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-03-03 15:05:42,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1398563429] [2025-03-03 15:05:42,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:05:42,938 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-03 15:05:42,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:05:42,939 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-03 15:05:42,939 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2025-03-03 15:05:42,939 INFO L87 Difference]: Start difference. First operand 4717 states and 6494 transitions. Second operand has 16 states, 16 states have (on average 4.0) internal successors, (64), 16 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:05:43,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:05:43,738 INFO L93 Difference]: Finished difference Result 10998 states and 15260 transitions. [2025-03-03 15:05:43,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-03 15:05:43,738 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 4.0) internal successors, (64), 16 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:05:43,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:05:43,762 INFO L225 Difference]: With dead ends: 10998 [2025-03-03 15:05:43,762 INFO L226 Difference]: Without dead ends: 10369 [2025-03-03 15:05:43,763 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=194, Invalid=562, Unknown=0, NotChecked=0, Total=756 [2025-03-03 15:05:43,764 INFO L435 NwaCegarLoop]: 182 mSDtfsCounter, 1800 mSDsluCounter, 1895 mSDsCounter, 0 mSdLazyCounter, 825 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1800 SdHoareTripleChecker+Valid, 2077 SdHoareTripleChecker+Invalid, 832 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 825 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 15:05:43,764 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1800 Valid, 2077 Invalid, 832 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 825 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 15:05:43,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10369 states. [2025-03-03 15:05:43,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10369 to 4632. [2025-03-03 15:05:43,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4632 states, 4631 states have (on average 1.3778881451090477) internal successors, (6381), 4631 states have internal predecessors, (6381), 0 states have call successors, (0), 0 states 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:05:43,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4632 states to 4632 states and 6381 transitions. [2025-03-03 15:05:43,816 INFO L78 Accepts]: Start accepts. Automaton has 4632 states and 6381 transitions. Word has length 64 [2025-03-03 15:05:43,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:05:43,816 INFO L471 AbstractCegarLoop]: Abstraction has 4632 states and 6381 transitions. [2025-03-03 15:05:43,816 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 4.0) internal successors, (64), 16 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:05:43,816 INFO L276 IsEmpty]: Start isEmpty. Operand 4632 states and 6381 transitions. [2025-03-03 15:05:43,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-03-03 15:05:43,818 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:05:43,818 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:05:43,819 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-03 15:05:43,820 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:05:43,820 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:05:43,821 INFO L85 PathProgramCache]: Analyzing trace with hash -1589347453, now seen corresponding path program 1 times [2025-03-03 15:05:43,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:05:43,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2682911] [2025-03-03 15:05:43,821 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:05:43,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:05:43,829 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-03 15:05:43,847 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-03 15:05:43,848 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:05:43,848 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:05:44,495 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:05:44,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:05:44,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2682911] [2025-03-03 15:05:44,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2682911] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:05:44,496 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:05:44,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2025-03-03 15:05:44,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926429951] [2025-03-03 15:05:44,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:05:44,496 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-03 15:05:44,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:05:44,496 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-03 15:05:44,497 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=303, Unknown=0, NotChecked=0, Total=342 [2025-03-03 15:05:44,497 INFO L87 Difference]: Start difference. First operand 4632 states and 6381 transitions. Second operand has 19 states, 19 states have (on average 3.3684210526315788) internal successors, (64), 19 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:05:45,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:05:45,806 INFO L93 Difference]: Finished difference Result 6693 states and 9189 transitions. [2025-03-03 15:05:45,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-03-03 15:05:45,806 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 3.3684210526315788) internal successors, (64), 19 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:05:45,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:05:45,812 INFO L225 Difference]: With dead ends: 6693 [2025-03-03 15:05:45,812 INFO L226 Difference]: Without dead ends: 6459 [2025-03-03 15:05:45,813 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 213 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=292, Invalid=1040, Unknown=0, NotChecked=0, Total=1332 [2025-03-03 15:05:45,814 INFO L435 NwaCegarLoop]: 208 mSDtfsCounter, 1786 mSDsluCounter, 2665 mSDsCounter, 0 mSdLazyCounter, 1595 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1786 SdHoareTripleChecker+Valid, 2873 SdHoareTripleChecker+Invalid, 1605 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 1595 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-03 15:05:45,814 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1786 Valid, 2873 Invalid, 1605 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 1595 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-03 15:05:45,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6459 states. [2025-03-03 15:05:45,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6459 to 4592. [2025-03-03 15:05:45,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4592 states, 4591 states have (on average 1.3772598562404705) internal successors, (6323), 4591 states have internal predecessors, (6323), 0 states have call successors, (0), 0 states 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:05:45,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4592 states to 4592 states and 6323 transitions. [2025-03-03 15:05:45,855 INFO L78 Accepts]: Start accepts. Automaton has 4592 states and 6323 transitions. Word has length 64 [2025-03-03 15:05:45,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:05:45,855 INFO L471 AbstractCegarLoop]: Abstraction has 4592 states and 6323 transitions. [2025-03-03 15:05:45,855 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 3.3684210526315788) internal successors, (64), 19 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:05:45,855 INFO L276 IsEmpty]: Start isEmpty. Operand 4592 states and 6323 transitions. [2025-03-03 15:05:45,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-03-03 15:05:45,857 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:05:45,857 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:05:45,857 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-03 15:05:45,857 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:05:45,857 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:05:45,858 INFO L85 PathProgramCache]: Analyzing trace with hash -996650711, now seen corresponding path program 1 times [2025-03-03 15:05:45,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:05:45,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [989589623] [2025-03-03 15:05:45,858 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:05:45,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:05:45,865 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-03-03 15:05:45,871 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-03-03 15:05:45,871 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:05:45,871 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:05:45,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:05:45,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:05:45,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [989589623] [2025-03-03 15:05:45,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [989589623] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:05:45,910 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:05:45,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 15:05:45,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713287918] [2025-03-03 15:05:45,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:05:45,911 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:05:45,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:05:45,911 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:05:45,911 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:05:45,911 INFO L87 Difference]: Start difference. First operand 4592 states and 6323 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:05:45,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:05:45,958 INFO L93 Difference]: Finished difference Result 4598 states and 6326 transitions. [2025-03-03 15:05:45,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 15:05:45,958 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:05:45,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:05:45,961 INFO L225 Difference]: With dead ends: 4598 [2025-03-03 15:05:45,962 INFO L226 Difference]: Without dead ends: 4155 [2025-03-03 15:05:45,962 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:05:45,963 INFO L435 NwaCegarLoop]: 273 mSDtfsCounter, 428 mSDsluCounter, 349 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 428 SdHoareTripleChecker+Valid, 622 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:05:45,963 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [428 Valid, 622 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:05:45,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4155 states. [2025-03-03 15:05:45,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4155 to 4151. [2025-03-03 15:05:45,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4151 states, 4150 states have (on average 1.380722891566265) internal successors, (5730), 4150 states have internal predecessors, (5730), 0 states have call successors, (0), 0 states 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:05:45,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4151 states to 4151 states and 5730 transitions. [2025-03-03 15:05:45,994 INFO L78 Accepts]: Start accepts. Automaton has 4151 states and 5730 transitions. Word has length 67 [2025-03-03 15:05:45,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:05:45,994 INFO L471 AbstractCegarLoop]: Abstraction has 4151 states and 5730 transitions. [2025-03-03 15:05:45,994 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:05:45,994 INFO L276 IsEmpty]: Start isEmpty. Operand 4151 states and 5730 transitions. [2025-03-03 15:05:45,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-03-03 15:05:45,996 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:05:45,996 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:05:45,996 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-03 15:05:45,996 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:05:45,997 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:05:45,997 INFO L85 PathProgramCache]: Analyzing trace with hash 446783402, now seen corresponding path program 1 times [2025-03-03 15:05:45,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:05:45,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734265153] [2025-03-03 15:05:45,997 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:05:45,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:05:46,006 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-03 15:05:46,012 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-03 15:05:46,012 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:05:46,012 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:05:46,047 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:05:46,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:05:46,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [734265153] [2025-03-03 15:05:46,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [734265153] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:05:46,048 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:05:46,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:05:46,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097059674] [2025-03-03 15:05:46,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:05:46,048 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:05:46,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:05:46,049 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:05:46,049 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:05:46,049 INFO L87 Difference]: Start difference. First operand 4151 states and 5730 transitions. Second operand has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 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:05:46,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:05:46,078 INFO L93 Difference]: Finished difference Result 10825 states and 15066 transitions. [2025-03-03 15:05:46,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:05:46,079 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 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:05:46,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:05:46,085 INFO L225 Difference]: With dead ends: 10825 [2025-03-03 15:05:46,085 INFO L226 Difference]: Without dead ends: 7333 [2025-03-03 15:05:46,089 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:05:46,090 INFO L435 NwaCegarLoop]: 280 mSDtfsCounter, 121 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 435 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:05:46,090 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 435 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:05:46,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7333 states. [2025-03-03 15:05:46,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7333 to 6879. [2025-03-03 15:05:46,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6879 states, 6878 states have (on average 1.3845594649607444) internal successors, (9523), 6878 states have internal predecessors, (9523), 0 states have call successors, (0), 0 states 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:05:46,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6879 states to 6879 states and 9523 transitions. [2025-03-03 15:05:46,149 INFO L78 Accepts]: Start accepts. Automaton has 6879 states and 9523 transitions. Word has length 70 [2025-03-03 15:05:46,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:05:46,149 INFO L471 AbstractCegarLoop]: Abstraction has 6879 states and 9523 transitions. [2025-03-03 15:05:46,149 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 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:05:46,149 INFO L276 IsEmpty]: Start isEmpty. Operand 6879 states and 9523 transitions. [2025-03-03 15:05:46,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-03-03 15:05:46,151 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:05:46,151 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:05:46,151 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-03-03 15:05:46,151 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:05:46,151 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:05:46,151 INFO L85 PathProgramCache]: Analyzing trace with hash -2143865666, now seen corresponding path program 1 times [2025-03-03 15:05:46,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:05:46,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1663485520] [2025-03-03 15:05:46,152 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:05:46,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:05:46,161 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-03 15:05:46,166 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-03 15:05:46,167 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:05:46,167 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:05:46,205 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:05:46,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:05:46,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1663485520] [2025-03-03 15:05:46,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1663485520] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:05:46,205 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:05:46,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:05:46,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763758094] [2025-03-03 15:05:46,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:05:46,206 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:05:46,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:05:46,207 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:05:46,207 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:05:46,207 INFO L87 Difference]: Start difference. First operand 6879 states and 9523 transitions. Second operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:05:46,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:05:46,251 INFO L93 Difference]: Finished difference Result 18699 states and 25969 transitions. [2025-03-03 15:05:46,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:05:46,251 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 71 [2025-03-03 15:05:46,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:05:46,265 INFO L225 Difference]: With dead ends: 18699 [2025-03-03 15:05:46,265 INFO L226 Difference]: Without dead ends: 12479 [2025-03-03 15:05:46,272 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:05:46,275 INFO L435 NwaCegarLoop]: 262 mSDtfsCounter, 109 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 427 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:05:46,276 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 427 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:05:46,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12479 states. [2025-03-03 15:05:46,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12479 to 11573. [2025-03-03 15:05:46,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11573 states, 11572 states have (on average 1.382388524023505) internal successors, (15997), 11572 states have internal predecessors, (15997), 0 states have call successors, (0), 0 states 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:05:46,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11573 states to 11573 states and 15997 transitions. [2025-03-03 15:05:46,425 INFO L78 Accepts]: Start accepts. Automaton has 11573 states and 15997 transitions. Word has length 71 [2025-03-03 15:05:46,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:05:46,425 INFO L471 AbstractCegarLoop]: Abstraction has 11573 states and 15997 transitions. [2025-03-03 15:05:46,426 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:05:46,426 INFO L276 IsEmpty]: Start isEmpty. Operand 11573 states and 15997 transitions. [2025-03-03 15:05:46,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-03-03 15:05:46,427 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:05:46,427 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] [2025-03-03 15:05:46,427 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-03-03 15:05:46,428 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:05:46,428 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:05:46,428 INFO L85 PathProgramCache]: Analyzing trace with hash -1909575233, now seen corresponding path program 1 times [2025-03-03 15:05:46,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:05:46,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841089083] [2025-03-03 15:05:46,429 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:05:46,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:05:46,436 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-03-03 15:05:46,440 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-03-03 15:05:46,440 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:05:46,440 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:05:46,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:05:46,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:05:46,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [841089083] [2025-03-03 15:05:46,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [841089083] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:05:46,459 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:05:46,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:05:46,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969568239] [2025-03-03 15:05:46,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:05:46,459 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:05:46,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:05:46,460 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:05:46,460 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:05:46,460 INFO L87 Difference]: Start difference. First operand 11573 states and 15997 transitions. Second operand has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 0 states 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:05:46,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:05:46,518 INFO L93 Difference]: Finished difference Result 31801 states and 43786 transitions. [2025-03-03 15:05:46,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:05:46,519 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 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 73 [2025-03-03 15:05:46,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:05:46,538 INFO L225 Difference]: With dead ends: 31801 [2025-03-03 15:05:46,538 INFO L226 Difference]: Without dead ends: 20759 [2025-03-03 15:05:46,548 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:05:46,549 INFO L435 NwaCegarLoop]: 233 mSDtfsCounter, 148 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 365 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:05:46,549 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 365 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:05:46,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20759 states. [2025-03-03 15:05:46,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20759 to 20429. [2025-03-03 15:05:46,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20429 states, 20428 states have (on average 1.3426669277462306) internal successors, (27428), 20428 states have internal predecessors, (27428), 0 states have call successors, (0), 0 states 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:05:46,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20429 states to 20429 states and 27428 transitions. [2025-03-03 15:05:46,727 INFO L78 Accepts]: Start accepts. Automaton has 20429 states and 27428 transitions. Word has length 73 [2025-03-03 15:05:46,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:05:46,727 INFO L471 AbstractCegarLoop]: Abstraction has 20429 states and 27428 transitions. [2025-03-03 15:05:46,727 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 0 states 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:05:46,727 INFO L276 IsEmpty]: Start isEmpty. Operand 20429 states and 27428 transitions. [2025-03-03 15:05:46,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-03-03 15:05:46,729 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:05:46,729 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] [2025-03-03 15:05:46,729 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-03-03 15:05:46,729 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:05:46,730 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:05:46,730 INFO L85 PathProgramCache]: Analyzing trace with hash -1486873407, now seen corresponding path program 1 times [2025-03-03 15:05:46,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:05:46,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251349664] [2025-03-03 15:05:46,730 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:05:46,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:05:46,737 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-03-03 15:05:46,742 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-03-03 15:05:46,742 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:05:46,742 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:05:46,776 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:05:46,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:05:46,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251349664] [2025-03-03 15:05:46,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1251349664] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:05:46,776 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:05:46,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:05:46,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109278172] [2025-03-03 15:05:46,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:05:46,776 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:05:46,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:05:46,777 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:05:46,777 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:05:46,777 INFO L87 Difference]: Start difference. First operand 20429 states and 27428 transitions. Second operand has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 0 states 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:05:46,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:05:46,877 INFO L93 Difference]: Finished difference Result 52241 states and 70382 transitions. [2025-03-03 15:05:46,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:05:46,878 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 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 73 [2025-03-03 15:05:46,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:05:46,911 INFO L225 Difference]: With dead ends: 52241 [2025-03-03 15:05:46,912 INFO L226 Difference]: Without dead ends: 32322 [2025-03-03 15:05:46,929 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:05:46,930 INFO L435 NwaCegarLoop]: 278 mSDtfsCounter, 115 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 423 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:05:46,930 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 423 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:05:46,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32322 states. [2025-03-03 15:05:47,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32322 to 28576. [2025-03-03 15:05:47,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28576 states, 28575 states have (on average 1.3351181102362204) internal successors, (38151), 28575 states have internal predecessors, (38151), 0 states have call successors, (0), 0 states 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:05:47,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28576 states to 28576 states and 38151 transitions. [2025-03-03 15:05:47,268 INFO L78 Accepts]: Start accepts. Automaton has 28576 states and 38151 transitions. Word has length 73 [2025-03-03 15:05:47,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:05:47,268 INFO L471 AbstractCegarLoop]: Abstraction has 28576 states and 38151 transitions. [2025-03-03 15:05:47,268 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 0 states 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:05:47,268 INFO L276 IsEmpty]: Start isEmpty. Operand 28576 states and 38151 transitions. [2025-03-03 15:05:47,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-03-03 15:05:47,269 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:05:47,269 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] [2025-03-03 15:05:47,269 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-03-03 15:05:47,269 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:05:47,270 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:05:47,270 INFO L85 PathProgramCache]: Analyzing trace with hash -1974129179, now seen corresponding path program 1 times [2025-03-03 15:05:47,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:05:47,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667205324] [2025-03-03 15:05:47,270 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:05:47,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:05:47,277 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-03-03 15:05:47,283 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-03-03 15:05:47,283 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:05:47,283 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:05:47,382 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:05:47,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:05:47,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1667205324] [2025-03-03 15:05:47,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1667205324] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:05:47,383 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:05:47,383 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 15:05:47,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196527238] [2025-03-03 15:05:47,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:05:47,383 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 15:05:47,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:05:47,383 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 15:05:47,383 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:05:47,383 INFO L87 Difference]: Start difference. First operand 28576 states and 38151 transitions. Second operand has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 6 states have internal predecessors, (74), 0 states have call successors, (0), 0 states 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:05:47,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:05:47,452 INFO L93 Difference]: Finished difference Result 30018 states and 40072 transitions. [2025-03-03 15:05:47,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 15:05:47,452 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 6 states have internal predecessors, (74), 0 states have call successors, (0), 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 74 [2025-03-03 15:05:47,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:05:47,482 INFO L225 Difference]: With dead ends: 30018 [2025-03-03 15:05:47,483 INFO L226 Difference]: Without dead ends: 30016 [2025-03-03 15:05:47,492 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:05:47,492 INFO L435 NwaCegarLoop]: 193 mSDtfsCounter, 0 mSDsluCounter, 762 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 955 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:05:47,492 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 955 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:05:47,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30016 states. [2025-03-03 15:05:47,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30016 to 30016. [2025-03-03 15:05:47,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30016 states, 30015 states have (on average 1.298783941362652) internal successors, (38983), 30015 states have internal predecessors, (38983), 0 states have call successors, (0), 0 states 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:05:47,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30016 states to 30016 states and 38983 transitions. [2025-03-03 15:05:47,824 INFO L78 Accepts]: Start accepts. Automaton has 30016 states and 38983 transitions. Word has length 74 [2025-03-03 15:05:47,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:05:47,824 INFO L471 AbstractCegarLoop]: Abstraction has 30016 states and 38983 transitions. [2025-03-03 15:05:47,824 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 6 states have internal predecessors, (74), 0 states have call successors, (0), 0 states 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:05:47,824 INFO L276 IsEmpty]: Start isEmpty. Operand 30016 states and 38983 transitions. [2025-03-03 15:05:47,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-03-03 15:05:47,830 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:05:47,830 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:05:47,830 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-03-03 15:05:47,830 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:05:47,830 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:05:47,830 INFO L85 PathProgramCache]: Analyzing trace with hash 753803424, now seen corresponding path program 1 times [2025-03-03 15:05:47,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:05:47,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1705630011] [2025-03-03 15:05:47,830 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:05:47,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:05:47,844 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-03 15:05:47,866 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-03 15:05:47,867 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:05:47,867 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:05:48,033 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:05:48,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:05:48,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1705630011] [2025-03-03 15:05:48,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1705630011] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 15:05:48,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [794084965] [2025-03-03 15:05:48,035 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:05:48,035 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 15:05:48,035 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 15:05:48,037 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 15:05:48,038 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-03 15:05:48,122 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-03 15:05:48,162 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-03 15:05:48,162 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:05:48,162 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:05:48,169 INFO L256 TraceCheckSpWp]: Trace formula consists of 431 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-03-03 15:05:48,173 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 15:05:49,058 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:05:49,058 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 15:05:50,063 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:05:50,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [794084965] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 15:05:50,064 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 15:05:50,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 13, 14] total 30 [2025-03-03 15:05:50,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1741875097] [2025-03-03 15:05:50,064 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 15:05:50,064 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-03-03 15:05:50,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:05:50,065 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-03-03 15:05:50,065 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=798, Unknown=0, NotChecked=0, Total=930 [2025-03-03 15:05:50,065 INFO L87 Difference]: Start difference. First operand 30016 states and 38983 transitions. Second operand has 31 states, 31 states have (on average 7.580645161290323) internal successors, (235), 30 states have internal predecessors, (235), 0 states have call successors, (0), 0 states 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:05:58,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:05:58,556 INFO L93 Difference]: Finished difference Result 191486 states and 243751 transitions. [2025-03-03 15:05:58,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 160 states. [2025-03-03 15:05:58,556 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 7.580645161290323) internal successors, (235), 30 states have internal predecessors, (235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 94 [2025-03-03 15:05:58,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:05:58,744 INFO L225 Difference]: With dead ends: 191486 [2025-03-03 15:05:58,744 INFO L226 Difference]: Without dead ends: 180188 [2025-03-03 15:05:58,801 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 352 GetRequests, 166 SyntacticMatches, 0 SemanticMatches, 186 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12597 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=5366, Invalid=29790, Unknown=0, NotChecked=0, Total=35156 [2025-03-03 15:05:58,801 INFO L435 NwaCegarLoop]: 406 mSDtfsCounter, 7927 mSDsluCounter, 5972 mSDsCounter, 0 mSdLazyCounter, 6687 mSolverCounterSat, 147 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7927 SdHoareTripleChecker+Valid, 6378 SdHoareTripleChecker+Invalid, 6834 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 147 IncrementalHoareTripleChecker+Valid, 6687 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2025-03-03 15:05:58,801 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7927 Valid, 6378 Invalid, 6834 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [147 Valid, 6687 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2025-03-03 15:05:58,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180188 states. [2025-03-03 15:05:59,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180188 to 30372. [2025-03-03 15:05:59,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30372 states, 30371 states have (on average 1.298310888676698) internal successors, (39431), 30371 states have internal predecessors, (39431), 0 states have call successors, (0), 0 states 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:05:59,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30372 states to 30372 states and 39431 transitions. [2025-03-03 15:05:59,727 INFO L78 Accepts]: Start accepts. Automaton has 30372 states and 39431 transitions. Word has length 94 [2025-03-03 15:05:59,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:05:59,727 INFO L471 AbstractCegarLoop]: Abstraction has 30372 states and 39431 transitions. [2025-03-03 15:05:59,728 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 7.580645161290323) internal successors, (235), 30 states have internal predecessors, (235), 0 states have call successors, (0), 0 states 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:05:59,728 INFO L276 IsEmpty]: Start isEmpty. Operand 30372 states and 39431 transitions. [2025-03-03 15:05:59,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-03-03 15:05:59,733 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:05:59,733 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:05:59,740 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-03 15:05:59,933 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable33 [2025-03-03 15:05:59,934 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:05:59,934 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:05:59,934 INFO L85 PathProgramCache]: Analyzing trace with hash -140784899, now seen corresponding path program 1 times [2025-03-03 15:05:59,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:05:59,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [966692264] [2025-03-03 15:05:59,934 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:05:59,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:05:59,943 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-03 15:05:59,950 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-03 15:05:59,950 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:05:59,950 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:06:00,085 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:06:00,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:06:00,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [966692264] [2025-03-03 15:06:00,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [966692264] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:06:00,086 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:06:00,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-03 15:06:00,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1464440424] [2025-03-03 15:06:00,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:06:00,086 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-03 15:06:00,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:06:00,087 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-03 15:06:00,087 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-03-03 15:06:00,087 INFO L87 Difference]: Start difference. First operand 30372 states and 39431 transitions. Second operand has 10 states, 10 states have (on average 9.4) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:06:00,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:06:00,515 INFO L93 Difference]: Finished difference Result 70916 states and 91731 transitions. [2025-03-03 15:06:00,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-03 15:06:00,516 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 9.4) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 94 [2025-03-03 15:06:00,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:06:00,572 INFO L225 Difference]: With dead ends: 70916 [2025-03-03 15:06:00,572 INFO L226 Difference]: Without dead ends: 55434 [2025-03-03 15:06:00,593 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=123, Invalid=339, Unknown=0, NotChecked=0, Total=462 [2025-03-03 15:06:00,594 INFO L435 NwaCegarLoop]: 150 mSDtfsCounter, 895 mSDsluCounter, 605 mSDsCounter, 0 mSdLazyCounter, 621 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 895 SdHoareTripleChecker+Valid, 755 SdHoareTripleChecker+Invalid, 632 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 621 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 15:06:00,594 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [895 Valid, 755 Invalid, 632 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 621 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 15:06:00,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55434 states. [2025-03-03 15:06:00,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55434 to 47994. [2025-03-03 15:06:01,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47994 states, 47993 states have (on average 1.298105973787844) internal successors, (62300), 47993 states have internal predecessors, (62300), 0 states have call successors, (0), 0 states 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:06:01,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47994 states to 47994 states and 62300 transitions. [2025-03-03 15:06:01,070 INFO L78 Accepts]: Start accepts. Automaton has 47994 states and 62300 transitions. Word has length 94 [2025-03-03 15:06:01,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:06:01,071 INFO L471 AbstractCegarLoop]: Abstraction has 47994 states and 62300 transitions. [2025-03-03 15:06:01,071 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.4) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:06:01,071 INFO L276 IsEmpty]: Start isEmpty. Operand 47994 states and 62300 transitions. [2025-03-03 15:06:01,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-03-03 15:06:01,076 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:06:01,077 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:06:01,077 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-03-03 15:06:01,077 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:06:01,077 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:06:01,077 INFO L85 PathProgramCache]: Analyzing trace with hash 1265112673, now seen corresponding path program 1 times [2025-03-03 15:06:01,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:06:01,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1529914277] [2025-03-03 15:06:01,077 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:06:01,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:06:01,085 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-03 15:06:01,098 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-03 15:06:01,098 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:06:01,098 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:06:01,264 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:06:01,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:06:01,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1529914277] [2025-03-03 15:06:01,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1529914277] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 15:06:01,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1182833211] [2025-03-03 15:06:01,265 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:06:01,265 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 15:06:01,265 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 15:06:01,266 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 15:06:01,268 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-03 15:06:01,342 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-03 15:06:01,371 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-03 15:06:01,371 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:06:01,371 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:06:01,373 INFO L256 TraceCheckSpWp]: Trace formula consists of 431 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-03 15:06:01,375 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 15:06:01,983 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:06:01,983 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 15:06:02,586 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:06:02,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1182833211] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 15:06:02,586 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 15:06:02,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 13, 13] total 29 [2025-03-03 15:06:02,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1837707451] [2025-03-03 15:06:02,587 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 15:06:02,587 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-03-03 15:06:02,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:06:02,587 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-03-03 15:06:02,588 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=756, Unknown=0, NotChecked=0, Total=870 [2025-03-03 15:06:02,588 INFO L87 Difference]: Start difference. First operand 47994 states and 62300 transitions. Second operand has 30 states, 30 states have (on average 8.133333333333333) internal successors, (244), 29 states have internal predecessors, (244), 0 states have call successors, (0), 0 states 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:06:12,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:06:12,654 INFO L93 Difference]: Finished difference Result 274516 states and 350686 transitions. [2025-03-03 15:06:12,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 202 states. [2025-03-03 15:06:12,654 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 8.133333333333333) internal successors, (244), 29 states have internal predecessors, (244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 94 [2025-03-03 15:06:12,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:06:12,971 INFO L225 Difference]: With dead ends: 274516 [2025-03-03 15:06:12,971 INFO L226 Difference]: Without dead ends: 251266 [2025-03-03 15:06:13,054 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 394 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 227 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20848 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=7450, Invalid=44762, Unknown=0, NotChecked=0, Total=52212 [2025-03-03 15:06:13,055 INFO L435 NwaCegarLoop]: 401 mSDtfsCounter, 7283 mSDsluCounter, 6435 mSDsCounter, 0 mSdLazyCounter, 6635 mSolverCounterSat, 114 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7283 SdHoareTripleChecker+Valid, 6836 SdHoareTripleChecker+Invalid, 6749 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 114 IncrementalHoareTripleChecker+Valid, 6635 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2025-03-03 15:06:13,055 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7283 Valid, 6836 Invalid, 6749 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [114 Valid, 6635 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2025-03-03 15:06:13,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251266 states. [2025-03-03 15:06:14,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251266 to 92991. [2025-03-03 15:06:14,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92991 states, 92990 states have (on average 1.297236261963652) internal successors, (120630), 92990 states have internal predecessors, (120630), 0 states have call successors, (0), 0 states 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:06:14,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92991 states to 92991 states and 120630 transitions. [2025-03-03 15:06:14,691 INFO L78 Accepts]: Start accepts. Automaton has 92991 states and 120630 transitions. Word has length 94 [2025-03-03 15:06:14,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:06:14,691 INFO L471 AbstractCegarLoop]: Abstraction has 92991 states and 120630 transitions. [2025-03-03 15:06:14,691 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 8.133333333333333) internal successors, (244), 29 states have internal predecessors, (244), 0 states have call successors, (0), 0 states 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:06:14,691 INFO L276 IsEmpty]: Start isEmpty. Operand 92991 states and 120630 transitions. [2025-03-03 15:06:14,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-03-03 15:06:14,701 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:06:14,701 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:06:14,707 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-03 15:06:14,901 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2025-03-03 15:06:14,901 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:06:14,902 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:06:14,902 INFO L85 PathProgramCache]: Analyzing trace with hash -143307748, now seen corresponding path program 1 times [2025-03-03 15:06:14,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:06:14,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595038107] [2025-03-03 15:06:14,903 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:06:14,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:06:14,911 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-03 15:06:14,917 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-03 15:06:14,917 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:06:14,917 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:06:14,949 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:06:14,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:06:14,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595038107] [2025-03-03 15:06:14,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [595038107] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:06:14,949 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:06:14,949 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:06:14,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583236595] [2025-03-03 15:06:14,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:06:14,951 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:06:14,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:06:14,951 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:06:14,951 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:06:14,951 INFO L87 Difference]: Start difference. First operand 92991 states and 120630 transitions. Second operand has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:06:15,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:06:15,305 INFO L93 Difference]: Finished difference Result 181907 states and 236276 transitions. [2025-03-03 15:06:15,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:06:15,306 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 95 [2025-03-03 15:06:15,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:06:15,400 INFO L225 Difference]: With dead ends: 181907 [2025-03-03 15:06:15,400 INFO L226 Difference]: Without dead ends: 90221 [2025-03-03 15:06:15,455 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:06:15,455 INFO L435 NwaCegarLoop]: 212 mSDtfsCounter, 94 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 361 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:06:15,455 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 361 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:06:15,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90221 states. [2025-03-03 15:06:16,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90221 to 90143. [2025-03-03 15:06:16,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90143 states, 90142 states have (on average 1.2823877881564643) internal successors, (115597), 90142 states have internal predecessors, (115597), 0 states have call successors, (0), 0 states 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:06:16,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90143 states to 90143 states and 115597 transitions. [2025-03-03 15:06:16,754 INFO L78 Accepts]: Start accepts. Automaton has 90143 states and 115597 transitions. Word has length 95 [2025-03-03 15:06:16,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:06:16,754 INFO L471 AbstractCegarLoop]: Abstraction has 90143 states and 115597 transitions. [2025-03-03 15:06:16,754 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:06:16,754 INFO L276 IsEmpty]: Start isEmpty. Operand 90143 states and 115597 transitions. [2025-03-03 15:06:16,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-03-03 15:06:16,899 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:06:16,899 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:06:16,899 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2025-03-03 15:06:16,899 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:06:16,900 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:06:16,900 INFO L85 PathProgramCache]: Analyzing trace with hash -119194167, now seen corresponding path program 1 times [2025-03-03 15:06:16,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:06:16,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308289516] [2025-03-03 15:06:16,900 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:06:16,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:06:16,908 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-03 15:06:16,923 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-03 15:06:16,924 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:06:16,924 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:06:16,984 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:06:16,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:06:16,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1308289516] [2025-03-03 15:06:16,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1308289516] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 15:06:16,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1518492466] [2025-03-03 15:06:16,984 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:06:16,985 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 15:06:16,985 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 15:06:16,986 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 15:06:16,988 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-03 15:06:17,068 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-03 15:06:17,108 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-03 15:06:17,109 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:06:17,109 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:06:17,111 INFO L256 TraceCheckSpWp]: Trace formula consists of 434 conjuncts, 36 conjuncts are in the unsatisfiable core [2025-03-03 15:06:17,114 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 15:06:17,436 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:06:17,436 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 15:06:17,886 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:06:17,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1518492466] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 15:06:17,886 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 15:06:17,886 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 11, 13] total 22 [2025-03-03 15:06:17,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064987119] [2025-03-03 15:06:17,886 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 15:06:17,886 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-03 15:06:17,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:06:17,887 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-03 15:06:17,887 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=328, Unknown=0, NotChecked=0, Total=462 [2025-03-03 15:06:17,887 INFO L87 Difference]: Start difference. First operand 90143 states and 115597 transitions. Second operand has 22 states, 22 states have (on average 10.454545454545455) internal successors, (230), 22 states have internal predecessors, (230), 0 states have call successors, (0), 0 states 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:06:21,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:06:21,029 INFO L93 Difference]: Finished difference Result 519354 states and 661886 transitions. [2025-03-03 15:06:21,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2025-03-03 15:06:21,031 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 10.454545454545455) internal successors, (230), 22 states have internal predecessors, (230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 95 [2025-03-03 15:06:21,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:06:21,585 INFO L225 Difference]: With dead ends: 519354 [2025-03-03 15:06:21,585 INFO L226 Difference]: Without dead ends: 430440 [2025-03-03 15:06:21,879 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 261 GetRequests, 172 SyntacticMatches, 1 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2994 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1701, Invalid=6309, Unknown=0, NotChecked=0, Total=8010 [2025-03-03 15:06:21,880 INFO L435 NwaCegarLoop]: 806 mSDtfsCounter, 7418 mSDsluCounter, 4123 mSDsCounter, 0 mSdLazyCounter, 942 mSolverCounterSat, 182 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7418 SdHoareTripleChecker+Valid, 4929 SdHoareTripleChecker+Invalid, 1124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 182 IncrementalHoareTripleChecker+Valid, 942 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 15:06:21,880 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7418 Valid, 4929 Invalid, 1124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [182 Valid, 942 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 15:06:22,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 430440 states. [2025-03-03 15:06:25,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 430440 to 327930. [2025-03-03 15:06:25,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 327930 states, 327929 states have (on average 1.2636119403895356) internal successors, (414375), 327929 states have internal predecessors, (414375), 0 states have call successors, (0), 0 states 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:06:26,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327930 states to 327930 states and 414375 transitions. [2025-03-03 15:06:26,318 INFO L78 Accepts]: Start accepts. Automaton has 327930 states and 414375 transitions. Word has length 95 [2025-03-03 15:06:26,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:06:26,319 INFO L471 AbstractCegarLoop]: Abstraction has 327930 states and 414375 transitions. [2025-03-03 15:06:26,319 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 10.454545454545455) internal successors, (230), 22 states have internal predecessors, (230), 0 states have call successors, (0), 0 states 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:06:26,319 INFO L276 IsEmpty]: Start isEmpty. Operand 327930 states and 414375 transitions. [2025-03-03 15:06:26,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-03-03 15:06:26,329 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:06:26,330 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:06:26,625 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 15:06:26,625 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:06:26,625 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:06:26,625 INFO L85 PathProgramCache]: Analyzing trace with hash 1873331779, now seen corresponding path program 1 times [2025-03-03 15:06:26,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:06:26,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401745346] [2025-03-03 15:06:26,626 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:06:26,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:06:26,627 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-03 15:06:26,639 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-03 15:06:26,649 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-03 15:06:26,652 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:06:26,653 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:06:26,681 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-03 15:06:26,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:06:26,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [401745346] [2025-03-03 15:06:26,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [401745346] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:06:26,682 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:06:26,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:06:26,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521596616] [2025-03-03 15:06:26,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:06:26,682 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:06:26,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:06:26,683 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:06:26,683 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:06:26,683 INFO L87 Difference]: Start difference. First operand 327930 states and 414375 transitions. Second operand has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 0 states have call successors, (0), 0 states 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:06:28,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:06:28,144 INFO L93 Difference]: Finished difference Result 609123 states and 770849 transitions. [2025-03-03 15:06:28,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:06:28,144 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 0 states have call successors, (0), 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 102 [2025-03-03 15:06:28,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:06:28,589 INFO L225 Difference]: With dead ends: 609123 [2025-03-03 15:06:28,589 INFO L226 Difference]: Without dead ends: 282054 [2025-03-03 15:06:28,748 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:06:28,749 INFO L435 NwaCegarLoop]: 136 mSDtfsCounter, 157 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:06:28,749 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 177 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 15:06:28,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282054 states. [2025-03-03 15:06:31,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282054 to 282036. [2025-03-03 15:06:31,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 282036 states, 282035 states have (on average 1.253401173613204) internal successors, (353503), 282035 states have internal predecessors, (353503), 0 states have call successors, (0), 0 states 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:06:32,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282036 states to 282036 states and 353503 transitions. [2025-03-03 15:06:32,160 INFO L78 Accepts]: Start accepts. Automaton has 282036 states and 353503 transitions. Word has length 102 [2025-03-03 15:06:32,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:06:32,160 INFO L471 AbstractCegarLoop]: Abstraction has 282036 states and 353503 transitions. [2025-03-03 15:06:32,160 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 0 states have call successors, (0), 0 states 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:06:32,161 INFO L276 IsEmpty]: Start isEmpty. Operand 282036 states and 353503 transitions. [2025-03-03 15:06:32,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-03-03 15:06:32,172 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:06:32,172 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:06:32,172 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2025-03-03 15:06:32,172 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:06:32,172 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:06:32,172 INFO L85 PathProgramCache]: Analyzing trace with hash 163345617, now seen corresponding path program 1 times [2025-03-03 15:06:32,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:06:32,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975791871] [2025-03-03 15:06:32,172 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:06:32,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:06:32,183 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-03 15:06:32,189 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-03 15:06:32,189 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:06:32,189 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:06:32,240 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:06:32,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:06:32,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1975791871] [2025-03-03 15:06:32,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1975791871] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 15:06:32,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1619428600] [2025-03-03 15:06:32,241 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:06:32,241 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 15:06:32,241 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 15:06:32,243 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 15:06:32,244 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-03 15:06:32,334 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-03 15:06:32,371 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-03 15:06:32,372 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:06:32,372 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:06:32,373 INFO L256 TraceCheckSpWp]: Trace formula consists of 446 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-03 15:06:32,375 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 15:06:33,005 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:06:33,005 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 15:06:33,105 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:06:33,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1619428600] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 15:06:33,105 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 15:06:33,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 14 [2025-03-03 15:06:33,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534541035] [2025-03-03 15:06:33,105 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 15:06:33,105 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-03 15:06:33,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:06:33,106 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-03 15:06:33,106 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2025-03-03 15:06:33,106 INFO L87 Difference]: Start difference. First operand 282036 states and 353503 transitions. Second operand has 14 states, 14 states have (on average 19.642857142857142) internal successors, (275), 14 states have internal predecessors, (275), 0 states have call successors, (0), 0 states 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:06:34,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:06:34,818 INFO L93 Difference]: Finished difference Result 580701 states and 725806 transitions. [2025-03-03 15:06:34,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 15:06:34,818 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 19.642857142857142) internal successors, (275), 14 states have internal predecessors, (275), 0 states have call successors, (0), 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 103 [2025-03-03 15:06:34,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:06:35,218 INFO L225 Difference]: With dead ends: 580701 [2025-03-03 15:06:35,219 INFO L226 Difference]: Without dead ends: 299581 [2025-03-03 15:06:35,296 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 199 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=89, Invalid=253, Unknown=0, NotChecked=0, Total=342 [2025-03-03 15:06:35,297 INFO L435 NwaCegarLoop]: 131 mSDtfsCounter, 1370 mSDsluCounter, 646 mSDsCounter, 0 mSdLazyCounter, 578 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1370 SdHoareTripleChecker+Valid, 777 SdHoareTripleChecker+Invalid, 607 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 578 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 15:06:35,297 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1370 Valid, 777 Invalid, 607 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 578 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 15:06:35,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299581 states. [2025-03-03 15:06:38,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299581 to 281889. [2025-03-03 15:06:38,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 281889 states, 281888 states have (on average 1.221566721534794) internal successors, (344345), 281888 states have internal predecessors, (344345), 0 states have call successors, (0), 0 states 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:06:39,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281889 states to 281889 states and 344345 transitions. [2025-03-03 15:06:39,033 INFO L78 Accepts]: Start accepts. Automaton has 281889 states and 344345 transitions. Word has length 103 [2025-03-03 15:06:39,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:06:39,034 INFO L471 AbstractCegarLoop]: Abstraction has 281889 states and 344345 transitions. [2025-03-03 15:06:39,034 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 19.642857142857142) internal successors, (275), 14 states have internal predecessors, (275), 0 states have call successors, (0), 0 states 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:06:39,034 INFO L276 IsEmpty]: Start isEmpty. Operand 281889 states and 344345 transitions. [2025-03-03 15:06:39,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-03-03 15:06:39,041 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:06:39,041 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:06:39,047 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-03 15:06:39,242 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2025-03-03 15:06:39,242 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:06:39,242 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:06:39,242 INFO L85 PathProgramCache]: Analyzing trace with hash -1007675532, now seen corresponding path program 1 times [2025-03-03 15:06:39,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:06:39,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286242227] [2025-03-03 15:06:39,242 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:06:39,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:06:39,250 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-03 15:06:39,255 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-03 15:06:39,255 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:06:39,255 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:06:39,286 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:06:39,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:06:39,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [286242227] [2025-03-03 15:06:39,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [286242227] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 15:06:39,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [48598690] [2025-03-03 15:06:39,287 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:06:39,287 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 15:06:39,287 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 15:06:39,289 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 15:06:39,290 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-03 15:06:39,393 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-03 15:06:39,422 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-03 15:06:39,422 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:06:39,422 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:06:39,423 INFO L256 TraceCheckSpWp]: Trace formula consists of 450 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-03 15:06:39,425 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 15:06:39,593 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:06:39,593 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 15:06:39,696 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:06:39,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [48598690] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 15:06:39,696 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 15:06:39,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 14 [2025-03-03 15:06:39,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561355985] [2025-03-03 15:06:39,696 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 15:06:39,697 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-03 15:06:39,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:06:39,697 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-03 15:06:39,697 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2025-03-03 15:06:39,697 INFO L87 Difference]: Start difference. First operand 281889 states and 344345 transitions. Second operand has 14 states, 14 states have (on average 20.428571428571427) internal successors, (286), 14 states have internal predecessors, (286), 0 states have call successors, (0), 0 states 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:06:41,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:06:41,275 INFO L93 Difference]: Finished difference Result 561667 states and 683870 transitions. [2025-03-03 15:06:41,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 15:06:41,276 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 20.428571428571427) internal successors, (286), 14 states have internal predecessors, (286), 0 states have call successors, (0), 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 104 [2025-03-03 15:06:41,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:06:41,642 INFO L225 Difference]: With dead ends: 561667 [2025-03-03 15:06:41,642 INFO L226 Difference]: Without dead ends: 280811 [2025-03-03 15:06:41,733 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 201 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=89, Invalid=253, Unknown=0, NotChecked=0, Total=342 [2025-03-03 15:06:41,734 INFO L435 NwaCegarLoop]: 117 mSDtfsCounter, 1134 mSDsluCounter, 587 mSDsCounter, 0 mSdLazyCounter, 502 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1134 SdHoareTripleChecker+Valid, 704 SdHoareTripleChecker+Invalid, 536 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 502 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 15:06:41,734 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1134 Valid, 704 Invalid, 536 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 502 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 15:06:41,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280811 states.