./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.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.7.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 3fb71e8e4e407700549b8952f3afdeeffa0973a11e08bb7f18bca04e4b75e49d --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 15:17:51,126 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 15:17:51,173 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 15:17:51,177 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 15:17:51,178 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 15:17:51,195 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 15:17:51,196 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 15:17:51,196 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 15:17:51,197 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 15:17:51,197 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 15:17:51,197 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 15:17:51,198 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 15:17:51,198 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 15:17:51,198 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 15:17:51,198 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 15:17:51,198 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 15:17:51,198 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 15:17:51,198 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 15:17:51,198 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 15:17:51,198 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 15:17:51,199 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 15:17:51,199 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 15:17:51,199 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 15:17:51,199 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 15:17:51,199 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 15:17:51,199 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 15:17:51,199 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 15:17:51,199 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 15:17:51,199 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 15:17:51,200 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 15:17:51,200 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 15:17:51,200 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 15:17:51,200 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 15:17:51,200 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 15:17:51,200 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 15:17:51,200 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 15:17:51,201 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 15:17:51,201 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 15:17:51,201 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 15:17:51,201 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 15:17:51,201 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 15:17:51,201 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 15:17:51,201 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 15:17:51,201 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 -> 3fb71e8e4e407700549b8952f3afdeeffa0973a11e08bb7f18bca04e4b75e49d [2025-03-03 15:17:51,425 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 15:17:51,431 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 15:17:51,433 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 15:17:51,434 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 15:17:51,435 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 15:17:51,436 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.1.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2025-03-03 15:17:52,618 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/751025173/24ae24e36b9e41df89b4fe7a721ef016/FLAG2d3781598 [2025-03-03 15:17:52,870 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 15:17:52,872 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.1.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2025-03-03 15:17:52,887 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/751025173/24ae24e36b9e41df89b4fe7a721ef016/FLAG2d3781598 [2025-03-03 15:17:52,905 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/751025173/24ae24e36b9e41df89b4fe7a721ef016 [2025-03-03 15:17:52,908 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 15:17:52,909 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 15:17:52,911 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 15:17:52,912 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 15:17:52,926 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 15:17:52,926 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 03:17:52" (1/1) ... [2025-03-03 15:17:52,927 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@bf92052 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:17:52, skipping insertion in model container [2025-03-03 15:17:52,929 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 03:17:52" (1/1) ... [2025-03-03 15:17:52,961 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 15:17:53,157 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.7.1.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c[10378,10391] [2025-03-03 15:17:53,190 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 15:17:53,202 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 15:17:53,269 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.7.1.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c[10378,10391] [2025-03-03 15:17:53,299 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 15:17:53,313 INFO L204 MainTranslator]: Completed translation [2025-03-03 15:17:53,313 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:17:53 WrapperNode [2025-03-03 15:17:53,314 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 15:17:53,315 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 15:17:53,315 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 15:17:53,315 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 15:17:53,320 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:17:53" (1/1) ... [2025-03-03 15:17:53,333 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:17:53" (1/1) ... [2025-03-03 15:17:53,361 INFO L138 Inliner]: procedures = 27, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 904 [2025-03-03 15:17:53,362 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 15:17:53,362 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 15:17:53,362 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 15:17:53,362 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 15:17:53,371 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:17:53" (1/1) ... [2025-03-03 15:17:53,371 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:17:53" (1/1) ... [2025-03-03 15:17:53,377 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:17:53" (1/1) ... [2025-03-03 15:17:53,399 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:17:53,403 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:17:53" (1/1) ... [2025-03-03 15:17:53,403 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:17:53" (1/1) ... [2025-03-03 15:17:53,413 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:17:53" (1/1) ... [2025-03-03 15:17:53,415 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:17:53" (1/1) ... [2025-03-03 15:17:53,418 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:17:53" (1/1) ... [2025-03-03 15:17:53,423 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:17:53" (1/1) ... [2025-03-03 15:17:53,426 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 15:17:53,430 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 15:17:53,430 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 15:17:53,430 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 15:17:53,431 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:17:53" (1/1) ... [2025-03-03 15:17:53,440 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 15:17:53,449 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 15:17:53,462 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:17:53,469 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:17:53,484 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 15:17:53,484 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 15:17:53,484 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 15:17:53,484 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 15:17:53,594 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 15:17:53,596 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 15:17:54,273 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L598: havoc main_~node3__m3~2#1; [2025-03-03 15:17:54,274 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L814: havoc main_~node3____CPAchecker_TMP_0~1#1; [2025-03-03 15:17:54,274 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L583: havoc main_~node2__m2~2#1; [2025-03-03 15:17:54,274 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L769: havoc main_~node4____CPAchecker_TMP_0~1#1; [2025-03-03 15:17:54,274 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L507: havoc main_~node7__m7~1#1;havoc main_~node6__m6~1#1;havoc main_~node5__m5~1#1;havoc main_~node4__m4~1#1;havoc main_~node3__m3~1#1;havoc main_~node2__m2~1#1;havoc main_~node1__m1~1#1;havoc main_~__tmp_1~0#1, main_~assert__arg~0#1;havoc main_~check__tmp~0#1;havoc main_~node7____CPAchecker_TMP_0~0#1;havoc main_~node7__m7~0#1;havoc main_~node6____CPAchecker_TMP_0~0#1;havoc main_~node6__m6~0#1;havoc main_~node5____CPAchecker_TMP_0~0#1;havoc main_~node5__m5~0#1;havoc main_~node4____CPAchecker_TMP_0~0#1;havoc main_~node4__m4~0#1;havoc main_~node3____CPAchecker_TMP_0~0#1;havoc main_~node3__m3~0#1;havoc main_~node2____CPAchecker_TMP_0~0#1;havoc main_~node2__m2~0#1;havoc main_~node1____CPAchecker_TMP_0~0#1;havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2025-03-03 15:17:54,274 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L724: havoc main_~node5____CPAchecker_TMP_0~1#1; [2025-03-03 15:17:54,274 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L991: havoc main_~node7____CPAchecker_TMP_0~1#1; [2025-03-03 15:17:54,274 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L859: havoc main_~node2____CPAchecker_TMP_0~1#1; [2025-03-03 15:17:54,274 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L628: havoc main_~node5__m5~2#1; [2025-03-03 15:17:54,274 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L563: havoc main_~node1__m1~2#1;havoc main_~__tmp_2~0#1, main_~assert__arg~1#1;havoc main_~check__tmp~1#1; [2025-03-03 15:17:54,275 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L910: havoc main_~node1____CPAchecker_TMP_0~1#1; [2025-03-03 15:17:54,275 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L679: havoc main_~node6____CPAchecker_TMP_0~1#1;havoc main_~node6__m6~2#1; [2025-03-03 15:17:54,275 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L613: havoc main_~node4__m4~2#1; [2025-03-03 15:17:54,311 INFO L? ?]: Removed 102 outVars from TransFormulas that were not future-live. [2025-03-03 15:17:54,311 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 15:17:54,323 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 15:17:54,326 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 15:17:54,326 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 03:17:54 BoogieIcfgContainer [2025-03-03 15:17:54,326 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 15:17:54,328 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 15:17:54,328 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 15:17:54,331 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 15:17:54,332 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 03:17:52" (1/3) ... [2025-03-03 15:17:54,332 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14391de5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 03:17:54, skipping insertion in model container [2025-03-03 15:17:54,332 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:17:53" (2/3) ... [2025-03-03 15:17:54,332 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14391de5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 03:17:54, skipping insertion in model container [2025-03-03 15:17:54,332 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 03:17:54" (3/3) ... [2025-03-03 15:17:54,333 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr.7.1.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2025-03-03 15:17:54,343 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 15:17:54,346 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_lcr.7.1.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c that has 1 procedures, 201 locations, 1 initial locations, 0 loop locations, and 1 error locations. [2025-03-03 15:17:54,389 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 15:17:54,400 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;@51fd8903, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 15:17:54,400 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 15:17:54,403 INFO L276 IsEmpty]: Start isEmpty. Operand has 201 states, 199 states have (on average 1.763819095477387) internal successors, (351), 200 states have internal predecessors, (351), 0 states have call successors, (0), 0 states 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:17:54,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-03-03 15:17:54,410 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:17:54,410 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:17:54,411 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:17:54,415 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:17:54,415 INFO L85 PathProgramCache]: Analyzing trace with hash 1129340721, now seen corresponding path program 1 times [2025-03-03 15:17:54,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:17:54,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996338937] [2025-03-03 15:17:54,420 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:17:54,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:17:54,514 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-03-03 15:17:54,620 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-03-03 15:17:54,620 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:17:54,620 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:17:55,153 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:17:55,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:17:55,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [996338937] [2025-03-03 15:17:55,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [996338937] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:17:55,154 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:17:55,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-03 15:17:55,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522822691] [2025-03-03 15:17:55,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:17:55,158 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 15:17:55,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:17:55,180 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 15:17:55,182 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:17:55,186 INFO L87 Difference]: Start difference. First operand has 201 states, 199 states have (on average 1.763819095477387) internal successors, (351), 200 states have internal predecessors, (351), 0 states have call successors, (0), 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 9 states, 9 states have (on average 11.88888888888889) internal successors, (107), 9 states have internal predecessors, (107), 0 states have call successors, (0), 0 states 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:17:55,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:17:55,811 INFO L93 Difference]: Finished difference Result 1440 states and 2328 transitions. [2025-03-03 15:17:55,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-03 15:17:55,813 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 11.88888888888889) internal successors, (107), 9 states have internal predecessors, (107), 0 states have call successors, (0), 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 107 [2025-03-03 15:17:55,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:17:55,832 INFO L225 Difference]: With dead ends: 1440 [2025-03-03 15:17:55,834 INFO L226 Difference]: Without dead ends: 1332 [2025-03-03 15:17:55,839 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=124, Invalid=256, Unknown=0, NotChecked=0, Total=380 [2025-03-03 15:17:55,841 INFO L435 NwaCegarLoop]: 1070 mSDtfsCounter, 2429 mSDsluCounter, 6748 mSDsCounter, 0 mSdLazyCounter, 564 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2429 SdHoareTripleChecker+Valid, 7818 SdHoareTripleChecker+Invalid, 575 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 564 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 15:17:55,842 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2429 Valid, 7818 Invalid, 575 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 564 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 15:17:55,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1332 states. [2025-03-03 15:17:55,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1332 to 303. [2025-03-03 15:17:55,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 303 states, 302 states have (on average 1.4503311258278146) internal successors, (438), 302 states have internal predecessors, (438), 0 states have call successors, (0), 0 states 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:17:55,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 438 transitions. [2025-03-03 15:17:55,900 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 438 transitions. Word has length 107 [2025-03-03 15:17:55,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:17:55,901 INFO L471 AbstractCegarLoop]: Abstraction has 303 states and 438 transitions. [2025-03-03 15:17:55,902 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.88888888888889) internal successors, (107), 9 states have internal predecessors, (107), 0 states have call successors, (0), 0 states 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:17:55,902 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 438 transitions. [2025-03-03 15:17:55,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-03-03 15:17:55,907 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:17:55,907 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:17:55,907 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 15:17:55,907 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:17:55,908 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:17:55,908 INFO L85 PathProgramCache]: Analyzing trace with hash 1117734741, now seen corresponding path program 1 times [2025-03-03 15:17:55,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:17:55,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [707564246] [2025-03-03 15:17:55,908 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:17:55,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:17:55,936 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-03 15:17:55,959 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-03 15:17:55,962 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:17:55,962 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:17:56,228 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:17:56,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:17:56,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [707564246] [2025-03-03 15:17:56,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [707564246] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:17:56,228 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:17:56,228 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-03 15:17:56,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1967805658] [2025-03-03 15:17:56,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:17:56,229 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 15:17:56,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:17:56,229 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 15:17:56,229 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:17:56,229 INFO L87 Difference]: Start difference. First operand 303 states and 438 transitions. Second operand has 9 states, 9 states have (on average 12.11111111111111) internal successors, (109), 9 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:17:56,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:17:56,588 INFO L93 Difference]: Finished difference Result 1559 states and 2435 transitions. [2025-03-03 15:17:56,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 15:17:56,590 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 12.11111111111111) internal successors, (109), 9 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 109 [2025-03-03 15:17:56,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:17:56,594 INFO L225 Difference]: With dead ends: 1559 [2025-03-03 15:17:56,594 INFO L226 Difference]: Without dead ends: 1399 [2025-03-03 15:17:56,599 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2025-03-03 15:17:56,600 INFO L435 NwaCegarLoop]: 1040 mSDtfsCounter, 1716 mSDsluCounter, 3780 mSDsCounter, 0 mSdLazyCounter, 450 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1716 SdHoareTripleChecker+Valid, 4820 SdHoareTripleChecker+Invalid, 457 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 450 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 15:17:56,601 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1716 Valid, 4820 Invalid, 457 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 450 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 15:17:56,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1399 states. [2025-03-03 15:17:56,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1399 to 482. [2025-03-03 15:17:56,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 482 states, 481 states have (on average 1.5051975051975053) internal successors, (724), 481 states have internal predecessors, (724), 0 states have call successors, (0), 0 states 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:17:56,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 482 states to 482 states and 724 transitions. [2025-03-03 15:17:56,635 INFO L78 Accepts]: Start accepts. Automaton has 482 states and 724 transitions. Word has length 109 [2025-03-03 15:17:56,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:17:56,635 INFO L471 AbstractCegarLoop]: Abstraction has 482 states and 724 transitions. [2025-03-03 15:17:56,635 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.11111111111111) internal successors, (109), 9 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:17:56,636 INFO L276 IsEmpty]: Start isEmpty. Operand 482 states and 724 transitions. [2025-03-03 15:17:56,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-03-03 15:17:56,637 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:17:56,637 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:17:56,637 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 15:17:56,637 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:17:56,639 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:17:56,639 INFO L85 PathProgramCache]: Analyzing trace with hash 138871629, now seen corresponding path program 1 times [2025-03-03 15:17:56,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:17:56,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1514186274] [2025-03-03 15:17:56,639 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:17:56,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:17:56,667 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-03 15:17:56,686 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-03 15:17:56,687 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:17:56,688 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:17:56,938 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:17:56,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:17:56,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1514186274] [2025-03-03 15:17:56,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1514186274] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:17:56,939 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:17:56,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-03 15:17:56,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1916516416] [2025-03-03 15:17:56,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:17:56,939 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 15:17:56,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:17:56,939 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 15:17:56,940 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:17:56,940 INFO L87 Difference]: Start difference. First operand 482 states and 724 transitions. Second operand has 9 states, 9 states have (on average 12.11111111111111) internal successors, (109), 9 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:17:57,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:17:57,239 INFO L93 Difference]: Finished difference Result 1738 states and 2721 transitions. [2025-03-03 15:17:57,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 15:17:57,240 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 12.11111111111111) internal successors, (109), 9 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 109 [2025-03-03 15:17:57,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:17:57,249 INFO L225 Difference]: With dead ends: 1738 [2025-03-03 15:17:57,249 INFO L226 Difference]: Without dead ends: 1578 [2025-03-03 15:17:57,250 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2025-03-03 15:17:57,251 INFO L435 NwaCegarLoop]: 930 mSDtfsCounter, 1709 mSDsluCounter, 3237 mSDsCounter, 0 mSdLazyCounter, 412 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1709 SdHoareTripleChecker+Valid, 4167 SdHoareTripleChecker+Invalid, 419 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 412 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 15:17:57,251 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1709 Valid, 4167 Invalid, 419 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 412 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 15:17:57,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1578 states. [2025-03-03 15:17:57,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1578 to 740. [2025-03-03 15:17:57,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 740 states, 739 states have (on average 1.537212449255751) internal successors, (1136), 739 states have internal predecessors, (1136), 0 states have call successors, (0), 0 states 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:17:57,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 740 states to 740 states and 1136 transitions. [2025-03-03 15:17:57,270 INFO L78 Accepts]: Start accepts. Automaton has 740 states and 1136 transitions. Word has length 109 [2025-03-03 15:17:57,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:17:57,270 INFO L471 AbstractCegarLoop]: Abstraction has 740 states and 1136 transitions. [2025-03-03 15:17:57,270 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.11111111111111) internal successors, (109), 9 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:17:57,270 INFO L276 IsEmpty]: Start isEmpty. Operand 740 states and 1136 transitions. [2025-03-03 15:17:57,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-03-03 15:17:57,272 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:17:57,272 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:17:57,272 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 15:17:57,272 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:17:57,272 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:17:57,272 INFO L85 PathProgramCache]: Analyzing trace with hash -708736427, now seen corresponding path program 1 times [2025-03-03 15:17:57,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:17:57,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1478022130] [2025-03-03 15:17:57,273 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:17:57,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:17:57,290 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-03 15:17:57,304 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-03 15:17:57,305 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:17:57,305 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:17:57,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:17:57,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:17:57,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1478022130] [2025-03-03 15:17:57,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1478022130] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:17:57,495 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:17:57,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-03 15:17:57,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1958424977] [2025-03-03 15:17:57,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:17:57,495 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 15:17:57,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:17:57,496 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 15:17:57,496 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:17:57,496 INFO L87 Difference]: Start difference. First operand 740 states and 1136 transitions. Second operand has 9 states, 9 states have (on average 12.11111111111111) internal successors, (109), 9 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:17:57,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:17:57,795 INFO L93 Difference]: Finished difference Result 1912 states and 2999 transitions. [2025-03-03 15:17:57,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 15:17:57,796 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 12.11111111111111) internal successors, (109), 9 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 109 [2025-03-03 15:17:57,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:17:57,803 INFO L225 Difference]: With dead ends: 1912 [2025-03-03 15:17:57,803 INFO L226 Difference]: Without dead ends: 1752 [2025-03-03 15:17:57,805 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2025-03-03 15:17:57,807 INFO L435 NwaCegarLoop]: 820 mSDtfsCounter, 1815 mSDsluCounter, 2886 mSDsCounter, 0 mSdLazyCounter, 377 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1815 SdHoareTripleChecker+Valid, 3706 SdHoareTripleChecker+Invalid, 384 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 377 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 15:17:57,808 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1815 Valid, 3706 Invalid, 384 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 377 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 15:17:57,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1752 states. [2025-03-03 15:17:57,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1752 to 914. [2025-03-03 15:17:57,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 914 states, 913 states have (on average 1.5487404162102958) internal successors, (1414), 913 states have internal predecessors, (1414), 0 states have call successors, (0), 0 states 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:17:57,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 914 states to 914 states and 1414 transitions. [2025-03-03 15:17:57,839 INFO L78 Accepts]: Start accepts. Automaton has 914 states and 1414 transitions. Word has length 109 [2025-03-03 15:17:57,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:17:57,839 INFO L471 AbstractCegarLoop]: Abstraction has 914 states and 1414 transitions. [2025-03-03 15:17:57,840 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.11111111111111) internal successors, (109), 9 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:17:57,840 INFO L276 IsEmpty]: Start isEmpty. Operand 914 states and 1414 transitions. [2025-03-03 15:17:57,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-03-03 15:17:57,841 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:17:57,841 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:17:57,841 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 15:17:57,841 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:17:57,841 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:17:57,842 INFO L85 PathProgramCache]: Analyzing trace with hash -217866163, now seen corresponding path program 1 times [2025-03-03 15:17:57,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:17:57,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1281583451] [2025-03-03 15:17:57,842 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:17:57,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:17:57,858 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-03 15:17:57,870 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-03 15:17:57,871 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:17:57,871 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:17:58,079 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:17:58,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:17:58,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1281583451] [2025-03-03 15:17:58,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1281583451] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:17:58,080 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:17:58,080 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-03 15:17:58,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721652455] [2025-03-03 15:17:58,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:17:58,080 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 15:17:58,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:17:58,080 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 15:17:58,081 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:17:58,081 INFO L87 Difference]: Start difference. First operand 914 states and 1414 transitions. Second operand has 9 states, 9 states have (on average 12.11111111111111) internal successors, (109), 9 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:17:58,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:17:58,361 INFO L93 Difference]: Finished difference Result 2081 states and 3269 transitions. [2025-03-03 15:17:58,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 15:17:58,361 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 12.11111111111111) internal successors, (109), 9 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 109 [2025-03-03 15:17:58,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:17:58,368 INFO L225 Difference]: With dead ends: 2081 [2025-03-03 15:17:58,368 INFO L226 Difference]: Without dead ends: 1921 [2025-03-03 15:17:58,369 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2025-03-03 15:17:58,370 INFO L435 NwaCegarLoop]: 710 mSDtfsCounter, 1922 mSDsluCounter, 2416 mSDsCounter, 0 mSdLazyCounter, 289 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1922 SdHoareTripleChecker+Valid, 3126 SdHoareTripleChecker+Invalid, 296 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 289 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 15:17:58,370 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1922 Valid, 3126 Invalid, 296 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 289 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 15:17:58,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1921 states. [2025-03-03 15:17:58,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1921 to 1083. [2025-03-03 15:17:58,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1083 states, 1082 states have (on average 1.5563770794824399) internal successors, (1684), 1082 states have internal predecessors, (1684), 0 states have call successors, (0), 0 states 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:17:58,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1083 states to 1083 states and 1684 transitions. [2025-03-03 15:17:58,398 INFO L78 Accepts]: Start accepts. Automaton has 1083 states and 1684 transitions. Word has length 109 [2025-03-03 15:17:58,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:17:58,398 INFO L471 AbstractCegarLoop]: Abstraction has 1083 states and 1684 transitions. [2025-03-03 15:17:58,399 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.11111111111111) internal successors, (109), 9 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:17:58,399 INFO L276 IsEmpty]: Start isEmpty. Operand 1083 states and 1684 transitions. [2025-03-03 15:17:58,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-03-03 15:17:58,399 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:17:58,399 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:17:58,400 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 15:17:58,400 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:17:58,400 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:17:58,400 INFO L85 PathProgramCache]: Analyzing trace with hash -191754923, now seen corresponding path program 1 times [2025-03-03 15:17:58,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:17:58,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011780679] [2025-03-03 15:17:58,401 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:17:58,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:17:58,417 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-03 15:17:58,430 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-03 15:17:58,430 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:17:58,430 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:17:58,625 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:17:58,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:17:58,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2011780679] [2025-03-03 15:17:58,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2011780679] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:17:58,625 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:17:58,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-03 15:17:58,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711745797] [2025-03-03 15:17:58,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:17:58,626 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 15:17:58,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:17:58,626 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 15:17:58,626 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:17:58,626 INFO L87 Difference]: Start difference. First operand 1083 states and 1684 transitions. Second operand has 9 states, 9 states have (on average 12.11111111111111) internal successors, (109), 9 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:17:58,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:17:58,856 INFO L93 Difference]: Finished difference Result 2245 states and 3531 transitions. [2025-03-03 15:17:58,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 15:17:58,856 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 12.11111111111111) internal successors, (109), 9 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 109 [2025-03-03 15:17:58,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:17:58,862 INFO L225 Difference]: With dead ends: 2245 [2025-03-03 15:17:58,862 INFO L226 Difference]: Without dead ends: 2085 [2025-03-03 15:17:58,863 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2025-03-03 15:17:58,864 INFO L435 NwaCegarLoop]: 600 mSDtfsCounter, 2026 mSDsluCounter, 2536 mSDsCounter, 0 mSdLazyCounter, 267 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2026 SdHoareTripleChecker+Valid, 3136 SdHoareTripleChecker+Invalid, 274 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 267 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:17:58,864 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2026 Valid, 3136 Invalid, 274 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 267 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 15:17:58,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2085 states. [2025-03-03 15:17:58,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2085 to 1247. [2025-03-03 15:17:58,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1247 states, 1246 states have (on average 1.5617977528089888) internal successors, (1946), 1246 states have internal predecessors, (1946), 0 states have call successors, (0), 0 states 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:17:58,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1247 states to 1247 states and 1946 transitions. [2025-03-03 15:17:58,891 INFO L78 Accepts]: Start accepts. Automaton has 1247 states and 1946 transitions. Word has length 109 [2025-03-03 15:17:58,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:17:58,891 INFO L471 AbstractCegarLoop]: Abstraction has 1247 states and 1946 transitions. [2025-03-03 15:17:58,891 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.11111111111111) internal successors, (109), 9 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:17:58,892 INFO L276 IsEmpty]: Start isEmpty. Operand 1247 states and 1946 transitions. [2025-03-03 15:17:58,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-03-03 15:17:58,892 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:17:58,893 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:17:58,893 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 15:17:58,893 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:17:58,893 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:17:58,893 INFO L85 PathProgramCache]: Analyzing trace with hash 1522138445, now seen corresponding path program 1 times [2025-03-03 15:17:58,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:17:58,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349347631] [2025-03-03 15:17:58,894 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:17:58,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:17:58,910 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-03 15:17:58,922 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-03 15:17:58,922 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:17:58,922 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:17:59,079 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:17:59,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:17:59,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1349347631] [2025-03-03 15:17:59,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1349347631] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:17:59,079 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:17:59,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-03 15:17:59,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [853841711] [2025-03-03 15:17:59,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:17:59,080 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 15:17:59,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:17:59,080 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 15:17:59,080 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:17:59,080 INFO L87 Difference]: Start difference. First operand 1247 states and 1946 transitions. Second operand has 9 states, 9 states have (on average 12.11111111111111) internal successors, (109), 9 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:17:59,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:17:59,297 INFO L93 Difference]: Finished difference Result 2404 states and 3785 transitions. [2025-03-03 15:17:59,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 15:17:59,298 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 12.11111111111111) internal successors, (109), 9 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 109 [2025-03-03 15:17:59,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:17:59,304 INFO L225 Difference]: With dead ends: 2404 [2025-03-03 15:17:59,304 INFO L226 Difference]: Without dead ends: 2244 [2025-03-03 15:17:59,304 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2025-03-03 15:17:59,305 INFO L435 NwaCegarLoop]: 490 mSDtfsCounter, 2129 mSDsluCounter, 2839 mSDsCounter, 0 mSdLazyCounter, 248 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2129 SdHoareTripleChecker+Valid, 3329 SdHoareTripleChecker+Invalid, 255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 248 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:17:59,305 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2129 Valid, 3329 Invalid, 255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 248 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 15:17:59,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2244 states. [2025-03-03 15:17:59,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2244 to 1406. [2025-03-03 15:17:59,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1406 states, 1405 states have (on average 1.5658362989323844) internal successors, (2200), 1405 states have internal predecessors, (2200), 0 states have call successors, (0), 0 states 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:17:59,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1406 states to 1406 states and 2200 transitions. [2025-03-03 15:17:59,329 INFO L78 Accepts]: Start accepts. Automaton has 1406 states and 2200 transitions. Word has length 109 [2025-03-03 15:17:59,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:17:59,329 INFO L471 AbstractCegarLoop]: Abstraction has 1406 states and 2200 transitions. [2025-03-03 15:17:59,329 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.11111111111111) internal successors, (109), 9 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:17:59,329 INFO L276 IsEmpty]: Start isEmpty. Operand 1406 states and 2200 transitions. [2025-03-03 15:17:59,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-03-03 15:17:59,330 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:17:59,330 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:17:59,330 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 15:17:59,330 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:17:59,330 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:17:59,330 INFO L85 PathProgramCache]: Analyzing trace with hash 1729982701, now seen corresponding path program 1 times [2025-03-03 15:17:59,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:17:59,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049577258] [2025-03-03 15:17:59,330 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:17:59,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:17:59,344 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-03 15:17:59,355 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-03 15:17:59,355 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:17:59,355 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:17:59,515 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:17:59,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:17:59,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2049577258] [2025-03-03 15:17:59,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2049577258] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:17:59,515 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:17:59,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-03 15:17:59,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677329917] [2025-03-03 15:17:59,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:17:59,515 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 15:17:59,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:17:59,516 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 15:17:59,516 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:17:59,516 INFO L87 Difference]: Start difference. First operand 1406 states and 2200 transitions. Second operand has 9 states, 9 states have (on average 12.11111111111111) internal successors, (109), 9 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:17:59,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:17:59,771 INFO L93 Difference]: Finished difference Result 2562 states and 4038 transitions. [2025-03-03 15:17:59,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 15:17:59,772 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 12.11111111111111) internal successors, (109), 9 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 109 [2025-03-03 15:17:59,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:17:59,778 INFO L225 Difference]: With dead ends: 2562 [2025-03-03 15:17:59,778 INFO L226 Difference]: Without dead ends: 2402 [2025-03-03 15:17:59,779 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2025-03-03 15:17:59,779 INFO L435 NwaCegarLoop]: 388 mSDtfsCounter, 2223 mSDsluCounter, 3336 mSDsCounter, 0 mSdLazyCounter, 282 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2223 SdHoareTripleChecker+Valid, 3724 SdHoareTripleChecker+Invalid, 288 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 282 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 15:17:59,779 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2223 Valid, 3724 Invalid, 288 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 282 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 15:17:59,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2402 states. [2025-03-03 15:17:59,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2402 to 1564. [2025-03-03 15:17:59,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1564 states, 1563 states have (on average 1.5694177863083814) internal successors, (2453), 1563 states have internal predecessors, (2453), 0 states have call successors, (0), 0 states 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:17:59,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1564 states to 1564 states and 2453 transitions. [2025-03-03 15:17:59,806 INFO L78 Accepts]: Start accepts. Automaton has 1564 states and 2453 transitions. Word has length 109 [2025-03-03 15:17:59,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:17:59,806 INFO L471 AbstractCegarLoop]: Abstraction has 1564 states and 2453 transitions. [2025-03-03 15:17:59,806 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.11111111111111) internal successors, (109), 9 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:17:59,806 INFO L276 IsEmpty]: Start isEmpty. Operand 1564 states and 2453 transitions. [2025-03-03 15:17:59,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-03-03 15:17:59,807 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:17:59,807 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:17:59,807 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 15:17:59,817 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:17:59,817 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:17:59,817 INFO L85 PathProgramCache]: Analyzing trace with hash -1291262470, now seen corresponding path program 1 times [2025-03-03 15:17:59,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:17:59,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1269302133] [2025-03-03 15:17:59,817 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:17:59,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:17:59,831 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-03 15:17:59,839 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-03 15:17:59,839 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:17:59,839 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:17:59,882 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:17:59,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:17:59,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1269302133] [2025-03-03 15:17:59,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1269302133] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:17:59,883 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:17:59,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:17:59,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320963362] [2025-03-03 15:17:59,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:17:59,883 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:17:59,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:17:59,883 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:17:59,883 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:17:59,884 INFO L87 Difference]: Start difference. First operand 1564 states and 2453 transitions. Second operand has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:17:59,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:17:59,922 INFO L93 Difference]: Finished difference Result 4144 states and 6563 transitions. [2025-03-03 15:17:59,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:17:59,922 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 109 [2025-03-03 15:17:59,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:17:59,930 INFO L225 Difference]: With dead ends: 4144 [2025-03-03 15:17:59,930 INFO L226 Difference]: Without dead ends: 2799 [2025-03-03 15:17:59,932 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:17:59,932 INFO L435 NwaCegarLoop]: 381 mSDtfsCounter, 115 mSDsluCounter, 256 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 637 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:17:59,933 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 637 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:17:59,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2799 states. [2025-03-03 15:17:59,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2799 to 2763. [2025-03-03 15:17:59,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2763 states, 2762 states have (on average 1.5658942795076032) internal successors, (4325), 2762 states have internal predecessors, (4325), 0 states have call successors, (0), 0 states 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:17:59,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2763 states to 2763 states and 4325 transitions. [2025-03-03 15:17:59,991 INFO L78 Accepts]: Start accepts. Automaton has 2763 states and 4325 transitions. Word has length 109 [2025-03-03 15:17:59,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:17:59,991 INFO L471 AbstractCegarLoop]: Abstraction has 2763 states and 4325 transitions. [2025-03-03 15:17:59,991 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:17:59,991 INFO L276 IsEmpty]: Start isEmpty. Operand 2763 states and 4325 transitions. [2025-03-03 15:17:59,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-03-03 15:17:59,992 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:17:59,993 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:17:59,993 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 15:17:59,993 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:17:59,993 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:17:59,993 INFO L85 PathProgramCache]: Analyzing trace with hash -1290100621, now seen corresponding path program 1 times [2025-03-03 15:17:59,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:17:59,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1397374978] [2025-03-03 15:17:59,993 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:17:59,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:18:00,012 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-03 15:18:00,023 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-03 15:18:00,023 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:18:00,023 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:18:00,333 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:18:00,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:18:00,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1397374978] [2025-03-03 15:18:00,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1397374978] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:18:00,334 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:18:00,334 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-03 15:18:00,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533683704] [2025-03-03 15:18:00,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:18:00,334 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 15:18:00,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:18:00,334 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 15:18:00,335 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:18:00,335 INFO L87 Difference]: Start difference. First operand 2763 states and 4325 transitions. Second operand has 9 states, 9 states have (on average 12.11111111111111) internal successors, (109), 9 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:18:00,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:18:00,643 INFO L93 Difference]: Finished difference Result 5309 states and 8350 transitions. [2025-03-03 15:18:00,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 15:18:00,644 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 12.11111111111111) internal successors, (109), 9 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 109 [2025-03-03 15:18:00,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:18:00,650 INFO L225 Difference]: With dead ends: 5309 [2025-03-03 15:18:00,650 INFO L226 Difference]: Without dead ends: 2765 [2025-03-03 15:18:00,653 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2025-03-03 15:18:00,653 INFO L435 NwaCegarLoop]: 260 mSDtfsCounter, 660 mSDsluCounter, 966 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 660 SdHoareTripleChecker+Valid, 1226 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:18:00,654 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [660 Valid, 1226 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 15:18:00,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2765 states. [2025-03-03 15:18:00,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2765 to 2763. [2025-03-03 15:18:00,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2763 states, 2762 states have (on average 1.562635771180304) internal successors, (4316), 2762 states have internal predecessors, (4316), 0 states have call successors, (0), 0 states 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:18:00,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2763 states to 2763 states and 4316 transitions. [2025-03-03 15:18:00,703 INFO L78 Accepts]: Start accepts. Automaton has 2763 states and 4316 transitions. Word has length 109 [2025-03-03 15:18:00,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:18:00,705 INFO L471 AbstractCegarLoop]: Abstraction has 2763 states and 4316 transitions. [2025-03-03 15:18:00,705 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.11111111111111) internal successors, (109), 9 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:18:00,705 INFO L276 IsEmpty]: Start isEmpty. Operand 2763 states and 4316 transitions. [2025-03-03 15:18:00,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-03-03 15:18:00,707 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:18:00,707 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:18:00,707 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 15:18:00,707 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:18:00,707 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:18:00,707 INFO L85 PathProgramCache]: Analyzing trace with hash -1369657694, now seen corresponding path program 1 times [2025-03-03 15:18:00,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:18:00,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610059339] [2025-03-03 15:18:00,708 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:18:00,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:18:00,726 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-03 15:18:00,752 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-03 15:18:00,753 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:18:00,753 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:18:00,844 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:18:00,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:18:00,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1610059339] [2025-03-03 15:18:00,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1610059339] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:18:00,844 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:18:00,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 15:18:00,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [794963290] [2025-03-03 15:18:00,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:18:00,844 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:18:00,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:18:00,845 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:18:00,845 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:18:00,845 INFO L87 Difference]: Start difference. First operand 2763 states and 4316 transitions. Second operand has 5 states, 5 states have (on average 22.0) internal successors, (110), 4 states have internal predecessors, (110), 0 states have call successors, (0), 0 states 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:18:01,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:18:01,054 INFO L93 Difference]: Finished difference Result 8111 states and 12741 transitions. [2025-03-03 15:18:01,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 15:18:01,054 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.0) internal successors, (110), 4 states have internal predecessors, (110), 0 states have call successors, (0), 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 110 [2025-03-03 15:18:01,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:18:01,067 INFO L225 Difference]: With dead ends: 8111 [2025-03-03 15:18:01,067 INFO L226 Difference]: Without dead ends: 5404 [2025-03-03 15:18:01,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:18:01,071 INFO L435 NwaCegarLoop]: 146 mSDtfsCounter, 1081 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 207 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1081 SdHoareTripleChecker+Valid, 239 SdHoareTripleChecker+Invalid, 213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 15:18:01,071 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1081 Valid, 239 Invalid, 213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 207 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 15:18:01,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5404 states. [2025-03-03 15:18:01,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5404 to 5402. [2025-03-03 15:18:01,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5402 states, 5401 states have (on average 1.563784484354749) internal successors, (8446), 5401 states have internal predecessors, (8446), 0 states have call successors, (0), 0 states 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:18:01,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5402 states to 5402 states and 8446 transitions. [2025-03-03 15:18:01,144 INFO L78 Accepts]: Start accepts. Automaton has 5402 states and 8446 transitions. Word has length 110 [2025-03-03 15:18:01,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:18:01,144 INFO L471 AbstractCegarLoop]: Abstraction has 5402 states and 8446 transitions. [2025-03-03 15:18:01,144 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.0) internal successors, (110), 4 states have internal predecessors, (110), 0 states have call successors, (0), 0 states 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:18:01,144 INFO L276 IsEmpty]: Start isEmpty. Operand 5402 states and 8446 transitions. [2025-03-03 15:18:01,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-03-03 15:18:01,145 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:18:01,146 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:18:01,146 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-03 15:18:01,146 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:18:01,146 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:18:01,146 INFO L85 PathProgramCache]: Analyzing trace with hash 1414332283, now seen corresponding path program 1 times [2025-03-03 15:18:01,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:18:01,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997465] [2025-03-03 15:18:01,146 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:18:01,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:18:01,160 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-03 15:18:01,171 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-03 15:18:01,171 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:18:01,171 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:18:01,269 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:18:01,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:18:01,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1997465] [2025-03-03 15:18:01,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1997465] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:18:01,269 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:18:01,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 15:18:01,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774708811] [2025-03-03 15:18:01,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:18:01,269 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:18:01,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:18:01,270 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:18:01,270 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:18:01,270 INFO L87 Difference]: Start difference. First operand 5402 states and 8446 transitions. Second operand has 5 states, 5 states have (on average 22.2) internal successors, (111), 4 states have internal predecessors, (111), 0 states have call successors, (0), 0 states 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:18:01,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:18:01,409 INFO L93 Difference]: Finished difference Result 10736 states and 16821 transitions. [2025-03-03 15:18:01,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 15:18:01,410 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.2) internal successors, (111), 4 states have internal predecessors, (111), 0 states have call successors, (0), 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 111 [2025-03-03 15:18:01,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:18:01,422 INFO L225 Difference]: With dead ends: 10736 [2025-03-03 15:18:01,425 INFO L226 Difference]: Without dead ends: 5402 [2025-03-03 15:18:01,431 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:18:01,431 INFO L435 NwaCegarLoop]: 146 mSDtfsCounter, 706 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 706 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:18:01,431 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [706 Valid, 174 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 15:18:01,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5402 states. [2025-03-03 15:18:01,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5402 to 5402. [2025-03-03 15:18:01,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5402 states, 5401 states have (on average 1.551009072394001) internal successors, (8377), 5401 states have internal predecessors, (8377), 0 states have call successors, (0), 0 states 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:18:01,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5402 states to 5402 states and 8377 transitions. [2025-03-03 15:18:01,509 INFO L78 Accepts]: Start accepts. Automaton has 5402 states and 8377 transitions. Word has length 111 [2025-03-03 15:18:01,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:18:01,509 INFO L471 AbstractCegarLoop]: Abstraction has 5402 states and 8377 transitions. [2025-03-03 15:18:01,509 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.2) internal successors, (111), 4 states have internal predecessors, (111), 0 states have call successors, (0), 0 states 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:18:01,509 INFO L276 IsEmpty]: Start isEmpty. Operand 5402 states and 8377 transitions. [2025-03-03 15:18:01,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-03-03 15:18:01,510 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:18:01,510 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:18:01,510 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-03 15:18:01,511 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:18:01,511 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:18:01,511 INFO L85 PathProgramCache]: Analyzing trace with hash -1152912738, now seen corresponding path program 1 times [2025-03-03 15:18:01,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:18:01,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479848726] [2025-03-03 15:18:01,511 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:18:01,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:18:01,525 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-03 15:18:01,540 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-03 15:18:01,540 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:18:01,540 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:18:01,616 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:18:01,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:18:01,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [479848726] [2025-03-03 15:18:01,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [479848726] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:18:01,616 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:18:01,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 15:18:01,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330309538] [2025-03-03 15:18:01,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:18:01,617 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:18:01,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:18:01,617 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:18:01,617 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:18:01,617 INFO L87 Difference]: Start difference. First operand 5402 states and 8377 transitions. Second operand has 5 states, 5 states have (on average 22.4) internal successors, (112), 4 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:18:01,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:18:01,738 INFO L93 Difference]: Finished difference Result 10724 states and 16669 transitions. [2025-03-03 15:18:01,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 15:18:01,739 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.4) internal successors, (112), 4 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 112 [2025-03-03 15:18:01,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:18:01,752 INFO L225 Difference]: With dead ends: 10724 [2025-03-03 15:18:01,752 INFO L226 Difference]: Without dead ends: 5402 [2025-03-03 15:18:01,758 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:18:01,758 INFO L435 NwaCegarLoop]: 150 mSDtfsCounter, 667 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 667 SdHoareTripleChecker+Valid, 202 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:18:01,759 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [667 Valid, 202 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 15:18:01,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5402 states. [2025-03-03 15:18:01,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5402 to 5402. [2025-03-03 15:18:01,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5402 states, 5401 states have (on average 1.5382336604332532) internal successors, (8308), 5401 states have internal predecessors, (8308), 0 states have call successors, (0), 0 states 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:18:01,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5402 states to 5402 states and 8308 transitions. [2025-03-03 15:18:01,862 INFO L78 Accepts]: Start accepts. Automaton has 5402 states and 8308 transitions. Word has length 112 [2025-03-03 15:18:01,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:18:01,862 INFO L471 AbstractCegarLoop]: Abstraction has 5402 states and 8308 transitions. [2025-03-03 15:18:01,862 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.4) internal successors, (112), 4 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:18:01,862 INFO L276 IsEmpty]: Start isEmpty. Operand 5402 states and 8308 transitions. [2025-03-03 15:18:01,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-03-03 15:18:01,864 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:18:01,864 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:18:01,865 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-03 15:18:01,865 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:18:01,865 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:18:01,865 INFO L85 PathProgramCache]: Analyzing trace with hash 228299647, now seen corresponding path program 1 times [2025-03-03 15:18:01,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:18:01,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [555994411] [2025-03-03 15:18:01,865 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:18:01,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:18:01,890 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-03 15:18:01,916 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-03 15:18:01,917 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:18:01,917 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:18:01,999 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:18:01,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:18:01,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [555994411] [2025-03-03 15:18:01,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [555994411] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:18:01,999 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:18:01,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 15:18:01,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1830070201] [2025-03-03 15:18:01,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:18:01,999 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:18:01,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:18:02,000 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:18:02,000 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:18:02,000 INFO L87 Difference]: Start difference. First operand 5402 states and 8308 transitions. Second operand has 5 states, 5 states have (on average 22.6) internal successors, (113), 4 states have internal predecessors, (113), 0 states have call successors, (0), 0 states 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:18:02,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:18:02,132 INFO L93 Difference]: Finished difference Result 10732 states and 16541 transitions. [2025-03-03 15:18:02,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 15:18:02,133 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.6) internal successors, (113), 4 states have internal predecessors, (113), 0 states have call successors, (0), 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 113 [2025-03-03 15:18:02,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:18:02,141 INFO L225 Difference]: With dead ends: 10732 [2025-03-03 15:18:02,141 INFO L226 Difference]: Without dead ends: 5402 [2025-03-03 15:18:02,147 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:18:02,148 INFO L435 NwaCegarLoop]: 146 mSDtfsCounter, 682 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 682 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:18:02,148 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [682 Valid, 182 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 15:18:02,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5402 states. [2025-03-03 15:18:02,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5402 to 5402. [2025-03-03 15:18:02,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5402 states, 5401 states have (on average 1.525458248472505) internal successors, (8239), 5401 states have internal predecessors, (8239), 0 states have call successors, (0), 0 states 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:18:02,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5402 states to 5402 states and 8239 transitions. [2025-03-03 15:18:02,213 INFO L78 Accepts]: Start accepts. Automaton has 5402 states and 8239 transitions. Word has length 113 [2025-03-03 15:18:02,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:18:02,213 INFO L471 AbstractCegarLoop]: Abstraction has 5402 states and 8239 transitions. [2025-03-03 15:18:02,213 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.6) internal successors, (113), 4 states have internal predecessors, (113), 0 states have call successors, (0), 0 states 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:18:02,214 INFO L276 IsEmpty]: Start isEmpty. Operand 5402 states and 8239 transitions. [2025-03-03 15:18:02,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2025-03-03 15:18:02,215 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:18:02,215 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:18:02,215 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-03 15:18:02,215 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:18:02,215 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:18:02,215 INFO L85 PathProgramCache]: Analyzing trace with hash -1611948994, now seen corresponding path program 1 times [2025-03-03 15:18:02,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:18:02,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138790264] [2025-03-03 15:18:02,215 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:18:02,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:18:02,229 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-03-03 15:18:02,240 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-03-03 15:18:02,240 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:18:02,240 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:18:02,324 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:18:02,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:18:02,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1138790264] [2025-03-03 15:18:02,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1138790264] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:18:02,324 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:18:02,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 15:18:02,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1234231478] [2025-03-03 15:18:02,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:18:02,325 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:18:02,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:18:02,325 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:18:02,325 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:18:02,325 INFO L87 Difference]: Start difference. First operand 5402 states and 8239 transitions. Second operand has 5 states, 5 states have (on average 22.8) internal successors, (114), 4 states have internal predecessors, (114), 0 states have call successors, (0), 0 states 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:18:02,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:18:02,453 INFO L93 Difference]: Finished difference Result 10744 states and 16417 transitions. [2025-03-03 15:18:02,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 15:18:02,453 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.8) internal successors, (114), 4 states have internal predecessors, (114), 0 states have call successors, (0), 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 114 [2025-03-03 15:18:02,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:18:02,460 INFO L225 Difference]: With dead ends: 10744 [2025-03-03 15:18:02,460 INFO L226 Difference]: Without dead ends: 5402 [2025-03-03 15:18:02,467 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:18:02,467 INFO L435 NwaCegarLoop]: 146 mSDtfsCounter, 710 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 710 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:18:02,467 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [710 Valid, 158 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 15:18:02,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5402 states. [2025-03-03 15:18:02,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5402 to 5402. [2025-03-03 15:18:02,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5402 states, 5401 states have (on average 1.512682836511757) internal successors, (8170), 5401 states have internal predecessors, (8170), 0 states have call successors, (0), 0 states 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:18:02,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5402 states to 5402 states and 8170 transitions. [2025-03-03 15:18:02,529 INFO L78 Accepts]: Start accepts. Automaton has 5402 states and 8170 transitions. Word has length 114 [2025-03-03 15:18:02,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:18:02,529 INFO L471 AbstractCegarLoop]: Abstraction has 5402 states and 8170 transitions. [2025-03-03 15:18:02,529 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.8) internal successors, (114), 4 states have internal predecessors, (114), 0 states have call successors, (0), 0 states 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:18:02,529 INFO L276 IsEmpty]: Start isEmpty. Operand 5402 states and 8170 transitions. [2025-03-03 15:18:02,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-03-03 15:18:02,530 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:18:02,530 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:18:02,531 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-03 15:18:02,531 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:18:02,531 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:18:02,531 INFO L85 PathProgramCache]: Analyzing trace with hash -1064258373, now seen corresponding path program 1 times [2025-03-03 15:18:02,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:18:02,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [36397269] [2025-03-03 15:18:02,531 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:18:02,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:18:02,544 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-03 15:18:02,554 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-03 15:18:02,554 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:18:02,554 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:18:02,621 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:18:02,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:18:02,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [36397269] [2025-03-03 15:18:02,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [36397269] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:18:02,622 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:18:02,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 15:18:02,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [654185278] [2025-03-03 15:18:02,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:18:02,622 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:18:02,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:18:02,622 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:18:02,622 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:18:02,622 INFO L87 Difference]: Start difference. First operand 5402 states and 8170 transitions. Second operand has 5 states, 5 states have (on average 23.0) internal successors, (115), 4 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:18:02,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:18:02,744 INFO L93 Difference]: Finished difference Result 10740 states and 16275 transitions. [2025-03-03 15:18:02,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 15:18:02,745 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 23.0) internal successors, (115), 4 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 115 [2025-03-03 15:18:02,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:18:02,752 INFO L225 Difference]: With dead ends: 10740 [2025-03-03 15:18:02,752 INFO L226 Difference]: Without dead ends: 5402 [2025-03-03 15:18:02,757 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:18:02,758 INFO L435 NwaCegarLoop]: 146 mSDtfsCounter, 692 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 692 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:18:02,758 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [692 Valid, 166 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 15:18:02,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5402 states. [2025-03-03 15:18:02,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5402 to 5402. [2025-03-03 15:18:02,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5402 states, 5401 states have (on average 1.4999074245510091) internal successors, (8101), 5401 states have internal predecessors, (8101), 0 states have call successors, (0), 0 states 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:18:02,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5402 states to 5402 states and 8101 transitions. [2025-03-03 15:18:02,830 INFO L78 Accepts]: Start accepts. Automaton has 5402 states and 8101 transitions. Word has length 115 [2025-03-03 15:18:02,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:18:02,831 INFO L471 AbstractCegarLoop]: Abstraction has 5402 states and 8101 transitions. [2025-03-03 15:18:02,831 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.0) internal successors, (115), 4 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:18:02,831 INFO L276 IsEmpty]: Start isEmpty. Operand 5402 states and 8101 transitions. [2025-03-03 15:18:02,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-03-03 15:18:02,832 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:18:02,832 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:18:02,832 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-03 15:18:02,832 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:18:02,833 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:18:02,833 INFO L85 PathProgramCache]: Analyzing trace with hash -772152774, now seen corresponding path program 1 times [2025-03-03 15:18:02,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:18:02,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1992474037] [2025-03-03 15:18:02,833 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:18:02,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:18:02,852 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-03-03 15:18:02,865 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-03-03 15:18:02,866 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:18:02,866 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:18:02,929 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:18:02,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:18:02,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1992474037] [2025-03-03 15:18:02,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1992474037] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:18:02,929 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:18:02,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 15:18:02,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750972595] [2025-03-03 15:18:02,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:18:02,930 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:18:02,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:18:02,931 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:18:02,931 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:18:02,931 INFO L87 Difference]: Start difference. First operand 5402 states and 8101 transitions. Second operand has 5 states, 5 states have (on average 23.2) internal successors, (116), 4 states have internal predecessors, (116), 0 states have call successors, (0), 0 states 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:18:03,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:18:03,059 INFO L93 Difference]: Finished difference Result 10728 states and 16125 transitions. [2025-03-03 15:18:03,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 15:18:03,060 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 23.2) internal successors, (116), 4 states have internal predecessors, (116), 0 states have call successors, (0), 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 116 [2025-03-03 15:18:03,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:18:03,070 INFO L225 Difference]: With dead ends: 10728 [2025-03-03 15:18:03,071 INFO L226 Difference]: Without dead ends: 5402 [2025-03-03 15:18:03,076 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:18:03,077 INFO L435 NwaCegarLoop]: 146 mSDtfsCounter, 650 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 650 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:18:03,077 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [650 Valid, 190 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 15:18:03,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5402 states. [2025-03-03 15:18:03,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5402 to 5402. [2025-03-03 15:18:03,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5402 states, 5401 states have (on average 1.487132012590261) internal successors, (8032), 5401 states have internal predecessors, (8032), 0 states have call successors, (0), 0 states 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:18:03,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5402 states to 5402 states and 8032 transitions. [2025-03-03 15:18:03,136 INFO L78 Accepts]: Start accepts. Automaton has 5402 states and 8032 transitions. Word has length 116 [2025-03-03 15:18:03,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:18:03,136 INFO L471 AbstractCegarLoop]: Abstraction has 5402 states and 8032 transitions. [2025-03-03 15:18:03,136 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.2) internal successors, (116), 4 states have internal predecessors, (116), 0 states have call successors, (0), 0 states 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:18:03,137 INFO L276 IsEmpty]: Start isEmpty. Operand 5402 states and 8032 transitions. [2025-03-03 15:18:03,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2025-03-03 15:18:03,138 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:18:03,138 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:18:03,138 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-03 15:18:03,138 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:18:03,138 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:18:03,138 INFO L85 PathProgramCache]: Analyzing trace with hash -1521594361, now seen corresponding path program 1 times [2025-03-03 15:18:03,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:18:03,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [120146384] [2025-03-03 15:18:03,139 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:18:03,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:18:03,152 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-03-03 15:18:03,186 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-03-03 15:18:03,186 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:18:03,186 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:18:03,642 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:18:03,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:18:03,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [120146384] [2025-03-03 15:18:03,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [120146384] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:18:03,642 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:18:03,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-03 15:18:03,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [728747143] [2025-03-03 15:18:03,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:18:03,643 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-03 15:18:03,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:18:03,643 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-03 15:18:03,643 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2025-03-03 15:18:03,643 INFO L87 Difference]: Start difference. First operand 5402 states and 8032 transitions. Second operand has 13 states, 13 states have (on average 9.0) internal successors, (117), 12 states have internal predecessors, (117), 0 states have call successors, (0), 0 states 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:18:04,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:18:04,389 INFO L93 Difference]: Finished difference Result 16011 states and 23808 transitions. [2025-03-03 15:18:04,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-03 15:18:04,389 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 9.0) internal successors, (117), 12 states have internal predecessors, (117), 0 states have call successors, (0), 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 117 [2025-03-03 15:18:04,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:18:04,406 INFO L225 Difference]: With dead ends: 16011 [2025-03-03 15:18:04,406 INFO L226 Difference]: Without dead ends: 10782 [2025-03-03 15:18:04,414 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=146, Invalid=454, Unknown=0, NotChecked=0, Total=600 [2025-03-03 15:18:04,414 INFO L435 NwaCegarLoop]: 141 mSDtfsCounter, 1077 mSDsluCounter, 813 mSDsCounter, 0 mSdLazyCounter, 906 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1077 SdHoareTripleChecker+Valid, 954 SdHoareTripleChecker+Invalid, 913 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 906 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 15:18:04,414 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1077 Valid, 954 Invalid, 913 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 906 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 15:18:04,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10782 states. [2025-03-03 15:18:04,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10782 to 5402. [2025-03-03 15:18:04,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5402 states, 5401 states have (on average 1.48602110720237) internal successors, (8026), 5401 states have internal predecessors, (8026), 0 states have call successors, (0), 0 states 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:18:04,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5402 states to 5402 states and 8026 transitions. [2025-03-03 15:18:04,520 INFO L78 Accepts]: Start accepts. Automaton has 5402 states and 8026 transitions. Word has length 117 [2025-03-03 15:18:04,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:18:04,521 INFO L471 AbstractCegarLoop]: Abstraction has 5402 states and 8026 transitions. [2025-03-03 15:18:04,521 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 9.0) internal successors, (117), 12 states have internal predecessors, (117), 0 states have call successors, (0), 0 states 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:18:04,521 INFO L276 IsEmpty]: Start isEmpty. Operand 5402 states and 8026 transitions. [2025-03-03 15:18:04,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-03-03 15:18:04,522 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:18:04,523 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:18:04,523 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-03 15:18:04,523 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:18:04,523 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:18:04,523 INFO L85 PathProgramCache]: Analyzing trace with hash 607749300, now seen corresponding path program 1 times [2025-03-03 15:18:04,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:18:04,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147022407] [2025-03-03 15:18:04,524 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:18:04,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:18:04,550 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-03-03 15:18:04,567 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-03-03 15:18:04,568 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:18:04,569 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:18:04,939 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:18:04,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:18:04,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1147022407] [2025-03-03 15:18:04,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1147022407] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:18:04,940 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:18:04,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-03 15:18:04,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1022393174] [2025-03-03 15:18:04,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:18:04,941 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-03 15:18:04,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:18:04,942 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-03 15:18:04,942 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2025-03-03 15:18:04,942 INFO L87 Difference]: Start difference. First operand 5402 states and 8026 transitions. Second operand has 14 states, 14 states have (on average 8.428571428571429) internal successors, (118), 13 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:18:05,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:18:05,618 INFO L93 Difference]: Finished difference Result 16185 states and 23949 transitions. [2025-03-03 15:18:05,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-03 15:18:05,618 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 8.428571428571429) internal successors, (118), 13 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 118 [2025-03-03 15:18:05,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:18:05,632 INFO L225 Difference]: With dead ends: 16185 [2025-03-03 15:18:05,632 INFO L226 Difference]: Without dead ends: 11013 [2025-03-03 15:18:05,638 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=169, Invalid=533, Unknown=0, NotChecked=0, Total=702 [2025-03-03 15:18:05,639 INFO L435 NwaCegarLoop]: 163 mSDtfsCounter, 1143 mSDsluCounter, 849 mSDsCounter, 0 mSdLazyCounter, 993 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1143 SdHoareTripleChecker+Valid, 1012 SdHoareTripleChecker+Invalid, 1006 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 993 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 15:18:05,639 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1143 Valid, 1012 Invalid, 1006 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 993 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 15:18:05,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11013 states. [2025-03-03 15:18:05,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11013 to 5435. [2025-03-03 15:18:05,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5435 states, 5434 states have (on average 1.4841737210158263) internal successors, (8065), 5434 states have internal predecessors, (8065), 0 states have call successors, (0), 0 states 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:18:05,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5435 states to 5435 states and 8065 transitions. [2025-03-03 15:18:05,731 INFO L78 Accepts]: Start accepts. Automaton has 5435 states and 8065 transitions. Word has length 118 [2025-03-03 15:18:05,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:18:05,731 INFO L471 AbstractCegarLoop]: Abstraction has 5435 states and 8065 transitions. [2025-03-03 15:18:05,732 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 8.428571428571429) internal successors, (118), 13 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:18:05,732 INFO L276 IsEmpty]: Start isEmpty. Operand 5435 states and 8065 transitions. [2025-03-03 15:18:05,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-03-03 15:18:05,733 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:18:05,733 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:18:05,733 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-03 15:18:05,733 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:18:05,733 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:18:05,733 INFO L85 PathProgramCache]: Analyzing trace with hash 518136492, now seen corresponding path program 1 times [2025-03-03 15:18:05,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:18:05,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [793824143] [2025-03-03 15:18:05,733 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:18:05,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:18:05,747 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-03-03 15:18:05,762 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-03-03 15:18:05,763 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:18:05,763 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:18:06,092 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:18:06,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:18:06,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [793824143] [2025-03-03 15:18:06,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [793824143] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:18:06,092 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:18:06,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-03 15:18:06,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761964564] [2025-03-03 15:18:06,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:18:06,093 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-03 15:18:06,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:18:06,093 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-03 15:18:06,094 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2025-03-03 15:18:06,094 INFO L87 Difference]: Start difference. First operand 5435 states and 8065 transitions. Second operand has 13 states, 13 states have (on average 9.076923076923077) internal successors, (118), 12 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:18:06,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:18:06,727 INFO L93 Difference]: Finished difference Result 15824 states and 23489 transitions. [2025-03-03 15:18:06,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-03 15:18:06,728 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 9.076923076923077) internal successors, (118), 12 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 118 [2025-03-03 15:18:06,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:18:06,742 INFO L225 Difference]: With dead ends: 15824 [2025-03-03 15:18:06,742 INFO L226 Difference]: Without dead ends: 10725 [2025-03-03 15:18:06,749 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=146, Invalid=454, Unknown=0, NotChecked=0, Total=600 [2025-03-03 15:18:06,750 INFO L435 NwaCegarLoop]: 141 mSDtfsCounter, 1051 mSDsluCounter, 795 mSDsCounter, 0 mSdLazyCounter, 871 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1051 SdHoareTripleChecker+Valid, 936 SdHoareTripleChecker+Invalid, 879 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 871 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 15:18:06,751 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1051 Valid, 936 Invalid, 879 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 871 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 15:18:06,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10725 states. [2025-03-03 15:18:06,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10725 to 5435. [2025-03-03 15:18:06,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5435 states, 5434 states have (on average 1.4817813765182186) internal successors, (8052), 5434 states have internal predecessors, (8052), 0 states have call successors, (0), 0 states 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:18:06,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5435 states to 5435 states and 8052 transitions. [2025-03-03 15:18:06,845 INFO L78 Accepts]: Start accepts. Automaton has 5435 states and 8052 transitions. Word has length 118 [2025-03-03 15:18:06,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:18:06,845 INFO L471 AbstractCegarLoop]: Abstraction has 5435 states and 8052 transitions. [2025-03-03 15:18:06,846 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 9.076923076923077) internal successors, (118), 12 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:18:06,846 INFO L276 IsEmpty]: Start isEmpty. Operand 5435 states and 8052 transitions. [2025-03-03 15:18:06,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-03-03 15:18:06,847 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:18:06,847 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:18:06,847 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-03 15:18:06,847 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:18:06,848 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:18:06,848 INFO L85 PathProgramCache]: Analyzing trace with hash 2012397017, now seen corresponding path program 1 times [2025-03-03 15:18:06,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:18:06,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864900787] [2025-03-03 15:18:06,848 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:18:06,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:18:06,867 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-03-03 15:18:06,882 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-03-03 15:18:06,883 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:18:06,883 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:18:07,083 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:18:07,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:18:07,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [864900787] [2025-03-03 15:18:07,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [864900787] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:18:07,084 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:18:07,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 15:18:07,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [170341684] [2025-03-03 15:18:07,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:18:07,084 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 15:18:07,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:18:07,084 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 15:18:07,084 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:18:07,084 INFO L87 Difference]: Start difference. First operand 5435 states and 8052 transitions. Second operand has 9 states, 9 states have (on average 13.222222222222221) internal successors, (119), 8 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:18:07,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:18:07,430 INFO L93 Difference]: Finished difference Result 15715 states and 23382 transitions. [2025-03-03 15:18:07,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 15:18:07,431 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 13.222222222222221) internal successors, (119), 8 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 119 [2025-03-03 15:18:07,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:18:07,448 INFO L225 Difference]: With dead ends: 15715 [2025-03-03 15:18:07,448 INFO L226 Difference]: Without dead ends: 10521 [2025-03-03 15:18:07,457 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2025-03-03 15:18:07,458 INFO L435 NwaCegarLoop]: 145 mSDtfsCounter, 577 mSDsluCounter, 500 mSDsCounter, 0 mSdLazyCounter, 489 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 577 SdHoareTripleChecker+Valid, 645 SdHoareTripleChecker+Invalid, 492 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 489 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 15:18:07,458 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [577 Valid, 645 Invalid, 492 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 489 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 15:18:07,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10521 states. [2025-03-03 15:18:07,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10521 to 5435. [2025-03-03 15:18:07,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5435 states, 5434 states have (on average 1.4815973500184028) internal successors, (8051), 5434 states have internal predecessors, (8051), 0 states have call successors, (0), 0 states 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:18:07,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5435 states to 5435 states and 8051 transitions. [2025-03-03 15:18:07,605 INFO L78 Accepts]: Start accepts. Automaton has 5435 states and 8051 transitions. Word has length 119 [2025-03-03 15:18:07,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:18:07,606 INFO L471 AbstractCegarLoop]: Abstraction has 5435 states and 8051 transitions. [2025-03-03 15:18:07,606 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 13.222222222222221) internal successors, (119), 8 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:18:07,606 INFO L276 IsEmpty]: Start isEmpty. Operand 5435 states and 8051 transitions. [2025-03-03 15:18:07,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2025-03-03 15:18:07,609 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:18:07,609 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:18:07,609 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-03 15:18:07,610 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:18:07,610 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:18:07,611 INFO L85 PathProgramCache]: Analyzing trace with hash 1358067236, now seen corresponding path program 1 times [2025-03-03 15:18:07,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:18:07,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [592854959] [2025-03-03 15:18:07,611 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:18:07,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:18:07,634 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-03-03 15:18:07,685 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-03-03 15:18:07,685 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:18:07,685 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:18:07,924 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:18:07,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:18:07,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [592854959] [2025-03-03 15:18:07,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [592854959] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:18:07,924 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:18:07,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-03 15:18:07,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2065742486] [2025-03-03 15:18:07,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:18:07,925 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-03 15:18:07,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:18:07,925 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-03 15:18:07,926 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-03-03 15:18:07,926 INFO L87 Difference]: Start difference. First operand 5435 states and 8051 transitions. Second operand has 10 states, 10 states have (on average 12.0) internal successors, (120), 9 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:18:08,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:18:08,410 INFO L93 Difference]: Finished difference Result 16008 states and 23742 transitions. [2025-03-03 15:18:08,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-03 15:18:08,411 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 12.0) internal successors, (120), 9 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 120 [2025-03-03 15:18:08,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:18:08,426 INFO L225 Difference]: With dead ends: 16008 [2025-03-03 15:18:08,426 INFO L226 Difference]: Without dead ends: 10809 [2025-03-03 15:18:08,433 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=122, Invalid=340, Unknown=0, NotChecked=0, Total=462 [2025-03-03 15:18:08,434 INFO L435 NwaCegarLoop]: 165 mSDtfsCounter, 1340 mSDsluCounter, 644 mSDsCounter, 0 mSdLazyCounter, 707 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1340 SdHoareTripleChecker+Valid, 809 SdHoareTripleChecker+Invalid, 714 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 707 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 15:18:08,434 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1340 Valid, 809 Invalid, 714 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 707 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 15:18:08,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10809 states. [2025-03-03 15:18:08,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10809 to 5402. [2025-03-03 15:18:08,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5402 states, 5401 states have (on average 1.4817626365487873) internal successors, (8003), 5401 states have internal predecessors, (8003), 0 states have call successors, (0), 0 states 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:18:08,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5402 states to 5402 states and 8003 transitions. [2025-03-03 15:18:08,522 INFO L78 Accepts]: Start accepts. Automaton has 5402 states and 8003 transitions. Word has length 120 [2025-03-03 15:18:08,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:18:08,522 INFO L471 AbstractCegarLoop]: Abstraction has 5402 states and 8003 transitions. [2025-03-03 15:18:08,522 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 12.0) internal successors, (120), 9 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:18:08,522 INFO L276 IsEmpty]: Start isEmpty. Operand 5402 states and 8003 transitions. [2025-03-03 15:18:08,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2025-03-03 15:18:08,523 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:18:08,523 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:18:08,523 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-03 15:18:08,523 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:18:08,524 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:18:08,524 INFO L85 PathProgramCache]: Analyzing trace with hash -1198907108, now seen corresponding path program 1 times [2025-03-03 15:18:08,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:18:08,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [115261067] [2025-03-03 15:18:08,525 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:18:08,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:18:08,538 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-03-03 15:18:08,560 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-03-03 15:18:08,560 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:18:08,560 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:18:08,843 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:18:08,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:18:08,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [115261067] [2025-03-03 15:18:08,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [115261067] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:18:08,843 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:18:08,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-03 15:18:08,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1007301954] [2025-03-03 15:18:08,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:18:08,844 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-03 15:18:08,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:18:08,844 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-03 15:18:08,844 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2025-03-03 15:18:08,844 INFO L87 Difference]: Start difference. First operand 5402 states and 8003 transitions. Second operand has 14 states, 14 states have (on average 8.571428571428571) internal successors, (120), 13 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:18:09,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:18:09,507 INFO L93 Difference]: Finished difference Result 16288 states and 24030 transitions. [2025-03-03 15:18:09,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-03 15:18:09,507 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 8.571428571428571) internal successors, (120), 13 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 120 [2025-03-03 15:18:09,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:18:09,522 INFO L225 Difference]: With dead ends: 16288 [2025-03-03 15:18:09,522 INFO L226 Difference]: Without dead ends: 11202 [2025-03-03 15:18:09,527 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=169, Invalid=533, Unknown=0, NotChecked=0, Total=702 [2025-03-03 15:18:09,527 INFO L435 NwaCegarLoop]: 202 mSDtfsCounter, 1662 mSDsluCounter, 1053 mSDsCounter, 0 mSdLazyCounter, 1201 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1662 SdHoareTripleChecker+Valid, 1255 SdHoareTripleChecker+Invalid, 1213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 1201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 15:18:09,528 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1662 Valid, 1255 Invalid, 1213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 1201 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 15:18:09,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11202 states. [2025-03-03 15:18:09,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11202 to 5599. [2025-03-03 15:18:09,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5599 states, 5598 states have (on average 1.4790996784565917) internal successors, (8280), 5598 states have internal predecessors, (8280), 0 states have call successors, (0), 0 states 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:18:09,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5599 states to 5599 states and 8280 transitions. [2025-03-03 15:18:09,595 INFO L78 Accepts]: Start accepts. Automaton has 5599 states and 8280 transitions. Word has length 120 [2025-03-03 15:18:09,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:18:09,596 INFO L471 AbstractCegarLoop]: Abstraction has 5599 states and 8280 transitions. [2025-03-03 15:18:09,596 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 8.571428571428571) internal successors, (120), 13 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:18:09,597 INFO L276 IsEmpty]: Start isEmpty. Operand 5599 states and 8280 transitions. [2025-03-03 15:18:09,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-03-03 15:18:09,598 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:18:09,598 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:18:09,598 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-03 15:18:09,598 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:18:09,599 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:18:09,599 INFO L85 PathProgramCache]: Analyzing trace with hash 1842268769, now seen corresponding path program 1 times [2025-03-03 15:18:09,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:18:09,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1763529734] [2025-03-03 15:18:09,599 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:18:09,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:18:09,610 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-03 15:18:09,642 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-03 15:18:09,643 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:18:09,643 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:18:10,014 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:18:10,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:18:10,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1763529734] [2025-03-03 15:18:10,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1763529734] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:18:10,015 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:18:10,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-03 15:18:10,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [726003607] [2025-03-03 15:18:10,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:18:10,015 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-03 15:18:10,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:18:10,015 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-03 15:18:10,015 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2025-03-03 15:18:10,016 INFO L87 Difference]: Start difference. First operand 5599 states and 8280 transitions. Second operand has 13 states, 13 states have (on average 9.307692307692308) internal successors, (121), 12 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:18:11,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:18:11,029 INFO L93 Difference]: Finished difference Result 34229 states and 50600 transitions. [2025-03-03 15:18:11,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-03 15:18:11,029 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 9.307692307692308) internal successors, (121), 12 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 121 [2025-03-03 15:18:11,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:18:11,067 INFO L225 Difference]: With dead ends: 34229 [2025-03-03 15:18:11,067 INFO L226 Difference]: Without dead ends: 28986 [2025-03-03 15:18:11,082 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 163 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=225, Invalid=645, Unknown=0, NotChecked=0, Total=870 [2025-03-03 15:18:11,083 INFO L435 NwaCegarLoop]: 242 mSDtfsCounter, 1953 mSDsluCounter, 1382 mSDsCounter, 0 mSdLazyCounter, 1444 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1953 SdHoareTripleChecker+Valid, 1624 SdHoareTripleChecker+Invalid, 1471 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 1444 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-03 15:18:11,083 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1953 Valid, 1624 Invalid, 1471 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 1444 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-03 15:18:11,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28986 states. [2025-03-03 15:18:11,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28986 to 5644. [2025-03-03 15:18:11,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5644 states, 5643 states have (on average 1.4743930533404217) internal successors, (8320), 5643 states have internal predecessors, (8320), 0 states have call successors, (0), 0 states 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:18:11,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5644 states to 5644 states and 8320 transitions. [2025-03-03 15:18:11,265 INFO L78 Accepts]: Start accepts. Automaton has 5644 states and 8320 transitions. Word has length 121 [2025-03-03 15:18:11,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:18:11,266 INFO L471 AbstractCegarLoop]: Abstraction has 5644 states and 8320 transitions. [2025-03-03 15:18:11,266 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 9.307692307692308) internal successors, (121), 12 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:18:11,266 INFO L276 IsEmpty]: Start isEmpty. Operand 5644 states and 8320 transitions. [2025-03-03 15:18:11,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-03-03 15:18:11,268 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:18:11,268 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:18:11,268 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-03 15:18:11,268 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:18:11,269 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:18:11,269 INFO L85 PathProgramCache]: Analyzing trace with hash 552531868, now seen corresponding path program 1 times [2025-03-03 15:18:11,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:18:11,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198598518] [2025-03-03 15:18:11,269 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:18:11,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:18:11,285 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-03 15:18:11,303 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-03 15:18:11,304 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:18:11,304 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:18:11,594 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:18:11,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:18:11,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [198598518] [2025-03-03 15:18:11,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [198598518] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:18:11,595 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:18:11,595 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-03 15:18:11,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819091469] [2025-03-03 15:18:11,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:18:11,596 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-03 15:18:11,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:18:11,596 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-03 15:18:11,597 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-03-03 15:18:11,597 INFO L87 Difference]: Start difference. First operand 5644 states and 8320 transitions. Second operand has 10 states, 10 states have (on average 12.2) internal successors, (122), 9 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:18:12,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:18:12,051 INFO L93 Difference]: Finished difference Result 16233 states and 24006 transitions. [2025-03-03 15:18:12,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-03 15:18:12,051 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 12.2) internal successors, (122), 9 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 122 [2025-03-03 15:18:12,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:18:12,062 INFO L225 Difference]: With dead ends: 16233 [2025-03-03 15:18:12,062 INFO L226 Difference]: Without dead ends: 11147 [2025-03-03 15:18:12,068 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=111, Invalid=309, Unknown=0, NotChecked=0, Total=420 [2025-03-03 15:18:12,068 INFO L435 NwaCegarLoop]: 206 mSDtfsCounter, 794 mSDsluCounter, 807 mSDsCounter, 0 mSdLazyCounter, 891 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 794 SdHoareTripleChecker+Valid, 1013 SdHoareTripleChecker+Invalid, 898 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 891 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 15:18:12,068 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [794 Valid, 1013 Invalid, 898 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 891 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 15:18:12,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11147 states. [2025-03-03 15:18:12,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11147 to 5474. [2025-03-03 15:18:12,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5474 states, 5473 states have (on average 1.4778001096290883) internal successors, (8088), 5473 states have internal predecessors, (8088), 0 states have call successors, (0), 0 states 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:18:12,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5474 states to 5474 states and 8088 transitions. [2025-03-03 15:18:12,141 INFO L78 Accepts]: Start accepts. Automaton has 5474 states and 8088 transitions. Word has length 122 [2025-03-03 15:18:12,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:18:12,141 INFO L471 AbstractCegarLoop]: Abstraction has 5474 states and 8088 transitions. [2025-03-03 15:18:12,141 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 12.2) internal successors, (122), 9 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:18:12,141 INFO L276 IsEmpty]: Start isEmpty. Operand 5474 states and 8088 transitions. [2025-03-03 15:18:12,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-03-03 15:18:12,143 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:18:12,143 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:18:12,143 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-03 15:18:12,143 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:18:12,143 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:18:12,143 INFO L85 PathProgramCache]: Analyzing trace with hash 565850676, now seen corresponding path program 1 times [2025-03-03 15:18:12,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:18:12,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315243140] [2025-03-03 15:18:12,143 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:18:12,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:18:12,155 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-03 15:18:12,176 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-03 15:18:12,177 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:18:12,177 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:18:12,372 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:18:12,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:18:12,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1315243140] [2025-03-03 15:18:12,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1315243140] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:18:12,373 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:18:12,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-03 15:18:12,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1618115699] [2025-03-03 15:18:12,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:18:12,373 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-03 15:18:12,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:18:12,373 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-03 15:18:12,373 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-03-03 15:18:12,374 INFO L87 Difference]: Start difference. First operand 5474 states and 8088 transitions. Second operand has 10 states, 10 states have (on average 12.2) internal successors, (122), 9 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:18:12,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:18:12,858 INFO L93 Difference]: Finished difference Result 11507 states and 16998 transitions. [2025-03-03 15:18:12,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-03 15:18:12,859 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 12.2) internal successors, (122), 9 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 122 [2025-03-03 15:18:12,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:18:12,864 INFO L225 Difference]: With dead ends: 11507 [2025-03-03 15:18:12,864 INFO L226 Difference]: Without dead ends: 6206 [2025-03-03 15:18:12,867 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=111, Invalid=309, Unknown=0, NotChecked=0, Total=420 [2025-03-03 15:18:12,868 INFO L435 NwaCegarLoop]: 226 mSDtfsCounter, 550 mSDsluCounter, 884 mSDsCounter, 0 mSdLazyCounter, 978 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 550 SdHoareTripleChecker+Valid, 1110 SdHoareTripleChecker+Invalid, 983 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 978 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 15:18:12,868 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [550 Valid, 1110 Invalid, 983 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 978 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 15:18:12,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6206 states. [2025-03-03 15:18:12,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6206 to 5474. [2025-03-03 15:18:12,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5474 states, 5473 states have (on average 1.4772519641878312) internal successors, (8085), 5473 states have internal predecessors, (8085), 0 states have call successors, (0), 0 states 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:18:12,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5474 states to 5474 states and 8085 transitions. [2025-03-03 15:18:12,926 INFO L78 Accepts]: Start accepts. Automaton has 5474 states and 8085 transitions. Word has length 122 [2025-03-03 15:18:12,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:18:12,926 INFO L471 AbstractCegarLoop]: Abstraction has 5474 states and 8085 transitions. [2025-03-03 15:18:12,927 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 12.2) internal successors, (122), 9 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:18:12,927 INFO L276 IsEmpty]: Start isEmpty. Operand 5474 states and 8085 transitions. [2025-03-03 15:18:12,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-03-03 15:18:12,928 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:18:12,929 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:18:12,930 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-03 15:18:12,930 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:18:12,931 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:18:12,931 INFO L85 PathProgramCache]: Analyzing trace with hash 1733842326, now seen corresponding path program 1 times [2025-03-03 15:18:12,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:18:12,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [349534366] [2025-03-03 15:18:12,931 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:18:12,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:18:12,942 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-03-03 15:18:12,951 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-03-03 15:18:12,951 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:18:12,951 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:18:12,997 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:18:12,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:18:12,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [349534366] [2025-03-03 15:18:12,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [349534366] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:18:12,997 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:18:12,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:18:12,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880017964] [2025-03-03 15:18:12,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:18:12,998 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:18:12,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:18:12,999 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:18:12,999 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:18:12,999 INFO L87 Difference]: Start difference. First operand 5474 states and 8085 transitions. Second operand has 3 states, 3 states have (on average 41.0) internal successors, (123), 3 states have internal predecessors, (123), 0 states have call successors, (0), 0 states 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:18:13,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:18:13,035 INFO L93 Difference]: Finished difference Result 15374 states and 22919 transitions. [2025-03-03 15:18:13,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:18:13,036 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.0) internal successors, (123), 3 states have internal predecessors, (123), 0 states have call successors, (0), 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 123 [2025-03-03 15:18:13,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:18:13,046 INFO L225 Difference]: With dead ends: 15374 [2025-03-03 15:18:13,046 INFO L226 Difference]: Without dead ends: 10288 [2025-03-03 15:18:13,052 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:18:13,053 INFO L435 NwaCegarLoop]: 361 mSDtfsCounter, 132 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 556 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:18:13,053 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 556 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:18:13,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10288 states. [2025-03-03 15:18:13,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10288 to 10014. [2025-03-03 15:18:13,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10014 states, 10013 states have (on average 1.4752821332268051) internal successors, (14772), 10013 states have internal predecessors, (14772), 0 states have call successors, (0), 0 states 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:18:13,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10014 states to 10014 states and 14772 transitions. [2025-03-03 15:18:13,152 INFO L78 Accepts]: Start accepts. Automaton has 10014 states and 14772 transitions. Word has length 123 [2025-03-03 15:18:13,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:18:13,152 INFO L471 AbstractCegarLoop]: Abstraction has 10014 states and 14772 transitions. [2025-03-03 15:18:13,152 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.0) internal successors, (123), 3 states have internal predecessors, (123), 0 states have call successors, (0), 0 states 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:18:13,152 INFO L276 IsEmpty]: Start isEmpty. Operand 10014 states and 14772 transitions. [2025-03-03 15:18:13,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-03-03 15:18:13,153 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:18:13,153 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:18:13,154 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-03 15:18:13,154 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:18:13,154 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:18:13,154 INFO L85 PathProgramCache]: Analyzing trace with hash -874864490, now seen corresponding path program 1 times [2025-03-03 15:18:13,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:18:13,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [699675412] [2025-03-03 15:18:13,154 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:18:13,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:18:13,166 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-03-03 15:18:13,201 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-03-03 15:18:13,201 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:18:13,201 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:18:13,731 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:18:13,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:18:13,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [699675412] [2025-03-03 15:18:13,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [699675412] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:18:13,731 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:18:13,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-03 15:18:13,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1818445351] [2025-03-03 15:18:13,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:18:13,732 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-03 15:18:13,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:18:13,732 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-03 15:18:13,732 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2025-03-03 15:18:13,732 INFO L87 Difference]: Start difference. First operand 10014 states and 14772 transitions. Second operand has 14 states, 14 states have (on average 8.785714285714286) internal successors, (123), 14 states have internal predecessors, (123), 0 states have call successors, (0), 0 states 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:18:14,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:18:14,446 INFO L93 Difference]: Finished difference Result 24453 states and 36146 transitions. [2025-03-03 15:18:14,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-03 15:18:14,446 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 8.785714285714286) internal successors, (123), 14 states have internal predecessors, (123), 0 states have call successors, (0), 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 123 [2025-03-03 15:18:14,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:18:14,467 INFO L225 Difference]: With dead ends: 24453 [2025-03-03 15:18:14,467 INFO L226 Difference]: Without dead ends: 22084 [2025-03-03 15:18:14,474 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=167, Invalid=535, Unknown=0, NotChecked=0, Total=702 [2025-03-03 15:18:14,475 INFO L435 NwaCegarLoop]: 648 mSDtfsCounter, 1164 mSDsluCounter, 4086 mSDsCounter, 0 mSdLazyCounter, 570 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1164 SdHoareTripleChecker+Valid, 4734 SdHoareTripleChecker+Invalid, 575 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 570 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 15:18:14,475 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1164 Valid, 4734 Invalid, 575 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 570 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 15:18:14,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22084 states. [2025-03-03 15:18:14,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22084 to 9947. [2025-03-03 15:18:14,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9947 states, 9946 states have (on average 1.475869696360346) internal successors, (14679), 9946 states have internal predecessors, (14679), 0 states have call successors, (0), 0 states 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:18:14,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9947 states to 9947 states and 14679 transitions. [2025-03-03 15:18:14,617 INFO L78 Accepts]: Start accepts. Automaton has 9947 states and 14679 transitions. Word has length 123 [2025-03-03 15:18:14,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:18:14,617 INFO L471 AbstractCegarLoop]: Abstraction has 9947 states and 14679 transitions. [2025-03-03 15:18:14,617 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 8.785714285714286) internal successors, (123), 14 states have internal predecessors, (123), 0 states have call successors, (0), 0 states 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:18:14,617 INFO L276 IsEmpty]: Start isEmpty. Operand 9947 states and 14679 transitions. [2025-03-03 15:18:14,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-03-03 15:18:14,619 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:18:14,619 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:18:14,619 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-03 15:18:14,619 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:18:14,619 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:18:14,619 INFO L85 PathProgramCache]: Analyzing trace with hash -143545039, now seen corresponding path program 1 times [2025-03-03 15:18:14,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:18:14,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1552304941] [2025-03-03 15:18:14,620 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:18:14,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:18:14,633 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-03-03 15:18:14,656 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-03-03 15:18:14,657 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:18:14,657 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:18:15,076 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:18:15,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:18:15,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1552304941] [2025-03-03 15:18:15,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1552304941] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:18:15,077 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:18:15,077 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-03 15:18:15,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [952418427] [2025-03-03 15:18:15,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:18:15,077 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-03 15:18:15,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:18:15,077 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-03 15:18:15,077 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2025-03-03 15:18:15,078 INFO L87 Difference]: Start difference. First operand 9947 states and 14679 transitions. Second operand has 13 states, 13 states have (on average 9.461538461538462) internal successors, (123), 13 states have internal predecessors, (123), 0 states have call successors, (0), 0 states 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:18:15,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:18:15,588 INFO L93 Difference]: Finished difference Result 22020 states and 32569 transitions. [2025-03-03 15:18:15,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-03 15:18:15,589 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 9.461538461538462) internal successors, (123), 13 states have internal predecessors, (123), 0 states have call successors, (0), 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 123 [2025-03-03 15:18:15,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:18:15,610 INFO L225 Difference]: With dead ends: 22020 [2025-03-03 15:18:15,610 INFO L226 Difference]: Without dead ends: 19674 [2025-03-03 15:18:15,618 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=142, Invalid=458, Unknown=0, NotChecked=0, Total=600 [2025-03-03 15:18:15,618 INFO L435 NwaCegarLoop]: 353 mSDtfsCounter, 921 mSDsluCounter, 2139 mSDsCounter, 0 mSdLazyCounter, 384 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 921 SdHoareTripleChecker+Valid, 2492 SdHoareTripleChecker+Invalid, 388 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 384 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 15:18:15,618 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [921 Valid, 2492 Invalid, 388 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 384 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 15:18:15,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19674 states. [2025-03-03 15:18:15,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19674 to 9890. [2025-03-03 15:18:15,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9890 states, 9889 states have (on average 1.476387905753868) internal successors, (14600), 9889 states have internal predecessors, (14600), 0 states have call successors, (0), 0 states 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:18:15,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9890 states to 9890 states and 14600 transitions. [2025-03-03 15:18:15,748 INFO L78 Accepts]: Start accepts. Automaton has 9890 states and 14600 transitions. Word has length 123 [2025-03-03 15:18:15,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:18:15,748 INFO L471 AbstractCegarLoop]: Abstraction has 9890 states and 14600 transitions. [2025-03-03 15:18:15,748 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 9.461538461538462) internal successors, (123), 13 states have internal predecessors, (123), 0 states have call successors, (0), 0 states 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:18:15,748 INFO L276 IsEmpty]: Start isEmpty. Operand 9890 states and 14600 transitions. [2025-03-03 15:18:15,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-03-03 15:18:15,749 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:18:15,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:18:15,749 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-03-03 15:18:15,749 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:18:15,749 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:18:15,750 INFO L85 PathProgramCache]: Analyzing trace with hash 398503081, now seen corresponding path program 1 times [2025-03-03 15:18:15,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:18:15,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403470734] [2025-03-03 15:18:15,750 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:18:15,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:18:15,760 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-03-03 15:18:15,784 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-03-03 15:18:15,785 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:18:15,785 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:18:18,532 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:18:18,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:18:18,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [403470734] [2025-03-03 15:18:18,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [403470734] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:18:18,533 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:18:18,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [46] imperfect sequences [] total 46 [2025-03-03 15:18:18,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25171132] [2025-03-03 15:18:18,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:18:18,533 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2025-03-03 15:18:18,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:18:18,534 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2025-03-03 15:18:18,534 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=1917, Unknown=0, NotChecked=0, Total=2070 [2025-03-03 15:18:18,535 INFO L87 Difference]: Start difference. First operand 9890 states and 14600 transitions. Second operand has 46 states, 46 states have (on average 2.6739130434782608) internal successors, (123), 46 states have internal predecessors, (123), 0 states have call successors, (0), 0 states 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:18:27,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:18:27,558 INFO L93 Difference]: Finished difference Result 27638 states and 40878 transitions. [2025-03-03 15:18:27,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2025-03-03 15:18:27,558 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 46 states have (on average 2.6739130434782608) internal successors, (123), 46 states have internal predecessors, (123), 0 states have call successors, (0), 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 123 [2025-03-03 15:18:27,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:18:27,583 INFO L225 Difference]: With dead ends: 27638 [2025-03-03 15:18:27,583 INFO L226 Difference]: Without dead ends: 26504 [2025-03-03 15:18:27,591 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1252 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=1037, Invalid=6445, Unknown=0, NotChecked=0, Total=7482 [2025-03-03 15:18:27,591 INFO L435 NwaCegarLoop]: 707 mSDtfsCounter, 2675 mSDsluCounter, 17417 mSDsCounter, 0 mSdLazyCounter, 12226 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2675 SdHoareTripleChecker+Valid, 18124 SdHoareTripleChecker+Invalid, 12255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 12226 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.4s IncrementalHoareTripleChecker+Time [2025-03-03 15:18:27,591 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2675 Valid, 18124 Invalid, 12255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 12226 Invalid, 0 Unknown, 0 Unchecked, 5.4s Time] [2025-03-03 15:18:27,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26504 states. [2025-03-03 15:18:27,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26504 to 9941. [2025-03-03 15:18:27,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9941 states, 9940 states have (on average 1.4756539235412476) internal successors, (14668), 9940 states have internal predecessors, (14668), 0 states have call successors, (0), 0 states 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:18:27,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9941 states to 9941 states and 14668 transitions. [2025-03-03 15:18:27,735 INFO L78 Accepts]: Start accepts. Automaton has 9941 states and 14668 transitions. Word has length 123 [2025-03-03 15:18:27,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:18:27,735 INFO L471 AbstractCegarLoop]: Abstraction has 9941 states and 14668 transitions. [2025-03-03 15:18:27,735 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 46 states have (on average 2.6739130434782608) internal successors, (123), 46 states have internal predecessors, (123), 0 states have call successors, (0), 0 states 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:18:27,735 INFO L276 IsEmpty]: Start isEmpty. Operand 9941 states and 14668 transitions. [2025-03-03 15:18:27,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-03-03 15:18:27,736 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:18:27,736 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:18:27,736 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-03-03 15:18:27,736 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:18:27,736 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:18:27,736 INFO L85 PathProgramCache]: Analyzing trace with hash 21726081, now seen corresponding path program 1 times [2025-03-03 15:18:27,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:18:27,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101876683] [2025-03-03 15:18:27,736 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:18:27,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:18:27,747 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-03-03 15:18:27,765 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-03-03 15:18:27,766 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:18:27,766 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:18:28,169 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:18:28,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:18:28,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [101876683] [2025-03-03 15:18:28,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [101876683] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:18:28,169 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:18:28,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-03 15:18:28,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1746264871] [2025-03-03 15:18:28,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:18:28,169 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-03 15:18:28,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:18:28,170 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-03 15:18:28,170 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2025-03-03 15:18:28,170 INFO L87 Difference]: Start difference. First operand 9941 states and 14668 transitions. Second operand has 14 states, 14 states have (on average 8.785714285714286) internal successors, (123), 14 states have internal predecessors, (123), 0 states have call successors, (0), 0 states 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:18:28,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:18:28,739 INFO L93 Difference]: Finished difference Result 41254 states and 61106 transitions. [2025-03-03 15:18:28,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-03 15:18:28,739 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 8.785714285714286) internal successors, (123), 14 states have internal predecessors, (123), 0 states have call successors, (0), 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 123 [2025-03-03 15:18:28,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:18:28,777 INFO L225 Difference]: With dead ends: 41254 [2025-03-03 15:18:28,777 INFO L226 Difference]: Without dead ends: 38936 [2025-03-03 15:18:28,790 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=167, Invalid=535, Unknown=0, NotChecked=0, Total=702 [2025-03-03 15:18:28,790 INFO L435 NwaCegarLoop]: 332 mSDtfsCounter, 1166 mSDsluCounter, 3291 mSDsCounter, 0 mSdLazyCounter, 586 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1166 SdHoareTripleChecker+Valid, 3623 SdHoareTripleChecker+Invalid, 590 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 586 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 15:18:28,790 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1166 Valid, 3623 Invalid, 590 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 586 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 15:18:28,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38936 states. [2025-03-03 15:18:28,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38936 to 9906. [2025-03-03 15:18:28,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9906 states, 9905 states have (on average 1.475517415446744) internal successors, (14615), 9905 states have internal predecessors, (14615), 0 states have call successors, (0), 0 states 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:18:29,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9906 states to 9906 states and 14615 transitions. [2025-03-03 15:18:29,007 INFO L78 Accepts]: Start accepts. Automaton has 9906 states and 14615 transitions. Word has length 123 [2025-03-03 15:18:29,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:18:29,008 INFO L471 AbstractCegarLoop]: Abstraction has 9906 states and 14615 transitions. [2025-03-03 15:18:29,008 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 8.785714285714286) internal successors, (123), 14 states have internal predecessors, (123), 0 states have call successors, (0), 0 states 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:18:29,008 INFO L276 IsEmpty]: Start isEmpty. Operand 9906 states and 14615 transitions. [2025-03-03 15:18:29,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-03-03 15:18:29,008 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:18:29,008 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:18:29,008 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-03-03 15:18:29,009 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:18:29,009 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:18:29,009 INFO L85 PathProgramCache]: Analyzing trace with hash -379638183, now seen corresponding path program 1 times [2025-03-03 15:18:29,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:18:29,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1058634778] [2025-03-03 15:18:29,009 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:18:29,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:18:29,019 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-03-03 15:18:29,037 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-03-03 15:18:29,037 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:18:29,037 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:18:29,411 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:18:29,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:18:29,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1058634778] [2025-03-03 15:18:29,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1058634778] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:18:29,412 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:18:29,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-03 15:18:29,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1790121620] [2025-03-03 15:18:29,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:18:29,413 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-03 15:18:29,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:18:29,414 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-03 15:18:29,414 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2025-03-03 15:18:29,414 INFO L87 Difference]: Start difference. First operand 9906 states and 14615 transitions. Second operand has 13 states, 13 states have (on average 9.461538461538462) internal successors, (123), 13 states have internal predecessors, (123), 0 states have call successors, (0), 0 states 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:18:29,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:18:29,887 INFO L93 Difference]: Finished difference Result 21880 states and 32373 transitions. [2025-03-03 15:18:29,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-03 15:18:29,887 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 9.461538461538462) internal successors, (123), 13 states have internal predecessors, (123), 0 states have call successors, (0), 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 123 [2025-03-03 15:18:29,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:18:29,903 INFO L225 Difference]: With dead ends: 21880 [2025-03-03 15:18:29,903 INFO L226 Difference]: Without dead ends: 19553 [2025-03-03 15:18:29,909 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=142, Invalid=458, Unknown=0, NotChecked=0, Total=600 [2025-03-03 15:18:29,909 INFO L435 NwaCegarLoop]: 343 mSDtfsCounter, 1090 mSDsluCounter, 1960 mSDsCounter, 0 mSdLazyCounter, 359 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1090 SdHoareTripleChecker+Valid, 2303 SdHoareTripleChecker+Invalid, 363 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 359 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 15:18:29,909 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1090 Valid, 2303 Invalid, 363 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 359 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 15:18:29,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19553 states. [2025-03-03 15:18:30,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19553 to 9848. [2025-03-03 15:18:30,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9848 states, 9847 states have (on average 1.4765918553874275) internal successors, (14540), 9847 states have internal predecessors, (14540), 0 states have call successors, (0), 0 states 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:18:30,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9848 states to 9848 states and 14540 transitions. [2025-03-03 15:18:30,035 INFO L78 Accepts]: Start accepts. Automaton has 9848 states and 14540 transitions. Word has length 123 [2025-03-03 15:18:30,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:18:30,035 INFO L471 AbstractCegarLoop]: Abstraction has 9848 states and 14540 transitions. [2025-03-03 15:18:30,035 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 9.461538461538462) internal successors, (123), 13 states have internal predecessors, (123), 0 states have call successors, (0), 0 states 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:18:30,035 INFO L276 IsEmpty]: Start isEmpty. Operand 9848 states and 14540 transitions. [2025-03-03 15:18:30,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-03-03 15:18:30,035 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:18:30,036 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:18:30,036 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-03-03 15:18:30,036 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:18:30,036 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:18:30,036 INFO L85 PathProgramCache]: Analyzing trace with hash 1438993215, now seen corresponding path program 1 times [2025-03-03 15:18:30,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:18:30,036 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357738014] [2025-03-03 15:18:30,036 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:18:30,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:18:30,047 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-03-03 15:18:30,060 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-03-03 15:18:30,060 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:18:30,060 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:18:30,221 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:18:30,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:18:30,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1357738014] [2025-03-03 15:18:30,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1357738014] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:18:30,221 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:18:30,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-03 15:18:30,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405891355] [2025-03-03 15:18:30,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:18:30,222 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-03 15:18:30,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:18:30,222 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-03 15:18:30,222 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-03-03 15:18:30,222 INFO L87 Difference]: Start difference. First operand 9848 states and 14540 transitions. Second operand has 10 states, 10 states have (on average 12.3) internal successors, (123), 9 states have internal predecessors, (123), 0 states have call successors, (0), 0 states 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:18:30,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:18:30,679 INFO L93 Difference]: Finished difference Result 29456 states and 43489 transitions. [2025-03-03 15:18:30,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-03 15:18:30,680 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 12.3) internal successors, (123), 9 states have internal predecessors, (123), 0 states have call successors, (0), 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 123 [2025-03-03 15:18:30,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:18:30,697 INFO L225 Difference]: With dead ends: 29456 [2025-03-03 15:18:30,697 INFO L226 Difference]: Without dead ends: 19791 [2025-03-03 15:18:30,703 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=122, Invalid=340, Unknown=0, NotChecked=0, Total=462 [2025-03-03 15:18:30,704 INFO L435 NwaCegarLoop]: 212 mSDtfsCounter, 1003 mSDsluCounter, 833 mSDsCounter, 0 mSdLazyCounter, 900 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1003 SdHoareTripleChecker+Valid, 1045 SdHoareTripleChecker+Invalid, 906 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 900 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 15:18:30,704 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1003 Valid, 1045 Invalid, 906 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 900 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 15:18:30,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19791 states. [2025-03-03 15:18:30,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19791 to 9839. [2025-03-03 15:18:30,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9839 states, 9838 states have (on average 1.4767229111608051) internal successors, (14528), 9838 states have internal predecessors, (14528), 0 states have call successors, (0), 0 states 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:18:30,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9839 states to 9839 states and 14528 transitions. [2025-03-03 15:18:30,820 INFO L78 Accepts]: Start accepts. Automaton has 9839 states and 14528 transitions. Word has length 123 [2025-03-03 15:18:30,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:18:30,820 INFO L471 AbstractCegarLoop]: Abstraction has 9839 states and 14528 transitions. [2025-03-03 15:18:30,820 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 12.3) internal successors, (123), 9 states have internal predecessors, (123), 0 states have call successors, (0), 0 states 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:18:30,820 INFO L276 IsEmpty]: Start isEmpty. Operand 9839 states and 14528 transitions. [2025-03-03 15:18:30,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-03-03 15:18:30,820 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:18:30,820 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:18:30,820 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-03-03 15:18:30,821 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:18:30,821 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:18:30,821 INFO L85 PathProgramCache]: Analyzing trace with hash 1282090721, now seen corresponding path program 1 times [2025-03-03 15:18:30,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:18:30,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912090] [2025-03-03 15:18:30,821 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:18:30,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:18:30,832 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-03-03 15:18:30,853 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-03-03 15:18:30,853 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:18:30,853 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:18:33,581 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:18:33,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:18:33,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [912090] [2025-03-03 15:18:33,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [912090] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:18:33,582 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:18:33,582 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [46] imperfect sequences [] total 46 [2025-03-03 15:18:33,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666999599] [2025-03-03 15:18:33,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:18:33,582 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2025-03-03 15:18:33,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:18:33,583 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2025-03-03 15:18:33,583 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=1925, Unknown=0, NotChecked=0, Total=2070 [2025-03-03 15:18:33,583 INFO L87 Difference]: Start difference. First operand 9839 states and 14528 transitions. Second operand has 46 states, 46 states have (on average 2.6739130434782608) internal successors, (123), 46 states have internal predecessors, (123), 0 states have call successors, (0), 0 states 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:18:42,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:18:42,522 INFO L93 Difference]: Finished difference Result 17890 states and 26414 transitions. [2025-03-03 15:18:42,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2025-03-03 15:18:42,522 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 46 states have (on average 2.6739130434782608) internal successors, (123), 46 states have internal predecessors, (123), 0 states have call successors, (0), 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 123 [2025-03-03 15:18:42,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:18:42,538 INFO L225 Difference]: With dead ends: 17890 [2025-03-03 15:18:42,538 INFO L226 Difference]: Without dead ends: 16756 [2025-03-03 15:18:42,544 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1067 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=1116, Invalid=6366, Unknown=0, NotChecked=0, Total=7482 [2025-03-03 15:18:42,545 INFO L435 NwaCegarLoop]: 727 mSDtfsCounter, 2965 mSDsluCounter, 16449 mSDsCounter, 0 mSdLazyCounter, 11611 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2965 SdHoareTripleChecker+Valid, 17176 SdHoareTripleChecker+Invalid, 11634 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 11611 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:18:42,545 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2965 Valid, 17176 Invalid, 11634 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 11611 Invalid, 0 Unknown, 0 Unchecked, 5.1s Time] [2025-03-03 15:18:42,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16756 states. [2025-03-03 15:18:42,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16756 to 9868. [2025-03-03 15:18:42,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9868 states, 9867 states have (on average 1.47603121516165) internal successors, (14564), 9867 states have internal predecessors, (14564), 0 states have call successors, (0), 0 states 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:18:42,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9868 states to 9868 states and 14564 transitions. [2025-03-03 15:18:42,652 INFO L78 Accepts]: Start accepts. Automaton has 9868 states and 14564 transitions. Word has length 123 [2025-03-03 15:18:42,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:18:42,653 INFO L471 AbstractCegarLoop]: Abstraction has 9868 states and 14564 transitions. [2025-03-03 15:18:42,653 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 46 states have (on average 2.6739130434782608) internal successors, (123), 46 states have internal predecessors, (123), 0 states have call successors, (0), 0 states 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:18:42,653 INFO L276 IsEmpty]: Start isEmpty. Operand 9868 states and 14564 transitions. [2025-03-03 15:18:42,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-03-03 15:18:42,654 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:18:42,654 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:18:42,654 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-03-03 15:18:42,654 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:18:42,654 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:18:42,654 INFO L85 PathProgramCache]: Analyzing trace with hash -1562117898, now seen corresponding path program 1 times [2025-03-03 15:18:42,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:18:42,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1215188492] [2025-03-03 15:18:42,655 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:18:42,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:18:42,687 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-03-03 15:18:42,702 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-03-03 15:18:42,702 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:18:42,702 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:18:43,039 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:18:43,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:18:43,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1215188492] [2025-03-03 15:18:43,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1215188492] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:18:43,039 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:18:43,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-03 15:18:43,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1400052785] [2025-03-03 15:18:43,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:18:43,040 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-03 15:18:43,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:18:43,040 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-03 15:18:43,040 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2025-03-03 15:18:43,040 INFO L87 Difference]: Start difference. First operand 9868 states and 14564 transitions. Second operand has 12 states, 12 states have (on average 10.25) internal successors, (123), 12 states have internal predecessors, (123), 0 states have call successors, (0), 0 states 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:18:43,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:18:43,382 INFO L93 Difference]: Finished difference Result 21760 states and 32222 transitions. [2025-03-03 15:18:43,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-03 15:18:43,383 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 10.25) internal successors, (123), 12 states have internal predecessors, (123), 0 states have call successors, (0), 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 123 [2025-03-03 15:18:43,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:18:43,400 INFO L225 Difference]: With dead ends: 21760 [2025-03-03 15:18:43,400 INFO L226 Difference]: Without dead ends: 19432 [2025-03-03 15:18:43,408 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=135, Invalid=327, Unknown=0, NotChecked=0, Total=462 [2025-03-03 15:18:43,408 INFO L435 NwaCegarLoop]: 222 mSDtfsCounter, 868 mSDsluCounter, 1203 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 868 SdHoareTripleChecker+Valid, 1425 SdHoareTripleChecker+Invalid, 216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:18:43,408 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [868 Valid, 1425 Invalid, 216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 15:18:43,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19432 states. [2025-03-03 15:18:43,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19432 to 9806. [2025-03-03 15:18:43,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9806 states, 9805 states have (on average 1.4776134625191228) internal successors, (14488), 9805 states have internal predecessors, (14488), 0 states have call successors, (0), 0 states 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:18:43,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9806 states to 9806 states and 14488 transitions. [2025-03-03 15:18:43,541 INFO L78 Accepts]: Start accepts. Automaton has 9806 states and 14488 transitions. Word has length 123 [2025-03-03 15:18:43,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:18:43,541 INFO L471 AbstractCegarLoop]: Abstraction has 9806 states and 14488 transitions. [2025-03-03 15:18:43,541 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 10.25) internal successors, (123), 12 states have internal predecessors, (123), 0 states have call successors, (0), 0 states 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:18:43,541 INFO L276 IsEmpty]: Start isEmpty. Operand 9806 states and 14488 transitions. [2025-03-03 15:18:43,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-03-03 15:18:43,542 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:18:43,542 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:18:43,542 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-03-03 15:18:43,542 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:18:43,542 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:18:43,542 INFO L85 PathProgramCache]: Analyzing trace with hash 2032136526, now seen corresponding path program 1 times [2025-03-03 15:18:43,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:18:43,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [209378291] [2025-03-03 15:18:43,543 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:18:43,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:18:43,554 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-03-03 15:18:43,572 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-03-03 15:18:43,573 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:18:43,573 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:18:44,048 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:18:44,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:18:44,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [209378291] [2025-03-03 15:18:44,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [209378291] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:18:44,048 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:18:44,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-03 15:18:44,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449520575] [2025-03-03 15:18:44,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:18:44,049 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-03 15:18:44,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:18:44,049 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-03 15:18:44,049 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2025-03-03 15:18:44,049 INFO L87 Difference]: Start difference. First operand 9806 states and 14488 transitions. Second operand has 13 states, 13 states have (on average 9.538461538461538) internal successors, (124), 13 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:18:44,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:18:44,481 INFO L93 Difference]: Finished difference Result 21716 states and 32168 transitions. [2025-03-03 15:18:44,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-03 15:18:44,482 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 9.538461538461538) internal successors, (124), 13 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 124 [2025-03-03 15:18:44,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:18:44,497 INFO L225 Difference]: With dead ends: 21716 [2025-03-03 15:18:44,497 INFO L226 Difference]: Without dead ends: 19436 [2025-03-03 15:18:44,503 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=142, Invalid=458, Unknown=0, NotChecked=0, Total=600 [2025-03-03 15:18:44,503 INFO L435 NwaCegarLoop]: 326 mSDtfsCounter, 1039 mSDsluCounter, 1863 mSDsCounter, 0 mSdLazyCounter, 363 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1039 SdHoareTripleChecker+Valid, 2189 SdHoareTripleChecker+Invalid, 367 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 363 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 15:18:44,503 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1039 Valid, 2189 Invalid, 367 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 363 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 15:18:44,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19436 states. [2025-03-03 15:18:44,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19436 to 9775. [2025-03-03 15:18:44,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9775 states, 9774 states have (on average 1.4783098015142213) internal successors, (14449), 9774 states have internal predecessors, (14449), 0 states have call successors, (0), 0 states 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:18:44,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9775 states to 9775 states and 14449 transitions. [2025-03-03 15:18:44,609 INFO L78 Accepts]: Start accepts. Automaton has 9775 states and 14449 transitions. Word has length 124 [2025-03-03 15:18:44,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:18:44,609 INFO L471 AbstractCegarLoop]: Abstraction has 9775 states and 14449 transitions. [2025-03-03 15:18:44,609 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 9.538461538461538) internal successors, (124), 13 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:18:44,609 INFO L276 IsEmpty]: Start isEmpty. Operand 9775 states and 14449 transitions. [2025-03-03 15:18:44,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-03-03 15:18:44,609 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:18:44,609 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:18:44,610 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2025-03-03 15:18:44,610 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:18:44,610 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:18:44,610 INFO L85 PathProgramCache]: Analyzing trace with hash -278484014, now seen corresponding path program 1 times [2025-03-03 15:18:44,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:18:44,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [304906037] [2025-03-03 15:18:44,610 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:18:44,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:18:44,620 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-03-03 15:18:44,654 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-03-03 15:18:44,654 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:18:44,654 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:18:45,000 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:18:45,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:18:45,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [304906037] [2025-03-03 15:18:45,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [304906037] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:18:45,003 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:18:45,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-03 15:18:45,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562117732] [2025-03-03 15:18:45,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:18:45,005 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-03 15:18:45,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:18:45,005 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-03 15:18:45,006 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2025-03-03 15:18:45,006 INFO L87 Difference]: Start difference. First operand 9775 states and 14449 transitions. Second operand has 14 states, 14 states have (on average 8.857142857142858) internal successors, (124), 14 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:18:45,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:18:45,563 INFO L93 Difference]: Finished difference Result 40935 states and 60709 transitions. [2025-03-03 15:18:45,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-03 15:18:45,564 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 8.857142857142858) internal successors, (124), 14 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 124 [2025-03-03 15:18:45,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:18:45,603 INFO L225 Difference]: With dead ends: 40935 [2025-03-03 15:18:45,603 INFO L226 Difference]: Without dead ends: 38669 [2025-03-03 15:18:45,616 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=167, Invalid=535, Unknown=0, NotChecked=0, Total=702 [2025-03-03 15:18:45,616 INFO L435 NwaCegarLoop]: 548 mSDtfsCounter, 1255 mSDsluCounter, 4219 mSDsCounter, 0 mSdLazyCounter, 581 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1255 SdHoareTripleChecker+Valid, 4767 SdHoareTripleChecker+Invalid, 586 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 581 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 15:18:45,616 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1255 Valid, 4767 Invalid, 586 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 581 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 15:18:45,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38669 states. [2025-03-03 15:18:45,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38669 to 9779. [2025-03-03 15:18:45,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9779 states, 9778 states have (on average 1.4783186745755779) internal successors, (14455), 9778 states have internal predecessors, (14455), 0 states have call successors, (0), 0 states 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:18:45,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9779 states to 9779 states and 14455 transitions. [2025-03-03 15:18:45,869 INFO L78 Accepts]: Start accepts. Automaton has 9779 states and 14455 transitions. Word has length 124 [2025-03-03 15:18:45,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:18:45,869 INFO L471 AbstractCegarLoop]: Abstraction has 9779 states and 14455 transitions. [2025-03-03 15:18:45,869 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 8.857142857142858) internal successors, (124), 14 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:18:45,869 INFO L276 IsEmpty]: Start isEmpty. Operand 9779 states and 14455 transitions. [2025-03-03 15:18:45,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-03-03 15:18:45,869 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:18:45,869 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:18:45,869 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2025-03-03 15:18:45,870 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:18:45,870 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:18:45,870 INFO L85 PathProgramCache]: Analyzing trace with hash -1806514987, now seen corresponding path program 1 times [2025-03-03 15:18:45,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:18:45,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [119965671] [2025-03-03 15:18:45,870 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:18:45,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:18:45,884 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-03-03 15:18:45,914 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-03-03 15:18:45,914 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:18:45,914 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:18:46,019 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:18:46,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:18:46,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [119965671] [2025-03-03 15:18:46,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [119965671] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:18:46,020 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:18:46,020 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 15:18:46,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040641980] [2025-03-03 15:18:46,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:18:46,020 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 15:18:46,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:18:46,021 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 15:18:46,021 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 15:18:46,021 INFO L87 Difference]: Start difference. First operand 9779 states and 14455 transitions. Second operand has 4 states, 4 states have (on average 31.0) internal successors, (124), 4 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:18:46,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:18:46,091 INFO L93 Difference]: Finished difference Result 23579 states and 34961 transitions. [2025-03-03 15:18:46,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 15:18:46,091 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 31.0) internal successors, (124), 4 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 124 [2025-03-03 15:18:46,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:18:46,103 INFO L225 Difference]: With dead ends: 23579 [2025-03-03 15:18:46,104 INFO L226 Difference]: Without dead ends: 13953 [2025-03-03 15:18:46,112 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:18:46,112 INFO L435 NwaCegarLoop]: 239 mSDtfsCounter, 115 mSDsluCounter, 349 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 588 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:18:46,112 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 588 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:18:46,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13953 states. [2025-03-03 15:18:46,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13953 to 13891. [2025-03-03 15:18:46,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13891 states, 13890 states have (on average 1.472930165586753) internal successors, (20459), 13890 states have internal predecessors, (20459), 0 states have call successors, (0), 0 states 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:18:46,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13891 states to 13891 states and 20459 transitions. [2025-03-03 15:18:46,261 INFO L78 Accepts]: Start accepts. Automaton has 13891 states and 20459 transitions. Word has length 124 [2025-03-03 15:18:46,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:18:46,261 INFO L471 AbstractCegarLoop]: Abstraction has 13891 states and 20459 transitions. [2025-03-03 15:18:46,261 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 31.0) internal successors, (124), 4 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:18:46,261 INFO L276 IsEmpty]: Start isEmpty. Operand 13891 states and 20459 transitions. [2025-03-03 15:18:46,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-03-03 15:18:46,262 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:18:46,262 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:18:46,262 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2025-03-03 15:18:46,262 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:18:46,262 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:18:46,262 INFO L85 PathProgramCache]: Analyzing trace with hash -1774310916, now seen corresponding path program 1 times [2025-03-03 15:18:46,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:18:46,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336487708] [2025-03-03 15:18:46,262 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:18:46,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:18:46,274 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-03-03 15:18:46,311 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-03-03 15:18:46,311 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:18:46,311 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:18:46,432 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:18:46,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:18:46,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1336487708] [2025-03-03 15:18:46,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1336487708] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:18:46,432 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:18:46,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 15:18:46,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1301954167] [2025-03-03 15:18:46,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:18:46,432 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:18:46,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:18:46,436 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:18:46,436 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:18:46,436 INFO L87 Difference]: Start difference. First operand 13891 states and 20459 transitions. Second operand has 5 states, 5 states have (on average 24.8) internal successors, (124), 5 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:18:46,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:18:46,468 INFO L93 Difference]: Finished difference Result 13957 states and 20556 transitions. [2025-03-03 15:18:46,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 15:18:46,469 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 24.8) internal successors, (124), 5 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 124 [2025-03-03 15:18:46,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:18:46,480 INFO L225 Difference]: With dead ends: 13957 [2025-03-03 15:18:46,480 INFO L226 Difference]: Without dead ends: 13955 [2025-03-03 15:18:46,484 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:18:46,484 INFO L435 NwaCegarLoop]: 243 mSDtfsCounter, 0 mSDsluCounter, 718 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 961 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:18:46,484 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 961 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:18:46,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13955 states. [2025-03-03 15:18:46,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13955 to 13955. [2025-03-03 15:18:46,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13955 states, 13954 states have (on average 1.465887917443027) internal successors, (20455), 13954 states have internal predecessors, (20455), 0 states have call successors, (0), 0 states 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:18:46,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13955 states to 13955 states and 20455 transitions. [2025-03-03 15:18:46,590 INFO L78 Accepts]: Start accepts. Automaton has 13955 states and 20455 transitions. Word has length 124 [2025-03-03 15:18:46,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:18:46,590 INFO L471 AbstractCegarLoop]: Abstraction has 13955 states and 20455 transitions. [2025-03-03 15:18:46,590 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.8) internal successors, (124), 5 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:18:46,590 INFO L276 IsEmpty]: Start isEmpty. Operand 13955 states and 20455 transitions. [2025-03-03 15:18:46,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-03-03 15:18:46,592 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:18:46,592 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:18:46,592 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2025-03-03 15:18:46,592 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:18:46,593 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:18:46,593 INFO L85 PathProgramCache]: Analyzing trace with hash -2014751236, now seen corresponding path program 1 times [2025-03-03 15:18:46,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:18:46,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1613232652] [2025-03-03 15:18:46,593 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:18:46,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:18:46,604 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-03-03 15:18:46,614 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-03-03 15:18:46,614 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:18:46,614 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:18:46,684 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:18:46,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:18:46,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1613232652] [2025-03-03 15:18:46,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1613232652] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:18:46,684 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:18:46,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 15:18:46,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1100779861] [2025-03-03 15:18:46,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:18:46,685 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 15:18:46,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:18:46,685 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 15:18:46,685 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-03 15:18:46,685 INFO L87 Difference]: Start difference. First operand 13955 states and 20455 transitions. Second operand has 7 states, 7 states have (on average 22.857142857142858) internal successors, (160), 6 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:18:47,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:18:47,018 INFO L93 Difference]: Finished difference Result 47725 states and 70440 transitions. [2025-03-03 15:18:47,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 15:18:47,018 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 22.857142857142858) internal successors, (160), 6 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 160 [2025-03-03 15:18:47,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:18:47,046 INFO L225 Difference]: With dead ends: 47725 [2025-03-03 15:18:47,046 INFO L226 Difference]: Without dead ends: 33923 [2025-03-03 15:18:47,057 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2025-03-03 15:18:47,057 INFO L435 NwaCegarLoop]: 184 mSDtfsCounter, 1070 mSDsluCounter, 437 mSDsCounter, 0 mSdLazyCounter, 480 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1070 SdHoareTripleChecker+Valid, 621 SdHoareTripleChecker+Invalid, 490 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 480 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 15:18:47,057 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1070 Valid, 621 Invalid, 490 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 480 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 15:18:47,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33923 states. [2025-03-03 15:18:47,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33923 to 20689. [2025-03-03 15:18:47,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20689 states, 20688 states have (on average 1.4675174013921113) internal successors, (30360), 20688 states have internal predecessors, (30360), 0 states have call successors, (0), 0 states 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:18:47,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20689 states to 20689 states and 30360 transitions. [2025-03-03 15:18:47,266 INFO L78 Accepts]: Start accepts. Automaton has 20689 states and 30360 transitions. Word has length 160 [2025-03-03 15:18:47,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:18:47,266 INFO L471 AbstractCegarLoop]: Abstraction has 20689 states and 30360 transitions. [2025-03-03 15:18:47,266 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 22.857142857142858) internal successors, (160), 6 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:18:47,266 INFO L276 IsEmpty]: Start isEmpty. Operand 20689 states and 30360 transitions. [2025-03-03 15:18:47,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-03-03 15:18:47,269 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:18:47,269 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:18:47,269 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2025-03-03 15:18:47,269 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:18:47,269 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:18:47,269 INFO L85 PathProgramCache]: Analyzing trace with hash -207215300, now seen corresponding path program 1 times [2025-03-03 15:18:47,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:18:47,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426957621] [2025-03-03 15:18:47,269 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:18:47,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:18:47,282 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-03-03 15:18:47,291 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-03-03 15:18:47,292 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:18:47,292 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:18:47,365 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:18:47,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:18:47,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426957621] [2025-03-03 15:18:47,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [426957621] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:18:47,366 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:18:47,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 15:18:47,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2037069340] [2025-03-03 15:18:47,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:18:47,366 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 15:18:47,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:18:47,366 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 15:18:47,366 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-03 15:18:47,366 INFO L87 Difference]: Start difference. First operand 20689 states and 30360 transitions. Second operand has 7 states, 7 states have (on average 22.857142857142858) internal successors, (160), 6 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:18:47,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:18:47,712 INFO L93 Difference]: Finished difference Result 85973 states and 126822 transitions. [2025-03-03 15:18:47,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 15:18:47,712 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 22.857142857142858) internal successors, (160), 6 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 160 [2025-03-03 15:18:47,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:18:47,772 INFO L225 Difference]: With dead ends: 85973 [2025-03-03 15:18:47,772 INFO L226 Difference]: Without dead ends: 65475 [2025-03-03 15:18:47,791 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2025-03-03 15:18:47,791 INFO L435 NwaCegarLoop]: 140 mSDtfsCounter, 1424 mSDsluCounter, 348 mSDsCounter, 0 mSdLazyCounter, 348 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1424 SdHoareTripleChecker+Valid, 488 SdHoareTripleChecker+Invalid, 362 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 348 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 15:18:47,792 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1424 Valid, 488 Invalid, 362 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 348 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 15:18:47,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65475 states. [2025-03-03 15:18:48,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65475 to 43825. [2025-03-03 15:18:48,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43825 states, 43824 states have (on average 1.4649963490324935) internal successors, (64202), 43824 states have internal predecessors, (64202), 0 states have call successors, (0), 0 states 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:18:48,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43825 states to 43825 states and 64202 transitions. [2025-03-03 15:18:48,374 INFO L78 Accepts]: Start accepts. Automaton has 43825 states and 64202 transitions. Word has length 160 [2025-03-03 15:18:48,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:18:48,374 INFO L471 AbstractCegarLoop]: Abstraction has 43825 states and 64202 transitions. [2025-03-03 15:18:48,374 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 22.857142857142858) internal successors, (160), 6 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:18:48,374 INFO L276 IsEmpty]: Start isEmpty. Operand 43825 states and 64202 transitions. [2025-03-03 15:18:48,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-03-03 15:18:48,378 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:18:48,378 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:18:48,378 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2025-03-03 15:18:48,378 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:18:48,378 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:18:48,378 INFO L85 PathProgramCache]: Analyzing trace with hash 850171004, now seen corresponding path program 1 times [2025-03-03 15:18:48,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:18:48,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731023812] [2025-03-03 15:18:48,379 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:18:48,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:18:48,397 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-03-03 15:18:48,411 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-03-03 15:18:48,411 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:18:48,411 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:18:48,520 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:18:48,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:18:48,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [731023812] [2025-03-03 15:18:48,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [731023812] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:18:48,521 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:18:48,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 15:18:48,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986505354] [2025-03-03 15:18:48,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:18:48,521 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 15:18:48,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:18:48,522 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 15:18:48,522 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-03 15:18:48,522 INFO L87 Difference]: Start difference. First operand 43825 states and 64202 transitions. Second operand has 7 states, 7 states have (on average 22.857142857142858) internal successors, (160), 6 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:18:49,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:18:49,034 INFO L93 Difference]: Finished difference Result 169109 states and 248676 transitions. [2025-03-03 15:18:49,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 15:18:49,035 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 22.857142857142858) internal successors, (160), 6 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 160 [2025-03-03 15:18:49,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:18:49,158 INFO L225 Difference]: With dead ends: 169109 [2025-03-03 15:18:49,158 INFO L226 Difference]: Without dead ends: 125475 [2025-03-03 15:18:49,213 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2025-03-03 15:18:49,213 INFO L435 NwaCegarLoop]: 140 mSDtfsCounter, 1339 mSDsluCounter, 346 mSDsCounter, 0 mSdLazyCounter, 341 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1339 SdHoareTripleChecker+Valid, 486 SdHoareTripleChecker+Invalid, 355 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 341 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 15:18:49,213 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1339 Valid, 486 Invalid, 355 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 341 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 15:18:49,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125475 states. [2025-03-03 15:18:50,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125475 to 92737. [2025-03-03 15:18:50,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92737 states, 92736 states have (on average 1.4620212215320911) internal successors, (135582), 92736 states have internal predecessors, (135582), 0 states have call successors, (0), 0 states 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:18:50,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92737 states to 92737 states and 135582 transitions. [2025-03-03 15:18:50,433 INFO L78 Accepts]: Start accepts. Automaton has 92737 states and 135582 transitions. Word has length 160 [2025-03-03 15:18:50,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:18:50,433 INFO L471 AbstractCegarLoop]: Abstraction has 92737 states and 135582 transitions. [2025-03-03 15:18:50,433 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 22.857142857142858) internal successors, (160), 6 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:18:50,433 INFO L276 IsEmpty]: Start isEmpty. Operand 92737 states and 135582 transitions. [2025-03-03 15:18:50,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-03-03 15:18:50,437 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:18:50,437 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:18:50,437 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2025-03-03 15:18:50,437 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:18:50,438 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:18:50,438 INFO L85 PathProgramCache]: Analyzing trace with hash -630467684, now seen corresponding path program 1 times [2025-03-03 15:18:50,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:18:50,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1045901490] [2025-03-03 15:18:50,438 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:18:50,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:18:50,449 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-03-03 15:18:50,458 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-03-03 15:18:50,458 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:18:50,458 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:18:50,537 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:18:50,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:18:50,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1045901490] [2025-03-03 15:18:50,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1045901490] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:18:50,537 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:18:50,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 15:18:50,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [222835837] [2025-03-03 15:18:50,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:18:50,538 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 15:18:50,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:18:50,540 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 15:18:50,540 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-03 15:18:50,540 INFO L87 Difference]: Start difference. First operand 92737 states and 135582 transitions. Second operand has 7 states, 7 states have (on average 22.857142857142858) internal successors, (160), 6 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:18:51,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:18:51,621 INFO L93 Difference]: Finished difference Result 332741 states and 487632 transitions. [2025-03-03 15:18:51,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 15:18:51,622 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 22.857142857142858) internal successors, (160), 6 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 160 [2025-03-03 15:18:51,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:18:51,968 INFO L225 Difference]: With dead ends: 332741 [2025-03-03 15:18:51,968 INFO L226 Difference]: Without dead ends: 240195 [2025-03-03 15:18:52,046 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2025-03-03 15:18:52,055 INFO L435 NwaCegarLoop]: 140 mSDtfsCounter, 1254 mSDsluCounter, 344 mSDsCounter, 0 mSdLazyCounter, 334 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1254 SdHoareTripleChecker+Valid, 484 SdHoareTripleChecker+Invalid, 348 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 334 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 15:18:52,056 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1254 Valid, 484 Invalid, 348 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 334 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 15:18:52,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240195 states. [2025-03-03 15:18:54,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240195 to 195841. [2025-03-03 15:18:54,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195841 states, 195840 states have (on average 1.459017565359477) internal successors, (285734), 195840 states have internal predecessors, (285734), 0 states have call successors, (0), 0 states 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:18:54,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195841 states to 195841 states and 285734 transitions. [2025-03-03 15:18:54,939 INFO L78 Accepts]: Start accepts. Automaton has 195841 states and 285734 transitions. Word has length 160 [2025-03-03 15:18:54,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:18:54,939 INFO L471 AbstractCegarLoop]: Abstraction has 195841 states and 285734 transitions. [2025-03-03 15:18:54,939 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 22.857142857142858) internal successors, (160), 6 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:18:54,940 INFO L276 IsEmpty]: Start isEmpty. Operand 195841 states and 285734 transitions. [2025-03-03 15:18:54,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-03-03 15:18:54,945 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:18:54,945 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:18:54,945 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2025-03-03 15:18:54,945 INFO L396 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:18:54,946 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:18:54,946 INFO L85 PathProgramCache]: Analyzing trace with hash -913421444, now seen corresponding path program 1 times [2025-03-03 15:18:54,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:18:54,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [937157001] [2025-03-03 15:18:54,946 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:18:54,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:18:54,963 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-03-03 15:18:54,977 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-03-03 15:18:54,977 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:18:54,977 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:18:55,084 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:18:55,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:18:55,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [937157001] [2025-03-03 15:18:55,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [937157001] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:18:55,085 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:18:55,085 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 15:18:55,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646927812] [2025-03-03 15:18:55,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:18:55,085 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 15:18:55,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:18:55,086 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 15:18:55,086 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-03 15:18:55,086 INFO L87 Difference]: Start difference. First operand 195841 states and 285734 transitions. Second operand has 7 states, 7 states have (on average 22.857142857142858) internal successors, (160), 6 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:18:56,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:18:56,968 INFO L93 Difference]: Finished difference Result 654725 states and 956040 transitions. [2025-03-03 15:18:56,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 15:18:56,969 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 22.857142857142858) internal successors, (160), 6 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 160 [2025-03-03 15:18:56,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:18:57,691 INFO L225 Difference]: With dead ends: 654725 [2025-03-03 15:18:57,691 INFO L226 Difference]: Without dead ends: 459075 [2025-03-03 15:18:57,949 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2025-03-03 15:18:57,950 INFO L435 NwaCegarLoop]: 140 mSDtfsCounter, 1169 mSDsluCounter, 342 mSDsCounter, 0 mSdLazyCounter, 327 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1169 SdHoareTripleChecker+Valid, 482 SdHoareTripleChecker+Invalid, 341 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 327 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 15:18:57,950 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1169 Valid, 482 Invalid, 341 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 327 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 15:18:58,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459075 states. [2025-03-03 15:19:02,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459075 to 412609. [2025-03-03 15:19:02,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 412609 states, 412608 states have (on average 1.456156933457422) internal successors, (600822), 412608 states have internal predecessors, (600822), 0 states have call successors, (0), 0 states 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:19:04,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412609 states to 412609 states and 600822 transitions. [2025-03-03 15:19:04,172 INFO L78 Accepts]: Start accepts. Automaton has 412609 states and 600822 transitions. Word has length 160 [2025-03-03 15:19:04,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:19:04,173 INFO L471 AbstractCegarLoop]: Abstraction has 412609 states and 600822 transitions. [2025-03-03 15:19:04,173 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 22.857142857142858) internal successors, (160), 6 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:19:04,173 INFO L276 IsEmpty]: Start isEmpty. Operand 412609 states and 600822 transitions. [2025-03-03 15:19:04,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-03-03 15:19:04,178 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:19:04,178 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:19:04,178 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2025-03-03 15:19:04,179 INFO L396 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:19:04,179 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:19:04,179 INFO L85 PathProgramCache]: Analyzing trace with hash 2032494434, now seen corresponding path program 1 times [2025-03-03 15:19:04,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:19:04,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316281286] [2025-03-03 15:19:04,179 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:19:04,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:19:04,209 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-03-03 15:19:04,228 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-03-03 15:19:04,229 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:19:04,230 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:19:04,320 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:19:04,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:19:04,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [316281286] [2025-03-03 15:19:04,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [316281286] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 15:19:04,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [24202644] [2025-03-03 15:19:04,321 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:19:04,321 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 15:19:04,321 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 15:19:04,323 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:19:04,324 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:19:04,452 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-03-03 15:19:04,507 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-03-03 15:19:04,507 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:19:04,507 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:19:04,512 INFO L256 TraceCheckSpWp]: Trace formula consists of 733 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-03 15:19:04,520 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 15:19:05,163 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:19:05,163 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 15:19:05,332 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:19:05,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [24202644] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 15:19:05,332 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 15:19:05,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2025-03-03 15:19:05,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506638561] [2025-03-03 15:19:05,333 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 15:19:05,333 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-03 15:19:05,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:19:05,334 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-03 15:19:05,334 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2025-03-03 15:19:05,334 INFO L87 Difference]: Start difference. First operand 412609 states and 600822 transitions. Second operand has 11 states, 11 states have (on average 25.90909090909091) internal successors, (285), 10 states have internal predecessors, (285), 0 states have call successors, (0), 0 states 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:19:09,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:19:09,171 INFO L93 Difference]: Finished difference Result 1288133 states and 1873848 transitions. [2025-03-03 15:19:09,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 15:19:09,171 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 25.90909090909091) internal successors, (285), 10 states have internal predecessors, (285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 160 [2025-03-03 15:19:09,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted.